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 Sven Verdoolaege
8 * Use of this software is governed by the MIT license
10 * Written by Sven Verdoolaege, K.U.Leuven, Departement
11 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
12 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
13 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
14 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
15 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
16 * B.P. 105 - 78153 Le Chesnay, France
20 #include <isl_ctx_private.h>
21 #include <isl_map_private.h>
23 #include <isl/constraint.h>
24 #include "isl_space_private.h"
25 #include "isl_equalities.h"
26 #include <isl_lp_private.h>
30 #include <isl_reordering.h>
31 #include "isl_sample.h"
35 #include <isl_mat_private.h>
36 #include <isl_vec_private.h>
37 #include <isl_dim_map.h>
38 #include <isl_local_space_private.h>
39 #include <isl_aff_private.h>
40 #include <isl_options_private.h>
41 #include <isl_morph.h>
42 #include <isl_val_private.h>
43 #include <isl/deprecated/map_int.h>
44 #include <isl/deprecated/set_int.h>
46 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
49 case isl_dim_param
: return dim
->nparam
;
50 case isl_dim_in
: return dim
->n_in
;
51 case isl_dim_out
: return dim
->n_out
;
52 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
57 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
60 case isl_dim_param
: return 1;
61 case isl_dim_in
: return 1 + dim
->nparam
;
62 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
67 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
68 enum isl_dim_type type
)
73 case isl_dim_cst
: return 1;
76 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
77 case isl_dim_div
: return bmap
->n_div
;
78 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
83 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
85 return map
? n(map
->dim
, type
) : 0;
88 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
90 return set
? n(set
->dim
, type
) : 0;
93 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
94 enum isl_dim_type type
)
96 isl_space
*dim
= bmap
->dim
;
98 case isl_dim_cst
: return 0;
99 case isl_dim_param
: return 1;
100 case isl_dim_in
: return 1 + dim
->nparam
;
101 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
102 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
107 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
108 enum isl_dim_type type
)
110 return isl_basic_map_offset(bset
, type
);
113 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
115 return pos(map
->dim
, type
);
118 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
119 enum isl_dim_type type
)
121 return isl_basic_map_dim(bset
, type
);
124 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
126 return isl_basic_set_dim(bset
, isl_dim_set
);
129 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
131 return isl_basic_set_dim(bset
, isl_dim_param
);
134 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
138 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
141 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
143 return isl_set_dim(set
, isl_dim_set
);
146 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
148 return isl_set_dim(set
, isl_dim_param
);
151 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
153 return bmap
? bmap
->dim
->n_in
: 0;
156 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
158 return bmap
? bmap
->dim
->n_out
: 0;
161 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
163 return bmap
? bmap
->dim
->nparam
: 0;
166 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
168 return bmap
? bmap
->n_div
: 0;
171 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
173 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
176 unsigned isl_map_n_in(const struct isl_map
*map
)
178 return map
? map
->dim
->n_in
: 0;
181 unsigned isl_map_n_out(const struct isl_map
*map
)
183 return map
? map
->dim
->n_out
: 0;
186 unsigned isl_map_n_param(const struct isl_map
*map
)
188 return map
? map
->dim
->nparam
: 0;
191 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
196 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
199 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
200 set
->dim
, isl_dim_set
);
203 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
204 __isl_keep isl_basic_set
*bset
)
208 return isl_bool_error
;
209 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
212 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
213 bset
->dim
, isl_dim_set
);
216 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
221 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
224 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
225 set
->dim
, isl_dim_set
);
228 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
229 struct isl_basic_set
*bset
)
234 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
237 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
238 bset
->dim
, isl_dim_set
);
241 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
243 return bmap
? bmap
->ctx
: NULL
;
246 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
248 return bset
? bset
->ctx
: NULL
;
251 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
253 return map
? map
->ctx
: NULL
;
256 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
258 return set
? set
->ctx
: NULL
;
261 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
265 return isl_space_copy(bmap
->dim
);
268 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
272 return isl_space_copy(bset
->dim
);
275 /* Extract the divs in "bmap" as a matrix.
277 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
288 ctx
= isl_basic_map_get_ctx(bmap
);
289 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
290 cols
= 1 + 1 + total
+ bmap
->n_div
;
291 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
295 for (i
= 0; i
< bmap
->n_div
; ++i
)
296 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
301 /* Extract the divs in "bset" as a matrix.
303 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
305 return isl_basic_map_get_divs(bset
);
308 __isl_give isl_local_space
*isl_basic_map_get_local_space(
309 __isl_keep isl_basic_map
*bmap
)
316 div
= isl_basic_map_get_divs(bmap
);
317 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
320 __isl_give isl_local_space
*isl_basic_set_get_local_space(
321 __isl_keep isl_basic_set
*bset
)
323 return isl_basic_map_get_local_space(bset
);
326 /* For each known div d = floor(f/m), add the constraints
329 * -(f-(m-1)) + m d >= 0
331 * Do not finalize the result.
333 static __isl_give isl_basic_map
*add_known_div_constraints(
334 __isl_take isl_basic_map
*bmap
)
341 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
344 bmap
= isl_basic_map_cow(bmap
);
345 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
348 for (i
= 0; i
< n_div
; ++i
) {
349 if (isl_int_is_zero(bmap
->div
[i
][0]))
351 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
352 return isl_basic_map_free(bmap
);
358 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
359 __isl_take isl_local_space
*ls
)
368 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
369 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
370 n_div
, 0, 2 * n_div
);
372 for (i
= 0; i
< n_div
; ++i
)
373 if (isl_basic_map_alloc_div(bmap
) < 0)
376 for (i
= 0; i
< n_div
; ++i
)
377 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
378 bmap
= add_known_div_constraints(bmap
);
380 isl_local_space_free(ls
);
383 isl_local_space_free(ls
);
384 isl_basic_map_free(bmap
);
388 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
389 __isl_take isl_local_space
*ls
)
391 return isl_basic_map_from_local_space(ls
);
394 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
398 return isl_space_copy(map
->dim
);
401 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
405 return isl_space_copy(set
->dim
);
408 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
409 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
411 bmap
= isl_basic_map_cow(bmap
);
414 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
417 bmap
= isl_basic_map_finalize(bmap
);
420 isl_basic_map_free(bmap
);
424 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
425 __isl_take isl_basic_set
*bset
, const char *s
)
427 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
430 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
431 enum isl_dim_type type
)
433 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
436 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
437 enum isl_dim_type type
, const char *s
)
441 map
= isl_map_cow(map
);
445 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
449 for (i
= 0; i
< map
->n
; ++i
) {
450 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
461 /* Replace the identifier of the tuple of type "type" by "id".
463 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
464 __isl_take isl_basic_map
*bmap
,
465 enum isl_dim_type type
, __isl_take isl_id
*id
)
467 bmap
= isl_basic_map_cow(bmap
);
470 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
472 return isl_basic_map_free(bmap
);
473 bmap
= isl_basic_map_finalize(bmap
);
480 /* Replace the identifier of the tuple by "id".
482 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
483 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
485 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
488 /* Does the input or output tuple have a name?
490 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
492 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
495 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
496 enum isl_dim_type type
)
498 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
501 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
504 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
507 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
508 enum isl_dim_type type
, __isl_take isl_id
*id
)
510 map
= isl_map_cow(map
);
514 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
516 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
522 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
523 __isl_take isl_id
*id
)
525 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
528 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
529 enum isl_dim_type type
)
531 map
= isl_map_cow(map
);
535 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
537 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
540 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
542 return isl_map_reset_tuple_id(set
, isl_dim_set
);
545 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
547 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
550 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
551 enum isl_dim_type type
)
553 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
556 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
558 return isl_map_has_tuple_id(set
, isl_dim_set
);
561 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
563 return isl_map_get_tuple_id(set
, isl_dim_set
);
566 /* Does the set tuple have a name?
568 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
571 return isl_bool_error
;
572 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
576 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
578 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
581 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
583 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
586 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
587 enum isl_dim_type type
, unsigned pos
)
589 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
592 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
593 enum isl_dim_type type
, unsigned pos
)
595 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
598 /* Does the given dimension have a name?
600 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
601 enum isl_dim_type type
, unsigned pos
)
604 return isl_bool_error
;
605 return isl_space_has_dim_name(map
->dim
, type
, pos
);
608 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
609 enum isl_dim_type type
, unsigned pos
)
611 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
614 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
615 enum isl_dim_type type
, unsigned pos
)
617 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
620 /* Does the given dimension have a name?
622 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
623 enum isl_dim_type type
, unsigned pos
)
626 return isl_bool_error
;
627 return isl_space_has_dim_name(set
->dim
, type
, pos
);
630 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
631 __isl_take isl_basic_map
*bmap
,
632 enum isl_dim_type type
, unsigned pos
, const char *s
)
634 bmap
= isl_basic_map_cow(bmap
);
637 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
640 return isl_basic_map_finalize(bmap
);
642 isl_basic_map_free(bmap
);
646 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
647 enum isl_dim_type type
, unsigned pos
, const char *s
)
651 map
= isl_map_cow(map
);
655 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
659 for (i
= 0; i
< map
->n
; ++i
) {
660 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
671 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
672 __isl_take isl_basic_set
*bset
,
673 enum isl_dim_type type
, unsigned pos
, const char *s
)
675 return (isl_basic_set
*)isl_basic_map_set_dim_name(
676 (isl_basic_map
*)bset
, type
, pos
, s
);
679 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
680 enum isl_dim_type type
, unsigned pos
, const char *s
)
682 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
685 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
686 enum isl_dim_type type
, unsigned pos
)
689 return isl_bool_error
;
690 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
693 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
694 enum isl_dim_type type
, unsigned pos
)
696 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
699 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
700 enum isl_dim_type type
, unsigned pos
)
702 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
705 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
706 enum isl_dim_type type
, unsigned pos
)
708 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
711 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
712 enum isl_dim_type type
, unsigned pos
)
714 return isl_map_has_dim_id(set
, type
, pos
);
717 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
718 enum isl_dim_type type
, unsigned pos
)
720 return isl_map_get_dim_id(set
, type
, pos
);
723 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
724 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
726 map
= isl_map_cow(map
);
730 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
732 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
738 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
739 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
741 return isl_map_set_dim_id(set
, type
, pos
, id
);
744 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
745 __isl_keep isl_id
*id
)
749 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
752 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
753 __isl_keep isl_id
*id
)
755 return isl_map_find_dim_by_id(set
, type
, id
);
758 /* Return the position of the dimension of the given type and name
760 * Return -1 if no such dimension can be found.
762 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
763 enum isl_dim_type type
, const char *name
)
767 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
770 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
775 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
778 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
781 return isl_map_find_dim_by_name(set
, type
, name
);
784 /* Reset the user pointer on all identifiers of parameters and tuples
785 * of the space of "map".
787 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
791 space
= isl_map_get_space(map
);
792 space
= isl_space_reset_user(space
);
793 map
= isl_map_reset_space(map
, space
);
798 /* Reset the user pointer on all identifiers of parameters and tuples
799 * of the space of "set".
801 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
803 return isl_map_reset_user(set
);
806 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
810 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
813 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
815 return isl_basic_map_is_rational(bset
);
818 /* Does "bmap" contain any rational points?
820 * If "bmap" has an equality for each dimension, equating the dimension
821 * to an integer constant, then it has no rational points, even if it
822 * is marked as rational.
824 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
826 int has_rational
= 1;
831 if (isl_basic_map_plain_is_empty(bmap
))
833 if (!isl_basic_map_is_rational(bmap
))
835 bmap
= isl_basic_map_copy(bmap
);
836 bmap
= isl_basic_map_implicit_equalities(bmap
);
839 total
= isl_basic_map_total_dim(bmap
);
840 if (bmap
->n_eq
== total
) {
842 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
843 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
846 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
847 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
849 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
857 isl_basic_map_free(bmap
);
862 /* Does "map" contain any rational points?
864 int isl_map_has_rational(__isl_keep isl_map
*map
)
871 for (i
= 0; i
< map
->n
; ++i
) {
872 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
873 if (has_rational
< 0)
881 /* Does "set" contain any rational points?
883 int isl_set_has_rational(__isl_keep isl_set
*set
)
885 return isl_map_has_rational(set
);
888 /* Is this basic set a parameter domain?
890 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
894 return isl_space_is_params(bset
->dim
);
897 /* Is this set a parameter domain?
899 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
902 return isl_bool_error
;
903 return isl_space_is_params(set
->dim
);
906 /* Is this map actually a parameter domain?
907 * Users should never call this function. Outside of isl,
908 * a map can never be a parameter domain.
910 int isl_map_is_params(__isl_keep isl_map
*map
)
914 return isl_space_is_params(map
->dim
);
917 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
918 struct isl_basic_map
*bmap
, unsigned extra
,
919 unsigned n_eq
, unsigned n_ineq
)
922 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
927 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
928 if (isl_blk_is_error(bmap
->block
))
931 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
932 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
936 bmap
->block2
= isl_blk_empty();
939 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
940 if (isl_blk_is_error(bmap
->block2
))
943 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
948 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
949 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
951 for (i
= 0; i
< extra
; ++i
)
952 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
956 bmap
->c_size
= n_eq
+ n_ineq
;
957 bmap
->eq
= bmap
->ineq
+ n_ineq
;
966 isl_basic_map_free(bmap
);
970 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
971 unsigned nparam
, unsigned dim
, unsigned extra
,
972 unsigned n_eq
, unsigned n_ineq
)
974 struct isl_basic_map
*bmap
;
977 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
981 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
982 return (struct isl_basic_set
*)bmap
;
985 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
986 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
988 struct isl_basic_map
*bmap
;
991 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
992 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
993 return (struct isl_basic_set
*)bmap
;
999 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1000 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1002 struct isl_basic_map
*bmap
;
1006 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1011 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1013 isl_space_free(dim
);
1017 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1018 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1019 unsigned n_eq
, unsigned n_ineq
)
1021 struct isl_basic_map
*bmap
;
1024 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1028 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1032 static void dup_constraints(
1033 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1036 unsigned total
= isl_basic_map_total_dim(src
);
1038 for (i
= 0; i
< src
->n_eq
; ++i
) {
1039 int j
= isl_basic_map_alloc_equality(dst
);
1040 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1043 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1044 int j
= isl_basic_map_alloc_inequality(dst
);
1045 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1048 for (i
= 0; i
< src
->n_div
; ++i
) {
1049 int j
= isl_basic_map_alloc_div(dst
);
1050 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1052 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1055 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
1057 struct isl_basic_map
*dup
;
1061 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1062 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1065 dup_constraints(dup
, bmap
);
1066 dup
->flags
= bmap
->flags
;
1067 dup
->sample
= isl_vec_copy(bmap
->sample
);
1071 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1073 struct isl_basic_map
*dup
;
1075 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
1076 return (struct isl_basic_set
*)dup
;
1079 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
1084 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1088 return isl_basic_set_dup(bset
);
1091 struct isl_set
*isl_set_copy(struct isl_set
*set
)
1100 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
1105 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1109 bmap
= isl_basic_map_dup(bmap
);
1111 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1115 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1124 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1129 if (--bmap
->ref
> 0)
1132 isl_ctx_deref(bmap
->ctx
);
1134 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1136 isl_blk_free(bmap
->ctx
, bmap
->block
);
1137 isl_vec_free(bmap
->sample
);
1138 isl_space_free(bmap
->dim
);
1144 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1146 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1149 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1151 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1154 __isl_give isl_map
*isl_map_align_params_map_map_and(
1155 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1156 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1157 __isl_take isl_map
*map2
))
1161 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1162 return fn(map1
, map2
);
1163 if (!isl_space_has_named_params(map1
->dim
) ||
1164 !isl_space_has_named_params(map2
->dim
))
1165 isl_die(map1
->ctx
, isl_error_invalid
,
1166 "unaligned unnamed parameters", goto error
);
1167 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1168 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1169 return fn(map1
, map2
);
1176 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1177 __isl_keep isl_map
*map2
,
1178 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1183 return isl_bool_error
;
1184 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1185 return fn(map1
, map2
);
1186 if (!isl_space_has_named_params(map1
->dim
) ||
1187 !isl_space_has_named_params(map2
->dim
))
1188 isl_die(map1
->ctx
, isl_error_invalid
,
1189 "unaligned unnamed parameters", return isl_bool_error
);
1190 map1
= isl_map_copy(map1
);
1191 map2
= isl_map_copy(map2
);
1192 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1193 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1200 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1202 struct isl_ctx
*ctx
;
1206 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1207 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1209 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1210 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1211 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1212 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1213 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1214 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1216 int j
= isl_basic_map_alloc_inequality(bmap
);
1220 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1221 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1228 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1229 bmap
->extra
- bmap
->n_div
);
1230 return bmap
->n_eq
++;
1233 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1235 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1238 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1242 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1247 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1249 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1252 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1257 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1259 if (pos
!= bmap
->n_eq
- 1) {
1261 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1262 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1268 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1270 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1273 /* Turn inequality "pos" of "bmap" into an equality.
1275 * In particular, we move the inequality in front of the equalities
1276 * and move the last inequality in the position of the moved inequality.
1277 * Note that isl_tab_make_equalities_explicit depends on this particular
1278 * change in the ordering of the constraints.
1280 void isl_basic_map_inequality_to_equality(
1281 struct isl_basic_map
*bmap
, unsigned pos
)
1285 t
= bmap
->ineq
[pos
];
1286 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1287 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1292 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1293 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1294 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1295 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1298 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1300 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1303 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1305 struct isl_ctx
*ctx
;
1309 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1310 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1311 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1312 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1313 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1314 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1315 1 + isl_basic_map_total_dim(bmap
),
1316 bmap
->extra
- bmap
->n_div
);
1317 return bmap
->n_ineq
++;
1320 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1322 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1325 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1329 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1334 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1336 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1339 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1344 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1346 if (pos
!= bmap
->n_ineq
- 1) {
1347 t
= bmap
->ineq
[pos
];
1348 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1349 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1350 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1356 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1358 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1361 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1366 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1369 k
= isl_basic_map_alloc_equality(bmap
);
1372 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1375 isl_basic_map_free(bmap
);
1379 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1382 return (isl_basic_set
*)
1383 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1386 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1391 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1394 k
= isl_basic_map_alloc_inequality(bmap
);
1397 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1400 isl_basic_map_free(bmap
);
1404 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1407 return (isl_basic_set
*)
1408 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1411 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1415 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1416 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1417 1 + 1 + isl_basic_map_total_dim(bmap
),
1418 bmap
->extra
- bmap
->n_div
);
1419 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1420 return bmap
->n_div
++;
1423 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1425 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1428 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1432 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1437 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1439 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1442 /* Copy constraint from src to dst, putting the vars of src at offset
1443 * dim_off in dst and the divs of src at offset div_off in dst.
1444 * If both sets are actually map, then dim_off applies to the input
1447 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1448 struct isl_basic_map
*src_map
, isl_int
*src
,
1449 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1451 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1452 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1453 unsigned src_in
= isl_basic_map_n_in(src_map
);
1454 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1455 unsigned src_out
= isl_basic_map_n_out(src_map
);
1456 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1457 isl_int_set(dst
[0], src
[0]);
1458 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1459 if (dst_nparam
> src_nparam
)
1460 isl_seq_clr(dst
+1+src_nparam
,
1461 dst_nparam
- src_nparam
);
1462 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1463 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1465 isl_min(dst_in
-in_off
, src_in
));
1466 if (dst_in
-in_off
> src_in
)
1467 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1468 dst_in
- in_off
- src_in
);
1469 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1470 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1471 src
+1+src_nparam
+src_in
,
1472 isl_min(dst_out
-out_off
, src_out
));
1473 if (dst_out
-out_off
> src_out
)
1474 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1475 dst_out
- out_off
- src_out
);
1476 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1477 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1478 src
+1+src_nparam
+src_in
+src_out
,
1479 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1480 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1481 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1482 div_off
+src_map
->n_div
,
1483 dst_map
->n_div
- div_off
- src_map
->n_div
);
1486 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1487 struct isl_basic_map
*src_map
, isl_int
*src
,
1488 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1490 isl_int_set(dst
[0], src
[0]);
1491 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1494 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1495 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1500 if (!bmap1
|| !bmap2
)
1503 div_off
= bmap1
->n_div
;
1505 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1506 int i1
= isl_basic_map_alloc_equality(bmap1
);
1509 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1510 i_pos
, o_pos
, div_off
);
1513 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1514 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1517 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1518 i_pos
, o_pos
, div_off
);
1521 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1522 int i1
= isl_basic_map_alloc_div(bmap1
);
1525 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1526 i_pos
, o_pos
, div_off
);
1529 isl_basic_map_free(bmap2
);
1534 isl_basic_map_free(bmap1
);
1535 isl_basic_map_free(bmap2
);
1539 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1540 struct isl_basic_set
*bset2
, unsigned pos
)
1542 return (struct isl_basic_set
*)
1543 add_constraints((struct isl_basic_map
*)bset1
,
1544 (struct isl_basic_map
*)bset2
, 0, pos
);
1547 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1548 __isl_take isl_space
*dim
, unsigned extra
,
1549 unsigned n_eq
, unsigned n_ineq
)
1551 struct isl_basic_map
*ext
;
1561 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1562 base
->extra
>= base
->n_div
+ extra
;
1564 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1565 room_for_ineq(base
, n_ineq
)) {
1566 isl_space_free(dim
);
1570 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1571 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1572 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1573 extra
+= base
->extra
;
1575 n_ineq
+= base
->n_ineq
;
1577 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1583 ext
->sample
= isl_vec_copy(base
->sample
);
1584 flags
= base
->flags
;
1585 ext
= add_constraints(ext
, base
, 0, 0);
1588 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1594 isl_space_free(dim
);
1595 isl_basic_map_free(base
);
1599 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1600 __isl_take isl_space
*dim
, unsigned extra
,
1601 unsigned n_eq
, unsigned n_ineq
)
1603 return (struct isl_basic_set
*)
1604 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1605 extra
, n_eq
, n_ineq
);
1608 struct isl_basic_map
*isl_basic_map_extend_constraints(
1609 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1613 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1617 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1618 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1619 unsigned n_eq
, unsigned n_ineq
)
1621 struct isl_basic_map
*bmap
;
1626 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1630 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1633 isl_basic_map_free(base
);
1637 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1638 unsigned nparam
, unsigned dim
, unsigned extra
,
1639 unsigned n_eq
, unsigned n_ineq
)
1641 return (struct isl_basic_set
*)
1642 isl_basic_map_extend((struct isl_basic_map
*)base
,
1643 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1646 struct isl_basic_set
*isl_basic_set_extend_constraints(
1647 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1649 return (struct isl_basic_set
*)
1650 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1654 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1656 return (struct isl_basic_set
*)
1657 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1660 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1665 if (bmap
->ref
> 1) {
1667 bmap
= isl_basic_map_dup(bmap
);
1670 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1671 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1676 /* Clear all cached information in "map", either because it is about
1677 * to be modified or because it is being freed.
1678 * Always return the same pointer that is passed in.
1679 * This is needed for the use in isl_map_free.
1681 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1683 isl_basic_map_free(map
->cached_simple_hull
[0]);
1684 isl_basic_map_free(map
->cached_simple_hull
[1]);
1685 map
->cached_simple_hull
[0] = NULL
;
1686 map
->cached_simple_hull
[1] = NULL
;
1690 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1692 return isl_map_cow(set
);
1695 /* Return an isl_map that is equal to "map" and that has only
1696 * a single reference.
1698 * If the original input already has only one reference, then
1699 * simply return it, but clear all cached information, since
1700 * it may be rendered invalid by the operations that will be
1701 * performed on the result.
1703 * Otherwise, create a duplicate (without any cached information).
1705 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1711 return clear_caches(map
);
1713 return isl_map_dup(map
);
1716 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1717 unsigned a_len
, unsigned b_len
)
1719 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1720 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1721 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1724 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1725 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1733 isl_assert(bmap
->ctx
,
1734 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1736 if (n1
== 0 || n2
== 0)
1739 bmap
= isl_basic_map_cow(bmap
);
1743 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1744 if (isl_blk_is_error(blk
))
1747 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1749 bmap
->eq
[i
] + pos
, n1
, n2
);
1751 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1753 bmap
->ineq
[i
] + pos
, n1
, n2
);
1755 for (i
= 0; i
< bmap
->n_div
; ++i
)
1757 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1759 isl_blk_free(bmap
->ctx
, blk
);
1761 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1762 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1763 return isl_basic_map_finalize(bmap
);
1765 isl_basic_map_free(bmap
);
1769 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1775 total
= isl_basic_map_total_dim(bmap
);
1776 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1777 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1779 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1781 i
= isl_basic_map_alloc_equality(bmap
);
1785 isl_int_set_si(bmap
->eq
[i
][0], 1);
1786 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1787 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1788 isl_vec_free(bmap
->sample
);
1789 bmap
->sample
= NULL
;
1790 return isl_basic_map_finalize(bmap
);
1792 isl_basic_map_free(bmap
);
1796 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1798 return (struct isl_basic_set
*)
1799 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1802 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1805 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1807 isl_int
*t
= bmap
->div
[a
];
1808 bmap
->div
[a
] = bmap
->div
[b
];
1812 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1813 * div definitions accordingly.
1815 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1818 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1820 swap_div(bmap
, a
, b
);
1822 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1823 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1825 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1826 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1828 for (i
= 0; i
< bmap
->n_div
; ++i
)
1829 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1830 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1833 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
1834 * div definitions accordingly.
1836 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
1838 isl_basic_map_swap_div(bset
, a
, b
);
1841 /* Eliminate the specified n dimensions starting at first from the
1842 * constraints, without removing the dimensions from the space.
1843 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1845 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1846 enum isl_dim_type type
, unsigned first
, unsigned n
)
1855 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1856 isl_die(map
->ctx
, isl_error_invalid
,
1857 "index out of bounds", goto error
);
1859 map
= isl_map_cow(map
);
1863 for (i
= 0; i
< map
->n
; ++i
) {
1864 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1874 /* Eliminate the specified n dimensions starting at first from the
1875 * constraints, without removing the dimensions from the space.
1876 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1878 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1879 enum isl_dim_type type
, unsigned first
, unsigned n
)
1881 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1884 /* Eliminate the specified n dimensions starting at first from the
1885 * constraints, without removing the dimensions from the space.
1886 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1888 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1889 unsigned first
, unsigned n
)
1891 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1894 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1895 __isl_take isl_basic_map
*bmap
)
1899 bmap
= isl_basic_map_eliminate_vars(bmap
,
1900 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1904 return isl_basic_map_finalize(bmap
);
1907 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1908 __isl_take isl_basic_set
*bset
)
1910 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1911 (struct isl_basic_map
*)bset
);
1914 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1923 map
= isl_map_cow(map
);
1927 for (i
= 0; i
< map
->n
; ++i
) {
1928 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1938 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1940 return isl_map_remove_divs(set
);
1943 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1944 enum isl_dim_type type
, unsigned first
, unsigned n
)
1948 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1950 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1952 bmap
= isl_basic_map_eliminate_vars(bmap
,
1953 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1956 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1958 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1961 isl_basic_map_free(bmap
);
1965 /* Return true if the definition of the given div (recursively) involves
1966 * any of the given variables.
1968 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1969 unsigned first
, unsigned n
)
1972 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1974 if (isl_int_is_zero(bmap
->div
[div
][0]))
1976 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1979 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1980 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1982 if (div_involves_vars(bmap
, i
, first
, n
))
1989 /* Try and add a lower and/or upper bound on "div" to "bmap"
1990 * based on inequality "i".
1991 * "total" is the total number of variables (excluding the divs).
1992 * "v" is a temporary object that can be used during the calculations.
1993 * If "lb" is set, then a lower bound should be constructed.
1994 * If "ub" is set, then an upper bound should be constructed.
1996 * The calling function has already checked that the inequality does not
1997 * reference "div", but we still need to check that the inequality is
1998 * of the right form. We'll consider the case where we want to construct
1999 * a lower bound. The construction of upper bounds is similar.
2001 * Let "div" be of the form
2003 * q = floor((a + f(x))/d)
2005 * We essentially check if constraint "i" is of the form
2009 * so that we can use it to derive a lower bound on "div".
2010 * However, we allow a slightly more general form
2014 * with the condition that the coefficients of g(x) - f(x) are all
2016 * Rewriting this constraint as
2020 * adding a + f(x) to both sides and dividing by d, we obtain
2022 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2024 * Taking the floor on both sides, we obtain
2026 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2030 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2032 * In the case of an upper bound, we construct the constraint
2034 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2037 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2038 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2039 unsigned total
, isl_int v
, int lb
, int ub
)
2043 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2045 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2046 bmap
->div
[div
][1 + 1 + j
]);
2047 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2050 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2051 bmap
->div
[div
][1 + 1 + j
]);
2052 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2058 bmap
= isl_basic_map_cow(bmap
);
2059 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2061 int k
= isl_basic_map_alloc_inequality(bmap
);
2064 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2065 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2066 bmap
->div
[div
][1 + j
]);
2067 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2068 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2070 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2073 int k
= isl_basic_map_alloc_inequality(bmap
);
2076 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2077 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2078 bmap
->div
[div
][1 + j
]);
2079 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2080 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2082 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2085 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2088 isl_basic_map_free(bmap
);
2092 /* This function is called right before "div" is eliminated from "bmap"
2093 * using Fourier-Motzkin.
2094 * Look through the constraints of "bmap" for constraints on the argument
2095 * of the integer division and use them to construct constraints on the
2096 * integer division itself. These constraints can then be combined
2097 * during the Fourier-Motzkin elimination.
2098 * Note that it is only useful to introduce lower bounds on "div"
2099 * if "bmap" already contains upper bounds on "div" as the newly
2100 * introduce lower bounds can then be combined with the pre-existing
2101 * upper bounds. Similarly for upper bounds.
2102 * We therefore first check if "bmap" contains any lower and/or upper bounds
2105 * It is interesting to note that the introduction of these constraints
2106 * can indeed lead to more accurate results, even when compared to
2107 * deriving constraints on the argument of "div" from constraints on "div".
2108 * Consider, for example, the set
2110 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2112 * The second constraint can be rewritten as
2114 * 2 * [(-i-2j+3)/4] + k >= 0
2116 * from which we can derive
2118 * -i - 2j + 3 >= -2k
2124 * Combined with the first constraint, we obtain
2126 * -3 <= 3 + 2k or k >= -3
2128 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2129 * the first constraint, we obtain
2131 * [(i + 2j)/4] >= [-3/4] = -1
2133 * Combining this constraint with the second constraint, we obtain
2137 static __isl_give isl_basic_map
*insert_bounds_on_div(
2138 __isl_take isl_basic_map
*bmap
, int div
)
2141 int check_lb
, check_ub
;
2148 if (isl_int_is_zero(bmap
->div
[div
][0]))
2151 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2155 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2156 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2163 if (!check_lb
&& !check_ub
)
2168 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2169 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2172 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2173 check_lb
, check_ub
);
2181 /* Remove all divs (recursively) involving any of the given dimensions
2182 * in their definitions.
2184 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2185 __isl_take isl_basic_map
*bmap
,
2186 enum isl_dim_type type
, unsigned first
, unsigned n
)
2192 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2194 first
+= isl_basic_map_offset(bmap
, type
);
2196 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2197 if (!div_involves_vars(bmap
, i
, first
, n
))
2199 bmap
= insert_bounds_on_div(bmap
, i
);
2200 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2208 isl_basic_map_free(bmap
);
2212 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2213 __isl_take isl_basic_set
*bset
,
2214 enum isl_dim_type type
, unsigned first
, unsigned n
)
2216 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2219 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2220 enum isl_dim_type type
, unsigned first
, unsigned n
)
2229 map
= isl_map_cow(map
);
2233 for (i
= 0; i
< map
->n
; ++i
) {
2234 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2245 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2246 enum isl_dim_type type
, unsigned first
, unsigned n
)
2248 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2252 /* Does the desciption of "bmap" depend on the specified dimensions?
2253 * We also check whether the dimensions appear in any of the div definitions.
2254 * In principle there is no need for this check. If the dimensions appear
2255 * in a div definition, they also appear in the defining constraints of that
2258 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2259 enum isl_dim_type type
, unsigned first
, unsigned n
)
2264 return isl_bool_error
;
2266 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2267 isl_die(bmap
->ctx
, isl_error_invalid
,
2268 "index out of bounds", return isl_bool_error
);
2270 first
+= isl_basic_map_offset(bmap
, type
);
2271 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2272 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2273 return isl_bool_true
;
2274 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2275 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2276 return isl_bool_true
;
2277 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2278 if (isl_int_is_zero(bmap
->div
[i
][0]))
2280 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2281 return isl_bool_true
;
2284 return isl_bool_false
;
2287 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2288 enum isl_dim_type type
, unsigned first
, unsigned n
)
2293 return isl_bool_error
;
2295 if (first
+ n
> isl_map_dim(map
, type
))
2296 isl_die(map
->ctx
, isl_error_invalid
,
2297 "index out of bounds", return isl_bool_error
);
2299 for (i
= 0; i
< map
->n
; ++i
) {
2300 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2302 if (involves
< 0 || involves
)
2306 return isl_bool_false
;
2309 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2310 enum isl_dim_type type
, unsigned first
, unsigned n
)
2312 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2315 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2316 enum isl_dim_type type
, unsigned first
, unsigned n
)
2318 return isl_map_involves_dims(set
, type
, first
, n
);
2321 /* Does local variable "div" of "bmap" have a complete explicit representation?
2322 * Having a complete explicit representation requires not only
2323 * an explicit representation, but also that all local variables
2324 * that appear in this explicit representation in turn have
2325 * a complete explicit representation.
2327 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
2330 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2333 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
2334 if (marked
< 0 || marked
)
2335 return isl_bool_not(marked
);
2337 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2340 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2342 known
= isl_basic_map_div_is_known(bmap
, i
);
2343 if (known
< 0 || !known
)
2347 return isl_bool_true
;
2350 /* Does local variable "div" of "bset" have a complete explicit representation?
2352 isl_bool
isl_basic_set_div_is_known(__isl_keep isl_basic_set
*bset
, int div
)
2354 return isl_basic_map_div_is_known(bset
, div
);
2357 /* Remove all divs that are unknown or defined in terms of unknown divs.
2359 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2360 __isl_take isl_basic_map
*bmap
)
2367 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2368 if (isl_basic_map_div_is_known(bmap
, i
))
2370 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2379 /* Remove all divs that are unknown or defined in terms of unknown divs.
2381 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2382 __isl_take isl_basic_set
*bset
)
2384 return isl_basic_map_remove_unknown_divs(bset
);
2387 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2396 map
= isl_map_cow(map
);
2400 for (i
= 0; i
< map
->n
; ++i
) {
2401 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2411 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2413 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2416 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2417 __isl_take isl_basic_set
*bset
,
2418 enum isl_dim_type type
, unsigned first
, unsigned n
)
2420 return (isl_basic_set
*)
2421 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2424 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2425 enum isl_dim_type type
, unsigned first
, unsigned n
)
2432 map
= isl_map_cow(map
);
2435 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2437 for (i
= 0; i
< map
->n
; ++i
) {
2438 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2439 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2443 map
= isl_map_drop(map
, type
, first
, n
);
2450 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2451 enum isl_dim_type type
, unsigned first
, unsigned n
)
2453 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2456 /* Project out n inputs starting at first using Fourier-Motzkin */
2457 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2458 unsigned first
, unsigned n
)
2460 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2463 static void dump_term(struct isl_basic_map
*bmap
,
2464 isl_int c
, int pos
, FILE *out
)
2467 unsigned in
= isl_basic_map_n_in(bmap
);
2468 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2469 unsigned nparam
= isl_basic_map_n_param(bmap
);
2471 isl_int_print(out
, c
, 0);
2473 if (!isl_int_is_one(c
))
2474 isl_int_print(out
, c
, 0);
2475 if (pos
< 1 + nparam
) {
2476 name
= isl_space_get_dim_name(bmap
->dim
,
2477 isl_dim_param
, pos
- 1);
2479 fprintf(out
, "%s", name
);
2481 fprintf(out
, "p%d", pos
- 1);
2482 } else if (pos
< 1 + nparam
+ in
)
2483 fprintf(out
, "i%d", pos
- 1 - nparam
);
2484 else if (pos
< 1 + nparam
+ dim
)
2485 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2487 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2491 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2492 int sign
, FILE *out
)
2496 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2500 for (i
= 0, first
= 1; i
< len
; ++i
) {
2501 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2504 fprintf(out
, " + ");
2506 isl_int_abs(v
, c
[i
]);
2507 dump_term(bmap
, v
, i
, out
);
2514 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2515 const char *op
, FILE *out
, int indent
)
2519 fprintf(out
, "%*s", indent
, "");
2521 dump_constraint_sign(bmap
, c
, 1, out
);
2522 fprintf(out
, " %s ", op
);
2523 dump_constraint_sign(bmap
, c
, -1, out
);
2527 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2528 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2530 fprintf(out
, "%*s", indent
, "");
2531 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2536 static void dump_constraints(struct isl_basic_map
*bmap
,
2537 isl_int
**c
, unsigned n
,
2538 const char *op
, FILE *out
, int indent
)
2542 for (i
= 0; i
< n
; ++i
)
2543 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2546 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2550 unsigned total
= isl_basic_map_total_dim(bmap
);
2552 for (j
= 0; j
< 1 + total
; ++j
) {
2553 if (isl_int_is_zero(exp
[j
]))
2555 if (!first
&& isl_int_is_pos(exp
[j
]))
2557 dump_term(bmap
, exp
[j
], j
, out
);
2562 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2566 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2567 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2569 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2570 fprintf(out
, "%*s", indent
, "");
2571 fprintf(out
, "e%d = [(", i
);
2572 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2574 isl_int_print(out
, bmap
->div
[i
][0], 0);
2575 fprintf(out
, "]\n");
2579 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2580 FILE *out
, int indent
)
2583 fprintf(out
, "null basic set\n");
2587 fprintf(out
, "%*s", indent
, "");
2588 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2589 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2590 bset
->extra
, bset
->flags
);
2591 dump((struct isl_basic_map
*)bset
, out
, indent
);
2594 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2595 FILE *out
, int indent
)
2598 fprintf(out
, "null basic map\n");
2602 fprintf(out
, "%*s", indent
, "");
2603 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2604 "flags: %x, n_name: %d\n",
2606 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2607 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2608 dump(bmap
, out
, indent
);
2611 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2616 total
= isl_basic_map_total_dim(bmap
);
2617 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2618 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2619 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2620 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2624 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
2629 if (isl_space_dim(space
, isl_dim_in
) != 0)
2630 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
2631 "set cannot have input dimensions", goto error
);
2632 return isl_map_alloc_space(space
, n
, flags
);
2634 isl_space_free(space
);
2638 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2639 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2641 struct isl_set
*set
;
2644 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2648 set
= isl_set_alloc_space(dims
, n
, flags
);
2652 /* Make sure "map" has room for at least "n" more basic maps.
2654 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2657 struct isl_map
*grown
= NULL
;
2661 isl_assert(map
->ctx
, n
>= 0, goto error
);
2662 if (map
->n
+ n
<= map
->size
)
2664 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2667 for (i
= 0; i
< map
->n
; ++i
) {
2668 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2676 isl_map_free(grown
);
2681 /* Make sure "set" has room for at least "n" more basic sets.
2683 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2685 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2688 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2691 struct isl_set
*dup
;
2696 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2699 for (i
= 0; i
< set
->n
; ++i
)
2700 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2704 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2706 return isl_map_from_basic_map(bset
);
2709 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2711 struct isl_map
*map
;
2716 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2717 return isl_map_add_basic_map(map
, bmap
);
2720 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2721 __isl_take isl_basic_set
*bset
)
2723 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2724 (struct isl_basic_map
*)bset
);
2727 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
2729 return isl_map_free(set
);
2732 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2737 fprintf(out
, "null set\n");
2741 fprintf(out
, "%*s", indent
, "");
2742 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2743 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2745 for (i
= 0; i
< set
->n
; ++i
) {
2746 fprintf(out
, "%*s", indent
, "");
2747 fprintf(out
, "basic set %d:\n", i
);
2748 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2752 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2757 fprintf(out
, "null map\n");
2761 fprintf(out
, "%*s", indent
, "");
2762 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2763 "flags: %x, n_name: %d\n",
2764 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2765 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2766 for (i
= 0; i
< map
->n
; ++i
) {
2767 fprintf(out
, "%*s", indent
, "");
2768 fprintf(out
, "basic map %d:\n", i
);
2769 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2773 struct isl_basic_map
*isl_basic_map_intersect_domain(
2774 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2776 struct isl_basic_map
*bmap_domain
;
2781 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2782 bset
->dim
, isl_dim_param
), goto error
);
2784 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2785 isl_assert(bset
->ctx
,
2786 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2788 bmap
= isl_basic_map_cow(bmap
);
2791 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2792 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2793 bmap_domain
= isl_basic_map_from_domain(bset
);
2794 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2796 bmap
= isl_basic_map_simplify(bmap
);
2797 return isl_basic_map_finalize(bmap
);
2799 isl_basic_map_free(bmap
);
2800 isl_basic_set_free(bset
);
2804 struct isl_basic_map
*isl_basic_map_intersect_range(
2805 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2807 struct isl_basic_map
*bmap_range
;
2812 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2813 bset
->dim
, isl_dim_param
), goto error
);
2815 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2816 isl_assert(bset
->ctx
,
2817 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2819 if (isl_basic_set_plain_is_universe(bset
)) {
2820 isl_basic_set_free(bset
);
2824 bmap
= isl_basic_map_cow(bmap
);
2827 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2828 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2829 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2830 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2832 bmap
= isl_basic_map_simplify(bmap
);
2833 return isl_basic_map_finalize(bmap
);
2835 isl_basic_map_free(bmap
);
2836 isl_basic_set_free(bset
);
2840 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
2841 __isl_keep isl_vec
*vec
)
2848 return isl_bool_error
;
2850 total
= 1 + isl_basic_map_total_dim(bmap
);
2851 if (total
!= vec
->size
)
2852 return isl_bool_error
;
2856 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2857 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2858 if (!isl_int_is_zero(s
)) {
2860 return isl_bool_false
;
2864 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2865 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2866 if (isl_int_is_neg(s
)) {
2868 return isl_bool_false
;
2874 return isl_bool_true
;
2877 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
2878 __isl_keep isl_vec
*vec
)
2880 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2883 struct isl_basic_map
*isl_basic_map_intersect(
2884 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2886 struct isl_vec
*sample
= NULL
;
2888 if (!bmap1
|| !bmap2
)
2891 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2892 bmap2
->dim
, isl_dim_param
), goto error
);
2893 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2894 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2895 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2896 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2897 return isl_basic_map_intersect(bmap2
, bmap1
);
2899 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2900 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2901 isl_assert(bmap1
->ctx
,
2902 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2904 if (isl_basic_map_plain_is_empty(bmap1
)) {
2905 isl_basic_map_free(bmap2
);
2908 if (isl_basic_map_plain_is_empty(bmap2
)) {
2909 isl_basic_map_free(bmap1
);
2913 if (bmap1
->sample
&&
2914 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2915 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2916 sample
= isl_vec_copy(bmap1
->sample
);
2917 else if (bmap2
->sample
&&
2918 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2919 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2920 sample
= isl_vec_copy(bmap2
->sample
);
2922 bmap1
= isl_basic_map_cow(bmap1
);
2925 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2926 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2927 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2930 isl_vec_free(sample
);
2932 isl_vec_free(bmap1
->sample
);
2933 bmap1
->sample
= sample
;
2936 bmap1
= isl_basic_map_simplify(bmap1
);
2937 return isl_basic_map_finalize(bmap1
);
2940 isl_vec_free(sample
);
2941 isl_basic_map_free(bmap1
);
2942 isl_basic_map_free(bmap2
);
2946 struct isl_basic_set
*isl_basic_set_intersect(
2947 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2949 return (struct isl_basic_set
*)
2950 isl_basic_map_intersect(
2951 (struct isl_basic_map
*)bset1
,
2952 (struct isl_basic_map
*)bset2
);
2955 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2956 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2958 return isl_basic_set_intersect(bset1
, bset2
);
2961 /* Special case of isl_map_intersect, where both map1 and map2
2962 * are convex, without any divs and such that either map1 or map2
2963 * contains a single constraint. This constraint is then simply
2964 * added to the other map.
2966 static __isl_give isl_map
*map_intersect_add_constraint(
2967 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2969 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2970 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2971 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2972 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2974 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2975 return isl_map_intersect(map2
, map1
);
2977 isl_assert(map2
->ctx
,
2978 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2980 map1
= isl_map_cow(map1
);
2983 if (isl_map_plain_is_empty(map1
)) {
2987 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2988 if (map2
->p
[0]->n_eq
== 1)
2989 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2991 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2992 map2
->p
[0]->ineq
[0]);
2994 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2995 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2999 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3000 isl_basic_map_free(map1
->p
[0]);
3013 /* map2 may be either a parameter domain or a map living in the same
3016 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3017 __isl_take isl_map
*map2
)
3026 if ((isl_map_plain_is_empty(map1
) ||
3027 isl_map_plain_is_universe(map2
)) &&
3028 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3032 if ((isl_map_plain_is_empty(map2
) ||
3033 isl_map_plain_is_universe(map1
)) &&
3034 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3039 if (map1
->n
== 1 && map2
->n
== 1 &&
3040 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3041 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3042 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3043 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3044 return map_intersect_add_constraint(map1
, map2
);
3046 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3047 isl_space_dim(map2
->dim
, isl_dim_param
))
3048 isl_assert(map1
->ctx
,
3049 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3051 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3052 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3053 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3055 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3056 map1
->n
* map2
->n
, flags
);
3059 for (i
= 0; i
< map1
->n
; ++i
)
3060 for (j
= 0; j
< map2
->n
; ++j
) {
3061 struct isl_basic_map
*part
;
3062 part
= isl_basic_map_intersect(
3063 isl_basic_map_copy(map1
->p
[i
]),
3064 isl_basic_map_copy(map2
->p
[j
]));
3065 if (isl_basic_map_is_empty(part
) < 0)
3066 part
= isl_basic_map_free(part
);
3067 result
= isl_map_add_basic_map(result
, part
);
3080 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3081 __isl_take isl_map
*map2
)
3085 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3086 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3087 "spaces don't match", goto error
);
3088 return map_intersect_internal(map1
, map2
);
3095 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3096 __isl_take isl_map
*map2
)
3098 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3101 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3103 return (struct isl_set
*)
3104 isl_map_intersect((struct isl_map
*)set1
,
3105 (struct isl_map
*)set2
);
3108 /* map_intersect_internal accepts intersections
3109 * with parameter domains, so we can just call that function.
3111 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3112 __isl_take isl_set
*params
)
3114 return map_intersect_internal(map
, params
);
3117 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3118 __isl_take isl_map
*map2
)
3120 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3123 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3124 __isl_take isl_set
*params
)
3126 return isl_map_intersect_params(set
, params
);
3129 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3132 unsigned pos
, n1
, n2
;
3136 bmap
= isl_basic_map_cow(bmap
);
3139 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3140 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3141 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3142 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3143 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3144 return isl_basic_map_reset_space(bmap
, space
);
3147 static __isl_give isl_basic_map
*basic_map_space_reset(
3148 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3154 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3157 space
= isl_basic_map_get_space(bmap
);
3158 space
= isl_space_reset(space
, type
);
3159 bmap
= isl_basic_map_reset_space(bmap
, space
);
3163 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3164 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3165 unsigned pos
, unsigned n
)
3168 struct isl_basic_map
*res
;
3169 struct isl_dim_map
*dim_map
;
3170 unsigned total
, off
;
3171 enum isl_dim_type t
;
3174 return basic_map_space_reset(bmap
, type
);
3179 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3181 total
= isl_basic_map_total_dim(bmap
) + n
;
3182 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3184 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3186 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3188 unsigned size
= isl_basic_map_dim(bmap
, t
);
3189 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3191 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3192 pos
, size
- pos
, off
+ pos
+ n
);
3194 off
+= isl_space_dim(res_dim
, t
);
3196 isl_dim_map_div(dim_map
, bmap
, off
);
3198 res
= isl_basic_map_alloc_space(res_dim
,
3199 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3200 if (isl_basic_map_is_rational(bmap
))
3201 res
= isl_basic_map_set_rational(res
);
3202 if (isl_basic_map_plain_is_empty(bmap
)) {
3203 isl_basic_map_free(bmap
);
3205 return isl_basic_map_set_to_empty(res
);
3207 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3208 return isl_basic_map_finalize(res
);
3211 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3212 __isl_take isl_basic_set
*bset
,
3213 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3215 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3218 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3219 enum isl_dim_type type
, unsigned n
)
3223 return isl_basic_map_insert_dims(bmap
, type
,
3224 isl_basic_map_dim(bmap
, type
), n
);
3227 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3228 enum isl_dim_type type
, unsigned n
)
3232 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3233 return isl_basic_map_add_dims(bset
, type
, n
);
3235 isl_basic_set_free(bset
);
3239 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3240 enum isl_dim_type type
)
3244 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3247 space
= isl_map_get_space(map
);
3248 space
= isl_space_reset(space
, type
);
3249 map
= isl_map_reset_space(map
, space
);
3253 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3254 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3259 return map_space_reset(map
, type
);
3261 map
= isl_map_cow(map
);
3265 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3269 for (i
= 0; i
< map
->n
; ++i
) {
3270 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3281 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3282 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3284 return isl_map_insert_dims(set
, type
, pos
, n
);
3287 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3288 enum isl_dim_type type
, unsigned n
)
3292 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3295 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3296 enum isl_dim_type type
, unsigned n
)
3300 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3301 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3307 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3308 __isl_take isl_basic_map
*bmap
,
3309 enum isl_dim_type dst_type
, unsigned dst_pos
,
3310 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3312 struct isl_dim_map
*dim_map
;
3313 struct isl_basic_map
*res
;
3314 enum isl_dim_type t
;
3315 unsigned total
, off
;
3322 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3325 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3328 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3330 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3331 pos(bmap
->dim
, src_type
) + src_pos
+
3332 ((src_type
< dst_type
) ? n
: 0)) {
3333 bmap
= isl_basic_map_cow(bmap
);
3337 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3338 src_type
, src_pos
, n
);
3342 bmap
= isl_basic_map_finalize(bmap
);
3347 total
= isl_basic_map_total_dim(bmap
);
3348 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3351 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3352 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3353 if (t
== dst_type
) {
3354 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3357 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3360 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3361 dst_pos
, size
- dst_pos
, off
);
3362 off
+= size
- dst_pos
;
3363 } else if (t
== src_type
) {
3364 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3367 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3368 src_pos
+ n
, size
- src_pos
- n
, off
);
3369 off
+= size
- src_pos
- n
;
3371 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3375 isl_dim_map_div(dim_map
, bmap
, off
);
3377 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3378 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3379 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3383 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3384 src_type
, src_pos
, n
);
3388 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3389 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3390 bmap
= isl_basic_map_finalize(bmap
);
3394 isl_basic_map_free(bmap
);
3398 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3399 enum isl_dim_type dst_type
, unsigned dst_pos
,
3400 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3402 return (isl_basic_set
*)isl_basic_map_move_dims(
3403 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3406 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3407 enum isl_dim_type dst_type
, unsigned dst_pos
,
3408 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3412 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3413 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3414 src_type
, src_pos
, n
);
3420 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3421 enum isl_dim_type dst_type
, unsigned dst_pos
,
3422 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3431 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3434 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3437 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3439 map
= isl_map_cow(map
);
3443 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3447 for (i
= 0; i
< map
->n
; ++i
) {
3448 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3450 src_type
, src_pos
, n
);
3461 /* Move the specified dimensions to the last columns right before
3462 * the divs. Don't change the dimension specification of bmap.
3463 * That's the responsibility of the caller.
3465 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3466 enum isl_dim_type type
, unsigned first
, unsigned n
)
3468 struct isl_dim_map
*dim_map
;
3469 struct isl_basic_map
*res
;
3470 enum isl_dim_type t
;
3471 unsigned total
, off
;
3475 if (pos(bmap
->dim
, type
) + first
+ n
==
3476 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3479 total
= isl_basic_map_total_dim(bmap
);
3480 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3483 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3484 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3486 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3489 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3490 first
, n
, total
- bmap
->n_div
- n
);
3491 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3492 first
+ n
, size
- (first
+ n
), off
);
3493 off
+= size
- (first
+ n
);
3495 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3499 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3501 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3502 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3503 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3507 /* Insert "n" rows in the divs of "bmap".
3509 * The number of columns is not changed, which means that the last
3510 * dimensions of "bmap" are being reintepreted as the new divs.
3511 * The space of "bmap" is not adjusted, however, which means
3512 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3513 * from the space of "bmap" is the responsibility of the caller.
3515 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3523 bmap
= isl_basic_map_cow(bmap
);
3527 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3528 old
= bmap
->block2
.data
;
3529 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3530 (bmap
->extra
+ n
) * (1 + row_size
));
3531 if (!bmap
->block2
.data
)
3532 return isl_basic_map_free(bmap
);
3533 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3535 return isl_basic_map_free(bmap
);
3536 for (i
= 0; i
< n
; ++i
) {
3537 new_div
[i
] = bmap
->block2
.data
+
3538 (bmap
->extra
+ i
) * (1 + row_size
);
3539 isl_seq_clr(new_div
[i
], 1 + row_size
);
3541 for (i
= 0; i
< bmap
->extra
; ++i
)
3542 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3544 bmap
->div
= new_div
;
3551 /* Drop constraints from "bmap" that only involve the variables
3552 * of "type" in the range [first, first + n] that are not related
3553 * to any of the variables outside that interval.
3554 * These constraints cannot influence the values for the variables
3555 * outside the interval, except in case they cause "bmap" to be empty.
3556 * Only drop the constraints if "bmap" is known to be non-empty.
3558 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
3559 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3560 unsigned first
, unsigned n
)
3564 unsigned dim
, n_div
;
3567 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
3569 return isl_basic_map_free(bmap
);
3573 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
3574 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
3575 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
3577 return isl_basic_map_free(bmap
);
3578 first
+= isl_basic_map_offset(bmap
, type
) - 1;
3579 for (i
= 0; i
< first
; ++i
)
3581 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
3584 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
3589 /* Turn the n dimensions of type type, starting at first
3590 * into existentially quantified variables.
3592 * If a subset of the projected out variables are unrelated
3593 * to any of the variables that remain, then the constraints
3594 * involving this subset are simply dropped first.
3596 __isl_give isl_basic_map
*isl_basic_map_project_out(
3597 __isl_take isl_basic_map
*bmap
,
3598 enum isl_dim_type type
, unsigned first
, unsigned n
)
3601 return basic_map_space_reset(bmap
, type
);
3602 if (type
== isl_dim_div
)
3603 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
3604 "cannot project out existentially quantified variables",
3605 return isl_basic_map_free(bmap
));
3607 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
3611 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3612 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3614 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3617 bmap
= move_last(bmap
, type
, first
, n
);
3618 bmap
= isl_basic_map_cow(bmap
);
3619 bmap
= insert_div_rows(bmap
, n
);
3623 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3626 bmap
= isl_basic_map_simplify(bmap
);
3627 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3628 return isl_basic_map_finalize(bmap
);
3630 isl_basic_map_free(bmap
);
3634 /* Turn the n dimensions of type type, starting at first
3635 * into existentially quantified variables.
3637 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3638 enum isl_dim_type type
, unsigned first
, unsigned n
)
3640 return (isl_basic_set
*)isl_basic_map_project_out(
3641 (isl_basic_map
*)bset
, type
, first
, n
);
3644 /* Turn the n dimensions of type type, starting at first
3645 * into existentially quantified variables.
3647 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3648 enum isl_dim_type type
, unsigned first
, unsigned n
)
3656 return map_space_reset(map
, type
);
3658 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3660 map
= isl_map_cow(map
);
3664 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3668 for (i
= 0; i
< map
->n
; ++i
) {
3669 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3680 /* Turn the n dimensions of type type, starting at first
3681 * into existentially quantified variables.
3683 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3684 enum isl_dim_type type
, unsigned first
, unsigned n
)
3686 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3689 /* Return a map that projects the elements in "set" onto their
3690 * "n" set dimensions starting at "first".
3691 * "type" should be equal to isl_dim_set.
3693 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
3694 enum isl_dim_type type
, unsigned first
, unsigned n
)
3702 if (type
!= isl_dim_set
)
3703 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
3704 "only set dimensions can be projected out", goto error
);
3705 dim
= isl_set_dim(set
, isl_dim_set
);
3706 if (first
+ n
> dim
|| first
+ n
< first
)
3707 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
3708 "index out of bounds", goto error
);
3710 map
= isl_map_from_domain(set
);
3711 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
3712 for (i
= 0; i
< n
; ++i
)
3713 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
3721 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3725 for (i
= 0; i
< n
; ++i
) {
3726 j
= isl_basic_map_alloc_div(bmap
);
3729 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3733 isl_basic_map_free(bmap
);
3737 struct isl_basic_map
*isl_basic_map_apply_range(
3738 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3740 isl_space
*dim_result
= NULL
;
3741 struct isl_basic_map
*bmap
;
3742 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3743 struct isl_dim_map
*dim_map1
, *dim_map2
;
3745 if (!bmap1
|| !bmap2
)
3747 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3748 bmap2
->dim
, isl_dim_param
))
3749 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3750 "parameters don't match", goto error
);
3751 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
3752 bmap2
->dim
, isl_dim_in
))
3753 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3754 "spaces don't match", goto error
);
3756 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3757 isl_space_copy(bmap2
->dim
));
3759 n_in
= isl_basic_map_n_in(bmap1
);
3760 n_out
= isl_basic_map_n_out(bmap2
);
3761 n
= isl_basic_map_n_out(bmap1
);
3762 nparam
= isl_basic_map_n_param(bmap1
);
3764 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3765 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3766 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3767 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3768 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3769 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3770 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3771 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3772 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3773 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3774 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3776 bmap
= isl_basic_map_alloc_space(dim_result
,
3777 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3778 bmap1
->n_eq
+ bmap2
->n_eq
,
3779 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3780 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3781 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3782 bmap
= add_divs(bmap
, n
);
3783 bmap
= isl_basic_map_simplify(bmap
);
3784 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3785 return isl_basic_map_finalize(bmap
);
3787 isl_basic_map_free(bmap1
);
3788 isl_basic_map_free(bmap2
);
3792 struct isl_basic_set
*isl_basic_set_apply(
3793 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3798 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3801 return (struct isl_basic_set
*)
3802 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3804 isl_basic_set_free(bset
);
3805 isl_basic_map_free(bmap
);
3809 struct isl_basic_map
*isl_basic_map_apply_domain(
3810 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3812 if (!bmap1
|| !bmap2
)
3815 isl_assert(bmap1
->ctx
,
3816 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3817 isl_assert(bmap1
->ctx
,
3818 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3821 bmap1
= isl_basic_map_reverse(bmap1
);
3822 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3823 return isl_basic_map_reverse(bmap1
);
3825 isl_basic_map_free(bmap1
);
3826 isl_basic_map_free(bmap2
);
3830 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3831 * A \cap B -> f(A) + f(B)
3833 struct isl_basic_map
*isl_basic_map_sum(
3834 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3836 unsigned n_in
, n_out
, nparam
, total
, pos
;
3837 struct isl_basic_map
*bmap
= NULL
;
3838 struct isl_dim_map
*dim_map1
, *dim_map2
;
3841 if (!bmap1
|| !bmap2
)
3844 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3847 nparam
= isl_basic_map_n_param(bmap1
);
3848 n_in
= isl_basic_map_n_in(bmap1
);
3849 n_out
= isl_basic_map_n_out(bmap1
);
3851 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3852 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3853 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3854 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3855 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3856 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3857 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3858 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3859 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3860 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3861 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3863 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3864 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3865 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3866 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3867 for (i
= 0; i
< n_out
; ++i
) {
3868 int j
= isl_basic_map_alloc_equality(bmap
);
3871 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3872 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3873 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3874 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3876 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3877 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3878 bmap
= add_divs(bmap
, 2 * n_out
);
3880 bmap
= isl_basic_map_simplify(bmap
);
3881 return isl_basic_map_finalize(bmap
);
3883 isl_basic_map_free(bmap
);
3884 isl_basic_map_free(bmap1
);
3885 isl_basic_map_free(bmap2
);
3889 /* Given two maps A -> f(A) and B -> g(B), construct a map
3890 * A \cap B -> f(A) + f(B)
3892 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3894 struct isl_map
*result
;
3900 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3902 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3903 map1
->n
* map2
->n
, 0);
3906 for (i
= 0; i
< map1
->n
; ++i
)
3907 for (j
= 0; j
< map2
->n
; ++j
) {
3908 struct isl_basic_map
*part
;
3909 part
= isl_basic_map_sum(
3910 isl_basic_map_copy(map1
->p
[i
]),
3911 isl_basic_map_copy(map2
->p
[j
]));
3912 if (isl_basic_map_is_empty(part
))
3913 isl_basic_map_free(part
);
3915 result
= isl_map_add_basic_map(result
, part
);
3928 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3929 __isl_take isl_set
*set2
)
3931 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3934 /* Given a basic map A -> f(A), construct A -> -f(A).
3936 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3941 bmap
= isl_basic_map_cow(bmap
);
3945 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3946 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3947 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3948 for (j
= 0; j
< n
; ++j
)
3949 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3950 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3951 for (j
= 0; j
< n
; ++j
)
3952 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3953 for (i
= 0; i
< bmap
->n_div
; ++i
)
3954 for (j
= 0; j
< n
; ++j
)
3955 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3956 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3957 return isl_basic_map_finalize(bmap
);
3960 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3962 return isl_basic_map_neg(bset
);
3965 /* Given a map A -> f(A), construct A -> -f(A).
3967 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3971 map
= isl_map_cow(map
);
3975 for (i
= 0; i
< map
->n
; ++i
) {
3976 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3987 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3989 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3992 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3993 * A -> floor(f(A)/d).
3995 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3998 unsigned n_in
, n_out
, nparam
, total
, pos
;
3999 struct isl_basic_map
*result
= NULL
;
4000 struct isl_dim_map
*dim_map
;
4006 nparam
= isl_basic_map_n_param(bmap
);
4007 n_in
= isl_basic_map_n_in(bmap
);
4008 n_out
= isl_basic_map_n_out(bmap
);
4010 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4011 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4012 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4013 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4014 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4015 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4017 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4018 bmap
->n_div
+ n_out
,
4019 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4020 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4021 result
= add_divs(result
, n_out
);
4022 for (i
= 0; i
< n_out
; ++i
) {
4024 j
= isl_basic_map_alloc_inequality(result
);
4027 isl_seq_clr(result
->ineq
[j
], 1+total
);
4028 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4029 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4030 j
= isl_basic_map_alloc_inequality(result
);
4033 isl_seq_clr(result
->ineq
[j
], 1+total
);
4034 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4035 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4036 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4039 result
= isl_basic_map_simplify(result
);
4040 return isl_basic_map_finalize(result
);
4042 isl_basic_map_free(result
);
4046 /* Given a map A -> f(A) and an integer d, construct a map
4047 * A -> floor(f(A)/d).
4049 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
4053 map
= isl_map_cow(map
);
4057 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4058 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4059 for (i
= 0; i
< map
->n
; ++i
) {
4060 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4071 /* Given a map A -> f(A) and an integer d, construct a map
4072 * A -> floor(f(A)/d).
4074 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4075 __isl_take isl_val
*d
)
4079 if (!isl_val_is_int(d
))
4080 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4081 "expecting integer denominator", goto error
);
4082 map
= isl_map_floordiv(map
, d
->n
);
4091 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
4097 i
= isl_basic_map_alloc_equality(bmap
);
4100 nparam
= isl_basic_map_n_param(bmap
);
4101 n_in
= isl_basic_map_n_in(bmap
);
4102 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4103 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4104 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4105 return isl_basic_map_finalize(bmap
);
4107 isl_basic_map_free(bmap
);
4111 /* Add a constraints to "bmap" expressing i_pos < o_pos
4113 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
4119 i
= isl_basic_map_alloc_inequality(bmap
);
4122 nparam
= isl_basic_map_n_param(bmap
);
4123 n_in
= isl_basic_map_n_in(bmap
);
4124 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4125 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4126 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4127 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4128 return isl_basic_map_finalize(bmap
);
4130 isl_basic_map_free(bmap
);
4134 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4136 static __isl_give isl_basic_map
*var_less_or_equal(
4137 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4143 i
= isl_basic_map_alloc_inequality(bmap
);
4146 nparam
= isl_basic_map_n_param(bmap
);
4147 n_in
= isl_basic_map_n_in(bmap
);
4148 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4149 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4150 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4151 return isl_basic_map_finalize(bmap
);
4153 isl_basic_map_free(bmap
);
4157 /* Add a constraints to "bmap" expressing i_pos > o_pos
4159 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
4165 i
= isl_basic_map_alloc_inequality(bmap
);
4168 nparam
= isl_basic_map_n_param(bmap
);
4169 n_in
= isl_basic_map_n_in(bmap
);
4170 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4171 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4172 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4173 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4174 return isl_basic_map_finalize(bmap
);
4176 isl_basic_map_free(bmap
);
4180 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4182 static __isl_give isl_basic_map
*var_more_or_equal(
4183 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4189 i
= isl_basic_map_alloc_inequality(bmap
);
4192 nparam
= isl_basic_map_n_param(bmap
);
4193 n_in
= isl_basic_map_n_in(bmap
);
4194 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4195 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4196 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4197 return isl_basic_map_finalize(bmap
);
4199 isl_basic_map_free(bmap
);
4203 __isl_give isl_basic_map
*isl_basic_map_equal(
4204 __isl_take isl_space
*dim
, unsigned n_equal
)
4207 struct isl_basic_map
*bmap
;
4208 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4211 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4212 bmap
= var_equal(bmap
, i
);
4213 return isl_basic_map_finalize(bmap
);
4216 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4218 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4222 struct isl_basic_map
*bmap
;
4223 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4226 for (i
= 0; i
< pos
&& bmap
; ++i
)
4227 bmap
= var_equal(bmap
, i
);
4229 bmap
= var_less(bmap
, pos
);
4230 return isl_basic_map_finalize(bmap
);
4233 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4235 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4236 __isl_take isl_space
*dim
, unsigned pos
)
4239 isl_basic_map
*bmap
;
4241 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4242 for (i
= 0; i
< pos
; ++i
)
4243 bmap
= var_equal(bmap
, i
);
4244 bmap
= var_less_or_equal(bmap
, pos
);
4245 return isl_basic_map_finalize(bmap
);
4248 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4250 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4254 struct isl_basic_map
*bmap
;
4255 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4258 for (i
= 0; i
< pos
&& bmap
; ++i
)
4259 bmap
= var_equal(bmap
, i
);
4261 bmap
= var_more(bmap
, pos
);
4262 return isl_basic_map_finalize(bmap
);
4265 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4267 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4268 __isl_take isl_space
*dim
, unsigned pos
)
4271 isl_basic_map
*bmap
;
4273 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4274 for (i
= 0; i
< pos
; ++i
)
4275 bmap
= var_equal(bmap
, i
);
4276 bmap
= var_more_or_equal(bmap
, pos
);
4277 return isl_basic_map_finalize(bmap
);
4280 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4281 unsigned n
, int equal
)
4283 struct isl_map
*map
;
4286 if (n
== 0 && equal
)
4287 return isl_map_universe(dims
);
4289 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4291 for (i
= 0; i
+ 1 < n
; ++i
)
4292 map
= isl_map_add_basic_map(map
,
4293 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4296 map
= isl_map_add_basic_map(map
,
4297 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4299 map
= isl_map_add_basic_map(map
,
4300 isl_basic_map_less_at(dims
, n
- 1));
4302 isl_space_free(dims
);
4307 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4311 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4314 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4316 return map_lex_lte_first(dim
, n
, 0);
4319 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4321 return map_lex_lte_first(dim
, n
, 1);
4324 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4326 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4329 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4331 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4334 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4335 unsigned n
, int equal
)
4337 struct isl_map
*map
;
4340 if (n
== 0 && equal
)
4341 return isl_map_universe(dims
);
4343 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4345 for (i
= 0; i
+ 1 < n
; ++i
)
4346 map
= isl_map_add_basic_map(map
,
4347 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4350 map
= isl_map_add_basic_map(map
,
4351 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4353 map
= isl_map_add_basic_map(map
,
4354 isl_basic_map_more_at(dims
, n
- 1));
4356 isl_space_free(dims
);
4361 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4365 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4368 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4370 return map_lex_gte_first(dim
, n
, 0);
4373 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4375 return map_lex_gte_first(dim
, n
, 1);
4378 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4380 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4383 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4385 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4388 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4389 __isl_take isl_set
*set2
)
4392 map
= isl_map_lex_le(isl_set_get_space(set1
));
4393 map
= isl_map_intersect_domain(map
, set1
);
4394 map
= isl_map_intersect_range(map
, set2
);
4398 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4399 __isl_take isl_set
*set2
)
4402 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4403 map
= isl_map_intersect_domain(map
, set1
);
4404 map
= isl_map_intersect_range(map
, set2
);
4408 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4409 __isl_take isl_set
*set2
)
4412 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4413 map
= isl_map_intersect_domain(map
, set1
);
4414 map
= isl_map_intersect_range(map
, set2
);
4418 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4419 __isl_take isl_set
*set2
)
4422 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4423 map
= isl_map_intersect_domain(map
, set1
);
4424 map
= isl_map_intersect_range(map
, set2
);
4428 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4429 __isl_take isl_map
*map2
)
4432 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4433 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4434 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4438 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4439 __isl_take isl_map
*map2
)
4442 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4443 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4444 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4448 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4449 __isl_take isl_map
*map2
)
4452 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4453 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4454 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4458 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4459 __isl_take isl_map
*map2
)
4462 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4463 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4464 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4468 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4469 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4471 struct isl_basic_map
*bmap
;
4473 bset
= isl_basic_set_cow(bset
);
4477 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4478 isl_space_free(bset
->dim
);
4479 bmap
= (struct isl_basic_map
*) bset
;
4481 return isl_basic_map_finalize(bmap
);
4483 isl_basic_set_free(bset
);
4484 isl_space_free(dim
);
4488 /* For a div d = floor(f/m), add the constraint
4492 static int add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
4493 unsigned pos
, isl_int
*div
)
4496 unsigned total
= isl_basic_map_total_dim(bmap
);
4498 i
= isl_basic_map_alloc_inequality(bmap
);
4501 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4502 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4507 /* For a div d = floor(f/m), add the constraint
4509 * -(f-(m-1)) + m d >= 0
4511 static int add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
4512 unsigned pos
, isl_int
*div
)
4515 unsigned total
= isl_basic_map_total_dim(bmap
);
4517 i
= isl_basic_map_alloc_inequality(bmap
);
4520 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4521 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
4522 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
4523 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
4528 /* For a div d = floor(f/m), add the constraints
4531 * -(f-(m-1)) + m d >= 0
4533 * Note that the second constraint is the negation of
4537 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4538 unsigned pos
, isl_int
*div
)
4540 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
4542 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
4547 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4548 unsigned pos
, isl_int
*div
)
4550 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4554 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4556 unsigned total
= isl_basic_map_total_dim(bmap
);
4557 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4559 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4563 /* For each known div d = floor(f/m), add the constraints
4566 * -(f-(m-1)) + m d >= 0
4568 * Remove duplicate constraints in case of some these div constraints
4569 * already appear in "bmap".
4571 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
4572 __isl_take isl_basic_map
*bmap
)
4578 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4582 bmap
= add_known_div_constraints(bmap
);
4583 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
4584 bmap
= isl_basic_map_finalize(bmap
);
4588 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4590 * In particular, if this div is of the form d = floor(f/m),
4591 * then add the constraint
4595 * if sign < 0 or the constraint
4597 * -(f-(m-1)) + m d >= 0
4601 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
4602 unsigned div
, int sign
)
4610 total
= isl_basic_map_total_dim(bmap
);
4611 div_pos
= total
- bmap
->n_div
+ div
;
4614 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4616 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4619 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4621 return isl_basic_map_add_div_constraints(bset
, div
);
4624 struct isl_basic_set
*isl_basic_map_underlying_set(
4625 struct isl_basic_map
*bmap
)
4629 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4631 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4632 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4633 return (struct isl_basic_set
*)bmap
;
4634 bmap
= isl_basic_map_cow(bmap
);
4637 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4640 bmap
->extra
-= bmap
->n_div
;
4642 bmap
= isl_basic_map_finalize(bmap
);
4643 return (struct isl_basic_set
*)bmap
;
4645 isl_basic_map_free(bmap
);
4649 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4650 __isl_take isl_basic_set
*bset
)
4652 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4655 /* Replace each element in "list" by the result of applying
4656 * isl_basic_map_underlying_set to the element.
4658 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
4659 __isl_take isl_basic_map_list
*list
)
4666 n
= isl_basic_map_list_n_basic_map(list
);
4667 for (i
= 0; i
< n
; ++i
) {
4668 isl_basic_map
*bmap
;
4669 isl_basic_set
*bset
;
4671 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
4672 bset
= isl_basic_set_underlying_set(bmap
);
4673 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
4679 struct isl_basic_map
*isl_basic_map_overlying_set(
4680 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4682 struct isl_basic_map
*bmap
;
4683 struct isl_ctx
*ctx
;
4690 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4691 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4692 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4694 if (like
->n_div
== 0) {
4695 isl_space
*space
= isl_basic_map_get_space(like
);
4696 isl_basic_map_free(like
);
4697 return isl_basic_map_reset_space(bset
, space
);
4699 bset
= isl_basic_set_cow(bset
);
4702 total
= bset
->dim
->n_out
+ bset
->extra
;
4703 bmap
= (struct isl_basic_map
*)bset
;
4704 isl_space_free(bmap
->dim
);
4705 bmap
->dim
= isl_space_copy(like
->dim
);
4708 bmap
->n_div
= like
->n_div
;
4709 bmap
->extra
+= like
->n_div
;
4713 ltotal
= total
- bmap
->extra
+ like
->extra
;
4716 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4717 bmap
->extra
* (1 + 1 + total
));
4718 if (isl_blk_is_error(bmap
->block2
))
4720 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4724 for (i
= 0; i
< bmap
->extra
; ++i
)
4725 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4726 for (i
= 0; i
< like
->n_div
; ++i
) {
4727 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4728 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4730 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
4732 isl_basic_map_free(like
);
4733 bmap
= isl_basic_map_simplify(bmap
);
4734 bmap
= isl_basic_map_finalize(bmap
);
4737 isl_basic_map_free(like
);
4738 isl_basic_set_free(bset
);
4742 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4743 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4745 return (struct isl_basic_set
*)
4746 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4749 struct isl_set
*isl_set_from_underlying_set(
4750 struct isl_set
*set
, struct isl_basic_set
*like
)
4756 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4758 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4759 isl_basic_set_free(like
);
4762 set
= isl_set_cow(set
);
4765 for (i
= 0; i
< set
->n
; ++i
) {
4766 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4767 isl_basic_set_copy(like
));
4771 isl_space_free(set
->dim
);
4772 set
->dim
= isl_space_copy(like
->dim
);
4775 isl_basic_set_free(like
);
4778 isl_basic_set_free(like
);
4783 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4787 map
= isl_map_cow(map
);
4790 map
->dim
= isl_space_cow(map
->dim
);
4794 for (i
= 1; i
< map
->n
; ++i
)
4795 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4797 for (i
= 0; i
< map
->n
; ++i
) {
4798 map
->p
[i
] = (struct isl_basic_map
*)
4799 isl_basic_map_underlying_set(map
->p
[i
]);
4804 map
->dim
= isl_space_underlying(map
->dim
, 0);
4806 isl_space_free(map
->dim
);
4807 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4811 return (struct isl_set
*)map
;
4817 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4819 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4822 /* Replace the space of "bmap" by "space".
4824 * If the space of "bmap" is identical to "space" (including the identifiers
4825 * of the input and output dimensions), then simply return the original input.
4827 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4828 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
4834 equal
= isl_space_is_equal(bmap
->dim
, space
);
4835 if (equal
>= 0 && equal
)
4836 equal
= isl_space_match(bmap
->dim
, isl_dim_in
,
4838 if (equal
>= 0 && equal
)
4839 equal
= isl_space_match(bmap
->dim
, isl_dim_out
,
4840 space
, isl_dim_out
);
4844 isl_space_free(space
);
4847 bmap
= isl_basic_map_cow(bmap
);
4848 if (!bmap
|| !space
)
4851 isl_space_free(bmap
->dim
);
4854 bmap
= isl_basic_map_finalize(bmap
);
4858 isl_basic_map_free(bmap
);
4859 isl_space_free(space
);
4863 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4864 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4866 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4870 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4871 __isl_take isl_space
*dim
)
4875 map
= isl_map_cow(map
);
4879 for (i
= 0; i
< map
->n
; ++i
) {
4880 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4881 isl_space_copy(dim
));
4885 isl_space_free(map
->dim
);
4891 isl_space_free(dim
);
4895 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4896 __isl_take isl_space
*dim
)
4898 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4901 /* Compute the parameter domain of the given basic set.
4903 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4908 if (isl_basic_set_is_params(bset
))
4911 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4912 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4913 space
= isl_basic_set_get_space(bset
);
4914 space
= isl_space_params(space
);
4915 bset
= isl_basic_set_reset_space(bset
, space
);
4919 /* Construct a zero-dimensional basic set with the given parameter domain.
4921 __isl_give isl_basic_set
*isl_basic_set_from_params(
4922 __isl_take isl_basic_set
*bset
)
4925 space
= isl_basic_set_get_space(bset
);
4926 space
= isl_space_set_from_params(space
);
4927 bset
= isl_basic_set_reset_space(bset
, space
);
4931 /* Compute the parameter domain of the given set.
4933 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4938 if (isl_set_is_params(set
))
4941 n
= isl_set_dim(set
, isl_dim_set
);
4942 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4943 space
= isl_set_get_space(set
);
4944 space
= isl_space_params(space
);
4945 set
= isl_set_reset_space(set
, space
);
4949 /* Construct a zero-dimensional set with the given parameter domain.
4951 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4954 space
= isl_set_get_space(set
);
4955 space
= isl_space_set_from_params(space
);
4956 set
= isl_set_reset_space(set
, space
);
4960 /* Compute the parameter domain of the given map.
4962 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4967 n
= isl_map_dim(map
, isl_dim_in
);
4968 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4969 n
= isl_map_dim(map
, isl_dim_out
);
4970 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4971 space
= isl_map_get_space(map
);
4972 space
= isl_space_params(space
);
4973 map
= isl_map_reset_space(map
, space
);
4977 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4984 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
4986 n_out
= isl_basic_map_n_out(bmap
);
4987 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
4989 return isl_basic_map_reset_space(bmap
, space
);
4992 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4996 return isl_space_may_be_set(bmap
->dim
);
4999 /* Is this basic map actually a set?
5000 * Users should never call this function. Outside of isl,
5001 * the type should indicate whether something is a set or a map.
5003 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5007 return isl_space_is_set(bmap
->dim
);
5010 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5014 if (isl_basic_map_is_set(bmap
))
5016 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5019 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5020 __isl_take isl_basic_map
*bmap
)
5024 isl_basic_map
*domain
;
5025 int nparam
, n_in
, n_out
;
5028 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5029 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5030 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5032 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5033 domain
= isl_basic_map_universe(dim
);
5035 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5036 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5037 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5039 total
= isl_basic_map_total_dim(bmap
);
5041 for (i
= 0; i
< n_in
; ++i
) {
5042 k
= isl_basic_map_alloc_equality(bmap
);
5045 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5046 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
5047 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
5050 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5051 return isl_basic_map_finalize(bmap
);
5053 isl_basic_map_free(bmap
);
5057 __isl_give isl_basic_map
*isl_basic_map_range_map(
5058 __isl_take isl_basic_map
*bmap
)
5062 isl_basic_map
*range
;
5063 int nparam
, n_in
, n_out
;
5066 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5067 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5068 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5070 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5071 range
= isl_basic_map_universe(dim
);
5073 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5074 bmap
= isl_basic_map_apply_range(bmap
, range
);
5075 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5077 total
= isl_basic_map_total_dim(bmap
);
5079 for (i
= 0; i
< n_out
; ++i
) {
5080 k
= isl_basic_map_alloc_equality(bmap
);
5083 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5084 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
5085 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
5088 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5089 return isl_basic_map_finalize(bmap
);
5091 isl_basic_map_free(bmap
);
5095 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5099 return isl_space_may_be_set(map
->dim
);
5102 /* Is this map actually a set?
5103 * Users should never call this function. Outside of isl,
5104 * the type should indicate whether something is a set or a map.
5106 int isl_map_is_set(__isl_keep isl_map
*map
)
5110 return isl_space_is_set(map
->dim
);
5113 struct isl_set
*isl_map_range(struct isl_map
*map
)
5116 struct isl_set
*set
;
5120 if (isl_map_is_set(map
))
5121 return (isl_set
*)map
;
5123 map
= isl_map_cow(map
);
5127 set
= (struct isl_set
*) map
;
5128 set
->dim
= isl_space_range(set
->dim
);
5131 for (i
= 0; i
< map
->n
; ++i
) {
5132 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5136 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5137 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5144 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5148 map
= isl_map_cow(map
);
5152 map
->dim
= isl_space_domain_map(map
->dim
);
5155 for (i
= 0; i
< map
->n
; ++i
) {
5156 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5160 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5161 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5168 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5171 isl_space
*range_dim
;
5173 map
= isl_map_cow(map
);
5177 range_dim
= isl_space_range(isl_map_get_space(map
));
5178 range_dim
= isl_space_from_range(range_dim
);
5179 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5180 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5183 for (i
= 0; i
< map
->n
; ++i
) {
5184 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5188 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5189 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5196 /* Given a wrapped map of the form A[B -> C],
5197 * return the map A[B -> C] -> B.
5199 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5206 if (!isl_set_has_tuple_id(set
))
5207 return isl_map_domain_map(isl_set_unwrap(set
));
5209 id
= isl_set_get_tuple_id(set
);
5210 map
= isl_map_domain_map(isl_set_unwrap(set
));
5211 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5216 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
5217 __isl_take isl_space
*dim
)
5220 struct isl_map
*map
= NULL
;
5222 set
= isl_set_cow(set
);
5225 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
5226 map
= (struct isl_map
*)set
;
5227 for (i
= 0; i
< set
->n
; ++i
) {
5228 map
->p
[i
] = isl_basic_map_from_basic_set(
5229 set
->p
[i
], isl_space_copy(dim
));
5233 isl_space_free(map
->dim
);
5237 isl_space_free(dim
);
5242 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5243 __isl_take isl_basic_set
*bset
)
5245 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5248 __isl_give isl_basic_map
*isl_basic_map_from_range(
5249 __isl_take isl_basic_set
*bset
)
5252 space
= isl_basic_set_get_space(bset
);
5253 space
= isl_space_from_range(space
);
5254 bset
= isl_basic_set_reset_space(bset
, space
);
5255 return (isl_basic_map
*)bset
;
5258 /* Create a relation with the given set as range.
5259 * The domain of the created relation is a zero-dimensional
5260 * flat anonymous space.
5262 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5265 space
= isl_set_get_space(set
);
5266 space
= isl_space_from_range(space
);
5267 set
= isl_set_reset_space(set
, space
);
5268 return (struct isl_map
*)set
;
5271 /* Create a relation with the given set as domain.
5272 * The range of the created relation is a zero-dimensional
5273 * flat anonymous space.
5275 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5277 return isl_map_reverse(isl_map_from_range(set
));
5280 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5281 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5283 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5286 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5287 __isl_take isl_set
*range
)
5289 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5292 /* Return a newly allocated isl_map with given space and flags and
5293 * room for "n" basic maps.
5294 * Make sure that all cached information is cleared.
5296 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5299 struct isl_map
*map
;
5304 isl_die(space
->ctx
, isl_error_internal
,
5305 "negative number of basic maps", goto error
);
5306 map
= isl_calloc(space
->ctx
, struct isl_map
,
5307 sizeof(struct isl_map
) +
5308 (n
- 1) * sizeof(struct isl_basic_map
*));
5312 map
->ctx
= space
->ctx
;
5313 isl_ctx_ref(map
->ctx
);
5321 isl_space_free(space
);
5325 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5326 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5329 struct isl_map
*map
;
5332 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5336 map
= isl_map_alloc_space(dims
, n
, flags
);
5340 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5342 struct isl_basic_map
*bmap
;
5343 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5344 bmap
= isl_basic_map_set_to_empty(bmap
);
5348 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5350 struct isl_basic_set
*bset
;
5351 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5352 bset
= isl_basic_set_set_to_empty(bset
);
5356 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5358 struct isl_basic_map
*bmap
;
5359 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5360 bmap
= isl_basic_map_finalize(bmap
);
5364 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5366 struct isl_basic_set
*bset
;
5367 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5368 bset
= isl_basic_set_finalize(bset
);
5372 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5375 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5376 isl_basic_map
*bmap
;
5378 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5379 for (i
= 0; i
< total
; ++i
) {
5380 int k
= isl_basic_map_alloc_inequality(bmap
);
5383 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5384 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5388 isl_basic_map_free(bmap
);
5392 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5394 return isl_basic_map_nat_universe(dim
);
5397 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5399 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5402 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5404 return isl_map_nat_universe(dim
);
5407 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5409 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5412 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5414 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5417 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5419 struct isl_map
*map
;
5422 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5423 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5427 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5429 struct isl_set
*set
;
5432 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5433 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5437 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5440 struct isl_map
*dup
;
5444 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5445 for (i
= 0; i
< map
->n
; ++i
)
5446 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5450 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5451 __isl_take isl_basic_map
*bmap
)
5455 if (isl_basic_map_plain_is_empty(bmap
)) {
5456 isl_basic_map_free(bmap
);
5459 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5460 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5461 map
->p
[map
->n
] = bmap
;
5463 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5469 isl_basic_map_free(bmap
);
5473 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
5484 isl_ctx_deref(map
->ctx
);
5485 for (i
= 0; i
< map
->n
; ++i
)
5486 isl_basic_map_free(map
->p
[i
]);
5487 isl_space_free(map
->dim
);
5493 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5494 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5498 bmap
= isl_basic_map_cow(bmap
);
5499 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5500 j
= isl_basic_map_alloc_equality(bmap
);
5503 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5504 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5505 isl_int_set_si(bmap
->eq
[j
][0], value
);
5506 bmap
= isl_basic_map_simplify(bmap
);
5507 return isl_basic_map_finalize(bmap
);
5509 isl_basic_map_free(bmap
);
5513 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5514 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5518 bmap
= isl_basic_map_cow(bmap
);
5519 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5520 j
= isl_basic_map_alloc_equality(bmap
);
5523 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5524 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5525 isl_int_set(bmap
->eq
[j
][0], value
);
5526 bmap
= isl_basic_map_simplify(bmap
);
5527 return isl_basic_map_finalize(bmap
);
5529 isl_basic_map_free(bmap
);
5533 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5534 enum isl_dim_type type
, unsigned pos
, int value
)
5538 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5539 return isl_basic_map_fix_pos_si(bmap
,
5540 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5542 isl_basic_map_free(bmap
);
5546 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5547 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5551 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5552 return isl_basic_map_fix_pos(bmap
,
5553 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5555 isl_basic_map_free(bmap
);
5559 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5560 * to be equal to "v".
5562 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5563 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5567 if (!isl_val_is_int(v
))
5568 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5569 "expecting integer value", goto error
);
5570 if (pos
>= isl_basic_map_dim(bmap
, type
))
5571 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5572 "index out of bounds", goto error
);
5573 pos
+= isl_basic_map_offset(bmap
, type
);
5574 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5578 isl_basic_map_free(bmap
);
5583 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5584 * to be equal to "v".
5586 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5587 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5589 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5592 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5593 enum isl_dim_type type
, unsigned pos
, int value
)
5595 return (struct isl_basic_set
*)
5596 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5600 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5601 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5603 return (struct isl_basic_set
*)
5604 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5608 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5609 unsigned input
, int value
)
5611 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5614 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5615 unsigned dim
, int value
)
5617 return (struct isl_basic_set
*)
5618 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5619 isl_dim_set
, dim
, value
);
5622 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5624 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5631 isl_basic_map_free(map
->p
[i
]);
5632 if (i
!= map
->n
- 1) {
5633 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5634 map
->p
[i
] = map
->p
[map
->n
- 1];
5641 /* Perform "fn" on each basic map of "map", where we may not be holding
5642 * the only reference to "map".
5643 * In particular, "fn" should be a semantics preserving operation
5644 * that we want to apply to all copies of "map". We therefore need
5645 * to be careful not to modify "map" in a way that breaks "map"
5646 * in case anything goes wrong.
5648 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5649 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5651 struct isl_basic_map
*bmap
;
5657 for (i
= map
->n
- 1; i
>= 0; --i
) {
5658 bmap
= isl_basic_map_copy(map
->p
[i
]);
5662 isl_basic_map_free(map
->p
[i
]);
5664 if (remove_if_empty(map
, i
) < 0)
5674 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5675 enum isl_dim_type type
, unsigned pos
, int value
)
5679 map
= isl_map_cow(map
);
5683 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5684 for (i
= map
->n
- 1; i
>= 0; --i
) {
5685 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5686 if (remove_if_empty(map
, i
) < 0)
5689 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5696 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5697 enum isl_dim_type type
, unsigned pos
, int value
)
5699 return (struct isl_set
*)
5700 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5703 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5704 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5708 map
= isl_map_cow(map
);
5712 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5713 for (i
= 0; i
< map
->n
; ++i
) {
5714 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5718 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5725 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5726 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5728 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5731 /* Fix the value of the variable at position "pos" of type "type" of "map"
5732 * to be equal to "v".
5734 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5735 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5739 map
= isl_map_cow(map
);
5743 if (!isl_val_is_int(v
))
5744 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5745 "expecting integer value", goto error
);
5746 if (pos
>= isl_map_dim(map
, type
))
5747 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5748 "index out of bounds", goto error
);
5749 for (i
= map
->n
- 1; i
>= 0; --i
) {
5750 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5752 if (remove_if_empty(map
, i
) < 0)
5755 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5764 /* Fix the value of the variable at position "pos" of type "type" of "set"
5765 * to be equal to "v".
5767 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5768 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5770 return isl_map_fix_val(set
, type
, pos
, v
);
5773 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5774 unsigned input
, int value
)
5776 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5779 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5781 return (struct isl_set
*)
5782 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5785 static __isl_give isl_basic_map
*basic_map_bound_si(
5786 __isl_take isl_basic_map
*bmap
,
5787 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5793 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5794 pos
+= isl_basic_map_offset(bmap
, type
);
5795 bmap
= isl_basic_map_cow(bmap
);
5796 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5797 j
= isl_basic_map_alloc_inequality(bmap
);
5800 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5802 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5803 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5805 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5806 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5808 bmap
= isl_basic_map_simplify(bmap
);
5809 return isl_basic_map_finalize(bmap
);
5811 isl_basic_map_free(bmap
);
5815 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5816 __isl_take isl_basic_map
*bmap
,
5817 enum isl_dim_type type
, unsigned pos
, int value
)
5819 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5822 /* Constrain the values of the given dimension to be no greater than "value".
5824 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5825 __isl_take isl_basic_map
*bmap
,
5826 enum isl_dim_type type
, unsigned pos
, int value
)
5828 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5831 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5832 unsigned dim
, isl_int value
)
5836 bset
= isl_basic_set_cow(bset
);
5837 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5838 j
= isl_basic_set_alloc_inequality(bset
);
5841 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5842 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5843 isl_int_neg(bset
->ineq
[j
][0], value
);
5844 bset
= isl_basic_set_simplify(bset
);
5845 return isl_basic_set_finalize(bset
);
5847 isl_basic_set_free(bset
);
5851 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5852 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5856 map
= isl_map_cow(map
);
5860 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5861 for (i
= 0; i
< map
->n
; ++i
) {
5862 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5863 type
, pos
, value
, upper
);
5867 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5874 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5875 enum isl_dim_type type
, unsigned pos
, int value
)
5877 return map_bound_si(map
, type
, pos
, value
, 0);
5880 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5881 enum isl_dim_type type
, unsigned pos
, int value
)
5883 return map_bound_si(map
, type
, pos
, value
, 1);
5886 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5887 enum isl_dim_type type
, unsigned pos
, int value
)
5889 return (struct isl_set
*)
5890 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5893 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5894 enum isl_dim_type type
, unsigned pos
, int value
)
5896 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5899 /* Bound the given variable of "bmap" from below (or above is "upper"
5900 * is set) to "value".
5902 static __isl_give isl_basic_map
*basic_map_bound(
5903 __isl_take isl_basic_map
*bmap
,
5904 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5910 if (pos
>= isl_basic_map_dim(bmap
, type
))
5911 isl_die(bmap
->ctx
, isl_error_invalid
,
5912 "index out of bounds", goto error
);
5913 pos
+= isl_basic_map_offset(bmap
, type
);
5914 bmap
= isl_basic_map_cow(bmap
);
5915 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5916 j
= isl_basic_map_alloc_inequality(bmap
);
5919 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5921 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5922 isl_int_set(bmap
->ineq
[j
][0], value
);
5924 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5925 isl_int_neg(bmap
->ineq
[j
][0], value
);
5927 bmap
= isl_basic_map_simplify(bmap
);
5928 return isl_basic_map_finalize(bmap
);
5930 isl_basic_map_free(bmap
);
5934 /* Bound the given variable of "map" from below (or above is "upper"
5935 * is set) to "value".
5937 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5938 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5942 map
= isl_map_cow(map
);
5946 if (pos
>= isl_map_dim(map
, type
))
5947 isl_die(map
->ctx
, isl_error_invalid
,
5948 "index out of bounds", goto error
);
5949 for (i
= map
->n
- 1; i
>= 0; --i
) {
5950 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5951 if (remove_if_empty(map
, i
) < 0)
5954 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5961 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5962 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5964 return map_bound(map
, type
, pos
, value
, 0);
5967 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5968 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5970 return map_bound(map
, type
, pos
, value
, 1);
5973 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5974 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5976 return isl_map_lower_bound(set
, type
, pos
, value
);
5979 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5980 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5982 return isl_map_upper_bound(set
, type
, pos
, value
);
5985 /* Force the values of the variable at position "pos" of type "type" of "set"
5986 * to be no smaller than "value".
5988 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
5989 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5993 if (!isl_val_is_int(value
))
5994 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5995 "expecting integer value", goto error
);
5996 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
5997 isl_val_free(value
);
6000 isl_val_free(value
);
6005 /* Force the values of the variable at position "pos" of type "type" of "set"
6006 * to be no greater than "value".
6008 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6009 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6013 if (!isl_val_is_int(value
))
6014 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6015 "expecting integer value", goto error
);
6016 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6017 isl_val_free(value
);
6020 isl_val_free(value
);
6025 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
6030 set
= isl_set_cow(set
);
6034 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
6035 for (i
= 0; i
< set
->n
; ++i
) {
6036 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
6046 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
6050 map
= isl_map_cow(map
);
6054 map
->dim
= isl_space_reverse(map
->dim
);
6057 for (i
= 0; i
< map
->n
; ++i
) {
6058 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6062 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6070 #define TYPE isl_pw_multi_aff
6072 #define SUFFIX _pw_multi_aff
6074 #define EMPTY isl_pw_multi_aff_empty
6076 #define ADD isl_pw_multi_aff_union_add
6077 #include "isl_map_lexopt_templ.c"
6079 /* Given a map "map", compute the lexicographically minimal
6080 * (or maximal) image element for each domain element in dom,
6081 * in the form of an isl_pw_multi_aff.
6082 * If "empty" is not NULL, then set *empty to those elements in dom that
6083 * do not have an image element.
6084 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6085 * should be computed over the domain of "map". "empty" is also NULL
6088 * We first compute the lexicographically minimal or maximal element
6089 * in the first basic map. This results in a partial solution "res"
6090 * and a subset "todo" of dom that still need to be handled.
6091 * We then consider each of the remaining maps in "map" and successively
6092 * update both "res" and "todo".
6093 * If "empty" is NULL, then the todo sets are not needed and therefore
6094 * also not computed.
6096 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6097 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6098 __isl_give isl_set
**empty
, unsigned flags
)
6102 isl_pw_multi_aff
*res
;
6105 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6106 if (!map
|| (!full
&& !dom
))
6109 if (isl_map_plain_is_empty(map
)) {
6114 return isl_pw_multi_aff_from_map(map
);
6117 res
= basic_map_partial_lexopt_pw_multi_aff(
6118 isl_basic_map_copy(map
->p
[0]),
6119 isl_set_copy(dom
), empty
, flags
);
6123 for (i
= 1; i
< map
->n
; ++i
) {
6124 isl_pw_multi_aff
*res_i
;
6126 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6127 isl_basic_map_copy(map
->p
[i
]),
6128 isl_set_copy(dom
), empty
, flags
);
6130 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6131 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6133 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6136 todo
= isl_set_intersect(todo
, *empty
);
6155 #define TYPE isl_map
6159 #define EMPTY isl_map_empty
6161 #define ADD isl_map_union_disjoint
6162 #include "isl_map_lexopt_templ.c"
6164 /* Given a map "map", compute the lexicographically minimal
6165 * (or maximal) image element for each domain element in "dom",
6166 * in the form of an isl_map.
6167 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6168 * do not have an image element.
6169 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6170 * should be computed over the domain of "map". "empty" is also NULL
6173 * If the input consists of more than one disjunct, then first
6174 * compute the desired result in the form of an isl_pw_multi_aff and
6175 * then convert that into an isl_map.
6177 * This function used to have an explicit implementation in terms
6178 * of isl_maps, but it would continually intersect the domains of
6179 * partial results with the complement of the domain of the next
6180 * partial solution, potentially leading to an explosion in the number
6181 * of disjuncts if there are several disjuncts in the input.
6182 * An even earlier implementation of this function would look for
6183 * better results in the domain of the partial result and for extra
6184 * results in the complement of this domain, which would lead to
6185 * even more splintering.
6187 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6188 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6189 __isl_give isl_set
**empty
, unsigned flags
)
6192 struct isl_map
*res
;
6193 isl_pw_multi_aff
*pma
;
6195 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6196 if (!map
|| (!full
&& !dom
))
6199 if (isl_map_plain_is_empty(map
)) {
6208 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6214 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6216 return isl_map_from_pw_multi_aff(pma
);
6225 __isl_give isl_map
*isl_map_partial_lexmax(
6226 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6227 __isl_give isl_set
**empty
)
6229 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6232 __isl_give isl_map
*isl_map_partial_lexmin(
6233 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6234 __isl_give isl_set
**empty
)
6236 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6239 __isl_give isl_set
*isl_set_partial_lexmin(
6240 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6241 __isl_give isl_set
**empty
)
6243 return (struct isl_set
*)
6244 isl_map_partial_lexmin((struct isl_map
*)set
,
6248 __isl_give isl_set
*isl_set_partial_lexmax(
6249 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6250 __isl_give isl_set
**empty
)
6252 return (struct isl_set
*)
6253 isl_map_partial_lexmax((struct isl_map
*)set
,
6257 /* Compute the lexicographic minimum (or maximum if "flags" includes
6258 * ISL_OPT_MAX) of "bset" over its parametric domain.
6260 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6263 return isl_basic_map_lexopt(bset
, flags
);
6266 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6268 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6271 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6273 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6276 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6278 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6281 /* Compute the lexicographic minimum of "bset" over its parametric domain
6282 * for the purpose of quantifier elimination.
6283 * That is, find an explicit representation for all the existentially
6284 * quantified variables in "bset" by computing their lexicographic
6287 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6288 __isl_take isl_basic_set
*bset
)
6290 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6293 /* Extract the first and only affine expression from list
6294 * and then add it to *pwaff with the given dom.
6295 * This domain is known to be disjoint from other domains
6296 * because of the way isl_basic_map_foreach_lexmax works.
6298 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6299 __isl_take isl_aff_list
*list
, void *user
)
6301 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6303 isl_pw_aff
**pwaff
= user
;
6304 isl_pw_aff
*pwaff_i
;
6308 if (isl_aff_list_n_aff(list
) != 1)
6309 isl_die(ctx
, isl_error_internal
,
6310 "expecting single element list", goto error
);
6312 aff
= isl_aff_list_get_aff(list
, 0);
6313 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6315 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6317 isl_aff_list_free(list
);
6321 isl_basic_set_free(dom
);
6322 isl_aff_list_free(list
);
6326 /* Given a basic map with one output dimension, compute the minimum or
6327 * maximum of that dimension as an isl_pw_aff.
6329 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6330 * call update_dim_opt on each leaf of the result.
6332 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6335 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6339 dim
= isl_space_from_domain(isl_space_domain(dim
));
6340 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6341 pwaff
= isl_pw_aff_empty(dim
);
6343 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6345 return isl_pw_aff_free(pwaff
);
6350 /* Compute the minimum or maximum of the given output dimension
6351 * as a function of the parameters and the input dimensions,
6352 * but independently of the other output dimensions.
6354 * We first project out the other output dimension and then compute
6355 * the "lexicographic" maximum in each basic map, combining the results
6356 * using isl_pw_aff_union_max.
6358 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6365 n_out
= isl_map_dim(map
, isl_dim_out
);
6366 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6367 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6372 isl_space
*dim
= isl_map_get_space(map
);
6374 return isl_pw_aff_empty(dim
);
6377 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6378 for (i
= 1; i
< map
->n
; ++i
) {
6379 isl_pw_aff
*pwaff_i
;
6381 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6382 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6390 /* Compute the minimum of the given output dimension as a function of the
6391 * parameters and input dimensions, but independently of
6392 * the other output dimensions.
6394 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6396 return map_dim_opt(map
, pos
, 0);
6399 /* Compute the maximum of the given output dimension as a function of the
6400 * parameters and input dimensions, but independently of
6401 * the other output dimensions.
6403 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6405 return map_dim_opt(map
, pos
, 1);
6408 /* Compute the minimum or maximum of the given set dimension
6409 * as a function of the parameters,
6410 * but independently of the other set dimensions.
6412 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6415 return map_dim_opt(set
, pos
, max
);
6418 /* Compute the maximum of the given set dimension as a function of the
6419 * parameters, but independently of the other set dimensions.
6421 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6423 return set_dim_opt(set
, pos
, 1);
6426 /* Compute the minimum of the given set dimension as a function of the
6427 * parameters, but independently of the other set dimensions.
6429 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6431 return set_dim_opt(set
, pos
, 0);
6434 /* Apply a preimage specified by "mat" on the parameters of "bset".
6435 * bset is assumed to have only parameters and divs.
6437 static struct isl_basic_set
*basic_set_parameter_preimage(
6438 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6445 bset
->dim
= isl_space_cow(bset
->dim
);
6449 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6451 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6453 bset
->dim
->nparam
= 0;
6454 bset
->dim
->n_out
= nparam
;
6455 bset
= isl_basic_set_preimage(bset
, mat
);
6457 bset
->dim
->nparam
= bset
->dim
->n_out
;
6458 bset
->dim
->n_out
= 0;
6463 isl_basic_set_free(bset
);
6467 /* Apply a preimage specified by "mat" on the parameters of "set".
6468 * set is assumed to have only parameters and divs.
6470 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
6471 __isl_take isl_mat
*mat
)
6479 nparam
= isl_set_dim(set
, isl_dim_param
);
6481 if (mat
->n_row
!= 1 + nparam
)
6482 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
6483 "unexpected number of rows", goto error
);
6485 space
= isl_set_get_space(set
);
6486 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
6487 isl_dim_param
, 0, nparam
);
6488 set
= isl_set_reset_space(set
, space
);
6489 set
= isl_set_preimage(set
, mat
);
6490 nparam
= isl_set_dim(set
, isl_dim_out
);
6491 space
= isl_set_get_space(set
);
6492 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
6493 isl_dim_out
, 0, nparam
);
6494 set
= isl_set_reset_space(set
, space
);
6502 /* Intersect the basic set "bset" with the affine space specified by the
6503 * equalities in "eq".
6505 static struct isl_basic_set
*basic_set_append_equalities(
6506 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6514 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6519 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6520 for (i
= 0; i
< eq
->n_row
; ++i
) {
6521 k
= isl_basic_set_alloc_equality(bset
);
6524 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6525 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6529 bset
= isl_basic_set_gauss(bset
, NULL
);
6530 bset
= isl_basic_set_finalize(bset
);
6535 isl_basic_set_free(bset
);
6539 /* Intersect the set "set" with the affine space specified by the
6540 * equalities in "eq".
6542 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6550 for (i
= 0; i
< set
->n
; ++i
) {
6551 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6564 /* Given a basic set "bset" that only involves parameters and existentially
6565 * quantified variables, return the index of the first equality
6566 * that only involves parameters. If there is no such equality then
6567 * return bset->n_eq.
6569 * This function assumes that isl_basic_set_gauss has been called on "bset".
6571 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6574 unsigned nparam
, n_div
;
6579 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6580 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6582 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6583 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6590 /* Compute an explicit representation for the existentially quantified
6591 * variables in "bset" by computing the "minimal value" of the set
6592 * variables. Since there are no set variables, the computation of
6593 * the minimal value essentially computes an explicit representation
6594 * of the non-empty part(s) of "bset".
6596 * The input only involves parameters and existentially quantified variables.
6597 * All equalities among parameters have been removed.
6599 * Since the existentially quantified variables in the result are in general
6600 * going to be different from those in the input, we first replace
6601 * them by the minimal number of variables based on their equalities.
6602 * This should simplify the parametric integer programming.
6604 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6606 isl_morph
*morph1
, *morph2
;
6612 if (bset
->n_eq
== 0)
6613 return isl_basic_set_lexmin_compute_divs(bset
);
6615 morph1
= isl_basic_set_parameter_compression(bset
);
6616 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6617 bset
= isl_basic_set_lift(bset
);
6618 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6619 bset
= isl_morph_basic_set(morph2
, bset
);
6620 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6621 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6623 set
= isl_basic_set_lexmin_compute_divs(bset
);
6625 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6630 /* Project the given basic set onto its parameter domain, possibly introducing
6631 * new, explicit, existential variables in the constraints.
6632 * The input has parameters and (possibly implicit) existential variables.
6633 * The output has the same parameters, but only
6634 * explicit existentially quantified variables.
6636 * The actual projection is performed by pip, but pip doesn't seem
6637 * to like equalities very much, so we first remove the equalities
6638 * among the parameters by performing a variable compression on
6639 * the parameters. Afterward, an inverse transformation is performed
6640 * and the equalities among the parameters are inserted back in.
6642 * The variable compression on the parameters may uncover additional
6643 * equalities that were only implicit before. We therefore check
6644 * if there are any new parameter equalities in the result and
6645 * if so recurse. The removal of parameter equalities is required
6646 * for the parameter compression performed by base_compute_divs.
6648 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6652 struct isl_mat
*T
, *T2
;
6653 struct isl_set
*set
;
6656 bset
= isl_basic_set_cow(bset
);
6660 if (bset
->n_eq
== 0)
6661 return base_compute_divs(bset
);
6663 bset
= isl_basic_set_gauss(bset
, NULL
);
6666 if (isl_basic_set_plain_is_empty(bset
))
6667 return isl_set_from_basic_set(bset
);
6669 i
= first_parameter_equality(bset
);
6670 if (i
== bset
->n_eq
)
6671 return base_compute_divs(bset
);
6673 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6674 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6676 eq
= isl_mat_cow(eq
);
6677 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6678 if (T
&& T
->n_col
== 0) {
6682 bset
= isl_basic_set_set_to_empty(bset
);
6683 return isl_set_from_basic_set(bset
);
6685 bset
= basic_set_parameter_preimage(bset
, T
);
6687 i
= first_parameter_equality(bset
);
6690 else if (i
== bset
->n_eq
)
6691 set
= base_compute_divs(bset
);
6693 set
= parameter_compute_divs(bset
);
6694 set
= set_parameter_preimage(set
, T2
);
6695 set
= set_append_equalities(set
, eq
);
6699 /* Insert the divs from "ls" before those of "bmap".
6701 * The number of columns is not changed, which means that the last
6702 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6703 * The caller is responsible for removing the same number of dimensions
6704 * from the space of "bmap".
6706 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6707 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6713 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6717 old_n_div
= bmap
->n_div
;
6718 bmap
= insert_div_rows(bmap
, n_div
);
6722 for (i
= 0; i
< n_div
; ++i
) {
6723 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6724 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6730 /* Replace the space of "bmap" by the space and divs of "ls".
6732 * If "ls" has any divs, then we simplify the result since we may
6733 * have discovered some additional equalities that could simplify
6734 * the div expressions.
6736 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6737 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6741 bmap
= isl_basic_map_cow(bmap
);
6745 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6746 bmap
= insert_divs_from_local_space(bmap
, ls
);
6750 isl_space_free(bmap
->dim
);
6751 bmap
->dim
= isl_local_space_get_space(ls
);
6755 isl_local_space_free(ls
);
6757 bmap
= isl_basic_map_simplify(bmap
);
6758 bmap
= isl_basic_map_finalize(bmap
);
6761 isl_basic_map_free(bmap
);
6762 isl_local_space_free(ls
);
6766 /* Replace the space of "map" by the space and divs of "ls".
6768 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6769 __isl_take isl_local_space
*ls
)
6773 map
= isl_map_cow(map
);
6777 for (i
= 0; i
< map
->n
; ++i
) {
6778 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6779 isl_local_space_copy(ls
));
6783 isl_space_free(map
->dim
);
6784 map
->dim
= isl_local_space_get_space(ls
);
6788 isl_local_space_free(ls
);
6791 isl_local_space_free(ls
);
6796 /* Compute an explicit representation for the existentially
6797 * quantified variables for which do not know any explicit representation yet.
6799 * We first sort the existentially quantified variables so that the
6800 * existentially quantified variables for which we already have an explicit
6801 * representation are placed before those for which we do not.
6802 * The input dimensions, the output dimensions and the existentially
6803 * quantified variables for which we already have an explicit
6804 * representation are then turned into parameters.
6805 * compute_divs returns a map with the same parameters and
6806 * no input or output dimensions and the dimension specification
6807 * is reset to that of the input, including the existentially quantified
6808 * variables for which we already had an explicit representation.
6810 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6812 struct isl_basic_set
*bset
;
6813 struct isl_set
*set
;
6814 struct isl_map
*map
;
6816 isl_local_space
*ls
;
6823 bmap
= isl_basic_map_sort_divs(bmap
);
6824 bmap
= isl_basic_map_cow(bmap
);
6828 n_known
= isl_basic_map_first_unknown_div(bmap
);
6830 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
6832 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6833 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6834 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6835 dim
= isl_space_set_alloc(bmap
->ctx
,
6836 nparam
+ n_in
+ n_out
+ n_known
, 0);
6840 ls
= isl_basic_map_get_local_space(bmap
);
6841 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6842 n_known
, bmap
->n_div
- n_known
);
6844 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6845 swap_div(bmap
, i
- n_known
, i
);
6846 bmap
->n_div
-= n_known
;
6847 bmap
->extra
-= n_known
;
6849 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6850 bset
= (struct isl_basic_set
*)bmap
;
6852 set
= parameter_compute_divs(bset
);
6853 map
= (struct isl_map
*)set
;
6854 map
= replace_space_by_local_space(map
, ls
);
6858 isl_basic_map_free(bmap
);
6862 /* Remove the explicit representation of local variable "div",
6865 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
6866 __isl_take isl_basic_map
*bmap
, int div
)
6870 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
6872 return isl_basic_map_free(bmap
);
6876 bmap
= isl_basic_map_cow(bmap
);
6879 isl_int_set_si(bmap
->div
[div
][0], 0);
6883 /* Is local variable "div" of "bmap" marked as not having an explicit
6885 * Note that even if "div" is not marked in this way and therefore
6886 * has an explicit representation, this representation may still
6887 * depend (indirectly) on other local variables that do not
6888 * have an explicit representation.
6890 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
6894 return isl_bool_error
;
6895 if (div
< 0 || div
>= isl_basic_map_dim(bmap
, isl_dim_div
))
6896 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6897 "position out of bounds", return isl_bool_error
);
6898 return isl_int_is_zero(bmap
->div
[div
][0]);
6901 /* Return the position of the first local variable that does not
6902 * have an explicit representation.
6903 * Return the total number of local variables if they all have
6904 * an explicit representation.
6905 * Return -1 on error.
6907 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
6914 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6915 if (!isl_basic_map_div_is_known(bmap
, i
))
6921 /* Does "bmap" have an explicit representation for all local variables?
6923 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6927 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
6928 first
= isl_basic_map_first_unknown_div(bmap
);
6930 return isl_bool_error
;
6934 /* Do all basic maps in "map" have an explicit representation
6935 * for all local variables?
6937 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
6942 return isl_bool_error
;
6944 for (i
= 0; i
< map
->n
; ++i
) {
6945 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6950 return isl_bool_true
;
6953 /* If bmap contains any unknown divs, then compute explicit
6954 * expressions for them. However, this computation may be
6955 * quite expensive, so first try to remove divs that aren't
6958 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6961 struct isl_map
*map
;
6963 known
= isl_basic_map_divs_known(bmap
);
6967 return isl_map_from_basic_map(bmap
);
6969 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6971 known
= isl_basic_map_divs_known(bmap
);
6975 return isl_map_from_basic_map(bmap
);
6977 map
= compute_divs(bmap
);
6980 isl_basic_map_free(bmap
);
6984 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6988 struct isl_map
*res
;
6995 known
= isl_map_divs_known(map
);
7003 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7004 for (i
= 1 ; i
< map
->n
; ++i
) {
7006 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7007 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7008 res
= isl_map_union_disjoint(res
, r2
);
7010 res
= isl_map_union(res
, r2
);
7017 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7019 return (struct isl_set
*)
7020 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
7023 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7025 return (struct isl_set
*)
7026 isl_map_compute_divs((struct isl_map
*)set
);
7029 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7032 struct isl_set
*set
;
7037 map
= isl_map_cow(map
);
7041 set
= (struct isl_set
*)map
;
7042 set
->dim
= isl_space_domain(set
->dim
);
7045 for (i
= 0; i
< map
->n
; ++i
) {
7046 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7050 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7051 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7058 /* Return the union of "map1" and "map2", where we assume for now that
7059 * "map1" and "map2" are disjoint. Note that the basic maps inside
7060 * "map1" or "map2" may not be disjoint from each other.
7061 * Also note that this function is also called from isl_map_union,
7062 * which takes care of handling the situation where "map1" and "map2"
7063 * may not be disjoint.
7065 * If one of the inputs is empty, we can simply return the other input.
7066 * Similarly, if one of the inputs is universal, then it is equal to the union.
7068 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7069 __isl_take isl_map
*map2
)
7073 struct isl_map
*map
= NULL
;
7079 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7080 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7081 "spaces don't match", goto error
);
7092 is_universe
= isl_map_plain_is_universe(map1
);
7093 if (is_universe
< 0)
7100 is_universe
= isl_map_plain_is_universe(map2
);
7101 if (is_universe
< 0)
7108 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7109 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7110 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7112 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7113 map1
->n
+ map2
->n
, flags
);
7116 for (i
= 0; i
< map1
->n
; ++i
) {
7117 map
= isl_map_add_basic_map(map
,
7118 isl_basic_map_copy(map1
->p
[i
]));
7122 for (i
= 0; i
< map2
->n
; ++i
) {
7123 map
= isl_map_add_basic_map(map
,
7124 isl_basic_map_copy(map2
->p
[i
]));
7138 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7139 * guaranteed to be disjoint by the caller.
7141 * Note that this functions is called from within isl_map_make_disjoint,
7142 * so we have to be careful not to touch the constraints of the inputs
7145 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7146 __isl_take isl_map
*map2
)
7148 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7151 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7152 * not be disjoint. The parameters are assumed to have been aligned.
7154 * We currently simply call map_union_disjoint, the internal operation
7155 * of which does not really depend on the inputs being disjoint.
7156 * If the result contains more than one basic map, then we clear
7157 * the disjoint flag since the result may contain basic maps from
7158 * both inputs and these are not guaranteed to be disjoint.
7160 * As a special case, if "map1" and "map2" are obviously equal,
7161 * then we simply return "map1".
7163 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7164 __isl_take isl_map
*map2
)
7171 equal
= isl_map_plain_is_equal(map1
, map2
);
7179 map1
= map_union_disjoint(map1
, map2
);
7183 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7191 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7194 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7195 __isl_take isl_map
*map2
)
7197 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7200 struct isl_set
*isl_set_union_disjoint(
7201 struct isl_set
*set1
, struct isl_set
*set2
)
7203 return (struct isl_set
*)
7204 isl_map_union_disjoint(
7205 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
7208 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7210 return (struct isl_set
*)
7211 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7214 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7217 * "map" and "set" are assumed to be compatible and non-NULL.
7219 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7220 __isl_take isl_set
*set
,
7221 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7222 __isl_take isl_basic_set
*bset
))
7225 struct isl_map
*result
;
7228 if (isl_set_plain_is_universe(set
)) {
7233 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7234 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7235 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7237 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7238 map
->n
* set
->n
, flags
);
7239 for (i
= 0; result
&& i
< map
->n
; ++i
)
7240 for (j
= 0; j
< set
->n
; ++j
) {
7241 result
= isl_map_add_basic_map(result
,
7242 fn(isl_basic_map_copy(map
->p
[i
]),
7243 isl_basic_set_copy(set
->p
[j
])));
7253 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7254 __isl_take isl_set
*set
)
7259 if (!isl_map_compatible_range(map
, set
))
7260 isl_die(set
->ctx
, isl_error_invalid
,
7261 "incompatible spaces", goto error
);
7263 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7270 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7271 __isl_take isl_set
*set
)
7273 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7276 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7277 __isl_take isl_set
*set
)
7282 if (!isl_map_compatible_domain(map
, set
))
7283 isl_die(set
->ctx
, isl_error_invalid
,
7284 "incompatible spaces", goto error
);
7286 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7293 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7294 __isl_take isl_set
*set
)
7296 return isl_map_align_params_map_map_and(map
, set
,
7297 &map_intersect_domain
);
7300 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7301 __isl_take isl_map
*map2
)
7305 map1
= isl_map_reverse(map1
);
7306 map1
= isl_map_apply_range(map1
, map2
);
7307 return isl_map_reverse(map1
);
7314 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7315 __isl_take isl_map
*map2
)
7317 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7320 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7321 __isl_take isl_map
*map2
)
7323 isl_space
*dim_result
;
7324 struct isl_map
*result
;
7330 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7331 isl_space_copy(map2
->dim
));
7333 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7336 for (i
= 0; i
< map1
->n
; ++i
)
7337 for (j
= 0; j
< map2
->n
; ++j
) {
7338 result
= isl_map_add_basic_map(result
,
7339 isl_basic_map_apply_range(
7340 isl_basic_map_copy(map1
->p
[i
]),
7341 isl_basic_map_copy(map2
->p
[j
])));
7347 if (result
&& result
->n
<= 1)
7348 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7356 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7357 __isl_take isl_map
*map2
)
7359 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7363 * returns range - domain
7365 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7367 isl_space
*target_space
;
7368 struct isl_basic_set
*bset
;
7375 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7376 bmap
->dim
, isl_dim_out
),
7378 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7379 dim
= isl_basic_map_n_in(bmap
);
7380 nparam
= isl_basic_map_n_param(bmap
);
7381 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7382 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7383 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7384 for (i
= 0; i
< dim
; ++i
) {
7385 int j
= isl_basic_map_alloc_equality(bmap
);
7387 bmap
= isl_basic_map_free(bmap
);
7390 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7391 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7392 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
7393 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7395 bset
= isl_basic_map_domain(bmap
);
7396 bset
= isl_basic_set_reset_space(bset
, target_space
);
7399 isl_basic_map_free(bmap
);
7404 * returns range - domain
7406 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7410 struct isl_set
*result
;
7415 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7416 map
->dim
, isl_dim_out
),
7418 dim
= isl_map_get_space(map
);
7419 dim
= isl_space_domain(dim
);
7420 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7423 for (i
= 0; i
< map
->n
; ++i
)
7424 result
= isl_set_add_basic_set(result
,
7425 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7434 * returns [domain -> range] -> range - domain
7436 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7437 __isl_take isl_basic_map
*bmap
)
7441 isl_basic_map
*domain
;
7445 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7446 bmap
->dim
, isl_dim_out
))
7447 isl_die(bmap
->ctx
, isl_error_invalid
,
7448 "domain and range don't match", goto error
);
7450 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7451 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7453 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7454 domain
= isl_basic_map_universe(dim
);
7456 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7457 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7458 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7460 total
= isl_basic_map_total_dim(bmap
);
7462 for (i
= 0; i
< n
; ++i
) {
7463 k
= isl_basic_map_alloc_equality(bmap
);
7466 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7467 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7468 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7469 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7472 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7473 return isl_basic_map_finalize(bmap
);
7475 isl_basic_map_free(bmap
);
7480 * returns [domain -> range] -> range - domain
7482 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7485 isl_space
*domain_dim
;
7490 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7491 map
->dim
, isl_dim_out
))
7492 isl_die(map
->ctx
, isl_error_invalid
,
7493 "domain and range don't match", goto error
);
7495 map
= isl_map_cow(map
);
7499 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7500 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7501 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7504 for (i
= 0; i
< map
->n
; ++i
) {
7505 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7509 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7516 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7518 struct isl_basic_map
*bmap
;
7526 nparam
= dims
->nparam
;
7528 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7532 for (i
= 0; i
< dim
; ++i
) {
7533 int j
= isl_basic_map_alloc_equality(bmap
);
7536 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7537 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7538 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7540 return isl_basic_map_finalize(bmap
);
7542 isl_basic_map_free(bmap
);
7546 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7550 if (dim
->n_in
!= dim
->n_out
)
7551 isl_die(dim
->ctx
, isl_error_invalid
,
7552 "number of input and output dimensions needs to be "
7553 "the same", goto error
);
7554 return basic_map_identity(dim
);
7556 isl_space_free(dim
);
7560 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7562 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7565 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7567 isl_space
*dim
= isl_set_get_space(set
);
7569 id
= isl_map_identity(isl_space_map_from_set(dim
));
7570 return isl_map_intersect_range(id
, set
);
7573 /* Construct a basic set with all set dimensions having only non-negative
7576 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7577 __isl_take isl_space
*space
)
7582 struct isl_basic_set
*bset
;
7586 nparam
= space
->nparam
;
7588 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7591 for (i
= 0; i
< dim
; ++i
) {
7592 int k
= isl_basic_set_alloc_inequality(bset
);
7595 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7596 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7600 isl_basic_set_free(bset
);
7604 /* Construct the half-space x_pos >= 0.
7606 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7610 isl_basic_set
*nonneg
;
7612 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7613 k
= isl_basic_set_alloc_inequality(nonneg
);
7616 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7617 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7619 return isl_basic_set_finalize(nonneg
);
7621 isl_basic_set_free(nonneg
);
7625 /* Construct the half-space x_pos <= -1.
7627 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7632 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7633 k
= isl_basic_set_alloc_inequality(neg
);
7636 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7637 isl_int_set_si(neg
->ineq
[k
][0], -1);
7638 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7640 return isl_basic_set_finalize(neg
);
7642 isl_basic_set_free(neg
);
7646 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7647 enum isl_dim_type type
, unsigned first
, unsigned n
)
7651 isl_basic_set
*nonneg
;
7659 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7661 offset
= pos(set
->dim
, type
);
7662 for (i
= 0; i
< n
; ++i
) {
7663 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7664 offset
+ first
+ i
);
7665 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
7667 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7676 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7677 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7684 if (isl_set_plain_is_empty(set
)) {
7689 return fn(set
, signs
, user
);
7692 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7694 half
= isl_set_intersect(half
, isl_set_copy(set
));
7695 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7699 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7701 half
= isl_set_intersect(half
, set
);
7702 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7708 /* Call "fn" on the intersections of "set" with each of the orthants
7709 * (except for obviously empty intersections). The orthant is identified
7710 * by the signs array, with each entry having value 1 or -1 according
7711 * to the sign of the corresponding variable.
7713 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7714 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7724 if (isl_set_plain_is_empty(set
))
7727 nparam
= isl_set_dim(set
, isl_dim_param
);
7728 nvar
= isl_set_dim(set
, isl_dim_set
);
7730 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7732 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7740 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7742 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7745 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
7746 __isl_keep isl_basic_map
*bmap2
)
7749 struct isl_map
*map1
;
7750 struct isl_map
*map2
;
7752 if (!bmap1
|| !bmap2
)
7753 return isl_bool_error
;
7755 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7756 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7758 is_subset
= isl_map_is_subset(map1
, map2
);
7766 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7767 __isl_keep isl_basic_set
*bset2
)
7769 return isl_basic_map_is_subset(bset1
, bset2
);
7772 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
7773 __isl_keep isl_basic_map
*bmap2
)
7777 if (!bmap1
|| !bmap2
)
7778 return isl_bool_error
;
7779 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7780 if (is_subset
!= isl_bool_true
)
7782 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7786 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
7787 __isl_keep isl_basic_set
*bset2
)
7789 return isl_basic_map_is_equal(
7790 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7793 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
7799 return isl_bool_error
;
7800 for (i
= 0; i
< map
->n
; ++i
) {
7801 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7803 return isl_bool_error
;
7805 return isl_bool_false
;
7807 return isl_bool_true
;
7810 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7812 return map
? map
->n
== 0 : isl_bool_error
;
7815 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
7817 return set
? set
->n
== 0 : isl_bool_error
;
7820 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
7822 return isl_map_is_empty((struct isl_map
*)set
);
7825 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7830 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7833 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7838 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7841 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7846 return isl_bool_error
;
7847 is_subset
= isl_map_is_subset(map1
, map2
);
7848 if (is_subset
!= isl_bool_true
)
7850 is_subset
= isl_map_is_subset(map2
, map1
);
7854 /* Is "map1" equal to "map2"?
7856 * First check if they are obviously equal.
7857 * If not, then perform a more detailed analysis.
7859 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7863 equal
= isl_map_plain_is_equal(map1
, map2
);
7864 if (equal
< 0 || equal
)
7866 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7869 isl_bool
isl_basic_map_is_strict_subset(
7870 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7874 if (!bmap1
|| !bmap2
)
7875 return isl_bool_error
;
7876 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7877 if (is_subset
!= isl_bool_true
)
7879 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7880 if (is_subset
== isl_bool_error
)
7885 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
7886 __isl_keep isl_map
*map2
)
7891 return isl_bool_error
;
7892 is_subset
= isl_map_is_subset(map1
, map2
);
7893 if (is_subset
!= isl_bool_true
)
7895 is_subset
= isl_map_is_subset(map2
, map1
);
7896 if (is_subset
== isl_bool_error
)
7901 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
7902 __isl_keep isl_set
*set2
)
7904 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7907 /* Is "bmap" obviously equal to the universe with the same space?
7909 * That is, does it not have any constraints?
7911 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
7914 return isl_bool_error
;
7915 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7918 /* Is "bset" obviously equal to the universe with the same space?
7920 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
7922 return isl_basic_map_plain_is_universe(bset
);
7925 /* If "c" does not involve any existentially quantified variables,
7926 * then set *univ to false and abort
7928 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
7930 isl_bool
*univ
= user
;
7933 n
= isl_constraint_dim(c
, isl_dim_div
);
7934 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
7935 isl_constraint_free(c
);
7936 if (*univ
< 0 || !*univ
)
7937 return isl_stat_error
;
7941 /* Is "bmap" equal to the universe with the same space?
7943 * First check if it is obviously equal to the universe.
7944 * If not and if there are any constraints not involving
7945 * existentially quantified variables, then it is certainly
7946 * not equal to the universe.
7947 * Otherwise, check if the universe is a subset of "bmap".
7949 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
7952 isl_basic_map
*test
;
7954 univ
= isl_basic_map_plain_is_universe(bmap
);
7955 if (univ
< 0 || univ
)
7957 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
7958 return isl_bool_false
;
7959 univ
= isl_bool_true
;
7960 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
7962 return isl_bool_error
;
7963 if (univ
< 0 || !univ
)
7965 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
7966 univ
= isl_basic_map_is_subset(test
, bmap
);
7967 isl_basic_map_free(test
);
7971 /* Is "bset" equal to the universe with the same space?
7973 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
7975 return isl_basic_map_is_universe(bset
);
7978 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7983 return isl_bool_error
;
7985 for (i
= 0; i
< map
->n
; ++i
) {
7986 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
7991 return isl_bool_false
;
7994 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7996 return isl_map_plain_is_universe((isl_map
*) set
);
7999 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8001 struct isl_basic_set
*bset
= NULL
;
8002 struct isl_vec
*sample
= NULL
;
8003 isl_bool empty
, non_empty
;
8006 return isl_bool_error
;
8008 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8009 return isl_bool_true
;
8011 if (isl_basic_map_plain_is_universe(bmap
))
8012 return isl_bool_false
;
8014 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8015 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8016 copy
= isl_basic_map_remove_redundancies(copy
);
8017 empty
= isl_basic_map_plain_is_empty(copy
);
8018 isl_basic_map_free(copy
);
8022 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8024 return isl_bool_error
;
8026 return isl_bool_false
;
8027 isl_vec_free(bmap
->sample
);
8028 bmap
->sample
= NULL
;
8029 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8031 return isl_bool_error
;
8032 sample
= isl_basic_set_sample_vec(bset
);
8034 return isl_bool_error
;
8035 empty
= sample
->size
== 0;
8036 isl_vec_free(bmap
->sample
);
8037 bmap
->sample
= sample
;
8039 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8044 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8047 return isl_bool_error
;
8048 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8051 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8054 return isl_bool_error
;
8055 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8058 /* Is "bmap" known to be non-empty?
8060 * That is, is the cached sample still valid?
8062 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8067 return isl_bool_error
;
8069 return isl_bool_false
;
8070 total
= 1 + isl_basic_map_total_dim(bmap
);
8071 if (bmap
->sample
->size
!= total
)
8072 return isl_bool_false
;
8073 return isl_basic_map_contains(bmap
, bmap
->sample
);
8076 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8078 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
8081 struct isl_map
*isl_basic_map_union(
8082 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8084 struct isl_map
*map
;
8085 if (!bmap1
|| !bmap2
)
8088 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8090 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8093 map
= isl_map_add_basic_map(map
, bmap1
);
8094 map
= isl_map_add_basic_map(map
, bmap2
);
8097 isl_basic_map_free(bmap1
);
8098 isl_basic_map_free(bmap2
);
8102 struct isl_set
*isl_basic_set_union(
8103 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8105 return (struct isl_set
*)isl_basic_map_union(
8106 (struct isl_basic_map
*)bset1
,
8107 (struct isl_basic_map
*)bset2
);
8110 /* Order divs such that any div only depends on previous divs */
8111 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
8119 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8121 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8123 if (isl_int_is_zero(bmap
->div
[i
][0]))
8125 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8130 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8131 "integer division depends on itself",
8132 return isl_basic_map_free(bmap
));
8133 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8139 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8141 return (struct isl_basic_set
*)
8142 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
8145 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8152 for (i
= 0; i
< map
->n
; ++i
) {
8153 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8164 /* Apply the expansion computed by isl_merge_divs.
8165 * The expansion itself is given by "exp" while the resulting
8166 * list of divs is given by "div".
8168 * Move the integer divisions of "bmap" into the right position
8169 * according to "exp" and then introduce the additional integer
8170 * divisions, adding div constraints.
8171 * The moving should be done first to avoid moving coefficients
8172 * in the definitions of the extra integer divisions.
8174 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8175 __isl_take isl_basic_set
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8180 bmap
= isl_basic_map_cow(bmap
);
8184 if (div
->n_row
< bmap
->n_div
)
8185 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8186 "not an expansion", goto error
);
8188 n_div
= bmap
->n_div
;
8189 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8190 div
->n_row
- n_div
, 0,
8191 2 * (div
->n_row
- n_div
));
8193 for (i
= n_div
; i
< div
->n_row
; ++i
)
8194 if (isl_basic_map_alloc_div(bmap
) < 0)
8197 for (j
= n_div
- 1; j
>= 0; --j
) {
8200 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8203 for (i
= 0; i
< div
->n_row
; ++i
) {
8204 if (j
< n_div
&& exp
[j
] == i
) {
8207 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8208 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8210 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8218 isl_basic_map_free(bmap
);
8223 /* Apply the expansion computed by isl_merge_divs.
8224 * The expansion itself is given by "exp" while the resulting
8225 * list of divs is given by "div".
8227 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8228 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8230 return isl_basic_map_expand_divs(bset
, div
, exp
);
8233 /* Look for a div in dst that corresponds to the div "div" in src.
8234 * The divs before "div" in src and dst are assumed to be the same.
8236 * Returns -1 if no corresponding div was found and the position
8237 * of the corresponding div in dst otherwise.
8239 static int find_div(struct isl_basic_map
*dst
,
8240 struct isl_basic_map
*src
, unsigned div
)
8244 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8246 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8247 for (i
= div
; i
< dst
->n_div
; ++i
)
8248 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8249 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8250 dst
->n_div
- div
) == -1)
8255 /* Align the divs of "dst" to those of "src", adding divs from "src"
8256 * if needed. That is, make sure that the first src->n_div divs
8257 * of the result are equal to those of src.
8259 * The result is not finalized as by design it will have redundant
8260 * divs if any divs from "src" were copied.
8262 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8263 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8266 int known
, extended
;
8270 return isl_basic_map_free(dst
);
8272 if (src
->n_div
== 0)
8275 known
= isl_basic_map_divs_known(src
);
8277 return isl_basic_map_free(dst
);
8279 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8280 "some src divs are unknown",
8281 return isl_basic_map_free(dst
));
8283 src
= isl_basic_map_order_divs(src
);
8286 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8287 for (i
= 0; i
< src
->n_div
; ++i
) {
8288 int j
= find_div(dst
, src
, i
);
8291 int extra
= src
->n_div
- i
;
8292 dst
= isl_basic_map_cow(dst
);
8295 dst
= isl_basic_map_extend_space(dst
,
8296 isl_space_copy(dst
->dim
),
8297 extra
, 0, 2 * extra
);
8300 j
= isl_basic_map_alloc_div(dst
);
8302 return isl_basic_map_free(dst
);
8303 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8304 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8305 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8306 return isl_basic_map_free(dst
);
8309 isl_basic_map_swap_div(dst
, i
, j
);
8314 struct isl_basic_set
*isl_basic_set_align_divs(
8315 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8317 return (struct isl_basic_set
*)isl_basic_map_align_divs(
8318 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
8321 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8329 map
= isl_map_compute_divs(map
);
8330 map
= isl_map_cow(map
);
8334 for (i
= 1; i
< map
->n
; ++i
)
8335 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8336 for (i
= 1; i
< map
->n
; ++i
) {
8337 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8339 return isl_map_free(map
);
8342 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8346 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8348 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
8351 /* Align the divs of the basic maps in "map" to those
8352 * of the basic maps in "list", as well as to the other basic maps in "map".
8353 * The elements in "list" are assumed to have known divs.
8355 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8356 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8360 map
= isl_map_compute_divs(map
);
8361 map
= isl_map_cow(map
);
8363 return isl_map_free(map
);
8367 n
= isl_basic_map_list_n_basic_map(list
);
8368 for (i
= 0; i
< n
; ++i
) {
8369 isl_basic_map
*bmap
;
8371 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8372 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8373 isl_basic_map_free(bmap
);
8376 return isl_map_free(map
);
8378 return isl_map_align_divs(map
);
8381 /* Align the divs of each element of "list" to those of "bmap".
8382 * Both "bmap" and the elements of "list" are assumed to have known divs.
8384 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8385 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8390 return isl_basic_map_list_free(list
);
8392 n
= isl_basic_map_list_n_basic_map(list
);
8393 for (i
= 0; i
< n
; ++i
) {
8394 isl_basic_map
*bmap_i
;
8396 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8397 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8398 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8404 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8405 __isl_take isl_map
*map
)
8409 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8410 map
= isl_map_intersect_domain(map
, set
);
8411 set
= isl_map_range(map
);
8419 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8420 __isl_take isl_map
*map
)
8422 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8425 /* There is no need to cow as removing empty parts doesn't change
8426 * the meaning of the set.
8428 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8435 for (i
= map
->n
- 1; i
>= 0; --i
)
8436 remove_if_empty(map
, i
);
8441 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8443 return (struct isl_set
*)
8444 isl_map_remove_empty_parts((struct isl_map
*)set
);
8447 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8449 struct isl_basic_map
*bmap
;
8450 if (!map
|| map
->n
== 0)
8452 bmap
= map
->p
[map
->n
-1];
8453 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8454 return isl_basic_map_copy(bmap
);
8457 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8459 return (struct isl_basic_set
*)
8460 isl_map_copy_basic_map((struct isl_map
*)set
);
8463 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8464 __isl_keep isl_basic_map
*bmap
)
8470 for (i
= map
->n
-1; i
>= 0; --i
) {
8471 if (map
->p
[i
] != bmap
)
8473 map
= isl_map_cow(map
);
8476 isl_basic_map_free(map
->p
[i
]);
8477 if (i
!= map
->n
-1) {
8478 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8479 map
->p
[i
] = map
->p
[map
->n
-1];
8490 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8491 struct isl_basic_set
*bset
)
8493 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8494 (struct isl_basic_map
*)bset
);
8497 /* Given two basic sets bset1 and bset2, compute the maximal difference
8498 * between the values of dimension pos in bset1 and those in bset2
8499 * for any common value of the parameters and dimensions preceding pos.
8501 static enum isl_lp_result
basic_set_maximal_difference_at(
8502 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8503 int pos
, isl_int
*opt
)
8506 struct isl_basic_map
*bmap1
= NULL
;
8507 struct isl_basic_map
*bmap2
= NULL
;
8508 struct isl_ctx
*ctx
;
8509 struct isl_vec
*obj
;
8512 unsigned dim1
, dim2
;
8513 enum isl_lp_result res
;
8515 if (!bset1
|| !bset2
)
8516 return isl_lp_error
;
8518 nparam
= isl_basic_set_n_param(bset1
);
8519 dim1
= isl_basic_set_n_dim(bset1
);
8520 dim2
= isl_basic_set_n_dim(bset2
);
8521 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8522 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8523 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8524 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8525 if (!bmap1
|| !bmap2
)
8527 bmap1
= isl_basic_map_cow(bmap1
);
8528 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8529 pos
, (dim1
- pos
) + (dim2
- pos
),
8530 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8531 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8534 total
= isl_basic_map_total_dim(bmap1
);
8536 obj
= isl_vec_alloc(ctx
, 1 + total
);
8539 isl_seq_clr(obj
->block
.data
, 1 + total
);
8540 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8541 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8542 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8544 isl_basic_map_free(bmap1
);
8548 isl_basic_map_free(bmap2
);
8550 isl_basic_map_free(bmap1
);
8551 return isl_lp_error
;
8554 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8555 * for any common value of the parameters and dimensions preceding pos
8556 * in both basic sets, the values of dimension pos in bset1 are
8557 * smaller or larger than those in bset2.
8560 * 1 if bset1 follows bset2
8561 * -1 if bset1 precedes bset2
8562 * 0 if bset1 and bset2 are incomparable
8563 * -2 if some error occurred.
8565 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8566 struct isl_basic_set
*bset2
, int pos
)
8569 enum isl_lp_result res
;
8574 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8576 if (res
== isl_lp_empty
)
8578 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8579 res
== isl_lp_unbounded
)
8581 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8590 /* Given two basic sets bset1 and bset2, check whether
8591 * for any common value of the parameters and dimensions preceding pos
8592 * there is a value of dimension pos in bset1 that is larger
8593 * than a value of the same dimension in bset2.
8596 * 1 if there exists such a pair
8597 * 0 if there is no such pair, but there is a pair of equal values
8599 * -2 if some error occurred.
8601 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8602 __isl_keep isl_basic_set
*bset2
, int pos
)
8605 enum isl_lp_result res
;
8610 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8612 if (res
== isl_lp_empty
)
8614 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8615 res
== isl_lp_unbounded
)
8617 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8619 else if (res
== isl_lp_ok
)
8628 /* Given two sets set1 and set2, check whether
8629 * for any common value of the parameters and dimensions preceding pos
8630 * there is a value of dimension pos in set1 that is larger
8631 * than a value of the same dimension in set2.
8634 * 1 if there exists such a pair
8635 * 0 if there is no such pair, but there is a pair of equal values
8637 * -2 if some error occurred.
8639 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8640 __isl_keep isl_set
*set2
, int pos
)
8648 for (i
= 0; i
< set1
->n
; ++i
)
8649 for (j
= 0; j
< set2
->n
; ++j
) {
8651 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8652 if (f
== 1 || f
== -2)
8661 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8662 unsigned pos
, isl_int
*val
)
8670 total
= isl_basic_map_total_dim(bmap
);
8671 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8672 for (; d
+1 > pos
; --d
)
8673 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8677 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8679 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8681 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8684 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8690 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8691 unsigned pos
, isl_int
*val
)
8703 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8706 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8707 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8708 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8709 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8713 isl_int_set(*val
, v
);
8719 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8720 unsigned pos
, isl_int
*val
)
8722 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8726 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8729 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8732 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8733 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8735 if (pos
>= isl_basic_map_dim(bmap
, type
))
8737 return isl_basic_map_plain_has_fixed_var(bmap
,
8738 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8741 /* If "bmap" obviously lies on a hyperplane where the given dimension
8742 * has a fixed value, then return that value.
8743 * Otherwise return NaN.
8745 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8746 __isl_keep isl_basic_map
*bmap
,
8747 enum isl_dim_type type
, unsigned pos
)
8755 ctx
= isl_basic_map_get_ctx(bmap
);
8756 v
= isl_val_alloc(ctx
);
8759 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8761 return isl_val_free(v
);
8763 isl_int_set_si(v
->d
, 1);
8767 return isl_val_nan(ctx
);
8770 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8771 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8773 if (pos
>= isl_map_dim(map
, type
))
8775 return isl_map_plain_has_fixed_var(map
,
8776 map_offset(map
, type
) - 1 + pos
, val
);
8779 /* If "map" obviously lies on a hyperplane where the given dimension
8780 * has a fixed value, then return that value.
8781 * Otherwise return NaN.
8783 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8784 enum isl_dim_type type
, unsigned pos
)
8792 ctx
= isl_map_get_ctx(map
);
8793 v
= isl_val_alloc(ctx
);
8796 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8798 return isl_val_free(v
);
8800 isl_int_set_si(v
->d
, 1);
8804 return isl_val_nan(ctx
);
8807 /* If "set" obviously lies on a hyperplane where the given dimension
8808 * has a fixed value, then return that value.
8809 * Otherwise return NaN.
8811 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8812 enum isl_dim_type type
, unsigned pos
)
8814 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8817 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8818 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8820 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8823 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8824 * then return this fixed value in *val.
8826 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8827 unsigned dim
, isl_int
*val
)
8829 return isl_basic_set_plain_has_fixed_var(bset
,
8830 isl_basic_set_n_param(bset
) + dim
, val
);
8833 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8834 * then return this fixed value in *val.
8836 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8837 unsigned dim
, isl_int
*val
)
8839 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8842 /* Check if input variable in has fixed value and if so and if val is not NULL,
8843 * then return this fixed value in *val.
8845 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8846 unsigned in
, isl_int
*val
)
8848 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8851 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8852 * and if val is not NULL, then return this lower bound in *val.
8854 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8855 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8857 int i
, i_eq
= -1, i_ineq
= -1;
8864 total
= isl_basic_set_total_dim(bset
);
8865 nparam
= isl_basic_set_n_param(bset
);
8866 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8867 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8873 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8874 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8876 if (i_eq
!= -1 || i_ineq
!= -1)
8880 if (i_eq
== -1 && i_ineq
== -1)
8882 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8883 /* The coefficient should always be one due to normalization. */
8884 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8886 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8888 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8889 total
- nparam
- dim
- 1) != -1)
8892 isl_int_neg(*val
, c
[0]);
8896 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8897 unsigned dim
, isl_int
*val
)
8909 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8913 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8915 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8916 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8918 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8922 isl_int_set(*val
, v
);
8928 /* Return -1 if the constraint "c1" should be sorted before "c2"
8929 * and 1 if it should be sorted after "c2".
8930 * Return 0 if the two constraints are the same (up to the constant term).
8932 * In particular, if a constraint involves later variables than another
8933 * then it is sorted after this other constraint.
8934 * uset_gist depends on constraints without existentially quantified
8935 * variables sorting first.
8937 * For constraints that have the same latest variable, those
8938 * with the same coefficient for this latest variable (first in absolute value
8939 * and then in actual value) are grouped together.
8940 * This is useful for detecting pairs of constraints that can
8941 * be chained in their printed representation.
8943 * Finally, within a group, constraints are sorted according to
8944 * their coefficients (excluding the constant term).
8946 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
8948 isl_int
**c1
= (isl_int
**) p1
;
8949 isl_int
**c2
= (isl_int
**) p2
;
8951 unsigned size
= *(unsigned *) arg
;
8954 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
8955 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
8960 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
8963 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
8967 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
8970 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
8971 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
8972 * and 0 if the two constraints are the same (up to the constant term).
8974 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
8975 isl_int
*c1
, isl_int
*c2
)
8981 total
= isl_basic_map_total_dim(bmap
);
8982 return sort_constraint_cmp(&c1
, &c2
, &total
);
8985 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
8986 __isl_take isl_basic_map
*bmap
)
8992 if (bmap
->n_ineq
== 0)
8994 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8996 total
= isl_basic_map_total_dim(bmap
);
8997 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
8998 &sort_constraint_cmp
, &total
) < 0)
8999 return isl_basic_map_free(bmap
);
9003 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9004 __isl_take isl_basic_set
*bset
)
9006 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
9007 (struct isl_basic_map
*)bset
);
9010 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
9014 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9016 bmap
= isl_basic_map_remove_redundancies(bmap
);
9017 bmap
= isl_basic_map_sort_constraints(bmap
);
9019 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9023 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
9025 return (struct isl_basic_set
*)isl_basic_map_normalize(
9026 (struct isl_basic_map
*)bset
);
9029 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
9030 const __isl_keep isl_basic_map
*bmap2
)
9035 if (!bmap1
|| !bmap2
)
9040 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9041 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9042 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9043 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
9044 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
9045 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
9046 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9047 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
9048 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9049 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9050 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9052 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9054 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9056 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9057 return bmap1
->n_eq
- bmap2
->n_eq
;
9058 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9059 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9060 if (bmap1
->n_div
!= bmap2
->n_div
)
9061 return bmap1
->n_div
- bmap2
->n_div
;
9062 total
= isl_basic_map_total_dim(bmap1
);
9063 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9064 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9068 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9069 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9073 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9074 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9081 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
9082 const __isl_keep isl_basic_set
*bset2
)
9084 return isl_basic_map_plain_cmp(bset1
, bset2
);
9087 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9093 if (set1
->n
!= set2
->n
)
9094 return set1
->n
- set2
->n
;
9096 for (i
= 0; i
< set1
->n
; ++i
) {
9097 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9105 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9106 __isl_keep isl_basic_map
*bmap2
)
9108 if (!bmap1
|| !bmap2
)
9109 return isl_bool_error
;
9110 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9113 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9114 __isl_keep isl_basic_set
*bset2
)
9116 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
9117 (isl_basic_map
*)bset2
);
9120 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9122 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
9123 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
9125 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9128 /* Sort the basic maps of "map" and remove duplicate basic maps.
9130 * While removing basic maps, we make sure that the basic maps remain
9131 * sorted because isl_map_normalize expects the basic maps of the result
9134 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9138 map
= isl_map_remove_empty_parts(map
);
9141 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9142 for (i
= map
->n
- 1; i
>= 1; --i
) {
9143 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9145 isl_basic_map_free(map
->p
[i
-1]);
9146 for (j
= i
; j
< map
->n
; ++j
)
9147 map
->p
[j
- 1] = map
->p
[j
];
9154 /* Remove obvious duplicates among the basic maps of "map".
9156 * Unlike isl_map_normalize, this function does not remove redundant
9157 * constraints and only removes duplicates that have exactly the same
9158 * constraints in the input. It does sort the constraints and
9159 * the basic maps to ease the detection of duplicates.
9161 * If "map" has already been normalized or if the basic maps are
9162 * disjoint, then there can be no duplicates.
9164 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9167 isl_basic_map
*bmap
;
9173 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9175 for (i
= 0; i
< map
->n
; ++i
) {
9176 bmap
= isl_basic_map_copy(map
->p
[i
]);
9177 bmap
= isl_basic_map_sort_constraints(bmap
);
9179 return isl_map_free(map
);
9180 isl_basic_map_free(map
->p
[i
]);
9184 map
= sort_and_remove_duplicates(map
);
9188 /* We normalize in place, but if anything goes wrong we need
9189 * to return NULL, so we need to make sure we don't change the
9190 * meaning of any possible other copies of map.
9192 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9195 struct isl_basic_map
*bmap
;
9199 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9201 for (i
= 0; i
< map
->n
; ++i
) {
9202 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9205 isl_basic_map_free(map
->p
[i
]);
9209 map
= sort_and_remove_duplicates(map
);
9211 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9218 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9220 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
9223 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9224 __isl_keep isl_map
*map2
)
9230 return isl_bool_error
;
9233 return isl_bool_true
;
9234 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9235 return isl_bool_false
;
9237 map1
= isl_map_copy(map1
);
9238 map2
= isl_map_copy(map2
);
9239 map1
= isl_map_normalize(map1
);
9240 map2
= isl_map_normalize(map2
);
9243 equal
= map1
->n
== map2
->n
;
9244 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9245 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9255 return isl_bool_error
;
9258 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9259 __isl_keep isl_set
*set2
)
9261 return isl_map_plain_is_equal((struct isl_map
*)set1
,
9262 (struct isl_map
*)set2
);
9265 /* Return an interval that ranges from min to max (inclusive)
9267 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
9268 isl_int min
, isl_int max
)
9271 struct isl_basic_set
*bset
= NULL
;
9273 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
9277 k
= isl_basic_set_alloc_inequality(bset
);
9280 isl_int_set_si(bset
->ineq
[k
][1], 1);
9281 isl_int_neg(bset
->ineq
[k
][0], min
);
9283 k
= isl_basic_set_alloc_inequality(bset
);
9286 isl_int_set_si(bset
->ineq
[k
][1], -1);
9287 isl_int_set(bset
->ineq
[k
][0], max
);
9291 isl_basic_set_free(bset
);
9295 /* Return the basic maps in "map" as a list.
9297 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9298 __isl_keep isl_map
*map
)
9302 isl_basic_map_list
*list
;
9306 ctx
= isl_map_get_ctx(map
);
9307 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9309 for (i
= 0; i
< map
->n
; ++i
) {
9310 isl_basic_map
*bmap
;
9312 bmap
= isl_basic_map_copy(map
->p
[i
]);
9313 list
= isl_basic_map_list_add(list
, bmap
);
9319 /* Return the intersection of the elements in the non-empty list "list".
9320 * All elements are assumed to live in the same space.
9322 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9323 __isl_take isl_basic_map_list
*list
)
9326 isl_basic_map
*bmap
;
9330 n
= isl_basic_map_list_n_basic_map(list
);
9332 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9333 "expecting non-empty list", goto error
);
9335 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9336 for (i
= 1; i
< n
; ++i
) {
9337 isl_basic_map
*bmap_i
;
9339 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9340 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9343 isl_basic_map_list_free(list
);
9346 isl_basic_map_list_free(list
);
9350 /* Return the intersection of the elements in the non-empty list "list".
9351 * All elements are assumed to live in the same space.
9353 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9354 __isl_take isl_basic_set_list
*list
)
9356 return isl_basic_map_list_intersect(list
);
9359 /* Return the union of the elements in the non-empty list "list".
9360 * All elements are assumed to live in the same space.
9362 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9369 n
= isl_set_list_n_set(list
);
9371 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9372 "expecting non-empty list", goto error
);
9374 set
= isl_set_list_get_set(list
, 0);
9375 for (i
= 1; i
< n
; ++i
) {
9378 set_i
= isl_set_list_get_set(list
, i
);
9379 set
= isl_set_union(set
, set_i
);
9382 isl_set_list_free(list
);
9385 isl_set_list_free(list
);
9389 /* Return the Cartesian product of the basic sets in list (in the given order).
9391 __isl_give isl_basic_set
*isl_basic_set_list_product(
9392 __isl_take
struct isl_basic_set_list
*list
)
9400 struct isl_basic_set
*product
= NULL
;
9404 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
9405 isl_assert(list
->ctx
, list
->p
[0], goto error
);
9406 nparam
= isl_basic_set_n_param(list
->p
[0]);
9407 dim
= isl_basic_set_n_dim(list
->p
[0]);
9408 extra
= list
->p
[0]->n_div
;
9409 n_eq
= list
->p
[0]->n_eq
;
9410 n_ineq
= list
->p
[0]->n_ineq
;
9411 for (i
= 1; i
< list
->n
; ++i
) {
9412 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9413 isl_assert(list
->ctx
,
9414 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9415 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9416 extra
+= list
->p
[i
]->n_div
;
9417 n_eq
+= list
->p
[i
]->n_eq
;
9418 n_ineq
+= list
->p
[i
]->n_ineq
;
9420 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9425 for (i
= 0; i
< list
->n
; ++i
) {
9426 isl_basic_set_add_constraints(product
,
9427 isl_basic_set_copy(list
->p
[i
]), dim
);
9428 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9430 isl_basic_set_list_free(list
);
9433 isl_basic_set_free(product
);
9434 isl_basic_set_list_free(list
);
9438 struct isl_basic_map
*isl_basic_map_product(
9439 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9441 isl_space
*dim_result
= NULL
;
9442 struct isl_basic_map
*bmap
;
9443 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9444 struct isl_dim_map
*dim_map1
, *dim_map2
;
9446 if (!bmap1
|| !bmap2
)
9449 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9450 bmap2
->dim
, isl_dim_param
), goto error
);
9451 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9452 isl_space_copy(bmap2
->dim
));
9454 in1
= isl_basic_map_n_in(bmap1
);
9455 in2
= isl_basic_map_n_in(bmap2
);
9456 out1
= isl_basic_map_n_out(bmap1
);
9457 out2
= isl_basic_map_n_out(bmap2
);
9458 nparam
= isl_basic_map_n_param(bmap1
);
9460 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9461 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9462 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9463 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9464 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9465 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9466 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9467 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9468 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9469 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9470 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9472 bmap
= isl_basic_map_alloc_space(dim_result
,
9473 bmap1
->n_div
+ bmap2
->n_div
,
9474 bmap1
->n_eq
+ bmap2
->n_eq
,
9475 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9476 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9477 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9478 bmap
= isl_basic_map_simplify(bmap
);
9479 return isl_basic_map_finalize(bmap
);
9481 isl_basic_map_free(bmap1
);
9482 isl_basic_map_free(bmap2
);
9486 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9487 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9489 isl_basic_map
*prod
;
9491 prod
= isl_basic_map_product(bmap1
, bmap2
);
9492 prod
= isl_basic_map_flatten(prod
);
9496 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9497 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9499 return isl_basic_map_flat_range_product(bset1
, bset2
);
9502 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9503 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9505 isl_space
*space_result
= NULL
;
9506 isl_basic_map
*bmap
;
9507 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9508 struct isl_dim_map
*dim_map1
, *dim_map2
;
9510 if (!bmap1
|| !bmap2
)
9513 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9514 isl_space_copy(bmap2
->dim
));
9516 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9517 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9518 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9519 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9521 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9522 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9523 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9524 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9525 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9526 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9527 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9528 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9529 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9530 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9531 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9533 bmap
= isl_basic_map_alloc_space(space_result
,
9534 bmap1
->n_div
+ bmap2
->n_div
,
9535 bmap1
->n_eq
+ bmap2
->n_eq
,
9536 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9537 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9538 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9539 bmap
= isl_basic_map_simplify(bmap
);
9540 return isl_basic_map_finalize(bmap
);
9542 isl_basic_map_free(bmap1
);
9543 isl_basic_map_free(bmap2
);
9547 __isl_give isl_basic_map
*isl_basic_map_range_product(
9548 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9550 isl_space
*dim_result
= NULL
;
9551 isl_basic_map
*bmap
;
9552 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9553 struct isl_dim_map
*dim_map1
, *dim_map2
;
9555 if (!bmap1
|| !bmap2
)
9558 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9559 bmap2
->dim
, isl_dim_param
))
9560 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9561 "parameters don't match", goto error
);
9563 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9564 isl_space_copy(bmap2
->dim
));
9566 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9567 out1
= isl_basic_map_n_out(bmap1
);
9568 out2
= isl_basic_map_n_out(bmap2
);
9569 nparam
= isl_basic_map_n_param(bmap1
);
9571 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9572 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9573 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9574 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9575 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9576 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9577 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9578 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9579 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9580 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9581 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9583 bmap
= isl_basic_map_alloc_space(dim_result
,
9584 bmap1
->n_div
+ bmap2
->n_div
,
9585 bmap1
->n_eq
+ bmap2
->n_eq
,
9586 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9587 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9588 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9589 bmap
= isl_basic_map_simplify(bmap
);
9590 return isl_basic_map_finalize(bmap
);
9592 isl_basic_map_free(bmap1
);
9593 isl_basic_map_free(bmap2
);
9597 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9598 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9600 isl_basic_map
*prod
;
9602 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9603 prod
= isl_basic_map_flatten_range(prod
);
9607 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9608 * and collect the results.
9609 * The result live in the space obtained by calling "space_product"
9610 * on the spaces of "map1" and "map2".
9611 * If "remove_duplicates" is set then the result may contain duplicates
9612 * (even if the inputs do not) and so we try and remove the obvious
9615 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9616 __isl_take isl_map
*map2
,
9617 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
9618 __isl_take isl_space
*right
),
9619 __isl_give isl_basic_map
*(*basic_map_product
)(
9620 __isl_take isl_basic_map
*left
,
9621 __isl_take isl_basic_map
*right
),
9622 int remove_duplicates
)
9625 struct isl_map
*result
;
9631 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9632 map2
->dim
, isl_dim_param
), goto error
);
9634 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9635 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9636 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9638 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
9639 isl_space_copy(map2
->dim
)),
9640 map1
->n
* map2
->n
, flags
);
9643 for (i
= 0; i
< map1
->n
; ++i
)
9644 for (j
= 0; j
< map2
->n
; ++j
) {
9645 struct isl_basic_map
*part
;
9646 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9647 isl_basic_map_copy(map2
->p
[j
]));
9648 if (isl_basic_map_is_empty(part
))
9649 isl_basic_map_free(part
);
9651 result
= isl_map_add_basic_map(result
, part
);
9655 if (remove_duplicates
)
9656 result
= isl_map_remove_obvious_duplicates(result
);
9666 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9668 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9669 __isl_take isl_map
*map2
)
9671 return map_product(map1
, map2
, &isl_space_product
,
9672 &isl_basic_map_product
, 0);
9675 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9676 __isl_take isl_map
*map2
)
9678 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9681 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9683 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9684 __isl_take isl_map
*map2
)
9688 prod
= isl_map_product(map1
, map2
);
9689 prod
= isl_map_flatten(prod
);
9693 /* Given two set A and B, construct its Cartesian product A x B.
9695 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9697 return isl_map_range_product(set1
, set2
);
9700 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9701 __isl_take isl_set
*set2
)
9703 return isl_map_flat_range_product(set1
, set2
);
9706 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9708 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9709 __isl_take isl_map
*map2
)
9711 return map_product(map1
, map2
, &isl_space_domain_product
,
9712 &isl_basic_map_domain_product
, 1);
9715 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9717 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9718 __isl_take isl_map
*map2
)
9720 return map_product(map1
, map2
, &isl_space_range_product
,
9721 &isl_basic_map_range_product
, 1);
9724 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9725 __isl_take isl_map
*map2
)
9727 return isl_map_align_params_map_map_and(map1
, map2
,
9728 &map_domain_product_aligned
);
9731 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9732 __isl_take isl_map
*map2
)
9734 return isl_map_align_params_map_map_and(map1
, map2
,
9735 &map_range_product_aligned
);
9738 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
9740 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
9743 int total1
, keep1
, total2
, keep2
;
9747 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9748 !isl_space_range_is_wrapping(map
->dim
))
9749 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9750 "not a product", return isl_map_free(map
));
9752 space
= isl_map_get_space(map
);
9753 total1
= isl_space_dim(space
, isl_dim_in
);
9754 total2
= isl_space_dim(space
, isl_dim_out
);
9755 space
= isl_space_factor_domain(space
);
9756 keep1
= isl_space_dim(space
, isl_dim_in
);
9757 keep2
= isl_space_dim(space
, isl_dim_out
);
9758 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
9759 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
9760 map
= isl_map_reset_space(map
, space
);
9765 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
9767 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
9770 int total1
, keep1
, total2
, keep2
;
9774 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9775 !isl_space_range_is_wrapping(map
->dim
))
9776 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9777 "not a product", return isl_map_free(map
));
9779 space
= isl_map_get_space(map
);
9780 total1
= isl_space_dim(space
, isl_dim_in
);
9781 total2
= isl_space_dim(space
, isl_dim_out
);
9782 space
= isl_space_factor_range(space
);
9783 keep1
= isl_space_dim(space
, isl_dim_in
);
9784 keep2
= isl_space_dim(space
, isl_dim_out
);
9785 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
9786 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
9787 map
= isl_map_reset_space(map
, space
);
9792 /* Given a map of the form [A -> B] -> C, return the map A -> C.
9794 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
9801 if (!isl_space_domain_is_wrapping(map
->dim
))
9802 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9803 "domain is not a product", return isl_map_free(map
));
9805 space
= isl_map_get_space(map
);
9806 total
= isl_space_dim(space
, isl_dim_in
);
9807 space
= isl_space_domain_factor_domain(space
);
9808 keep
= isl_space_dim(space
, isl_dim_in
);
9809 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
9810 map
= isl_map_reset_space(map
, space
);
9815 /* Given a map of the form [A -> B] -> C, return the map B -> C.
9817 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
9824 if (!isl_space_domain_is_wrapping(map
->dim
))
9825 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9826 "domain is not a product", return isl_map_free(map
));
9828 space
= isl_map_get_space(map
);
9829 total
= isl_space_dim(space
, isl_dim_in
);
9830 space
= isl_space_domain_factor_range(space
);
9831 keep
= isl_space_dim(space
, isl_dim_in
);
9832 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
9833 map
= isl_map_reset_space(map
, space
);
9838 /* Given a map A -> [B -> C], extract the map A -> B.
9840 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
9847 if (!isl_space_range_is_wrapping(map
->dim
))
9848 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9849 "range is not a product", return isl_map_free(map
));
9851 space
= isl_map_get_space(map
);
9852 total
= isl_space_dim(space
, isl_dim_out
);
9853 space
= isl_space_range_factor_domain(space
);
9854 keep
= isl_space_dim(space
, isl_dim_out
);
9855 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
9856 map
= isl_map_reset_space(map
, space
);
9861 /* Given a map A -> [B -> C], extract the map A -> C.
9863 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
9870 if (!isl_space_range_is_wrapping(map
->dim
))
9871 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9872 "range is not a product", return isl_map_free(map
));
9874 space
= isl_map_get_space(map
);
9875 total
= isl_space_dim(space
, isl_dim_out
);
9876 space
= isl_space_range_factor_range(space
);
9877 keep
= isl_space_dim(space
, isl_dim_out
);
9878 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
9879 map
= isl_map_reset_space(map
, space
);
9884 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9886 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9887 __isl_take isl_map
*map2
)
9891 prod
= isl_map_domain_product(map1
, map2
);
9892 prod
= isl_map_flatten_domain(prod
);
9896 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9898 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9899 __isl_take isl_map
*map2
)
9903 prod
= isl_map_range_product(map1
, map2
);
9904 prod
= isl_map_flatten_range(prod
);
9908 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9911 uint32_t hash
= isl_hash_init();
9916 bmap
= isl_basic_map_copy(bmap
);
9917 bmap
= isl_basic_map_normalize(bmap
);
9920 total
= isl_basic_map_total_dim(bmap
);
9921 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9922 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9924 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9925 isl_hash_hash(hash
, c_hash
);
9927 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9928 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9930 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9931 isl_hash_hash(hash
, c_hash
);
9933 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9934 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9936 if (isl_int_is_zero(bmap
->div
[i
][0]))
9938 isl_hash_byte(hash
, i
& 0xFF);
9939 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9940 isl_hash_hash(hash
, c_hash
);
9942 isl_basic_map_free(bmap
);
9946 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9948 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9951 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9958 map
= isl_map_copy(map
);
9959 map
= isl_map_normalize(map
);
9963 hash
= isl_hash_init();
9964 for (i
= 0; i
< map
->n
; ++i
) {
9966 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9967 isl_hash_hash(hash
, bmap_hash
);
9975 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9977 return isl_map_get_hash((isl_map
*)set
);
9980 /* Check if the value for dimension dim is completely determined
9981 * by the values of the other parameters and variables.
9982 * That is, check if dimension dim is involved in an equality.
9984 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9991 nparam
= isl_basic_set_n_param(bset
);
9992 for (i
= 0; i
< bset
->n_eq
; ++i
)
9993 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9998 /* Check if the value for dimension dim is completely determined
9999 * by the values of the other parameters and variables.
10000 * That is, check if dimension dim is involved in an equality
10001 * for each of the subsets.
10003 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
10009 for (i
= 0; i
< set
->n
; ++i
) {
10011 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
10018 /* Return the number of basic maps in the (current) representation of "map".
10020 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10022 return map
? map
->n
: 0;
10025 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10027 return set
? set
->n
: 0;
10030 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10031 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10036 return isl_stat_error
;
10038 for (i
= 0; i
< map
->n
; ++i
)
10039 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10040 return isl_stat_error
;
10042 return isl_stat_ok
;
10045 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10046 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10051 return isl_stat_error
;
10053 for (i
= 0; i
< set
->n
; ++i
)
10054 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10055 return isl_stat_error
;
10057 return isl_stat_ok
;
10060 /* Return a list of basic sets, the union of which is equal to "set".
10062 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10063 __isl_keep isl_set
*set
)
10066 isl_basic_set_list
*list
;
10071 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10072 for (i
= 0; i
< set
->n
; ++i
) {
10073 isl_basic_set
*bset
;
10075 bset
= isl_basic_set_copy(set
->p
[i
]);
10076 list
= isl_basic_set_list_add(list
, bset
);
10082 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10089 bset
= isl_basic_set_cow(bset
);
10093 dim
= isl_basic_set_get_space(bset
);
10094 dim
= isl_space_lift(dim
, bset
->n_div
);
10097 isl_space_free(bset
->dim
);
10099 bset
->extra
-= bset
->n_div
;
10102 bset
= isl_basic_set_finalize(bset
);
10106 isl_basic_set_free(bset
);
10110 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10116 set
= isl_set_align_divs(set
);
10121 set
= isl_set_cow(set
);
10125 n_div
= set
->p
[0]->n_div
;
10126 dim
= isl_set_get_space(set
);
10127 dim
= isl_space_lift(dim
, n_div
);
10130 isl_space_free(set
->dim
);
10133 for (i
= 0; i
< set
->n
; ++i
) {
10134 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10145 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
10148 struct isl_basic_map
*bmap
;
10155 set
= isl_set_align_divs(set
);
10160 dim
= isl_set_get_space(set
);
10161 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
10163 return isl_map_identity(isl_space_map_from_set(dim
));
10166 n_div
= set
->p
[0]->n_div
;
10167 dim
= isl_space_map_from_set(dim
);
10168 n_param
= isl_space_dim(dim
, isl_dim_param
);
10169 n_set
= isl_space_dim(dim
, isl_dim_in
);
10170 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
10171 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
10172 for (i
= 0; i
< n_set
; ++i
)
10173 bmap
= var_equal(bmap
, i
);
10175 total
= n_param
+ n_set
+ n_set
+ n_div
;
10176 for (i
= 0; i
< n_div
; ++i
) {
10177 k
= isl_basic_map_alloc_inequality(bmap
);
10180 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
10181 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
10182 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
10183 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
10184 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
10185 set
->p
[0]->div
[i
][0]);
10187 l
= isl_basic_map_alloc_inequality(bmap
);
10190 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
10191 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
10192 set
->p
[0]->div
[i
][0]);
10193 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
10197 bmap
= isl_basic_map_simplify(bmap
);
10198 bmap
= isl_basic_map_finalize(bmap
);
10199 return isl_map_from_basic_map(bmap
);
10202 isl_basic_map_free(bmap
);
10206 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10214 dim
= isl_basic_set_total_dim(bset
);
10215 size
+= bset
->n_eq
* (1 + dim
);
10216 size
+= bset
->n_ineq
* (1 + dim
);
10217 size
+= bset
->n_div
* (2 + dim
);
10222 int isl_set_size(__isl_keep isl_set
*set
)
10230 for (i
= 0; i
< set
->n
; ++i
)
10231 size
+= isl_basic_set_size(set
->p
[i
]);
10236 /* Check if there is any lower bound (if lower == 0) and/or upper
10237 * bound (if upper == 0) on the specified dim.
10239 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10240 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10245 return isl_bool_error
;
10247 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
),
10248 return isl_bool_error
);
10250 pos
+= isl_basic_map_offset(bmap
, type
);
10252 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10253 if (isl_int_is_zero(bmap
->div
[i
][0]))
10255 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10256 return isl_bool_true
;
10259 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10260 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10261 return isl_bool_true
;
10263 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10264 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10271 return lower
&& upper
;
10274 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10275 enum isl_dim_type type
, unsigned pos
)
10277 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10280 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10281 enum isl_dim_type type
, unsigned pos
)
10283 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10286 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10287 enum isl_dim_type type
, unsigned pos
)
10289 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10292 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10293 enum isl_dim_type type
, unsigned pos
)
10300 for (i
= 0; i
< map
->n
; ++i
) {
10302 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10303 if (bounded
< 0 || !bounded
)
10310 /* Return 1 if the specified dim is involved in both an upper bound
10311 * and a lower bound.
10313 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10314 enum isl_dim_type type
, unsigned pos
)
10316 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
10319 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10321 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10322 enum isl_dim_type type
, unsigned pos
,
10323 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10324 enum isl_dim_type type
, unsigned pos
))
10329 return isl_bool_error
;
10331 for (i
= 0; i
< map
->n
; ++i
) {
10333 bounded
= fn(map
->p
[i
], type
, pos
);
10334 if (bounded
< 0 || bounded
)
10338 return isl_bool_false
;
10341 /* Return 1 if the specified dim is involved in any lower bound.
10343 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10344 enum isl_dim_type type
, unsigned pos
)
10346 return has_any_bound(set
, type
, pos
,
10347 &isl_basic_map_dim_has_lower_bound
);
10350 /* Return 1 if the specified dim is involved in any upper bound.
10352 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10353 enum isl_dim_type type
, unsigned pos
)
10355 return has_any_bound(set
, type
, pos
,
10356 &isl_basic_map_dim_has_upper_bound
);
10359 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10361 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10362 enum isl_dim_type type
, unsigned pos
,
10363 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10364 enum isl_dim_type type
, unsigned pos
))
10369 return isl_bool_error
;
10371 for (i
= 0; i
< map
->n
; ++i
) {
10373 bounded
= fn(map
->p
[i
], type
, pos
);
10374 if (bounded
< 0 || !bounded
)
10378 return isl_bool_true
;
10381 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10383 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10384 enum isl_dim_type type
, unsigned pos
)
10386 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10389 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10391 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10392 enum isl_dim_type type
, unsigned pos
)
10394 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10397 /* For each of the "n" variables starting at "first", determine
10398 * the sign of the variable and put the results in the first "n"
10399 * elements of the array "signs".
10401 * 1 means that the variable is non-negative
10402 * -1 means that the variable is non-positive
10403 * 0 means the variable attains both positive and negative values.
10405 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10406 unsigned first
, unsigned n
, int *signs
)
10408 isl_vec
*bound
= NULL
;
10409 struct isl_tab
*tab
= NULL
;
10410 struct isl_tab_undo
*snap
;
10413 if (!bset
|| !signs
)
10416 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10417 tab
= isl_tab_from_basic_set(bset
, 0);
10418 if (!bound
|| !tab
)
10421 isl_seq_clr(bound
->el
, bound
->size
);
10422 isl_int_set_si(bound
->el
[0], -1);
10424 snap
= isl_tab_snap(tab
);
10425 for (i
= 0; i
< n
; ++i
) {
10428 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10429 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10431 empty
= tab
->empty
;
10432 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10433 if (isl_tab_rollback(tab
, snap
) < 0)
10441 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10442 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10444 empty
= tab
->empty
;
10445 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10446 if (isl_tab_rollback(tab
, snap
) < 0)
10449 signs
[i
] = empty
? -1 : 0;
10453 isl_vec_free(bound
);
10457 isl_vec_free(bound
);
10461 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10462 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10464 if (!bset
|| !signs
)
10466 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10469 first
+= pos(bset
->dim
, type
) - 1;
10470 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10473 /* Is it possible for the integer division "div" to depend (possibly
10474 * indirectly) on any output dimensions?
10476 * If the div is undefined, then we conservatively assume that it
10477 * may depend on them.
10478 * Otherwise, we check if it actually depends on them or on any integer
10479 * divisions that may depend on them.
10481 static int div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10484 unsigned n_out
, o_out
;
10485 unsigned n_div
, o_div
;
10487 if (isl_int_is_zero(bmap
->div
[div
][0]))
10490 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10491 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10493 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10496 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10497 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10499 for (i
= 0; i
< n_div
; ++i
) {
10500 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10502 if (div_may_involve_output(bmap
, i
))
10509 /* Return the first integer division of "bmap" in the range
10510 * [first, first + n[ that may depend on any output dimensions and
10511 * that has a non-zero coefficient in "c" (where the first coefficient
10512 * in "c" corresponds to integer division "first").
10514 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10515 isl_int
*c
, int first
, int n
)
10522 for (k
= first
; k
< first
+ n
; ++k
) {
10523 if (isl_int_is_zero(c
[k
]))
10525 if (div_may_involve_output(bmap
, k
))
10532 /* Look for a pair of inequality constraints in "bmap" of the form
10534 * -l + i >= 0 or i >= l
10536 * n + l - i >= 0 or i <= l + n
10538 * with n < "m" and i the output dimension at position "pos".
10539 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10540 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10541 * and earlier output dimensions, as well as integer divisions that do
10542 * not involve any of the output dimensions.
10544 * Return the index of the first inequality constraint or bmap->n_ineq
10545 * if no such pair can be found.
10547 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10548 int pos
, isl_int m
)
10553 unsigned n_div
, o_div
;
10554 unsigned n_out
, o_out
;
10560 ctx
= isl_basic_map_get_ctx(bmap
);
10561 total
= isl_basic_map_total_dim(bmap
);
10562 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10563 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10564 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10565 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10566 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10567 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10569 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10570 n_out
- (pos
+ 1)) != -1)
10572 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10575 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10576 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10579 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10580 bmap
->ineq
[j
] + 1, total
))
10584 if (j
>= bmap
->n_ineq
)
10586 isl_int_add(bmap
->ineq
[i
][0],
10587 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10588 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10589 isl_int_sub(bmap
->ineq
[i
][0],
10590 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10593 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10599 return bmap
->n_ineq
;
10602 /* Return the index of the equality of "bmap" that defines
10603 * the output dimension "pos" in terms of earlier dimensions.
10604 * The equality may also involve integer divisions, as long
10605 * as those integer divisions are defined in terms of
10606 * parameters or input dimensions.
10607 * In this case, *div is set to the number of integer divisions and
10608 * *ineq is set to the number of inequality constraints (provided
10609 * div and ineq are not NULL).
10611 * The equality may also involve a single integer division involving
10612 * the output dimensions (typically only output dimension "pos") as
10613 * long as the coefficient of output dimension "pos" is 1 or -1 and
10614 * there is a pair of constraints i >= l and i <= l + n, with i referring
10615 * to output dimension "pos", l an expression involving only earlier
10616 * dimensions and n smaller than the coefficient of the integer division
10617 * in the equality. In this case, the output dimension can be defined
10618 * in terms of a modulo expression that does not involve the integer division.
10619 * *div is then set to this single integer division and
10620 * *ineq is set to the index of constraint i >= l.
10622 * Return bmap->n_eq if there is no such equality.
10623 * Return -1 on error.
10625 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10626 int pos
, int *div
, int *ineq
)
10629 unsigned n_out
, o_out
;
10630 unsigned n_div
, o_div
;
10635 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10636 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10637 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10638 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10641 *ineq
= bmap
->n_ineq
;
10644 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10645 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10647 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10648 n_out
- (pos
+ 1)) != -1)
10650 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10654 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10655 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10657 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10658 k
+ 1, n_div
- (k
+1)) < n_div
)
10660 l
= find_modulo_constraint_pair(bmap
, pos
,
10661 bmap
->eq
[j
][o_div
+ k
]);
10664 if (l
>= bmap
->n_ineq
)
10676 /* Check if the given basic map is obviously single-valued.
10677 * In particular, for each output dimension, check that there is
10678 * an equality that defines the output dimension in terms of
10679 * earlier dimensions.
10681 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10687 return isl_bool_error
;
10689 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10691 for (i
= 0; i
< n_out
; ++i
) {
10694 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
10697 return isl_bool_error
;
10698 if (eq
>= bmap
->n_eq
)
10699 return isl_bool_false
;
10702 return isl_bool_true
;
10705 /* Check if the given basic map is single-valued.
10706 * We simply compute
10710 * and check if the result is a subset of the identity mapping.
10712 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10715 isl_basic_map
*test
;
10719 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10723 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10724 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10726 space
= isl_basic_map_get_space(bmap
);
10727 space
= isl_space_map_from_set(isl_space_range(space
));
10728 id
= isl_basic_map_identity(space
);
10730 sv
= isl_basic_map_is_subset(test
, id
);
10732 isl_basic_map_free(test
);
10733 isl_basic_map_free(id
);
10738 /* Check if the given map is obviously single-valued.
10740 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10743 return isl_bool_error
;
10745 return isl_bool_true
;
10747 return isl_bool_false
;
10749 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10752 /* Check if the given map is single-valued.
10753 * We simply compute
10757 * and check if the result is a subset of the identity mapping.
10759 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
10766 sv
= isl_map_plain_is_single_valued(map
);
10770 test
= isl_map_reverse(isl_map_copy(map
));
10771 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10773 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10774 id
= isl_map_identity(dim
);
10776 sv
= isl_map_is_subset(test
, id
);
10778 isl_map_free(test
);
10784 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
10788 map
= isl_map_copy(map
);
10789 map
= isl_map_reverse(map
);
10790 in
= isl_map_is_single_valued(map
);
10796 /* Check if the given map is obviously injective.
10798 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10802 map
= isl_map_copy(map
);
10803 map
= isl_map_reverse(map
);
10804 in
= isl_map_plain_is_single_valued(map
);
10810 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
10814 sv
= isl_map_is_single_valued(map
);
10818 return isl_map_is_injective(map
);
10821 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
10823 return isl_map_is_single_valued((isl_map
*)set
);
10826 /* Does "map" only map elements to themselves?
10828 * If the domain and range spaces are different, then "map"
10829 * is considered not to be an identity relation, even if it is empty.
10830 * Otherwise, construct the maximal identity relation and
10831 * check whether "map" is a subset of this relation.
10833 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
10837 isl_bool equal
, is_identity
;
10839 space
= isl_map_get_space(map
);
10840 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
10841 isl_space_free(space
);
10842 if (equal
< 0 || !equal
)
10845 id
= isl_map_identity(isl_map_get_space(map
));
10846 is_identity
= isl_map_is_subset(map
, id
);
10849 return is_identity
;
10852 int isl_map_is_translation(__isl_keep isl_map
*map
)
10857 delta
= isl_map_deltas(isl_map_copy(map
));
10858 ok
= isl_set_is_singleton(delta
);
10859 isl_set_free(delta
);
10864 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10866 if (isl_seq_first_non_zero(p
, pos
) != -1)
10868 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10873 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10882 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10885 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10886 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10887 for (j
= 0; j
< nvar
; ++j
) {
10888 int lower
= 0, upper
= 0;
10889 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10890 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10892 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10896 if (i
< bset
->n_eq
)
10898 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10899 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10901 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10903 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10908 if (!lower
|| !upper
)
10915 int isl_set_is_box(__isl_keep isl_set
*set
)
10922 return isl_basic_set_is_box(set
->p
[0]);
10925 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10928 return isl_bool_error
;
10930 return isl_space_is_wrapping(bset
->dim
);
10933 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
10936 return isl_bool_error
;
10938 return isl_space_is_wrapping(set
->dim
);
10941 /* Modify the space of "map" through a call to "change".
10942 * If "can_change" is set (not NULL), then first call it to check
10943 * if the modification is allowed, printing the error message "cannot_change"
10946 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
10947 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
10948 const char *cannot_change
,
10949 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
10957 ok
= can_change
? can_change(map
) : isl_bool_true
;
10959 return isl_map_free(map
);
10961 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
10962 return isl_map_free(map
));
10964 space
= change(isl_map_get_space(map
));
10965 map
= isl_map_reset_space(map
, space
);
10970 /* Is the domain of "map" a wrapped relation?
10972 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
10975 return isl_bool_error
;
10977 return isl_space_domain_is_wrapping(map
->dim
);
10980 /* Is the range of "map" a wrapped relation?
10982 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
10985 return isl_bool_error
;
10987 return isl_space_range_is_wrapping(map
->dim
);
10990 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
10992 bmap
= isl_basic_map_cow(bmap
);
10996 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11000 bmap
= isl_basic_map_finalize(bmap
);
11002 return (isl_basic_set
*)bmap
;
11004 isl_basic_map_free(bmap
);
11008 /* Given a map A -> B, return the set (A -> B).
11010 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11012 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11015 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11017 bset
= isl_basic_set_cow(bset
);
11021 bset
->dim
= isl_space_unwrap(bset
->dim
);
11025 bset
= isl_basic_set_finalize(bset
);
11027 return (isl_basic_map
*)bset
;
11029 isl_basic_set_free(bset
);
11033 /* Given a set (A -> B), return the map A -> B.
11034 * Error out if "set" is not of the form (A -> B).
11036 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11038 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11039 "not a wrapping set", &isl_space_unwrap
);
11042 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11043 enum isl_dim_type type
)
11048 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11051 bmap
= isl_basic_map_cow(bmap
);
11055 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11059 bmap
= isl_basic_map_finalize(bmap
);
11063 isl_basic_map_free(bmap
);
11067 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11068 enum isl_dim_type type
)
11075 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11078 map
= isl_map_cow(map
);
11082 for (i
= 0; i
< map
->n
; ++i
) {
11083 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11087 map
->dim
= isl_space_reset(map
->dim
, type
);
11097 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11102 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11105 bmap
= isl_basic_map_cow(bmap
);
11109 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11113 bmap
= isl_basic_map_finalize(bmap
);
11117 isl_basic_map_free(bmap
);
11121 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11123 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
11126 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11127 __isl_take isl_basic_map
*bmap
)
11132 if (!bmap
->dim
->nested
[0])
11135 bmap
= isl_basic_map_cow(bmap
);
11139 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11143 bmap
= isl_basic_map_finalize(bmap
);
11147 isl_basic_map_free(bmap
);
11151 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11152 __isl_take isl_basic_map
*bmap
)
11157 if (!bmap
->dim
->nested
[1])
11160 bmap
= isl_basic_map_cow(bmap
);
11164 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11168 bmap
= isl_basic_map_finalize(bmap
);
11172 isl_basic_map_free(bmap
);
11176 /* Remove any internal structure from the spaces of domain and range of "map".
11178 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11183 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11186 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11189 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11191 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
11194 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11196 isl_space
*dim
, *flat_dim
;
11199 dim
= isl_set_get_space(set
);
11200 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11201 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11202 map
= isl_map_intersect_domain(map
, set
);
11207 /* Remove any internal structure from the space of the domain of "map".
11209 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11214 if (!map
->dim
->nested
[0])
11217 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11220 /* Remove any internal structure from the space of the range of "map".
11222 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11227 if (!map
->dim
->nested
[1])
11230 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11233 /* Reorder the dimensions of "bmap" according to the given dim_map
11234 * and set the dimension specification to "dim" and
11235 * perform Gaussian elimination on the result.
11237 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11238 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11240 isl_basic_map
*res
;
11243 bmap
= isl_basic_map_cow(bmap
);
11244 if (!bmap
|| !dim
|| !dim_map
)
11247 flags
= bmap
->flags
;
11248 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11249 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11250 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11251 res
= isl_basic_map_alloc_space(dim
,
11252 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11253 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11255 res
->flags
= flags
;
11256 res
= isl_basic_map_gauss(res
, NULL
);
11257 res
= isl_basic_map_finalize(res
);
11261 isl_basic_map_free(bmap
);
11262 isl_space_free(dim
);
11266 /* Reorder the dimensions of "map" according to given reordering.
11268 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11269 __isl_take isl_reordering
*r
)
11272 struct isl_dim_map
*dim_map
;
11274 map
= isl_map_cow(map
);
11275 dim_map
= isl_dim_map_from_reordering(r
);
11276 if (!map
|| !r
|| !dim_map
)
11279 for (i
= 0; i
< map
->n
; ++i
) {
11280 struct isl_dim_map
*dim_map_i
;
11282 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11284 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11285 isl_space_copy(r
->dim
), dim_map_i
);
11291 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11293 isl_reordering_free(r
);
11299 isl_reordering_free(r
);
11303 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11304 __isl_take isl_reordering
*r
)
11306 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
11309 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11310 __isl_take isl_space
*model
)
11314 if (!map
|| !model
)
11317 ctx
= isl_space_get_ctx(model
);
11318 if (!isl_space_has_named_params(model
))
11319 isl_die(ctx
, isl_error_invalid
,
11320 "model has unnamed parameters", goto error
);
11321 if (!isl_space_has_named_params(map
->dim
))
11322 isl_die(ctx
, isl_error_invalid
,
11323 "relation has unnamed parameters", goto error
);
11324 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11325 isl_reordering
*exp
;
11327 model
= isl_space_drop_dims(model
, isl_dim_in
,
11328 0, isl_space_dim(model
, isl_dim_in
));
11329 model
= isl_space_drop_dims(model
, isl_dim_out
,
11330 0, isl_space_dim(model
, isl_dim_out
));
11331 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11332 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11333 map
= isl_map_realign(map
, exp
);
11336 isl_space_free(model
);
11339 isl_space_free(model
);
11344 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11345 __isl_take isl_space
*model
)
11347 return isl_map_align_params(set
, model
);
11350 /* Align the parameters of "bmap" to those of "model", introducing
11351 * additional parameters if needed.
11353 __isl_give isl_basic_map
*isl_basic_map_align_params(
11354 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11358 if (!bmap
|| !model
)
11361 ctx
= isl_space_get_ctx(model
);
11362 if (!isl_space_has_named_params(model
))
11363 isl_die(ctx
, isl_error_invalid
,
11364 "model has unnamed parameters", goto error
);
11365 if (!isl_space_has_named_params(bmap
->dim
))
11366 isl_die(ctx
, isl_error_invalid
,
11367 "relation has unnamed parameters", goto error
);
11368 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11369 isl_reordering
*exp
;
11370 struct isl_dim_map
*dim_map
;
11372 model
= isl_space_drop_dims(model
, isl_dim_in
,
11373 0, isl_space_dim(model
, isl_dim_in
));
11374 model
= isl_space_drop_dims(model
, isl_dim_out
,
11375 0, isl_space_dim(model
, isl_dim_out
));
11376 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11377 exp
= isl_reordering_extend_space(exp
,
11378 isl_basic_map_get_space(bmap
));
11379 dim_map
= isl_dim_map_from_reordering(exp
);
11380 bmap
= isl_basic_map_realign(bmap
,
11381 exp
? isl_space_copy(exp
->dim
) : NULL
,
11382 isl_dim_map_extend(dim_map
, bmap
));
11383 isl_reordering_free(exp
);
11387 isl_space_free(model
);
11390 isl_space_free(model
);
11391 isl_basic_map_free(bmap
);
11395 /* Align the parameters of "bset" to those of "model", introducing
11396 * additional parameters if needed.
11398 __isl_give isl_basic_set
*isl_basic_set_align_params(
11399 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11401 return isl_basic_map_align_params(bset
, model
);
11404 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11405 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11406 enum isl_dim_type c2
, enum isl_dim_type c3
,
11407 enum isl_dim_type c4
, enum isl_dim_type c5
)
11409 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11410 struct isl_mat
*mat
;
11416 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11417 isl_basic_map_total_dim(bmap
) + 1);
11420 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11421 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11422 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11423 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11424 isl_int_set(mat
->row
[i
][pos
],
11425 bmap
->eq
[i
][off
+ k
]);
11433 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11434 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11435 enum isl_dim_type c2
, enum isl_dim_type c3
,
11436 enum isl_dim_type c4
, enum isl_dim_type c5
)
11438 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11439 struct isl_mat
*mat
;
11445 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11446 isl_basic_map_total_dim(bmap
) + 1);
11449 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11450 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11451 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11452 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11453 isl_int_set(mat
->row
[i
][pos
],
11454 bmap
->ineq
[i
][off
+ k
]);
11462 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11463 __isl_take isl_space
*dim
,
11464 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11465 enum isl_dim_type c2
, enum isl_dim_type c3
,
11466 enum isl_dim_type c4
, enum isl_dim_type c5
)
11468 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11469 isl_basic_map
*bmap
;
11475 if (!dim
|| !eq
|| !ineq
)
11478 if (eq
->n_col
!= ineq
->n_col
)
11479 isl_die(dim
->ctx
, isl_error_invalid
,
11480 "equalities and inequalities matrices should have "
11481 "same number of columns", goto error
);
11483 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11485 if (eq
->n_col
< total
)
11486 isl_die(dim
->ctx
, isl_error_invalid
,
11487 "number of columns too small", goto error
);
11489 extra
= eq
->n_col
- total
;
11491 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11492 eq
->n_row
, ineq
->n_row
);
11495 for (i
= 0; i
< extra
; ++i
) {
11496 k
= isl_basic_map_alloc_div(bmap
);
11499 isl_int_set_si(bmap
->div
[k
][0], 0);
11501 for (i
= 0; i
< eq
->n_row
; ++i
) {
11502 l
= isl_basic_map_alloc_equality(bmap
);
11505 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11506 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11507 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11508 isl_int_set(bmap
->eq
[l
][off
+ k
],
11514 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11515 l
= isl_basic_map_alloc_inequality(bmap
);
11518 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11519 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11520 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11521 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11522 ineq
->row
[i
][pos
]);
11528 isl_space_free(dim
);
11530 isl_mat_free(ineq
);
11532 bmap
= isl_basic_map_simplify(bmap
);
11533 return isl_basic_map_finalize(bmap
);
11535 isl_space_free(dim
);
11537 isl_mat_free(ineq
);
11541 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11542 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11543 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11545 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
11546 c1
, c2
, c3
, c4
, isl_dim_in
);
11549 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11550 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11551 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11553 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
11554 c1
, c2
, c3
, c4
, isl_dim_in
);
11557 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11558 __isl_take isl_space
*dim
,
11559 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11560 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11562 return (isl_basic_set
*)
11563 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11564 c1
, c2
, c3
, c4
, isl_dim_in
);
11567 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11570 return isl_bool_error
;
11572 return isl_space_can_zip(bmap
->dim
);
11575 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11578 return isl_bool_error
;
11580 return isl_space_can_zip(map
->dim
);
11583 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11584 * (A -> C) -> (B -> D).
11586 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11595 if (!isl_basic_map_can_zip(bmap
))
11596 isl_die(bmap
->ctx
, isl_error_invalid
,
11597 "basic map cannot be zipped", goto error
);
11598 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11599 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11600 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11601 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11602 bmap
= isl_basic_map_cow(bmap
);
11603 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11606 bmap
->dim
= isl_space_zip(bmap
->dim
);
11609 bmap
= isl_basic_map_mark_final(bmap
);
11612 isl_basic_map_free(bmap
);
11616 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11617 * (A -> C) -> (B -> D).
11619 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11626 if (!isl_map_can_zip(map
))
11627 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11630 map
= isl_map_cow(map
);
11634 for (i
= 0; i
< map
->n
; ++i
) {
11635 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11640 map
->dim
= isl_space_zip(map
->dim
);
11650 /* Can we apply isl_basic_map_curry to "bmap"?
11651 * That is, does it have a nested relation in its domain?
11653 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11656 return isl_bool_error
;
11658 return isl_space_can_curry(bmap
->dim
);
11661 /* Can we apply isl_map_curry to "map"?
11662 * That is, does it have a nested relation in its domain?
11664 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
11667 return isl_bool_error
;
11669 return isl_space_can_curry(map
->dim
);
11672 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11675 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11681 if (!isl_basic_map_can_curry(bmap
))
11682 isl_die(bmap
->ctx
, isl_error_invalid
,
11683 "basic map cannot be curried", goto error
);
11684 bmap
= isl_basic_map_cow(bmap
);
11687 bmap
->dim
= isl_space_curry(bmap
->dim
);
11690 bmap
= isl_basic_map_mark_final(bmap
);
11693 isl_basic_map_free(bmap
);
11697 /* Given a map (A -> B) -> C, return the corresponding map
11700 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11702 return isl_map_change_space(map
, &isl_map_can_curry
,
11703 "map cannot be curried", &isl_space_curry
);
11706 /* Can isl_map_range_curry be applied to "map"?
11707 * That is, does it have a nested relation in its range,
11708 * the domain of which is itself a nested relation?
11710 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
11713 return isl_bool_error
;
11715 return isl_space_can_range_curry(map
->dim
);
11718 /* Given a map A -> ((B -> C) -> D), return the corresponding map
11719 * A -> (B -> (C -> D)).
11721 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
11723 return isl_map_change_space(map
, &isl_map_can_range_curry
,
11724 "map range cannot be curried",
11725 &isl_space_range_curry
);
11728 /* Can we apply isl_basic_map_uncurry to "bmap"?
11729 * That is, does it have a nested relation in its domain?
11731 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11734 return isl_bool_error
;
11736 return isl_space_can_uncurry(bmap
->dim
);
11739 /* Can we apply isl_map_uncurry to "map"?
11740 * That is, does it have a nested relation in its domain?
11742 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
11745 return isl_bool_error
;
11747 return isl_space_can_uncurry(map
->dim
);
11750 /* Given a basic map A -> (B -> C), return the corresponding basic map
11753 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11759 if (!isl_basic_map_can_uncurry(bmap
))
11760 isl_die(bmap
->ctx
, isl_error_invalid
,
11761 "basic map cannot be uncurried",
11762 return isl_basic_map_free(bmap
));
11763 bmap
= isl_basic_map_cow(bmap
);
11766 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11768 return isl_basic_map_free(bmap
);
11769 bmap
= isl_basic_map_mark_final(bmap
);
11773 /* Given a map A -> (B -> C), return the corresponding map
11776 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11778 return isl_map_change_space(map
, &isl_map_can_uncurry
,
11779 "map cannot be uncurried", &isl_space_uncurry
);
11782 /* Construct a basic map mapping the domain of the affine expression
11783 * to a one-dimensional range prescribed by the affine expression.
11785 * A NaN affine expression cannot be converted to a basic map.
11787 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11792 isl_local_space
*ls
;
11793 isl_basic_map
*bmap
= NULL
;
11797 is_nan
= isl_aff_is_nan(aff
);
11801 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
11802 "cannot convert NaN", goto error
);
11804 ls
= isl_aff_get_local_space(aff
);
11805 bmap
= isl_basic_map_from_local_space(ls
);
11806 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11807 k
= isl_basic_map_alloc_equality(bmap
);
11811 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11812 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11813 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11814 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11815 aff
->v
->size
- (pos
+ 1));
11818 bmap
= isl_basic_map_finalize(bmap
);
11822 isl_basic_map_free(bmap
);
11826 /* Construct a map mapping the domain of the affine expression
11827 * to a one-dimensional range prescribed by the affine expression.
11829 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11831 isl_basic_map
*bmap
;
11833 bmap
= isl_basic_map_from_aff(aff
);
11834 return isl_map_from_basic_map(bmap
);
11837 /* Construct a basic map mapping the domain the multi-affine expression
11838 * to its range, with each dimension in the range equated to the
11839 * corresponding affine expression.
11841 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11842 __isl_take isl_multi_aff
*maff
)
11846 isl_basic_map
*bmap
;
11851 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11852 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11853 "invalid space", goto error
);
11855 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11856 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11858 for (i
= 0; i
< maff
->n
; ++i
) {
11860 isl_basic_map
*bmap_i
;
11862 aff
= isl_aff_copy(maff
->p
[i
]);
11863 bmap_i
= isl_basic_map_from_aff(aff
);
11865 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11868 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11870 isl_multi_aff_free(maff
);
11873 isl_multi_aff_free(maff
);
11877 /* Construct a map mapping the domain the multi-affine expression
11878 * to its range, with each dimension in the range equated to the
11879 * corresponding affine expression.
11881 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11883 isl_basic_map
*bmap
;
11885 bmap
= isl_basic_map_from_multi_aff(maff
);
11886 return isl_map_from_basic_map(bmap
);
11889 /* Construct a basic map mapping a domain in the given space to
11890 * to an n-dimensional range, with n the number of elements in the list,
11891 * where each coordinate in the range is prescribed by the
11892 * corresponding affine expression.
11893 * The domains of all affine expressions in the list are assumed to match
11896 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11897 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11901 isl_basic_map
*bmap
;
11906 dim
= isl_space_from_domain(domain_dim
);
11907 bmap
= isl_basic_map_universe(dim
);
11909 for (i
= 0; i
< list
->n
; ++i
) {
11911 isl_basic_map
*bmap_i
;
11913 aff
= isl_aff_copy(list
->p
[i
]);
11914 bmap_i
= isl_basic_map_from_aff(aff
);
11916 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11919 isl_aff_list_free(list
);
11923 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11924 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11926 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11929 /* Construct a basic map where the given dimensions are equal to each other.
11931 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11932 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11934 isl_basic_map
*bmap
= NULL
;
11940 if (pos1
>= isl_space_dim(space
, type1
))
11941 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11942 "index out of bounds", goto error
);
11943 if (pos2
>= isl_space_dim(space
, type2
))
11944 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11945 "index out of bounds", goto error
);
11947 if (type1
== type2
&& pos1
== pos2
)
11948 return isl_basic_map_universe(space
);
11950 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11951 i
= isl_basic_map_alloc_equality(bmap
);
11954 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11955 pos1
+= isl_basic_map_offset(bmap
, type1
);
11956 pos2
+= isl_basic_map_offset(bmap
, type2
);
11957 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11958 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11959 bmap
= isl_basic_map_finalize(bmap
);
11960 isl_space_free(space
);
11963 isl_space_free(space
);
11964 isl_basic_map_free(bmap
);
11968 /* Add a constraint imposing that the given two dimensions are equal.
11970 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
11971 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11975 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11977 bmap
= isl_basic_map_intersect(bmap
, eq
);
11982 /* Add a constraint imposing that the given two dimensions are equal.
11984 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
11985 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11987 isl_basic_map
*bmap
;
11989 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11991 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11996 /* Add a constraint imposing that the given two dimensions have opposite values.
11998 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
11999 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12001 isl_basic_map
*bmap
= NULL
;
12007 if (pos1
>= isl_map_dim(map
, type1
))
12008 isl_die(map
->ctx
, isl_error_invalid
,
12009 "index out of bounds", goto error
);
12010 if (pos2
>= isl_map_dim(map
, type2
))
12011 isl_die(map
->ctx
, isl_error_invalid
,
12012 "index out of bounds", goto error
);
12014 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12015 i
= isl_basic_map_alloc_equality(bmap
);
12018 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12019 pos1
+= isl_basic_map_offset(bmap
, type1
);
12020 pos2
+= isl_basic_map_offset(bmap
, type2
);
12021 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12022 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12023 bmap
= isl_basic_map_finalize(bmap
);
12025 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12029 isl_basic_map_free(bmap
);
12034 /* Construct a constraint imposing that the value of the first dimension is
12035 * greater than or equal to that of the second.
12037 static __isl_give isl_constraint
*constraint_order_ge(
12038 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12039 enum isl_dim_type type2
, int pos2
)
12046 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12048 if (pos1
>= isl_constraint_dim(c
, type1
))
12049 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12050 "index out of bounds", return isl_constraint_free(c
));
12051 if (pos2
>= isl_constraint_dim(c
, type2
))
12052 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12053 "index out of bounds", return isl_constraint_free(c
));
12055 if (type1
== type2
&& pos1
== pos2
)
12058 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12059 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12064 /* Add a constraint imposing that the value of the first dimension is
12065 * greater than or equal to that of the second.
12067 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12068 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12073 if (type1
== type2
&& pos1
== pos2
)
12075 space
= isl_basic_map_get_space(bmap
);
12076 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12077 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12082 /* Add a constraint imposing that the value of the first dimension is
12083 * greater than or equal to that of the second.
12085 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12086 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12091 if (type1
== type2
&& pos1
== pos2
)
12093 space
= isl_map_get_space(map
);
12094 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12095 map
= isl_map_add_constraint(map
, c
);
12100 /* Add a constraint imposing that the value of the first dimension is
12101 * less than or equal to that of the second.
12103 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12104 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12106 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12109 /* Construct a basic map where the value of the first dimension is
12110 * greater than that of the second.
12112 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12113 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12115 isl_basic_map
*bmap
= NULL
;
12121 if (pos1
>= isl_space_dim(space
, type1
))
12122 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12123 "index out of bounds", goto error
);
12124 if (pos2
>= isl_space_dim(space
, type2
))
12125 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12126 "index out of bounds", goto error
);
12128 if (type1
== type2
&& pos1
== pos2
)
12129 return isl_basic_map_empty(space
);
12131 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12132 i
= isl_basic_map_alloc_inequality(bmap
);
12134 return isl_basic_map_free(bmap
);
12135 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12136 pos1
+= isl_basic_map_offset(bmap
, type1
);
12137 pos2
+= isl_basic_map_offset(bmap
, type2
);
12138 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12139 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12140 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12141 bmap
= isl_basic_map_finalize(bmap
);
12145 isl_space_free(space
);
12146 isl_basic_map_free(bmap
);
12150 /* Add a constraint imposing that the value of the first dimension is
12151 * greater than that of the second.
12153 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12154 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12158 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12160 bmap
= isl_basic_map_intersect(bmap
, gt
);
12165 /* Add a constraint imposing that the value of the first dimension is
12166 * greater than that of the second.
12168 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12169 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12171 isl_basic_map
*bmap
;
12173 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12175 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12180 /* Add a constraint imposing that the value of the first dimension is
12181 * smaller than that of the second.
12183 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12184 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12186 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12189 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12193 isl_local_space
*ls
;
12198 if (!isl_basic_map_divs_known(bmap
))
12199 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12200 "some divs are unknown", return NULL
);
12202 ls
= isl_basic_map_get_local_space(bmap
);
12203 div
= isl_local_space_get_div(ls
, pos
);
12204 isl_local_space_free(ls
);
12209 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12212 return isl_basic_map_get_div(bset
, pos
);
12215 /* Plug in "subs" for dimension "type", "pos" of "bset".
12217 * Let i be the dimension to replace and let "subs" be of the form
12221 * Any integer division with a non-zero coefficient for i,
12223 * floor((a i + g)/m)
12227 * floor((a f + d g)/(m d))
12229 * Constraints of the form
12237 * We currently require that "subs" is an integral expression.
12238 * Handling rational expressions may require us to add stride constraints
12239 * as we do in isl_basic_set_preimage_multi_aff.
12241 __isl_give isl_basic_set
*isl_basic_set_substitute(
12242 __isl_take isl_basic_set
*bset
,
12243 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12249 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12252 bset
= isl_basic_set_cow(bset
);
12253 if (!bset
|| !subs
)
12256 ctx
= isl_basic_set_get_ctx(bset
);
12257 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12258 isl_die(ctx
, isl_error_invalid
,
12259 "spaces don't match", goto error
);
12260 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12261 isl_die(ctx
, isl_error_unsupported
,
12262 "cannot handle divs yet", goto error
);
12263 if (!isl_int_is_one(subs
->v
->el
[0]))
12264 isl_die(ctx
, isl_error_invalid
,
12265 "can only substitute integer expressions", goto error
);
12267 pos
+= isl_basic_set_offset(bset
, type
);
12271 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12272 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12274 isl_int_set(v
, bset
->eq
[i
][pos
]);
12275 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12276 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12277 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12280 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12281 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12283 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12284 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12285 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12286 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12289 for (i
= 0; i
< bset
->n_div
; ++i
) {
12290 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12292 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12293 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12294 isl_seq_combine(bset
->div
[i
] + 1,
12295 subs
->v
->el
[0], bset
->div
[i
] + 1,
12296 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12297 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12302 bset
= isl_basic_set_simplify(bset
);
12303 return isl_basic_set_finalize(bset
);
12305 isl_basic_set_free(bset
);
12309 /* Plug in "subs" for dimension "type", "pos" of "set".
12311 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12312 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12316 if (set
&& isl_set_plain_is_empty(set
))
12319 set
= isl_set_cow(set
);
12323 for (i
= set
->n
- 1; i
>= 0; --i
) {
12324 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12325 if (remove_if_empty(set
, i
) < 0)
12335 /* Check if the range of "ma" is compatible with the domain or range
12336 * (depending on "type") of "bmap".
12337 * Return -1 if anything is wrong.
12339 static int check_basic_map_compatible_range_multi_aff(
12340 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12341 __isl_keep isl_multi_aff
*ma
)
12344 isl_space
*ma_space
;
12346 ma_space
= isl_multi_aff_get_space(ma
);
12348 m
= isl_space_match(bmap
->dim
, isl_dim_param
, ma_space
, isl_dim_param
);
12352 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12353 "parameters don't match", goto error
);
12354 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12358 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12359 "spaces don't match", goto error
);
12361 isl_space_free(ma_space
);
12364 isl_space_free(ma_space
);
12368 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12369 * coefficients before the transformed range of dimensions,
12370 * the "n_after" coefficients after the transformed range of dimensions
12371 * and the coefficients of the other divs in "bmap".
12373 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12374 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12379 isl_local_space
*ls
;
12384 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12388 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12389 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12390 for (i
= 0; i
< n_div
; ++i
) {
12391 int o_bmap
= 0, o_ls
= 0;
12393 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12394 o_bmap
+= 1 + 1 + n_param
;
12395 o_ls
+= 1 + 1 + n_param
;
12396 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12397 o_bmap
+= n_before
;
12398 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12399 ls
->div
->row
[i
] + o_ls
, n_set
);
12402 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12404 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12405 ls
->div
->row
[i
] + o_ls
, n_div
);
12408 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12409 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
12413 isl_local_space_free(ls
);
12416 isl_local_space_free(ls
);
12420 /* How many stride constraints does "ma" enforce?
12421 * That is, how many of the affine expressions have a denominator
12422 * different from one?
12424 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12429 for (i
= 0; i
< ma
->n
; ++i
)
12430 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12436 /* For each affine expression in ma of the form
12438 * x_i = (f_i y + h_i)/m_i
12440 * with m_i different from one, add a constraint to "bmap"
12443 * f_i y + h_i = m_i alpha_i
12445 * with alpha_i an additional existentially quantified variable.
12447 * The input variables of "ma" correspond to a subset of the variables
12448 * of "bmap". There are "n_before" variables in "bmap" before this
12449 * subset and "n_after" variables after this subset.
12450 * The integer divisions of the affine expressions in "ma" are assumed
12451 * to have been aligned. There are "n_div_ma" of them and
12452 * they appear first in "bmap", straight after the "n_after" variables.
12454 static __isl_give isl_basic_map
*add_ma_strides(
12455 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12456 int n_before
, int n_after
, int n_div_ma
)
12464 total
= isl_basic_map_total_dim(bmap
);
12465 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12466 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12467 for (i
= 0; i
< ma
->n
; ++i
) {
12468 int o_bmap
= 0, o_ma
= 1;
12470 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12472 div
= isl_basic_map_alloc_div(bmap
);
12473 k
= isl_basic_map_alloc_equality(bmap
);
12474 if (div
< 0 || k
< 0)
12476 isl_int_set_si(bmap
->div
[div
][0], 0);
12477 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12478 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12479 o_bmap
+= 1 + n_param
;
12480 o_ma
+= 1 + n_param
;
12481 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12482 o_bmap
+= n_before
;
12483 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12484 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12487 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12489 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12490 ma
->p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12491 o_bmap
+= n_div_ma
;
12493 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12494 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12500 isl_basic_map_free(bmap
);
12504 /* Replace the domain or range space (depending on "type) of "space" by "set".
12506 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12507 enum isl_dim_type type
, __isl_take isl_space
*set
)
12509 if (type
== isl_dim_in
) {
12510 space
= isl_space_range(space
);
12511 space
= isl_space_map_from_domain_and_range(set
, space
);
12513 space
= isl_space_domain(space
);
12514 space
= isl_space_map_from_domain_and_range(space
, set
);
12520 /* Compute the preimage of the domain or range (depending on "type")
12521 * of "bmap" under the function represented by "ma".
12522 * In other words, plug in "ma" in the domain or range of "bmap".
12523 * The result is a basic map that lives in the same space as "bmap"
12524 * except that the domain or range has been replaced by
12525 * the domain space of "ma".
12527 * If bmap is represented by
12529 * A(p) + S u + B x + T v + C(divs) >= 0,
12531 * where u and x are input and output dimensions if type == isl_dim_out
12532 * while x and v are input and output dimensions if type == isl_dim_in,
12533 * and ma is represented by
12535 * x = D(p) + F(y) + G(divs')
12537 * then the result is
12539 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12541 * The divs in the input set are similarly adjusted.
12544 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12548 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12549 * B_i G(divs') + c_i(divs))/n_i)
12551 * If bmap is not a rational map and if F(y) involves any denominators
12553 * x_i = (f_i y + h_i)/m_i
12555 * then additional constraints are added to ensure that we only
12556 * map back integer points. That is we enforce
12558 * f_i y + h_i = m_i alpha_i
12560 * with alpha_i an additional existentially quantified variable.
12562 * We first copy over the divs from "ma".
12563 * Then we add the modified constraints and divs from "bmap".
12564 * Finally, we add the stride constraints, if needed.
12566 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12567 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12568 __isl_take isl_multi_aff
*ma
)
12572 isl_basic_map
*res
= NULL
;
12573 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12574 isl_int f
, c1
, c2
, g
;
12575 int rational
, strides
;
12582 ma
= isl_multi_aff_align_divs(ma
);
12585 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12588 if (type
== isl_dim_in
) {
12590 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12592 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12595 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12596 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12598 space
= isl_multi_aff_get_domain_space(ma
);
12599 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12600 rational
= isl_basic_map_is_rational(bmap
);
12601 strides
= rational
? 0 : multi_aff_strides(ma
);
12602 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12603 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12605 res
= isl_basic_map_set_rational(res
);
12607 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12608 if (isl_basic_map_alloc_div(res
) < 0)
12611 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12614 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12615 k
= isl_basic_map_alloc_equality(res
);
12618 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12619 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12622 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12623 k
= isl_basic_map_alloc_inequality(res
);
12626 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12627 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12630 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12631 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12632 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12635 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12636 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12641 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
12647 isl_basic_map_free(bmap
);
12648 isl_multi_aff_free(ma
);
12649 res
= isl_basic_set_simplify(res
);
12650 return isl_basic_map_finalize(res
);
12656 isl_basic_map_free(bmap
);
12657 isl_multi_aff_free(ma
);
12658 isl_basic_map_free(res
);
12662 /* Compute the preimage of "bset" under the function represented by "ma".
12663 * In other words, plug in "ma" in "bset". The result is a basic set
12664 * that lives in the domain space of "ma".
12666 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12667 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12669 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12672 /* Compute the preimage of the domain of "bmap" under the function
12673 * represented by "ma".
12674 * In other words, plug in "ma" in the domain of "bmap".
12675 * The result is a basic map that lives in the same space as "bmap"
12676 * except that the domain has been replaced by the domain space of "ma".
12678 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12679 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12681 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12684 /* Compute the preimage of the range of "bmap" under the function
12685 * represented by "ma".
12686 * In other words, plug in "ma" in the range of "bmap".
12687 * The result is a basic map that lives in the same space as "bmap"
12688 * except that the range has been replaced by the domain space of "ma".
12690 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12691 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12693 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12696 /* Check if the range of "ma" is compatible with the domain or range
12697 * (depending on "type") of "map".
12698 * Return -1 if anything is wrong.
12700 static int check_map_compatible_range_multi_aff(
12701 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12702 __isl_keep isl_multi_aff
*ma
)
12705 isl_space
*ma_space
;
12707 ma_space
= isl_multi_aff_get_space(ma
);
12708 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12709 isl_space_free(ma_space
);
12711 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12712 "spaces don't match", return -1);
12716 /* Compute the preimage of the domain or range (depending on "type")
12717 * of "map" under the function represented by "ma".
12718 * In other words, plug in "ma" in the domain or range of "map".
12719 * The result is a map that lives in the same space as "map"
12720 * except that the domain or range has been replaced by
12721 * the domain space of "ma".
12723 * The parameters are assumed to have been aligned.
12725 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
12726 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12731 map
= isl_map_cow(map
);
12732 ma
= isl_multi_aff_align_divs(ma
);
12735 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
12738 for (i
= 0; i
< map
->n
; ++i
) {
12739 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
12740 isl_multi_aff_copy(ma
));
12745 space
= isl_multi_aff_get_domain_space(ma
);
12746 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
12748 isl_space_free(map
->dim
);
12753 isl_multi_aff_free(ma
);
12755 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
12756 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
12759 isl_multi_aff_free(ma
);
12764 /* Compute the preimage of the domain or range (depending on "type")
12765 * of "map" under the function represented by "ma".
12766 * In other words, plug in "ma" in the domain or range of "map".
12767 * The result is a map that lives in the same space as "map"
12768 * except that the domain or range has been replaced by
12769 * the domain space of "ma".
12771 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
12772 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12777 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
12778 return map_preimage_multi_aff(map
, type
, ma
);
12780 if (!isl_space_has_named_params(map
->dim
) ||
12781 !isl_space_has_named_params(ma
->space
))
12782 isl_die(map
->ctx
, isl_error_invalid
,
12783 "unaligned unnamed parameters", goto error
);
12784 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
12785 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
12787 return map_preimage_multi_aff(map
, type
, ma
);
12789 isl_multi_aff_free(ma
);
12790 return isl_map_free(map
);
12793 /* Compute the preimage of "set" under the function represented by "ma".
12794 * In other words, plug in "ma" in "set". The result is a set
12795 * that lives in the domain space of "ma".
12797 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
12798 __isl_take isl_multi_aff
*ma
)
12800 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
12803 /* Compute the preimage of the domain of "map" under the function
12804 * represented by "ma".
12805 * In other words, plug in "ma" in the domain of "map".
12806 * The result is a map that lives in the same space as "map"
12807 * except that the domain has been replaced by the domain space of "ma".
12809 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12810 __isl_take isl_multi_aff
*ma
)
12812 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12815 /* Compute the preimage of the range of "map" under the function
12816 * represented by "ma".
12817 * In other words, plug in "ma" in the range of "map".
12818 * The result is a map that lives in the same space as "map"
12819 * except that the range has been replaced by the domain space of "ma".
12821 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
12822 __isl_take isl_multi_aff
*ma
)
12824 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
12827 /* Compute the preimage of "map" under the function represented by "pma".
12828 * In other words, plug in "pma" in the domain or range of "map".
12829 * The result is a map that lives in the same space as "map",
12830 * except that the space of type "type" has been replaced by
12831 * the domain space of "pma".
12833 * The parameters of "map" and "pma" are assumed to have been aligned.
12835 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
12836 __isl_take isl_map
*map
, enum isl_dim_type type
,
12837 __isl_take isl_pw_multi_aff
*pma
)
12846 isl_pw_multi_aff_free(pma
);
12847 res
= isl_map_empty(isl_map_get_space(map
));
12852 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12853 isl_multi_aff_copy(pma
->p
[0].maff
));
12854 if (type
== isl_dim_in
)
12855 res
= isl_map_intersect_domain(res
,
12856 isl_map_copy(pma
->p
[0].set
));
12858 res
= isl_map_intersect_range(res
,
12859 isl_map_copy(pma
->p
[0].set
));
12861 for (i
= 1; i
< pma
->n
; ++i
) {
12864 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12865 isl_multi_aff_copy(pma
->p
[i
].maff
));
12866 if (type
== isl_dim_in
)
12867 res_i
= isl_map_intersect_domain(res_i
,
12868 isl_map_copy(pma
->p
[i
].set
));
12870 res_i
= isl_map_intersect_range(res_i
,
12871 isl_map_copy(pma
->p
[i
].set
));
12872 res
= isl_map_union(res
, res_i
);
12875 isl_pw_multi_aff_free(pma
);
12879 isl_pw_multi_aff_free(pma
);
12884 /* Compute the preimage of "map" under the function represented by "pma".
12885 * In other words, plug in "pma" in the domain or range of "map".
12886 * The result is a map that lives in the same space as "map",
12887 * except that the space of type "type" has been replaced by
12888 * the domain space of "pma".
12890 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
12891 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
12896 if (isl_space_match(map
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
12897 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12899 if (!isl_space_has_named_params(map
->dim
) ||
12900 !isl_space_has_named_params(pma
->dim
))
12901 isl_die(map
->ctx
, isl_error_invalid
,
12902 "unaligned unnamed parameters", goto error
);
12903 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
12904 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
12906 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12908 isl_pw_multi_aff_free(pma
);
12909 return isl_map_free(map
);
12912 /* Compute the preimage of "set" under the function represented by "pma".
12913 * In other words, plug in "pma" in "set". The result is a set
12914 * that lives in the domain space of "pma".
12916 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
12917 __isl_take isl_pw_multi_aff
*pma
)
12919 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
12922 /* Compute the preimage of the domain of "map" under the function
12923 * represented by "pma".
12924 * In other words, plug in "pma" in the domain of "map".
12925 * The result is a map that lives in the same space as "map",
12926 * except that domain space has been replaced by the domain space of "pma".
12928 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
12929 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12931 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
12934 /* Compute the preimage of the range of "map" under the function
12935 * represented by "pma".
12936 * In other words, plug in "pma" in the range of "map".
12937 * The result is a map that lives in the same space as "map",
12938 * except that range space has been replaced by the domain space of "pma".
12940 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
12941 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12943 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
12946 /* Compute the preimage of "map" under the function represented by "mpa".
12947 * In other words, plug in "mpa" in the domain or range of "map".
12948 * The result is a map that lives in the same space as "map",
12949 * except that the space of type "type" has been replaced by
12950 * the domain space of "mpa".
12952 * If the map does not involve any constraints that refer to the
12953 * dimensions of the substituted space, then the only possible
12954 * effect of "mpa" on the map is to map the space to a different space.
12955 * We create a separate isl_multi_aff to effectuate this change
12956 * in order to avoid spurious splitting of the map along the pieces
12959 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
12960 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
12963 isl_pw_multi_aff
*pma
;
12968 n
= isl_map_dim(map
, type
);
12969 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
12973 space
= isl_multi_pw_aff_get_space(mpa
);
12974 isl_multi_pw_aff_free(mpa
);
12975 ma
= isl_multi_aff_zero(space
);
12976 return isl_map_preimage_multi_aff(map
, type
, ma
);
12979 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
12980 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
12983 isl_multi_pw_aff_free(mpa
);
12987 /* Compute the preimage of "map" under the function represented by "mpa".
12988 * In other words, plug in "mpa" in the domain "map".
12989 * The result is a map that lives in the same space as "map",
12990 * except that domain space has been replaced by the domain space of "mpa".
12992 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
12993 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
12995 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
12998 /* Compute the preimage of "set" by the function represented by "mpa".
12999 * In other words, plug in "mpa" in "set".
13001 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13002 __isl_take isl_multi_pw_aff
*mpa
)
13004 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);