2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_ctx_private.h>
17 #include <isl_map_private.h>
19 #include "isl_space_private.h"
20 #include "isl_equalities.h"
21 #include <isl_list_private.h>
26 #include "isl_map_piplib.h"
27 #include <isl_reordering.h>
28 #include "isl_sample.h"
31 #include <isl_mat_private.h>
32 #include <isl_dim_map.h>
33 #include <isl_local_space_private.h>
34 #include <isl_aff_private.h>
35 #include <isl_options_private.h>
36 #include <isl_morph.h>
38 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
41 case isl_dim_param
: return dim
->nparam
;
42 case isl_dim_in
: return dim
->n_in
;
43 case isl_dim_out
: return dim
->n_out
;
44 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
49 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
52 case isl_dim_param
: return 1;
53 case isl_dim_in
: return 1 + dim
->nparam
;
54 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
59 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
60 enum isl_dim_type type
)
65 case isl_dim_cst
: return 1;
68 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
69 case isl_dim_div
: return bmap
->n_div
;
70 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
75 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
77 return map
? n(map
->dim
, type
) : 0;
80 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
82 return set
? n(set
->dim
, type
) : 0;
85 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
86 enum isl_dim_type type
)
88 isl_space
*dim
= bmap
->dim
;
90 case isl_dim_cst
: return 0;
91 case isl_dim_param
: return 1;
92 case isl_dim_in
: return 1 + dim
->nparam
;
93 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
94 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
99 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
100 enum isl_dim_type type
)
102 return isl_basic_map_offset(bset
, type
);
105 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
107 return pos(map
->dim
, type
);
110 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
111 enum isl_dim_type type
)
113 return isl_basic_map_dim(bset
, type
);
116 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
118 return isl_basic_set_dim(bset
, isl_dim_set
);
121 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
123 return isl_basic_set_dim(bset
, isl_dim_param
);
126 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
130 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
133 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
135 return isl_set_dim(set
, isl_dim_set
);
138 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
140 return isl_set_dim(set
, isl_dim_param
);
143 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
145 return bmap
? bmap
->dim
->n_in
: 0;
148 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
150 return bmap
? bmap
->dim
->n_out
: 0;
153 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
155 return bmap
? bmap
->dim
->nparam
: 0;
158 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
160 return bmap
? bmap
->n_div
: 0;
163 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
165 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
168 unsigned isl_map_n_in(const struct isl_map
*map
)
170 return map
? map
->dim
->n_in
: 0;
173 unsigned isl_map_n_out(const struct isl_map
*map
)
175 return map
? map
->dim
->n_out
: 0;
178 unsigned isl_map_n_param(const struct isl_map
*map
)
180 return map
? map
->dim
->nparam
: 0;
183 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
188 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
191 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
194 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
195 struct isl_basic_set
*bset
)
200 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
203 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
206 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
211 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
214 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
217 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
218 struct isl_basic_set
*bset
)
223 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
226 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
229 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
231 return bmap
? bmap
->ctx
: NULL
;
234 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
236 return bset
? bset
->ctx
: NULL
;
239 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
241 return map
? map
->ctx
: NULL
;
244 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
246 return set
? set
->ctx
: NULL
;
249 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
253 return isl_space_copy(bmap
->dim
);
256 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
260 return isl_space_copy(bset
->dim
);
263 /* Extract the divs in "bmap" as a matrix.
265 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
276 ctx
= isl_basic_map_get_ctx(bmap
);
277 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
278 cols
= 1 + 1 + total
+ bmap
->n_div
;
279 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
283 for (i
= 0; i
< bmap
->n_div
; ++i
)
284 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
289 __isl_give isl_local_space
*isl_basic_map_get_local_space(
290 __isl_keep isl_basic_map
*bmap
)
297 div
= isl_basic_map_get_divs(bmap
);
298 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
301 __isl_give isl_local_space
*isl_basic_set_get_local_space(
302 __isl_keep isl_basic_set
*bset
)
304 return isl_basic_map_get_local_space(bset
);
307 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
308 __isl_take isl_local_space
*ls
)
317 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
318 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
319 n_div
, 0, 2 * n_div
);
321 for (i
= 0; i
< n_div
; ++i
)
322 if (isl_basic_map_alloc_div(bmap
) < 0)
325 for (i
= 0; i
< n_div
; ++i
) {
326 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
327 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
331 isl_local_space_free(ls
);
334 isl_local_space_free(ls
);
335 isl_basic_map_free(bmap
);
339 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
340 __isl_take isl_local_space
*ls
)
342 return isl_basic_map_from_local_space(ls
);
345 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
349 return isl_space_copy(map
->dim
);
352 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
356 return isl_space_copy(set
->dim
);
359 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
360 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
362 bmap
= isl_basic_map_cow(bmap
);
365 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
368 bmap
= isl_basic_map_finalize(bmap
);
371 isl_basic_map_free(bmap
);
375 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
376 __isl_take isl_basic_set
*bset
, const char *s
)
378 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
381 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
382 enum isl_dim_type type
)
384 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
387 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
388 enum isl_dim_type type
, const char *s
)
392 map
= isl_map_cow(map
);
396 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
400 for (i
= 0; i
< map
->n
; ++i
) {
401 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
412 /* Does the input or output tuple have a name?
414 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
416 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
419 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
420 enum isl_dim_type type
)
422 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
425 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
428 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
431 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
432 enum isl_dim_type type
, __isl_take isl_id
*id
)
434 map
= isl_map_cow(map
);
436 return isl_id_free(id
);
438 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
440 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
443 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
444 __isl_take isl_id
*id
)
446 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
449 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
450 enum isl_dim_type type
)
452 map
= isl_map_cow(map
);
456 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
458 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
461 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
463 return isl_map_reset_tuple_id(set
, isl_dim_set
);
466 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
468 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
471 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
472 enum isl_dim_type type
)
474 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
477 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
479 return isl_map_has_tuple_id(set
, isl_dim_set
);
482 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
484 return isl_map_get_tuple_id(set
, isl_dim_set
);
487 /* Does the set tuple have a name?
489 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
491 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
495 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
497 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
500 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
502 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
505 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
506 enum isl_dim_type type
, unsigned pos
)
508 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
511 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
512 enum isl_dim_type type
, unsigned pos
)
514 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
517 /* Does the given dimension have a name?
519 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
520 enum isl_dim_type type
, unsigned pos
)
522 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
525 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
526 enum isl_dim_type type
, unsigned pos
)
528 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
531 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
532 enum isl_dim_type type
, unsigned pos
)
534 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
537 /* Does the given dimension have a name?
539 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
540 enum isl_dim_type type
, unsigned pos
)
542 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
545 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
546 __isl_take isl_basic_map
*bmap
,
547 enum isl_dim_type type
, unsigned pos
, const char *s
)
549 bmap
= isl_basic_map_cow(bmap
);
552 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
555 return isl_basic_map_finalize(bmap
);
557 isl_basic_map_free(bmap
);
561 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
562 enum isl_dim_type type
, unsigned pos
, const char *s
)
566 map
= isl_map_cow(map
);
570 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
574 for (i
= 0; i
< map
->n
; ++i
) {
575 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
586 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
587 __isl_take isl_basic_set
*bset
,
588 enum isl_dim_type type
, unsigned pos
, const char *s
)
590 return (isl_basic_set
*)isl_basic_map_set_dim_name(
591 (isl_basic_map
*)bset
, type
, pos
, s
);
594 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
595 enum isl_dim_type type
, unsigned pos
, const char *s
)
597 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
600 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
601 enum isl_dim_type type
, unsigned pos
)
603 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
606 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
607 enum isl_dim_type type
, unsigned pos
)
609 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
612 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
613 enum isl_dim_type type
, unsigned pos
)
615 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
618 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
619 enum isl_dim_type type
, unsigned pos
)
621 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
624 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
625 enum isl_dim_type type
, unsigned pos
)
627 return isl_map_has_dim_id(set
, type
, pos
);
630 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
631 enum isl_dim_type type
, unsigned pos
)
633 return isl_map_get_dim_id(set
, type
, pos
);
636 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
637 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
639 map
= isl_map_cow(map
);
641 return isl_id_free(id
);
643 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
645 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
648 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
649 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
651 return isl_map_set_dim_id(set
, type
, pos
, id
);
654 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
655 __isl_keep isl_id
*id
)
659 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
662 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
663 __isl_keep isl_id
*id
)
665 return isl_map_find_dim_by_id(set
, type
, id
);
668 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
673 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
676 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
679 return isl_map_find_dim_by_name(set
, type
, name
);
682 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
686 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
689 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
691 return isl_basic_map_is_rational(bset
);
694 /* Does "bmap" contain any rational points?
696 * If "bmap" has an equality for each dimension, equating the dimension
697 * to an integer constant, then it has no rational points, even if it
698 * is marked as rational.
700 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
702 int has_rational
= 1;
707 if (isl_basic_map_plain_is_empty(bmap
))
709 if (!isl_basic_map_is_rational(bmap
))
711 bmap
= isl_basic_map_copy(bmap
);
712 bmap
= isl_basic_map_implicit_equalities(bmap
);
715 total
= isl_basic_map_total_dim(bmap
);
716 if (bmap
->n_eq
== total
) {
718 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
719 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
722 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
723 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
725 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
733 isl_basic_map_free(bmap
);
738 /* Does "map" contain any rational points?
740 int isl_map_has_rational(__isl_keep isl_map
*map
)
747 for (i
= 0; i
< map
->n
; ++i
) {
748 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
749 if (has_rational
< 0)
757 /* Does "set" contain any rational points?
759 int isl_set_has_rational(__isl_keep isl_set
*set
)
761 return isl_map_has_rational(set
);
764 /* Is this basic set a parameter domain?
766 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
770 return isl_space_is_params(bset
->dim
);
773 /* Is this set a parameter domain?
775 int isl_set_is_params(__isl_keep isl_set
*set
)
779 return isl_space_is_params(set
->dim
);
782 /* Is this map actually a parameter domain?
783 * Users should never call this function. Outside of isl,
784 * a map can never be a parameter domain.
786 int isl_map_is_params(__isl_keep isl_map
*map
)
790 return isl_space_is_params(map
->dim
);
793 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
794 struct isl_basic_map
*bmap
, unsigned extra
,
795 unsigned n_eq
, unsigned n_ineq
)
798 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
803 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
804 if (isl_blk_is_error(bmap
->block
))
807 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
812 bmap
->block2
= isl_blk_empty();
815 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
816 if (isl_blk_is_error(bmap
->block2
))
819 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
824 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
825 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
827 for (i
= 0; i
< extra
; ++i
)
828 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
832 bmap
->c_size
= n_eq
+ n_ineq
;
833 bmap
->eq
= bmap
->ineq
+ n_ineq
;
842 isl_basic_map_free(bmap
);
846 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
847 unsigned nparam
, unsigned dim
, unsigned extra
,
848 unsigned n_eq
, unsigned n_ineq
)
850 struct isl_basic_map
*bmap
;
853 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
857 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
858 return (struct isl_basic_set
*)bmap
;
861 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
862 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
864 struct isl_basic_map
*bmap
;
867 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
868 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
869 return (struct isl_basic_set
*)bmap
;
875 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
876 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
878 struct isl_basic_map
*bmap
;
882 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
887 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
893 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
894 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
895 unsigned n_eq
, unsigned n_ineq
)
897 struct isl_basic_map
*bmap
;
900 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
904 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
908 static void dup_constraints(
909 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
912 unsigned total
= isl_basic_map_total_dim(src
);
914 for (i
= 0; i
< src
->n_eq
; ++i
) {
915 int j
= isl_basic_map_alloc_equality(dst
);
916 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
919 for (i
= 0; i
< src
->n_ineq
; ++i
) {
920 int j
= isl_basic_map_alloc_inequality(dst
);
921 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
924 for (i
= 0; i
< src
->n_div
; ++i
) {
925 int j
= isl_basic_map_alloc_div(dst
);
926 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
928 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
931 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
933 struct isl_basic_map
*dup
;
937 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
938 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
941 dup_constraints(dup
, bmap
);
942 dup
->flags
= bmap
->flags
;
943 dup
->sample
= isl_vec_copy(bmap
->sample
);
947 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
949 struct isl_basic_map
*dup
;
951 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
952 return (struct isl_basic_set
*)dup
;
955 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
960 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
964 return isl_basic_set_dup(bset
);
967 struct isl_set
*isl_set_copy(struct isl_set
*set
)
976 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
981 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
985 bmap
= isl_basic_map_dup(bmap
);
987 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
991 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1000 void *isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1005 if (--bmap
->ref
> 0)
1008 isl_ctx_deref(bmap
->ctx
);
1010 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1012 isl_blk_free(bmap
->ctx
, bmap
->block
);
1013 isl_vec_free(bmap
->sample
);
1014 isl_space_free(bmap
->dim
);
1020 void *isl_basic_set_free(struct isl_basic_set
*bset
)
1022 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1025 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1027 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1030 __isl_give isl_map
*isl_map_align_params_map_map_and(
1031 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1032 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1033 __isl_take isl_map
*map2
))
1037 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1038 return fn(map1
, map2
);
1039 if (!isl_space_has_named_params(map1
->dim
) ||
1040 !isl_space_has_named_params(map2
->dim
))
1041 isl_die(map1
->ctx
, isl_error_invalid
,
1042 "unaligned unnamed parameters", goto error
);
1043 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1044 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1045 return fn(map1
, map2
);
1052 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1053 __isl_keep isl_map
*map2
,
1054 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1060 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1061 return fn(map1
, map2
);
1062 if (!isl_space_has_named_params(map1
->dim
) ||
1063 !isl_space_has_named_params(map2
->dim
))
1064 isl_die(map1
->ctx
, isl_error_invalid
,
1065 "unaligned unnamed parameters", return -1);
1066 map1
= isl_map_copy(map1
);
1067 map2
= isl_map_copy(map2
);
1068 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1069 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1076 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1078 struct isl_ctx
*ctx
;
1082 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1083 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1085 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1086 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1087 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1088 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1089 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1090 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1092 int j
= isl_basic_map_alloc_inequality(bmap
);
1096 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1097 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1104 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1105 bmap
->extra
- bmap
->n_div
);
1106 return bmap
->n_eq
++;
1109 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1111 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1114 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1118 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1123 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1125 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1128 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1133 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1135 if (pos
!= bmap
->n_eq
- 1) {
1137 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1138 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1144 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1146 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1149 /* Turn inequality "pos" of "bmap" into an equality.
1151 * In particular, we move the inequality in front of the equalities
1152 * and move the last inequality in the position of the moved inequality.
1153 * Note that isl_tab_make_equalities_explicit depends on this particular
1154 * change in the ordering of the constraints.
1156 void isl_basic_map_inequality_to_equality(
1157 struct isl_basic_map
*bmap
, unsigned pos
)
1161 t
= bmap
->ineq
[pos
];
1162 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1163 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1168 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1169 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1170 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1171 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1174 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1176 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1179 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1181 struct isl_ctx
*ctx
;
1185 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1186 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1187 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1188 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1189 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1190 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1191 1 + isl_basic_map_total_dim(bmap
),
1192 bmap
->extra
- bmap
->n_div
);
1193 return bmap
->n_ineq
++;
1196 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1198 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1201 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1205 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1210 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1212 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1215 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1220 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1222 if (pos
!= bmap
->n_ineq
- 1) {
1223 t
= bmap
->ineq
[pos
];
1224 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1225 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1226 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1232 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1234 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1237 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1242 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1245 k
= isl_basic_map_alloc_equality(bmap
);
1248 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1251 isl_basic_map_free(bmap
);
1255 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1258 return (isl_basic_set
*)
1259 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1262 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1267 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1270 k
= isl_basic_map_alloc_inequality(bmap
);
1273 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1276 isl_basic_map_free(bmap
);
1280 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1283 return (isl_basic_set
*)
1284 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1287 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1291 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1292 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1293 1 + 1 + isl_basic_map_total_dim(bmap
),
1294 bmap
->extra
- bmap
->n_div
);
1295 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1296 return bmap
->n_div
++;
1299 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1301 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1304 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1308 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1313 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1315 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1318 /* Copy constraint from src to dst, putting the vars of src at offset
1319 * dim_off in dst and the divs of src at offset div_off in dst.
1320 * If both sets are actually map, then dim_off applies to the input
1323 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1324 struct isl_basic_map
*src_map
, isl_int
*src
,
1325 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1327 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1328 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1329 unsigned src_in
= isl_basic_map_n_in(src_map
);
1330 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1331 unsigned src_out
= isl_basic_map_n_out(src_map
);
1332 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1333 isl_int_set(dst
[0], src
[0]);
1334 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1335 if (dst_nparam
> src_nparam
)
1336 isl_seq_clr(dst
+1+src_nparam
,
1337 dst_nparam
- src_nparam
);
1338 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1339 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1341 isl_min(dst_in
-in_off
, src_in
));
1342 if (dst_in
-in_off
> src_in
)
1343 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1344 dst_in
- in_off
- src_in
);
1345 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1346 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1347 src
+1+src_nparam
+src_in
,
1348 isl_min(dst_out
-out_off
, src_out
));
1349 if (dst_out
-out_off
> src_out
)
1350 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1351 dst_out
- out_off
- src_out
);
1352 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1353 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1354 src
+1+src_nparam
+src_in
+src_out
,
1355 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1356 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1357 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1358 div_off
+src_map
->n_div
,
1359 dst_map
->n_div
- div_off
- src_map
->n_div
);
1362 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1363 struct isl_basic_map
*src_map
, isl_int
*src
,
1364 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1366 isl_int_set(dst
[0], src
[0]);
1367 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1370 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1371 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1376 if (!bmap1
|| !bmap2
)
1379 div_off
= bmap1
->n_div
;
1381 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1382 int i1
= isl_basic_map_alloc_equality(bmap1
);
1385 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1386 i_pos
, o_pos
, div_off
);
1389 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1390 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1393 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1394 i_pos
, o_pos
, div_off
);
1397 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1398 int i1
= isl_basic_map_alloc_div(bmap1
);
1401 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1402 i_pos
, o_pos
, div_off
);
1405 isl_basic_map_free(bmap2
);
1410 isl_basic_map_free(bmap1
);
1411 isl_basic_map_free(bmap2
);
1415 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1416 struct isl_basic_set
*bset2
, unsigned pos
)
1418 return (struct isl_basic_set
*)
1419 add_constraints((struct isl_basic_map
*)bset1
,
1420 (struct isl_basic_map
*)bset2
, 0, pos
);
1423 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1424 __isl_take isl_space
*dim
, unsigned extra
,
1425 unsigned n_eq
, unsigned n_ineq
)
1427 struct isl_basic_map
*ext
;
1437 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1438 base
->extra
>= base
->n_div
+ extra
;
1440 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1441 room_for_ineq(base
, n_ineq
)) {
1442 isl_space_free(dim
);
1446 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1447 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1448 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1449 extra
+= base
->extra
;
1451 n_ineq
+= base
->n_ineq
;
1453 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1459 ext
->sample
= isl_vec_copy(base
->sample
);
1460 flags
= base
->flags
;
1461 ext
= add_constraints(ext
, base
, 0, 0);
1464 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1470 isl_space_free(dim
);
1471 isl_basic_map_free(base
);
1475 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1476 __isl_take isl_space
*dim
, unsigned extra
,
1477 unsigned n_eq
, unsigned n_ineq
)
1479 return (struct isl_basic_set
*)
1480 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1481 extra
, n_eq
, n_ineq
);
1484 struct isl_basic_map
*isl_basic_map_extend_constraints(
1485 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1489 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1493 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1494 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1495 unsigned n_eq
, unsigned n_ineq
)
1497 struct isl_basic_map
*bmap
;
1502 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1506 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1509 isl_basic_map_free(base
);
1513 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1514 unsigned nparam
, unsigned dim
, unsigned extra
,
1515 unsigned n_eq
, unsigned n_ineq
)
1517 return (struct isl_basic_set
*)
1518 isl_basic_map_extend((struct isl_basic_map
*)base
,
1519 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1522 struct isl_basic_set
*isl_basic_set_extend_constraints(
1523 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1525 return (struct isl_basic_set
*)
1526 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1530 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1532 return (struct isl_basic_set
*)
1533 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1536 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1541 if (bmap
->ref
> 1) {
1543 bmap
= isl_basic_map_dup(bmap
);
1546 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1550 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1558 return isl_set_dup(set
);
1561 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1569 return isl_map_dup(map
);
1572 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1573 unsigned a_len
, unsigned b_len
)
1575 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1576 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1577 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1580 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1581 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1589 isl_assert(bmap
->ctx
,
1590 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1592 if (n1
== 0 || n2
== 0)
1595 bmap
= isl_basic_map_cow(bmap
);
1599 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1600 if (isl_blk_is_error(blk
))
1603 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1605 bmap
->eq
[i
] + pos
, n1
, n2
);
1607 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1609 bmap
->ineq
[i
] + pos
, n1
, n2
);
1611 for (i
= 0; i
< bmap
->n_div
; ++i
)
1613 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1615 isl_blk_free(bmap
->ctx
, blk
);
1617 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1618 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1619 return isl_basic_map_finalize(bmap
);
1621 isl_basic_map_free(bmap
);
1625 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1626 __isl_take isl_basic_set
*bset
, unsigned n
)
1634 nparam
= isl_basic_set_n_param(bset
);
1635 dim
= isl_basic_set_n_dim(bset
);
1636 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1638 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1640 isl_basic_set_free(bset
);
1644 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1650 total
= isl_basic_map_total_dim(bmap
);
1651 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1652 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1654 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1656 i
= isl_basic_map_alloc_equality(bmap
);
1660 isl_int_set_si(bmap
->eq
[i
][0], 1);
1661 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1662 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1663 isl_vec_free(bmap
->sample
);
1664 bmap
->sample
= NULL
;
1665 return isl_basic_map_finalize(bmap
);
1667 isl_basic_map_free(bmap
);
1671 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1673 return (struct isl_basic_set
*)
1674 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1677 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1680 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1682 isl_int
*t
= bmap
->div
[a
];
1683 bmap
->div
[a
] = bmap
->div
[b
];
1687 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1688 * div definitions accordingly.
1690 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1693 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1695 swap_div(bmap
, a
, b
);
1697 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1698 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1700 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1701 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1703 for (i
= 0; i
< bmap
->n_div
; ++i
)
1704 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1705 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1708 /* Eliminate the specified n dimensions starting at first from the
1709 * constraints, without removing the dimensions from the space.
1710 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1712 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1713 enum isl_dim_type type
, unsigned first
, unsigned n
)
1722 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1723 isl_die(map
->ctx
, isl_error_invalid
,
1724 "index out of bounds", goto error
);
1726 map
= isl_map_cow(map
);
1730 for (i
= 0; i
< map
->n
; ++i
) {
1731 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1741 /* Eliminate the specified n dimensions starting at first from the
1742 * constraints, without removing the dimensions from the space.
1743 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1745 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1746 enum isl_dim_type type
, unsigned first
, unsigned n
)
1748 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1751 /* Eliminate the specified n dimensions starting at first from the
1752 * constraints, without removing the dimensions from the space.
1753 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1755 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1756 unsigned first
, unsigned n
)
1758 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1761 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1762 __isl_take isl_basic_map
*bmap
)
1766 bmap
= isl_basic_map_eliminate_vars(bmap
,
1767 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1771 return isl_basic_map_finalize(bmap
);
1774 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1775 __isl_take isl_basic_set
*bset
)
1777 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1778 (struct isl_basic_map
*)bset
);
1781 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1790 map
= isl_map_cow(map
);
1794 for (i
= 0; i
< map
->n
; ++i
) {
1795 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1805 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1807 return isl_map_remove_divs(set
);
1810 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1811 enum isl_dim_type type
, unsigned first
, unsigned n
)
1815 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1817 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1819 bmap
= isl_basic_map_eliminate_vars(bmap
,
1820 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1823 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1825 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1828 isl_basic_map_free(bmap
);
1832 /* Return true if the definition of the given div (recursively) involves
1833 * any of the given variables.
1835 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1836 unsigned first
, unsigned n
)
1839 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1841 if (isl_int_is_zero(bmap
->div
[div
][0]))
1843 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1846 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1847 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1849 if (div_involves_vars(bmap
, i
, first
, n
))
1856 /* Try and add a lower and/or upper bound on "div" to "bmap"
1857 * based on inequality "i".
1858 * "total" is the total number of variables (excluding the divs).
1859 * "v" is a temporary object that can be used during the calculations.
1860 * If "lb" is set, then a lower bound should be constructed.
1861 * If "ub" is set, then an upper bound should be constructed.
1863 * The calling function has already checked that the inequality does not
1864 * reference "div", but we still need to check that the inequality is
1865 * of the right form. We'll consider the case where we want to construct
1866 * a lower bound. The construction of upper bounds is similar.
1868 * Let "div" be of the form
1870 * q = floor((a + f(x))/d)
1872 * We essentially check if constraint "i" is of the form
1876 * so that we can use it to derive a lower bound on "div".
1877 * However, we allow a slightly more general form
1881 * with the condition that the coefficients of g(x) - f(x) are all
1883 * Rewriting this constraint as
1887 * adding a + f(x) to both sides and dividing by d, we obtain
1889 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1891 * Taking the floor on both sides, we obtain
1893 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1897 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1899 * In the case of an upper bound, we construct the constraint
1901 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1904 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1905 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1906 unsigned total
, isl_int v
, int lb
, int ub
)
1910 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1912 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1913 bmap
->div
[div
][1 + 1 + j
]);
1914 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1917 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1918 bmap
->div
[div
][1 + 1 + j
]);
1919 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1925 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1927 int k
= isl_basic_map_alloc_inequality(bmap
);
1930 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1931 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1932 bmap
->div
[div
][1 + j
]);
1933 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1934 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1936 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1939 int k
= isl_basic_map_alloc_inequality(bmap
);
1942 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1943 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1944 bmap
->div
[div
][1 + j
]);
1945 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1946 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1948 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1953 isl_basic_map_free(bmap
);
1957 /* This function is called right before "div" is eliminated from "bmap"
1958 * using Fourier-Motzkin.
1959 * Look through the constraints of "bmap" for constraints on the argument
1960 * of the integer division and use them to construct constraints on the
1961 * integer division itself. These constraints can then be combined
1962 * during the Fourier-Motzkin elimination.
1963 * Note that it is only useful to introduce lower bounds on "div"
1964 * if "bmap" already contains upper bounds on "div" as the newly
1965 * introduce lower bounds can then be combined with the pre-existing
1966 * upper bounds. Similarly for upper bounds.
1967 * We therefore first check if "bmap" contains any lower and/or upper bounds
1970 * It is interesting to note that the introduction of these constraints
1971 * can indeed lead to more accurate results, even when compared to
1972 * deriving constraints on the argument of "div" from constraints on "div".
1973 * Consider, for example, the set
1975 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1977 * The second constraint can be rewritten as
1979 * 2 * [(-i-2j+3)/4] + k >= 0
1981 * from which we can derive
1983 * -i - 2j + 3 >= -2k
1989 * Combined with the first constraint, we obtain
1991 * -3 <= 3 + 2k or k >= -3
1993 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1994 * the first constraint, we obtain
1996 * [(i + 2j)/4] >= [-3/4] = -1
1998 * Combining this constraint with the second constraint, we obtain
2002 static __isl_give isl_basic_map
*insert_bounds_on_div(
2003 __isl_take isl_basic_map
*bmap
, int div
)
2006 int check_lb
, check_ub
;
2013 if (isl_int_is_zero(bmap
->div
[div
][0]))
2016 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2020 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2021 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2028 if (!check_lb
&& !check_ub
)
2033 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2034 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2037 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2038 check_lb
, check_ub
);
2046 /* Remove all divs (recursively) involving any of the given dimensions
2047 * in their definitions.
2049 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2050 __isl_take isl_basic_map
*bmap
,
2051 enum isl_dim_type type
, unsigned first
, unsigned n
)
2057 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2059 first
+= isl_basic_map_offset(bmap
, type
);
2061 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2062 if (!div_involves_vars(bmap
, i
, first
, n
))
2064 bmap
= insert_bounds_on_div(bmap
, i
);
2065 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2073 isl_basic_map_free(bmap
);
2077 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2078 __isl_take isl_basic_set
*bset
,
2079 enum isl_dim_type type
, unsigned first
, unsigned n
)
2081 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2084 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2085 enum isl_dim_type type
, unsigned first
, unsigned n
)
2094 map
= isl_map_cow(map
);
2098 for (i
= 0; i
< map
->n
; ++i
) {
2099 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2110 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2111 enum isl_dim_type type
, unsigned first
, unsigned n
)
2113 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2117 /* Does the desciption of "bmap" depend on the specified dimensions?
2118 * We also check whether the dimensions appear in any of the div definitions.
2119 * In principle there is no need for this check. If the dimensions appear
2120 * in a div definition, they also appear in the defining constraints of that
2123 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2124 enum isl_dim_type type
, unsigned first
, unsigned n
)
2131 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2132 isl_die(bmap
->ctx
, isl_error_invalid
,
2133 "index out of bounds", return -1);
2135 first
+= isl_basic_map_offset(bmap
, type
);
2136 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2137 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2139 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2140 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2142 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2143 if (isl_int_is_zero(bmap
->div
[i
][0]))
2145 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2152 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2153 enum isl_dim_type type
, unsigned first
, unsigned n
)
2160 if (first
+ n
> isl_map_dim(map
, type
))
2161 isl_die(map
->ctx
, isl_error_invalid
,
2162 "index out of bounds", return -1);
2164 for (i
= 0; i
< map
->n
; ++i
) {
2165 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2167 if (involves
< 0 || involves
)
2174 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2175 enum isl_dim_type type
, unsigned first
, unsigned n
)
2177 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2180 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2181 enum isl_dim_type type
, unsigned first
, unsigned n
)
2183 return isl_map_involves_dims(set
, type
, first
, n
);
2186 /* Return true if the definition of the given div is unknown or depends
2189 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2192 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2194 if (isl_int_is_zero(bmap
->div
[div
][0]))
2197 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2198 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2200 if (div_is_unknown(bmap
, i
))
2207 /* Remove all divs that are unknown or defined in terms of unknown divs.
2209 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2210 __isl_take isl_basic_map
*bmap
)
2217 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2218 if (!div_is_unknown(bmap
, i
))
2220 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2229 /* Remove all divs that are unknown or defined in terms of unknown divs.
2231 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2232 __isl_take isl_basic_set
*bset
)
2234 return isl_basic_map_remove_unknown_divs(bset
);
2237 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2246 map
= isl_map_cow(map
);
2250 for (i
= 0; i
< map
->n
; ++i
) {
2251 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2261 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2263 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2266 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2267 __isl_take isl_basic_set
*bset
,
2268 enum isl_dim_type type
, unsigned first
, unsigned n
)
2270 return (isl_basic_set
*)
2271 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2274 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2275 enum isl_dim_type type
, unsigned first
, unsigned n
)
2282 map
= isl_map_cow(map
);
2285 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2287 for (i
= 0; i
< map
->n
; ++i
) {
2288 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2289 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2293 map
= isl_map_drop(map
, type
, first
, n
);
2300 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2301 enum isl_dim_type type
, unsigned first
, unsigned n
)
2303 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2306 /* Project out n inputs starting at first using Fourier-Motzkin */
2307 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2308 unsigned first
, unsigned n
)
2310 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2313 static void dump_term(struct isl_basic_map
*bmap
,
2314 isl_int c
, int pos
, FILE *out
)
2317 unsigned in
= isl_basic_map_n_in(bmap
);
2318 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2319 unsigned nparam
= isl_basic_map_n_param(bmap
);
2321 isl_int_print(out
, c
, 0);
2323 if (!isl_int_is_one(c
))
2324 isl_int_print(out
, c
, 0);
2325 if (pos
< 1 + nparam
) {
2326 name
= isl_space_get_dim_name(bmap
->dim
,
2327 isl_dim_param
, pos
- 1);
2329 fprintf(out
, "%s", name
);
2331 fprintf(out
, "p%d", pos
- 1);
2332 } else if (pos
< 1 + nparam
+ in
)
2333 fprintf(out
, "i%d", pos
- 1 - nparam
);
2334 else if (pos
< 1 + nparam
+ dim
)
2335 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2337 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2341 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2342 int sign
, FILE *out
)
2346 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2350 for (i
= 0, first
= 1; i
< len
; ++i
) {
2351 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2354 fprintf(out
, " + ");
2356 isl_int_abs(v
, c
[i
]);
2357 dump_term(bmap
, v
, i
, out
);
2364 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2365 const char *op
, FILE *out
, int indent
)
2369 fprintf(out
, "%*s", indent
, "");
2371 dump_constraint_sign(bmap
, c
, 1, out
);
2372 fprintf(out
, " %s ", op
);
2373 dump_constraint_sign(bmap
, c
, -1, out
);
2377 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2378 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2380 fprintf(out
, "%*s", indent
, "");
2381 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2386 static void dump_constraints(struct isl_basic_map
*bmap
,
2387 isl_int
**c
, unsigned n
,
2388 const char *op
, FILE *out
, int indent
)
2392 for (i
= 0; i
< n
; ++i
)
2393 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2396 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2400 unsigned total
= isl_basic_map_total_dim(bmap
);
2402 for (j
= 0; j
< 1 + total
; ++j
) {
2403 if (isl_int_is_zero(exp
[j
]))
2405 if (!first
&& isl_int_is_pos(exp
[j
]))
2407 dump_term(bmap
, exp
[j
], j
, out
);
2412 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2416 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2417 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2419 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2420 fprintf(out
, "%*s", indent
, "");
2421 fprintf(out
, "e%d = [(", i
);
2422 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2424 isl_int_print(out
, bmap
->div
[i
][0], 0);
2425 fprintf(out
, "]\n");
2429 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2430 FILE *out
, int indent
)
2433 fprintf(out
, "null basic set\n");
2437 fprintf(out
, "%*s", indent
, "");
2438 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2439 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2440 bset
->extra
, bset
->flags
);
2441 dump((struct isl_basic_map
*)bset
, out
, indent
);
2444 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2445 FILE *out
, int indent
)
2448 fprintf(out
, "null basic map\n");
2452 fprintf(out
, "%*s", indent
, "");
2453 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2454 "flags: %x, n_name: %d\n",
2456 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2457 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2458 dump(bmap
, out
, indent
);
2461 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2466 total
= isl_basic_map_total_dim(bmap
);
2467 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2468 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2469 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2470 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2474 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2477 struct isl_set
*set
;
2481 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2482 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2483 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2484 sizeof(struct isl_set
) +
2485 (n
- 1) * sizeof(struct isl_basic_set
*));
2489 set
->ctx
= dim
->ctx
;
2490 isl_ctx_ref(set
->ctx
);
2498 isl_space_free(dim
);
2502 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2503 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2505 struct isl_set
*set
;
2508 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2512 set
= isl_set_alloc_space(dims
, n
, flags
);
2516 /* Make sure "map" has room for at least "n" more basic maps.
2518 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2521 struct isl_map
*grown
= NULL
;
2525 isl_assert(map
->ctx
, n
>= 0, goto error
);
2526 if (map
->n
+ n
<= map
->size
)
2528 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2531 for (i
= 0; i
< map
->n
; ++i
) {
2532 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2540 isl_map_free(grown
);
2545 /* Make sure "set" has room for at least "n" more basic sets.
2547 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2549 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2552 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2555 struct isl_set
*dup
;
2560 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2563 for (i
= 0; i
< set
->n
; ++i
)
2564 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2568 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2570 return isl_map_from_basic_map(bset
);
2573 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2575 struct isl_map
*map
;
2580 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2581 return isl_map_add_basic_map(map
, bmap
);
2584 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2585 __isl_take isl_basic_set
*bset
)
2587 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2588 (struct isl_basic_map
*)bset
);
2591 void *isl_set_free(__isl_take isl_set
*set
)
2601 isl_ctx_deref(set
->ctx
);
2602 for (i
= 0; i
< set
->n
; ++i
)
2603 isl_basic_set_free(set
->p
[i
]);
2604 isl_space_free(set
->dim
);
2610 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2615 fprintf(out
, "null set\n");
2619 fprintf(out
, "%*s", indent
, "");
2620 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2621 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2623 for (i
= 0; i
< set
->n
; ++i
) {
2624 fprintf(out
, "%*s", indent
, "");
2625 fprintf(out
, "basic set %d:\n", i
);
2626 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2630 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2635 fprintf(out
, "null map\n");
2639 fprintf(out
, "%*s", indent
, "");
2640 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2641 "flags: %x, n_name: %d\n",
2642 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2643 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2644 for (i
= 0; i
< map
->n
; ++i
) {
2645 fprintf(out
, "%*s", indent
, "");
2646 fprintf(out
, "basic map %d:\n", i
);
2647 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2651 struct isl_basic_map
*isl_basic_map_intersect_domain(
2652 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2654 struct isl_basic_map
*bmap_domain
;
2659 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2660 bset
->dim
, isl_dim_param
), goto error
);
2662 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2663 isl_assert(bset
->ctx
,
2664 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2666 bmap
= isl_basic_map_cow(bmap
);
2669 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2670 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2671 bmap_domain
= isl_basic_map_from_domain(bset
);
2672 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2674 bmap
= isl_basic_map_simplify(bmap
);
2675 return isl_basic_map_finalize(bmap
);
2677 isl_basic_map_free(bmap
);
2678 isl_basic_set_free(bset
);
2682 struct isl_basic_map
*isl_basic_map_intersect_range(
2683 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2685 struct isl_basic_map
*bmap_range
;
2690 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2691 bset
->dim
, isl_dim_param
), goto error
);
2693 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2694 isl_assert(bset
->ctx
,
2695 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2697 if (isl_basic_set_is_universe(bset
)) {
2698 isl_basic_set_free(bset
);
2702 bmap
= isl_basic_map_cow(bmap
);
2705 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2706 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2707 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2708 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2710 bmap
= isl_basic_map_simplify(bmap
);
2711 return isl_basic_map_finalize(bmap
);
2713 isl_basic_map_free(bmap
);
2714 isl_basic_set_free(bset
);
2718 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2724 total
= 1 + isl_basic_map_total_dim(bmap
);
2725 if (total
!= vec
->size
)
2730 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2731 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2732 if (!isl_int_is_zero(s
)) {
2738 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2739 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2740 if (isl_int_is_neg(s
)) {
2751 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2753 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2756 struct isl_basic_map
*isl_basic_map_intersect(
2757 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2759 struct isl_vec
*sample
= NULL
;
2761 if (!bmap1
|| !bmap2
)
2764 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2765 bmap2
->dim
, isl_dim_param
), goto error
);
2766 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2767 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2768 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2769 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2770 return isl_basic_map_intersect(bmap2
, bmap1
);
2772 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2773 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2774 isl_assert(bmap1
->ctx
,
2775 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2777 if (bmap1
->sample
&&
2778 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2779 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2780 sample
= isl_vec_copy(bmap1
->sample
);
2781 else if (bmap2
->sample
&&
2782 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2783 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2784 sample
= isl_vec_copy(bmap2
->sample
);
2786 bmap1
= isl_basic_map_cow(bmap1
);
2789 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2790 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2791 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2794 isl_vec_free(sample
);
2796 isl_vec_free(bmap1
->sample
);
2797 bmap1
->sample
= sample
;
2800 bmap1
= isl_basic_map_simplify(bmap1
);
2801 return isl_basic_map_finalize(bmap1
);
2804 isl_vec_free(sample
);
2805 isl_basic_map_free(bmap1
);
2806 isl_basic_map_free(bmap2
);
2810 struct isl_basic_set
*isl_basic_set_intersect(
2811 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2813 return (struct isl_basic_set
*)
2814 isl_basic_map_intersect(
2815 (struct isl_basic_map
*)bset1
,
2816 (struct isl_basic_map
*)bset2
);
2819 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2820 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2822 return isl_basic_set_intersect(bset1
, bset2
);
2825 /* Special case of isl_map_intersect, where both map1 and map2
2826 * are convex, without any divs and such that either map1 or map2
2827 * contains a single constraint. This constraint is then simply
2828 * added to the other map.
2830 static __isl_give isl_map
*map_intersect_add_constraint(
2831 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2833 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2834 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2835 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2836 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2838 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2839 return isl_map_intersect(map2
, map1
);
2841 isl_assert(map2
->ctx
,
2842 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2844 map1
= isl_map_cow(map1
);
2847 if (isl_map_plain_is_empty(map1
)) {
2851 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2852 if (map2
->p
[0]->n_eq
== 1)
2853 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2855 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2856 map2
->p
[0]->ineq
[0]);
2858 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2859 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2863 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2864 isl_basic_map_free(map1
->p
[0]);
2877 /* map2 may be either a parameter domain or a map living in the same
2880 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2881 __isl_take isl_map
*map2
)
2890 if ((isl_map_plain_is_empty(map1
) ||
2891 isl_map_plain_is_universe(map2
)) &&
2892 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2896 if ((isl_map_plain_is_empty(map2
) ||
2897 isl_map_plain_is_universe(map1
)) &&
2898 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2903 if (map1
->n
== 1 && map2
->n
== 1 &&
2904 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2905 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2906 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2907 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2908 return map_intersect_add_constraint(map1
, map2
);
2910 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2911 isl_space_dim(map2
->dim
, isl_dim_param
))
2912 isl_assert(map1
->ctx
,
2913 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2915 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2916 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2917 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2919 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2920 map1
->n
* map2
->n
, flags
);
2923 for (i
= 0; i
< map1
->n
; ++i
)
2924 for (j
= 0; j
< map2
->n
; ++j
) {
2925 struct isl_basic_map
*part
;
2926 part
= isl_basic_map_intersect(
2927 isl_basic_map_copy(map1
->p
[i
]),
2928 isl_basic_map_copy(map2
->p
[j
]));
2929 if (isl_basic_map_is_empty(part
) < 0)
2930 part
= isl_basic_map_free(part
);
2931 result
= isl_map_add_basic_map(result
, part
);
2944 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2945 __isl_take isl_map
*map2
)
2949 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2950 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2951 "spaces don't match", goto error
);
2952 return map_intersect_internal(map1
, map2
);
2959 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2960 __isl_take isl_map
*map2
)
2962 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2965 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2967 return (struct isl_set
*)
2968 isl_map_intersect((struct isl_map
*)set1
,
2969 (struct isl_map
*)set2
);
2972 /* map_intersect_internal accepts intersections
2973 * with parameter domains, so we can just call that function.
2975 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2976 __isl_take isl_set
*params
)
2978 return map_intersect_internal(map
, params
);
2981 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2982 __isl_take isl_map
*map2
)
2984 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2987 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2988 __isl_take isl_set
*params
)
2990 return isl_map_intersect_params(set
, params
);
2993 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2996 struct isl_basic_set
*bset
;
3001 bmap
= isl_basic_map_cow(bmap
);
3004 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3005 in
= isl_basic_map_n_in(bmap
);
3006 bset
= isl_basic_set_from_basic_map(bmap
);
3007 bset
= isl_basic_set_swap_vars(bset
, in
);
3008 return isl_basic_map_from_basic_set(bset
, dim
);
3011 static __isl_give isl_basic_map
*basic_map_space_reset(
3012 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3018 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3021 space
= isl_basic_map_get_space(bmap
);
3022 space
= isl_space_reset(space
, type
);
3023 bmap
= isl_basic_map_reset_space(bmap
, space
);
3027 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3028 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3029 unsigned pos
, unsigned n
)
3032 struct isl_basic_map
*res
;
3033 struct isl_dim_map
*dim_map
;
3034 unsigned total
, off
;
3035 enum isl_dim_type t
;
3038 return basic_map_space_reset(bmap
, type
);
3043 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3045 total
= isl_basic_map_total_dim(bmap
) + n
;
3046 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3048 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3050 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3052 unsigned size
= isl_basic_map_dim(bmap
, t
);
3053 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3055 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3056 pos
, size
- pos
, off
+ pos
+ n
);
3058 off
+= isl_space_dim(res_dim
, t
);
3060 isl_dim_map_div(dim_map
, bmap
, off
);
3062 res
= isl_basic_map_alloc_space(res_dim
,
3063 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3064 if (isl_basic_map_is_rational(bmap
))
3065 res
= isl_basic_map_set_rational(res
);
3066 if (isl_basic_map_plain_is_empty(bmap
)) {
3067 isl_basic_map_free(bmap
);
3068 return isl_basic_map_set_to_empty(res
);
3070 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3071 return isl_basic_map_finalize(res
);
3074 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3075 __isl_take isl_basic_set
*bset
,
3076 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3078 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3081 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3082 enum isl_dim_type type
, unsigned n
)
3086 return isl_basic_map_insert_dims(bmap
, type
,
3087 isl_basic_map_dim(bmap
, type
), n
);
3090 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3091 enum isl_dim_type type
, unsigned n
)
3095 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3096 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3098 isl_basic_set_free(bset
);
3102 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3103 enum isl_dim_type type
)
3107 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3110 space
= isl_map_get_space(map
);
3111 space
= isl_space_reset(space
, type
);
3112 map
= isl_map_reset_space(map
, space
);
3116 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3117 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3122 return map_space_reset(map
, type
);
3124 map
= isl_map_cow(map
);
3128 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3132 for (i
= 0; i
< map
->n
; ++i
) {
3133 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3144 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3145 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3147 return isl_map_insert_dims(set
, type
, pos
, n
);
3150 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3151 enum isl_dim_type type
, unsigned n
)
3155 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3158 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3159 enum isl_dim_type type
, unsigned n
)
3163 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3164 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3170 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3171 __isl_take isl_basic_map
*bmap
,
3172 enum isl_dim_type dst_type
, unsigned dst_pos
,
3173 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3175 struct isl_dim_map
*dim_map
;
3176 struct isl_basic_map
*res
;
3177 enum isl_dim_type t
;
3178 unsigned total
, off
;
3185 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3188 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3191 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3193 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3194 pos(bmap
->dim
, src_type
) + src_pos
+
3195 ((src_type
< dst_type
) ? n
: 0)) {
3196 bmap
= isl_basic_map_cow(bmap
);
3200 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3201 src_type
, src_pos
, n
);
3205 bmap
= isl_basic_map_finalize(bmap
);
3210 total
= isl_basic_map_total_dim(bmap
);
3211 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3214 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3215 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3216 if (t
== dst_type
) {
3217 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3220 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3223 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3224 dst_pos
, size
- dst_pos
, off
);
3225 off
+= size
- dst_pos
;
3226 } else if (t
== src_type
) {
3227 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3230 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3231 src_pos
+ n
, size
- src_pos
- n
, off
);
3232 off
+= size
- src_pos
- n
;
3234 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3238 isl_dim_map_div(dim_map
, bmap
, off
);
3240 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3241 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3242 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3246 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3247 src_type
, src_pos
, n
);
3251 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3252 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3253 bmap
= isl_basic_map_finalize(bmap
);
3257 isl_basic_map_free(bmap
);
3261 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3262 enum isl_dim_type dst_type
, unsigned dst_pos
,
3263 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3265 return (isl_basic_set
*)isl_basic_map_move_dims(
3266 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3269 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3270 enum isl_dim_type dst_type
, unsigned dst_pos
,
3271 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3275 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3276 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3277 src_type
, src_pos
, n
);
3283 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3284 enum isl_dim_type dst_type
, unsigned dst_pos
,
3285 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3294 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3297 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3300 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3302 map
= isl_map_cow(map
);
3306 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3310 for (i
= 0; i
< map
->n
; ++i
) {
3311 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3313 src_type
, src_pos
, n
);
3324 /* Move the specified dimensions to the last columns right before
3325 * the divs. Don't change the dimension specification of bmap.
3326 * That's the responsibility of the caller.
3328 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3329 enum isl_dim_type type
, unsigned first
, unsigned n
)
3331 struct isl_dim_map
*dim_map
;
3332 struct isl_basic_map
*res
;
3333 enum isl_dim_type t
;
3334 unsigned total
, off
;
3338 if (pos(bmap
->dim
, type
) + first
+ n
==
3339 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3342 total
= isl_basic_map_total_dim(bmap
);
3343 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3346 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3347 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3349 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3352 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3353 first
, n
, total
- bmap
->n_div
- n
);
3354 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3355 first
+ n
, size
- (first
+ n
), off
);
3356 off
+= size
- (first
+ n
);
3358 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3362 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3364 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3365 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3366 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3370 /* Insert "n" rows in the divs of "bmap".
3372 * The number of columns is not changed, which means that the last
3373 * dimensions of "bmap" are being reintepreted as the new divs.
3374 * The space of "bmap" is not adjusted, however, which means
3375 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3376 * from the space of "bmap" is the responsibility of the caller.
3378 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3386 bmap
= isl_basic_map_cow(bmap
);
3390 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3391 old
= bmap
->block2
.data
;
3392 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3393 (bmap
->extra
+ n
) * (1 + row_size
));
3394 if (!bmap
->block2
.data
)
3395 return isl_basic_map_free(bmap
);
3396 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3398 return isl_basic_map_free(bmap
);
3399 for (i
= 0; i
< n
; ++i
) {
3400 new_div
[i
] = bmap
->block2
.data
+
3401 (bmap
->extra
+ i
) * (1 + row_size
);
3402 isl_seq_clr(new_div
[i
], 1 + row_size
);
3404 for (i
= 0; i
< bmap
->extra
; ++i
)
3405 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3407 bmap
->div
= new_div
;
3414 /* Turn the n dimensions of type type, starting at first
3415 * into existentially quantified variables.
3417 __isl_give isl_basic_map
*isl_basic_map_project_out(
3418 __isl_take isl_basic_map
*bmap
,
3419 enum isl_dim_type type
, unsigned first
, unsigned n
)
3422 return basic_map_space_reset(bmap
, type
);
3427 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3428 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3430 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3433 bmap
= move_last(bmap
, type
, first
, n
);
3434 bmap
= isl_basic_map_cow(bmap
);
3435 bmap
= insert_div_rows(bmap
, n
);
3439 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3442 bmap
= isl_basic_map_simplify(bmap
);
3443 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3444 return isl_basic_map_finalize(bmap
);
3446 isl_basic_map_free(bmap
);
3450 /* Turn the n dimensions of type type, starting at first
3451 * into existentially quantified variables.
3453 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3454 enum isl_dim_type type
, unsigned first
, unsigned n
)
3456 return (isl_basic_set
*)isl_basic_map_project_out(
3457 (isl_basic_map
*)bset
, type
, first
, n
);
3460 /* Turn the n dimensions of type type, starting at first
3461 * into existentially quantified variables.
3463 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3464 enum isl_dim_type type
, unsigned first
, unsigned n
)
3472 return map_space_reset(map
, type
);
3474 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3476 map
= isl_map_cow(map
);
3480 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3484 for (i
= 0; i
< map
->n
; ++i
) {
3485 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3496 /* Turn the n dimensions of type type, starting at first
3497 * into existentially quantified variables.
3499 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3500 enum isl_dim_type type
, unsigned first
, unsigned n
)
3502 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3505 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3509 for (i
= 0; i
< n
; ++i
) {
3510 j
= isl_basic_map_alloc_div(bmap
);
3513 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3517 isl_basic_map_free(bmap
);
3521 struct isl_basic_map
*isl_basic_map_apply_range(
3522 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3524 isl_space
*dim_result
= NULL
;
3525 struct isl_basic_map
*bmap
;
3526 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3527 struct isl_dim_map
*dim_map1
, *dim_map2
;
3529 if (!bmap1
|| !bmap2
)
3532 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3533 isl_space_copy(bmap2
->dim
));
3535 n_in
= isl_basic_map_n_in(bmap1
);
3536 n_out
= isl_basic_map_n_out(bmap2
);
3537 n
= isl_basic_map_n_out(bmap1
);
3538 nparam
= isl_basic_map_n_param(bmap1
);
3540 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3541 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3542 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3543 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3544 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3545 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3546 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3547 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3548 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3549 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3550 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3552 bmap
= isl_basic_map_alloc_space(dim_result
,
3553 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3554 bmap1
->n_eq
+ bmap2
->n_eq
,
3555 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3556 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3557 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3558 bmap
= add_divs(bmap
, n
);
3559 bmap
= isl_basic_map_simplify(bmap
);
3560 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3561 return isl_basic_map_finalize(bmap
);
3563 isl_basic_map_free(bmap1
);
3564 isl_basic_map_free(bmap2
);
3568 struct isl_basic_set
*isl_basic_set_apply(
3569 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3574 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3577 return (struct isl_basic_set
*)
3578 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3580 isl_basic_set_free(bset
);
3581 isl_basic_map_free(bmap
);
3585 struct isl_basic_map
*isl_basic_map_apply_domain(
3586 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3588 if (!bmap1
|| !bmap2
)
3591 isl_assert(bmap1
->ctx
,
3592 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3593 isl_assert(bmap1
->ctx
,
3594 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3597 bmap1
= isl_basic_map_reverse(bmap1
);
3598 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3599 return isl_basic_map_reverse(bmap1
);
3601 isl_basic_map_free(bmap1
);
3602 isl_basic_map_free(bmap2
);
3606 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3607 * A \cap B -> f(A) + f(B)
3609 struct isl_basic_map
*isl_basic_map_sum(
3610 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3612 unsigned n_in
, n_out
, nparam
, total
, pos
;
3613 struct isl_basic_map
*bmap
= NULL
;
3614 struct isl_dim_map
*dim_map1
, *dim_map2
;
3617 if (!bmap1
|| !bmap2
)
3620 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3623 nparam
= isl_basic_map_n_param(bmap1
);
3624 n_in
= isl_basic_map_n_in(bmap1
);
3625 n_out
= isl_basic_map_n_out(bmap1
);
3627 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3628 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3629 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3630 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3631 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3632 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3633 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3634 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3635 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3636 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3637 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3639 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3640 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3641 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3642 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3643 for (i
= 0; i
< n_out
; ++i
) {
3644 int j
= isl_basic_map_alloc_equality(bmap
);
3647 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3648 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3649 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3650 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3652 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3653 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3654 bmap
= add_divs(bmap
, 2 * n_out
);
3656 bmap
= isl_basic_map_simplify(bmap
);
3657 return isl_basic_map_finalize(bmap
);
3659 isl_basic_map_free(bmap
);
3660 isl_basic_map_free(bmap1
);
3661 isl_basic_map_free(bmap2
);
3665 /* Given two maps A -> f(A) and B -> g(B), construct a map
3666 * A \cap B -> f(A) + f(B)
3668 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3670 struct isl_map
*result
;
3676 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3678 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3679 map1
->n
* map2
->n
, 0);
3682 for (i
= 0; i
< map1
->n
; ++i
)
3683 for (j
= 0; j
< map2
->n
; ++j
) {
3684 struct isl_basic_map
*part
;
3685 part
= isl_basic_map_sum(
3686 isl_basic_map_copy(map1
->p
[i
]),
3687 isl_basic_map_copy(map2
->p
[j
]));
3688 if (isl_basic_map_is_empty(part
))
3689 isl_basic_map_free(part
);
3691 result
= isl_map_add_basic_map(result
, part
);
3704 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3705 __isl_take isl_set
*set2
)
3707 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3710 /* Given a basic map A -> f(A), construct A -> -f(A).
3712 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3717 bmap
= isl_basic_map_cow(bmap
);
3721 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3722 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3723 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3724 for (j
= 0; j
< n
; ++j
)
3725 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3726 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3727 for (j
= 0; j
< n
; ++j
)
3728 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3729 for (i
= 0; i
< bmap
->n_div
; ++i
)
3730 for (j
= 0; j
< n
; ++j
)
3731 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3732 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3733 return isl_basic_map_finalize(bmap
);
3736 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3738 return isl_basic_map_neg(bset
);
3741 /* Given a map A -> f(A), construct A -> -f(A).
3743 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3747 map
= isl_map_cow(map
);
3751 for (i
= 0; i
< map
->n
; ++i
) {
3752 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3763 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3765 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3768 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3769 * A -> floor(f(A)/d).
3771 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3774 unsigned n_in
, n_out
, nparam
, total
, pos
;
3775 struct isl_basic_map
*result
= NULL
;
3776 struct isl_dim_map
*dim_map
;
3782 nparam
= isl_basic_map_n_param(bmap
);
3783 n_in
= isl_basic_map_n_in(bmap
);
3784 n_out
= isl_basic_map_n_out(bmap
);
3786 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3787 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3788 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3789 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3790 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3791 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3793 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3794 bmap
->n_div
+ n_out
,
3795 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3796 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3797 result
= add_divs(result
, n_out
);
3798 for (i
= 0; i
< n_out
; ++i
) {
3800 j
= isl_basic_map_alloc_inequality(result
);
3803 isl_seq_clr(result
->ineq
[j
], 1+total
);
3804 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3805 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3806 j
= isl_basic_map_alloc_inequality(result
);
3809 isl_seq_clr(result
->ineq
[j
], 1+total
);
3810 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3811 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3812 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3815 result
= isl_basic_map_simplify(result
);
3816 return isl_basic_map_finalize(result
);
3818 isl_basic_map_free(result
);
3822 /* Given a map A -> f(A) and an integer d, construct a map
3823 * A -> floor(f(A)/d).
3825 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3829 map
= isl_map_cow(map
);
3833 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3834 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3835 for (i
= 0; i
< map
->n
; ++i
) {
3836 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3847 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3853 i
= isl_basic_map_alloc_equality(bmap
);
3856 nparam
= isl_basic_map_n_param(bmap
);
3857 n_in
= isl_basic_map_n_in(bmap
);
3858 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3859 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3860 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3861 return isl_basic_map_finalize(bmap
);
3863 isl_basic_map_free(bmap
);
3867 /* Add a constraints to "bmap" expressing i_pos < o_pos
3869 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3875 i
= isl_basic_map_alloc_inequality(bmap
);
3878 nparam
= isl_basic_map_n_param(bmap
);
3879 n_in
= isl_basic_map_n_in(bmap
);
3880 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3881 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3882 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3883 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3884 return isl_basic_map_finalize(bmap
);
3886 isl_basic_map_free(bmap
);
3890 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3892 static __isl_give isl_basic_map
*var_less_or_equal(
3893 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3899 i
= isl_basic_map_alloc_inequality(bmap
);
3902 nparam
= isl_basic_map_n_param(bmap
);
3903 n_in
= isl_basic_map_n_in(bmap
);
3904 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3905 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3906 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3907 return isl_basic_map_finalize(bmap
);
3909 isl_basic_map_free(bmap
);
3913 /* Add a constraints to "bmap" expressing i_pos > o_pos
3915 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3921 i
= isl_basic_map_alloc_inequality(bmap
);
3924 nparam
= isl_basic_map_n_param(bmap
);
3925 n_in
= isl_basic_map_n_in(bmap
);
3926 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3927 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3928 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3929 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3930 return isl_basic_map_finalize(bmap
);
3932 isl_basic_map_free(bmap
);
3936 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3938 static __isl_give isl_basic_map
*var_more_or_equal(
3939 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3945 i
= isl_basic_map_alloc_inequality(bmap
);
3948 nparam
= isl_basic_map_n_param(bmap
);
3949 n_in
= isl_basic_map_n_in(bmap
);
3950 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3951 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3952 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3953 return isl_basic_map_finalize(bmap
);
3955 isl_basic_map_free(bmap
);
3959 __isl_give isl_basic_map
*isl_basic_map_equal(
3960 __isl_take isl_space
*dim
, unsigned n_equal
)
3963 struct isl_basic_map
*bmap
;
3964 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3967 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3968 bmap
= var_equal(bmap
, i
);
3969 return isl_basic_map_finalize(bmap
);
3972 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3974 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3978 struct isl_basic_map
*bmap
;
3979 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3982 for (i
= 0; i
< pos
&& bmap
; ++i
)
3983 bmap
= var_equal(bmap
, i
);
3985 bmap
= var_less(bmap
, pos
);
3986 return isl_basic_map_finalize(bmap
);
3989 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3991 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3992 __isl_take isl_space
*dim
, unsigned pos
)
3995 isl_basic_map
*bmap
;
3997 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3998 for (i
= 0; i
< pos
; ++i
)
3999 bmap
= var_equal(bmap
, i
);
4000 bmap
= var_less_or_equal(bmap
, pos
);
4001 return isl_basic_map_finalize(bmap
);
4004 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4006 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4010 struct isl_basic_map
*bmap
;
4011 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4014 for (i
= 0; i
< pos
&& bmap
; ++i
)
4015 bmap
= var_equal(bmap
, i
);
4017 bmap
= var_more(bmap
, pos
);
4018 return isl_basic_map_finalize(bmap
);
4021 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4023 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4024 __isl_take isl_space
*dim
, unsigned pos
)
4027 isl_basic_map
*bmap
;
4029 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4030 for (i
= 0; i
< pos
; ++i
)
4031 bmap
= var_equal(bmap
, i
);
4032 bmap
= var_more_or_equal(bmap
, pos
);
4033 return isl_basic_map_finalize(bmap
);
4036 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4037 unsigned n
, int equal
)
4039 struct isl_map
*map
;
4042 if (n
== 0 && equal
)
4043 return isl_map_universe(dims
);
4045 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4047 for (i
= 0; i
+ 1 < n
; ++i
)
4048 map
= isl_map_add_basic_map(map
,
4049 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4052 map
= isl_map_add_basic_map(map
,
4053 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4055 map
= isl_map_add_basic_map(map
,
4056 isl_basic_map_less_at(dims
, n
- 1));
4058 isl_space_free(dims
);
4063 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4067 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4070 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4072 return map_lex_lte_first(dim
, n
, 0);
4075 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4077 return map_lex_lte_first(dim
, n
, 1);
4080 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4082 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4085 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4087 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4090 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4091 unsigned n
, int equal
)
4093 struct isl_map
*map
;
4096 if (n
== 0 && equal
)
4097 return isl_map_universe(dims
);
4099 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4101 for (i
= 0; i
+ 1 < n
; ++i
)
4102 map
= isl_map_add_basic_map(map
,
4103 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4106 map
= isl_map_add_basic_map(map
,
4107 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4109 map
= isl_map_add_basic_map(map
,
4110 isl_basic_map_more_at(dims
, n
- 1));
4112 isl_space_free(dims
);
4117 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4121 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4124 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4126 return map_lex_gte_first(dim
, n
, 0);
4129 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4131 return map_lex_gte_first(dim
, n
, 1);
4134 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4136 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4139 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4141 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4144 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4145 __isl_take isl_set
*set2
)
4148 map
= isl_map_lex_le(isl_set_get_space(set1
));
4149 map
= isl_map_intersect_domain(map
, set1
);
4150 map
= isl_map_intersect_range(map
, set2
);
4154 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4155 __isl_take isl_set
*set2
)
4158 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4159 map
= isl_map_intersect_domain(map
, set1
);
4160 map
= isl_map_intersect_range(map
, set2
);
4164 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4165 __isl_take isl_set
*set2
)
4168 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4169 map
= isl_map_intersect_domain(map
, set1
);
4170 map
= isl_map_intersect_range(map
, set2
);
4174 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4175 __isl_take isl_set
*set2
)
4178 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4179 map
= isl_map_intersect_domain(map
, set1
);
4180 map
= isl_map_intersect_range(map
, set2
);
4184 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4185 __isl_take isl_map
*map2
)
4188 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4189 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4190 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4194 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4195 __isl_take isl_map
*map2
)
4198 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4199 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4200 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4204 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4205 __isl_take isl_map
*map2
)
4208 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4209 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4210 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4214 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4215 __isl_take isl_map
*map2
)
4218 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4219 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4220 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4224 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4225 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4227 struct isl_basic_map
*bmap
;
4229 bset
= isl_basic_set_cow(bset
);
4233 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4234 isl_space_free(bset
->dim
);
4235 bmap
= (struct isl_basic_map
*) bset
;
4237 return isl_basic_map_finalize(bmap
);
4239 isl_basic_set_free(bset
);
4240 isl_space_free(dim
);
4244 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4248 if (bmap
->dim
->n_in
== 0)
4249 return (struct isl_basic_set
*)bmap
;
4250 bmap
= isl_basic_map_cow(bmap
);
4253 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4256 bmap
= isl_basic_map_finalize(bmap
);
4257 return (struct isl_basic_set
*)bmap
;
4259 isl_basic_map_free(bmap
);
4263 /* For a div d = floor(f/m), add the constraints
4266 * -(f-(n-1)) + m d >= 0
4268 * Note that the second constraint is the negation of
4272 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4273 unsigned pos
, isl_int
*div
)
4276 unsigned total
= isl_basic_map_total_dim(bmap
);
4278 i
= isl_basic_map_alloc_inequality(bmap
);
4281 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4282 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4284 j
= isl_basic_map_alloc_inequality(bmap
);
4287 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4288 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4289 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4293 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4294 unsigned pos
, isl_int
*div
)
4296 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4300 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4302 unsigned total
= isl_basic_map_total_dim(bmap
);
4303 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4305 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4309 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4311 return isl_basic_map_add_div_constraints(bset
, div
);
4314 struct isl_basic_set
*isl_basic_map_underlying_set(
4315 struct isl_basic_map
*bmap
)
4319 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4321 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4322 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4323 return (struct isl_basic_set
*)bmap
;
4324 bmap
= isl_basic_map_cow(bmap
);
4327 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4330 bmap
->extra
-= bmap
->n_div
;
4332 bmap
= isl_basic_map_finalize(bmap
);
4333 return (struct isl_basic_set
*)bmap
;
4335 isl_basic_map_free(bmap
);
4339 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4340 __isl_take isl_basic_set
*bset
)
4342 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4345 struct isl_basic_map
*isl_basic_map_overlying_set(
4346 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4348 struct isl_basic_map
*bmap
;
4349 struct isl_ctx
*ctx
;
4356 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4357 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4358 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4360 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4361 isl_basic_map_free(like
);
4362 return (struct isl_basic_map
*)bset
;
4364 bset
= isl_basic_set_cow(bset
);
4367 total
= bset
->dim
->n_out
+ bset
->extra
;
4368 bmap
= (struct isl_basic_map
*)bset
;
4369 isl_space_free(bmap
->dim
);
4370 bmap
->dim
= isl_space_copy(like
->dim
);
4373 bmap
->n_div
= like
->n_div
;
4374 bmap
->extra
+= like
->n_div
;
4378 ltotal
= total
- bmap
->extra
+ like
->extra
;
4381 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4382 bmap
->extra
* (1 + 1 + total
));
4383 if (isl_blk_is_error(bmap
->block2
))
4385 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4389 for (i
= 0; i
< bmap
->extra
; ++i
)
4390 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4391 for (i
= 0; i
< like
->n_div
; ++i
) {
4392 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4393 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4395 bmap
= isl_basic_map_extend_constraints(bmap
,
4396 0, 2 * like
->n_div
);
4397 for (i
= 0; i
< like
->n_div
; ++i
) {
4400 if (isl_int_is_zero(bmap
->div
[i
][0]))
4402 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4403 bmap
= isl_basic_map_free(bmap
);
4406 isl_basic_map_free(like
);
4407 bmap
= isl_basic_map_simplify(bmap
);
4408 bmap
= isl_basic_map_finalize(bmap
);
4411 isl_basic_map_free(like
);
4412 isl_basic_set_free(bset
);
4416 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4417 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4419 return (struct isl_basic_set
*)
4420 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4423 struct isl_set
*isl_set_from_underlying_set(
4424 struct isl_set
*set
, struct isl_basic_set
*like
)
4430 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4432 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4433 isl_basic_set_free(like
);
4436 set
= isl_set_cow(set
);
4439 for (i
= 0; i
< set
->n
; ++i
) {
4440 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4441 isl_basic_set_copy(like
));
4445 isl_space_free(set
->dim
);
4446 set
->dim
= isl_space_copy(like
->dim
);
4449 isl_basic_set_free(like
);
4452 isl_basic_set_free(like
);
4457 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4461 map
= isl_map_cow(map
);
4464 map
->dim
= isl_space_cow(map
->dim
);
4468 for (i
= 1; i
< map
->n
; ++i
)
4469 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4471 for (i
= 0; i
< map
->n
; ++i
) {
4472 map
->p
[i
] = (struct isl_basic_map
*)
4473 isl_basic_map_underlying_set(map
->p
[i
]);
4478 map
->dim
= isl_space_underlying(map
->dim
, 0);
4480 isl_space_free(map
->dim
);
4481 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4485 return (struct isl_set
*)map
;
4491 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4493 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4496 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4497 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4499 bmap
= isl_basic_map_cow(bmap
);
4503 isl_space_free(bmap
->dim
);
4506 bmap
= isl_basic_map_finalize(bmap
);
4510 isl_basic_map_free(bmap
);
4511 isl_space_free(dim
);
4515 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4516 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4518 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4522 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4523 __isl_take isl_space
*dim
)
4527 map
= isl_map_cow(map
);
4531 for (i
= 0; i
< map
->n
; ++i
) {
4532 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4533 isl_space_copy(dim
));
4537 isl_space_free(map
->dim
);
4543 isl_space_free(dim
);
4547 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4548 __isl_take isl_space
*dim
)
4550 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4553 /* Compute the parameter domain of the given basic set.
4555 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4560 if (isl_basic_set_is_params(bset
))
4563 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4564 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4565 space
= isl_basic_set_get_space(bset
);
4566 space
= isl_space_params(space
);
4567 bset
= isl_basic_set_reset_space(bset
, space
);
4571 /* Construct a zero-dimensional basic set with the given parameter domain.
4573 __isl_give isl_basic_set
*isl_basic_set_from_params(
4574 __isl_take isl_basic_set
*bset
)
4577 space
= isl_basic_set_get_space(bset
);
4578 space
= isl_space_set_from_params(space
);
4579 bset
= isl_basic_set_reset_space(bset
, space
);
4583 /* Compute the parameter domain of the given set.
4585 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4590 if (isl_set_is_params(set
))
4593 n
= isl_set_dim(set
, isl_dim_set
);
4594 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4595 space
= isl_set_get_space(set
);
4596 space
= isl_space_params(space
);
4597 set
= isl_set_reset_space(set
, space
);
4601 /* Construct a zero-dimensional set with the given parameter domain.
4603 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4606 space
= isl_set_get_space(set
);
4607 space
= isl_space_set_from_params(space
);
4608 set
= isl_set_reset_space(set
, space
);
4612 /* Compute the parameter domain of the given map.
4614 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4619 n
= isl_map_dim(map
, isl_dim_in
);
4620 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4621 n
= isl_map_dim(map
, isl_dim_out
);
4622 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4623 space
= isl_map_get_space(map
);
4624 space
= isl_space_params(space
);
4625 map
= isl_map_reset_space(map
, space
);
4629 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4632 struct isl_basic_set
*domain
;
4638 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4640 n_in
= isl_basic_map_n_in(bmap
);
4641 n_out
= isl_basic_map_n_out(bmap
);
4642 domain
= isl_basic_set_from_basic_map(bmap
);
4643 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4645 domain
= isl_basic_set_reset_space(domain
, dim
);
4650 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4654 return isl_space_may_be_set(bmap
->dim
);
4657 /* Is this basic map actually a set?
4658 * Users should never call this function. Outside of isl,
4659 * the type should indicate whether something is a set or a map.
4661 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4665 return isl_space_is_set(bmap
->dim
);
4668 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4672 if (isl_basic_map_is_set(bmap
))
4674 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4677 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4678 __isl_take isl_basic_map
*bmap
)
4682 isl_basic_map
*domain
;
4683 int nparam
, n_in
, n_out
;
4686 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4687 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4688 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4690 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4691 domain
= isl_basic_map_universe(dim
);
4693 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4694 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4695 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4697 total
= isl_basic_map_total_dim(bmap
);
4699 for (i
= 0; i
< n_in
; ++i
) {
4700 k
= isl_basic_map_alloc_equality(bmap
);
4703 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4704 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4705 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4708 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4709 return isl_basic_map_finalize(bmap
);
4711 isl_basic_map_free(bmap
);
4715 __isl_give isl_basic_map
*isl_basic_map_range_map(
4716 __isl_take isl_basic_map
*bmap
)
4720 isl_basic_map
*range
;
4721 int nparam
, n_in
, n_out
;
4724 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4725 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4726 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4728 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4729 range
= isl_basic_map_universe(dim
);
4731 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4732 bmap
= isl_basic_map_apply_range(bmap
, range
);
4733 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4735 total
= isl_basic_map_total_dim(bmap
);
4737 for (i
= 0; i
< n_out
; ++i
) {
4738 k
= isl_basic_map_alloc_equality(bmap
);
4741 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4742 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4743 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4746 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4747 return isl_basic_map_finalize(bmap
);
4749 isl_basic_map_free(bmap
);
4753 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4757 return isl_space_may_be_set(map
->dim
);
4760 /* Is this map actually a set?
4761 * Users should never call this function. Outside of isl,
4762 * the type should indicate whether something is a set or a map.
4764 int isl_map_is_set(__isl_keep isl_map
*map
)
4768 return isl_space_is_set(map
->dim
);
4771 struct isl_set
*isl_map_range(struct isl_map
*map
)
4774 struct isl_set
*set
;
4778 if (isl_map_is_set(map
))
4779 return (isl_set
*)map
;
4781 map
= isl_map_cow(map
);
4785 set
= (struct isl_set
*) map
;
4786 set
->dim
= isl_space_range(set
->dim
);
4789 for (i
= 0; i
< map
->n
; ++i
) {
4790 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4794 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4795 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4802 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4805 isl_space
*domain_dim
;
4807 map
= isl_map_cow(map
);
4811 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4812 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4813 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4816 for (i
= 0; i
< map
->n
; ++i
) {
4817 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4821 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4822 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4829 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4832 isl_space
*range_dim
;
4834 map
= isl_map_cow(map
);
4838 range_dim
= isl_space_range(isl_map_get_space(map
));
4839 range_dim
= isl_space_from_range(range_dim
);
4840 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4841 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4844 for (i
= 0; i
< map
->n
; ++i
) {
4845 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4849 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4850 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4857 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4858 __isl_take isl_space
*dim
)
4861 struct isl_map
*map
= NULL
;
4863 set
= isl_set_cow(set
);
4866 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4867 map
= (struct isl_map
*)set
;
4868 for (i
= 0; i
< set
->n
; ++i
) {
4869 map
->p
[i
] = isl_basic_map_from_basic_set(
4870 set
->p
[i
], isl_space_copy(dim
));
4874 isl_space_free(map
->dim
);
4878 isl_space_free(dim
);
4883 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4884 __isl_take isl_basic_set
*bset
)
4886 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4889 __isl_give isl_basic_map
*isl_basic_map_from_range(
4890 __isl_take isl_basic_set
*bset
)
4893 space
= isl_basic_set_get_space(bset
);
4894 space
= isl_space_from_range(space
);
4895 bset
= isl_basic_set_reset_space(bset
, space
);
4896 return (isl_basic_map
*)bset
;
4899 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4902 space
= isl_set_get_space(set
);
4903 space
= isl_space_from_range(space
);
4904 set
= isl_set_reset_space(set
, space
);
4905 return (struct isl_map
*)set
;
4908 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4910 return isl_map_reverse(isl_map_from_range(set
));
4913 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4914 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4916 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4919 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4920 __isl_take isl_set
*range
)
4922 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4925 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4928 struct isl_set
*set
= NULL
;
4932 map
= isl_map_cow(map
);
4935 map
->dim
= isl_space_as_set_space(map
->dim
);
4938 set
= (struct isl_set
*)map
;
4939 for (i
= 0; i
< map
->n
; ++i
) {
4940 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4950 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4953 struct isl_map
*map
;
4958 isl_die(dim
->ctx
, isl_error_internal
,
4959 "negative number of basic maps", goto error
);
4960 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4961 sizeof(struct isl_map
) +
4962 (n
- 1) * sizeof(struct isl_basic_map
*));
4966 map
->ctx
= dim
->ctx
;
4967 isl_ctx_ref(map
->ctx
);
4975 isl_space_free(dim
);
4979 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4980 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4983 struct isl_map
*map
;
4986 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4990 map
= isl_map_alloc_space(dims
, n
, flags
);
4994 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4996 struct isl_basic_map
*bmap
;
4997 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4998 bmap
= isl_basic_map_set_to_empty(bmap
);
5002 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5004 struct isl_basic_set
*bset
;
5005 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5006 bset
= isl_basic_set_set_to_empty(bset
);
5010 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5012 struct isl_basic_map
*bmap
;
5015 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5016 bmap
= isl_basic_map_set_to_empty(bmap
);
5020 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5022 struct isl_basic_map
*bmap
;
5025 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5026 bmap
= isl_basic_map_set_to_empty(bmap
);
5030 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5032 struct isl_basic_set
*bset
;
5035 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5036 bset
= isl_basic_set_set_to_empty(bset
);
5040 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5042 struct isl_basic_map
*bmap
;
5043 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5044 bmap
= isl_basic_map_finalize(bmap
);
5048 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5050 struct isl_basic_set
*bset
;
5051 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5052 bset
= isl_basic_set_finalize(bset
);
5056 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5059 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5060 isl_basic_map
*bmap
;
5062 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5063 for (i
= 0; i
< total
; ++i
) {
5064 int k
= isl_basic_map_alloc_inequality(bmap
);
5067 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5068 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5072 isl_basic_map_free(bmap
);
5076 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5078 return isl_basic_map_nat_universe(dim
);
5081 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5083 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5086 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5088 return isl_map_nat_universe(dim
);
5091 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5092 __isl_keep isl_basic_map
*model
)
5096 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5099 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5103 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5106 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5107 __isl_keep isl_set
*model
)
5111 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5114 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5116 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5119 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5123 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5126 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5130 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5133 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5135 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5138 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5142 return isl_set_empty(isl_space_copy(model
->dim
));
5145 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5147 struct isl_map
*map
;
5150 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5151 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5155 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5157 struct isl_set
*set
;
5160 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5161 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5165 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5169 return isl_set_universe(isl_space_copy(model
->dim
));
5172 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5175 struct isl_map
*dup
;
5179 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5180 for (i
= 0; i
< map
->n
; ++i
)
5181 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5185 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5186 __isl_take isl_basic_map
*bmap
)
5190 if (isl_basic_map_plain_is_empty(bmap
)) {
5191 isl_basic_map_free(bmap
);
5194 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5195 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5196 map
->p
[map
->n
] = bmap
;
5198 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5204 isl_basic_map_free(bmap
);
5208 void *isl_map_free(struct isl_map
*map
)
5218 isl_ctx_deref(map
->ctx
);
5219 for (i
= 0; i
< map
->n
; ++i
)
5220 isl_basic_map_free(map
->p
[i
]);
5221 isl_space_free(map
->dim
);
5227 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5228 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5232 base
= isl_map_cow(base
);
5236 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5239 for (i
= 0; i
< base
->n
; ++i
) {
5240 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5241 isl_space_copy(base
->dim
), 0, 0, 0);
5251 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5252 unsigned nparam
, unsigned dim
)
5254 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5258 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5259 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5263 bmap
= isl_basic_map_cow(bmap
);
5264 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5265 j
= isl_basic_map_alloc_equality(bmap
);
5268 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5269 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5270 isl_int_set_si(bmap
->eq
[j
][0], value
);
5271 bmap
= isl_basic_map_simplify(bmap
);
5272 return isl_basic_map_finalize(bmap
);
5274 isl_basic_map_free(bmap
);
5278 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5279 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5283 bmap
= isl_basic_map_cow(bmap
);
5284 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5285 j
= isl_basic_map_alloc_equality(bmap
);
5288 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5289 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5290 isl_int_set(bmap
->eq
[j
][0], value
);
5291 bmap
= isl_basic_map_simplify(bmap
);
5292 return isl_basic_map_finalize(bmap
);
5294 isl_basic_map_free(bmap
);
5298 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5299 enum isl_dim_type type
, unsigned pos
, int value
)
5303 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5304 return isl_basic_map_fix_pos_si(bmap
,
5305 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5307 isl_basic_map_free(bmap
);
5311 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5312 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5316 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5317 return isl_basic_map_fix_pos(bmap
,
5318 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5320 isl_basic_map_free(bmap
);
5324 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5325 enum isl_dim_type type
, unsigned pos
, int value
)
5327 return (struct isl_basic_set
*)
5328 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5332 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5333 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5335 return (struct isl_basic_set
*)
5336 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5340 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5341 unsigned input
, int value
)
5343 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5346 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5347 unsigned dim
, int value
)
5349 return (struct isl_basic_set
*)
5350 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5351 isl_dim_set
, dim
, value
);
5354 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5356 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5363 isl_basic_map_free(map
->p
[i
]);
5364 if (i
!= map
->n
- 1) {
5365 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5366 map
->p
[i
] = map
->p
[map
->n
- 1];
5373 /* Perform "fn" on each basic map of "map", where we may not be holding
5374 * the only reference to "map".
5375 * In particular, "fn" should be a semantics preserving operation
5376 * that we want to apply to all copies of "map". We therefore need
5377 * to be careful not to modify "map" in a way that breaks "map"
5378 * in case anything goes wrong.
5380 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5381 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5383 struct isl_basic_map
*bmap
;
5389 for (i
= map
->n
- 1; i
>= 0; --i
) {
5390 bmap
= isl_basic_map_copy(map
->p
[i
]);
5394 isl_basic_map_free(map
->p
[i
]);
5396 if (remove_if_empty(map
, i
) < 0)
5406 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5407 enum isl_dim_type type
, unsigned pos
, int value
)
5411 map
= isl_map_cow(map
);
5415 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5416 for (i
= map
->n
- 1; i
>= 0; --i
) {
5417 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5418 if (remove_if_empty(map
, i
) < 0)
5421 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5428 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5429 enum isl_dim_type type
, unsigned pos
, int value
)
5431 return (struct isl_set
*)
5432 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5435 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5436 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5440 map
= isl_map_cow(map
);
5444 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5445 for (i
= 0; i
< map
->n
; ++i
) {
5446 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5450 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5457 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5458 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5460 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5463 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5464 unsigned input
, int value
)
5466 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5469 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5471 return (struct isl_set
*)
5472 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5475 static __isl_give isl_basic_map
*basic_map_bound_si(
5476 __isl_take isl_basic_map
*bmap
,
5477 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5483 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5484 pos
+= isl_basic_map_offset(bmap
, type
);
5485 bmap
= isl_basic_map_cow(bmap
);
5486 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5487 j
= isl_basic_map_alloc_inequality(bmap
);
5490 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5492 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5493 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5495 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5496 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5498 bmap
= isl_basic_map_simplify(bmap
);
5499 return isl_basic_map_finalize(bmap
);
5501 isl_basic_map_free(bmap
);
5505 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5506 __isl_take isl_basic_map
*bmap
,
5507 enum isl_dim_type type
, unsigned pos
, int value
)
5509 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5512 /* Constrain the values of the given dimension to be no greater than "value".
5514 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5515 __isl_take isl_basic_map
*bmap
,
5516 enum isl_dim_type type
, unsigned pos
, int value
)
5518 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5521 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5522 unsigned dim
, isl_int value
)
5526 bset
= isl_basic_set_cow(bset
);
5527 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5528 j
= isl_basic_set_alloc_inequality(bset
);
5531 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5532 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5533 isl_int_neg(bset
->ineq
[j
][0], value
);
5534 bset
= isl_basic_set_simplify(bset
);
5535 return isl_basic_set_finalize(bset
);
5537 isl_basic_set_free(bset
);
5541 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5542 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5546 map
= isl_map_cow(map
);
5550 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5551 for (i
= 0; i
< map
->n
; ++i
) {
5552 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5553 type
, pos
, value
, upper
);
5557 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5564 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5565 enum isl_dim_type type
, unsigned pos
, int value
)
5567 return map_bound_si(map
, type
, pos
, value
, 0);
5570 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5571 enum isl_dim_type type
, unsigned pos
, int value
)
5573 return map_bound_si(map
, type
, pos
, value
, 1);
5576 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5577 enum isl_dim_type type
, unsigned pos
, int value
)
5579 return (struct isl_set
*)
5580 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5583 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5584 enum isl_dim_type type
, unsigned pos
, int value
)
5586 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5589 /* Bound the given variable of "bmap" from below (or above is "upper"
5590 * is set) to "value".
5592 static __isl_give isl_basic_map
*basic_map_bound(
5593 __isl_take isl_basic_map
*bmap
,
5594 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5600 if (pos
>= isl_basic_map_dim(bmap
, type
))
5601 isl_die(bmap
->ctx
, isl_error_invalid
,
5602 "index out of bounds", goto error
);
5603 pos
+= isl_basic_map_offset(bmap
, type
);
5604 bmap
= isl_basic_map_cow(bmap
);
5605 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5606 j
= isl_basic_map_alloc_inequality(bmap
);
5609 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5611 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5612 isl_int_set(bmap
->ineq
[j
][0], value
);
5614 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5615 isl_int_neg(bmap
->ineq
[j
][0], value
);
5617 bmap
= isl_basic_map_simplify(bmap
);
5618 return isl_basic_map_finalize(bmap
);
5620 isl_basic_map_free(bmap
);
5624 /* Bound the given variable of "map" from below (or above is "upper"
5625 * is set) to "value".
5627 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5628 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5632 map
= isl_map_cow(map
);
5636 if (pos
>= isl_map_dim(map
, type
))
5637 isl_die(map
->ctx
, isl_error_invalid
,
5638 "index out of bounds", goto error
);
5639 for (i
= map
->n
- 1; i
>= 0; --i
) {
5640 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5641 if (remove_if_empty(map
, i
) < 0)
5644 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5651 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5652 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5654 return map_bound(map
, type
, pos
, value
, 0);
5657 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5658 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5660 return map_bound(map
, type
, pos
, value
, 1);
5663 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5664 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5666 return isl_map_lower_bound(set
, type
, pos
, value
);
5669 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5670 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5672 return isl_map_upper_bound(set
, type
, pos
, value
);
5675 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5680 set
= isl_set_cow(set
);
5684 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5685 for (i
= 0; i
< set
->n
; ++i
) {
5686 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5696 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5700 map
= isl_map_cow(map
);
5704 map
->dim
= isl_space_reverse(map
->dim
);
5707 for (i
= 0; i
< map
->n
; ++i
) {
5708 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5712 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5719 static struct isl_map
*isl_basic_map_partial_lexopt(
5720 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5721 struct isl_set
**empty
, int max
)
5725 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5726 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5728 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5730 isl_basic_map_free(bmap
);
5731 isl_basic_set_free(dom
);
5737 struct isl_map
*isl_basic_map_partial_lexmax(
5738 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5739 struct isl_set
**empty
)
5741 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5744 struct isl_map
*isl_basic_map_partial_lexmin(
5745 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5746 struct isl_set
**empty
)
5748 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5751 struct isl_set
*isl_basic_set_partial_lexmin(
5752 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5753 struct isl_set
**empty
)
5755 return (struct isl_set
*)
5756 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5760 struct isl_set
*isl_basic_set_partial_lexmax(
5761 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5762 struct isl_set
**empty
)
5764 return (struct isl_set
*)
5765 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5769 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5770 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5771 __isl_give isl_set
**empty
)
5773 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5776 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5777 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5778 __isl_give isl_set
**empty
)
5780 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5783 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5784 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5785 __isl_give isl_set
**empty
)
5787 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5790 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5791 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5792 __isl_give isl_set
**empty
)
5794 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5797 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5798 __isl_take isl_basic_map
*bmap
, int max
)
5800 isl_basic_set
*dom
= NULL
;
5801 isl_space
*dom_space
;
5805 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5806 dom
= isl_basic_set_universe(dom_space
);
5807 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5809 isl_basic_map_free(bmap
);
5813 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5814 __isl_take isl_basic_map
*bmap
)
5816 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5820 #define TYPE isl_pw_multi_aff
5822 #define SUFFIX _pw_multi_aff
5824 #define EMPTY isl_pw_multi_aff_empty
5826 #define ADD isl_pw_multi_aff_union_add
5827 #include "isl_map_lexopt_templ.c"
5829 /* Given a map "map", compute the lexicographically minimal
5830 * (or maximal) image element for each domain element in dom,
5831 * in the form of an isl_pw_multi_aff.
5832 * Set *empty to those elements in dom that do not have an image element.
5834 * We first compute the lexicographically minimal or maximal element
5835 * in the first basic map. This results in a partial solution "res"
5836 * and a subset "todo" of dom that still need to be handled.
5837 * We then consider each of the remaining maps in "map" and successively
5838 * update both "res" and "todo".
5840 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5841 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5842 __isl_give isl_set
**empty
, int max
)
5845 isl_pw_multi_aff
*res
;
5851 if (isl_map_plain_is_empty(map
)) {
5856 return isl_pw_multi_aff_from_map(map
);
5859 res
= basic_map_partial_lexopt_pw_multi_aff(
5860 isl_basic_map_copy(map
->p
[0]),
5861 isl_set_copy(dom
), &todo
, max
);
5863 for (i
= 1; i
< map
->n
; ++i
) {
5864 isl_pw_multi_aff
*res_i
;
5867 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5868 isl_basic_map_copy(map
->p
[i
]),
5869 isl_set_copy(dom
), &todo_i
, max
);
5872 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5874 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5876 todo
= isl_set_intersect(todo
, todo_i
);
5897 #define TYPE isl_map
5901 #define EMPTY isl_map_empty
5903 #define ADD isl_map_union_disjoint
5904 #include "isl_map_lexopt_templ.c"
5906 /* Given a map "map", compute the lexicographically minimal
5907 * (or maximal) image element for each domain element in dom.
5908 * Set *empty to those elements in dom that do not have an image element.
5910 * We first compute the lexicographically minimal or maximal element
5911 * in the first basic map. This results in a partial solution "res"
5912 * and a subset "todo" of dom that still need to be handled.
5913 * We then consider each of the remaining maps in "map" and successively
5914 * update both "res" and "todo".
5916 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5917 * Assume we are computing the lexicographical maximum.
5918 * We first compute the lexicographically maximal element in basic map i.
5919 * This results in a partial solution res_i and a subset todo_i.
5920 * Then we combine these results with those obtain for the first k basic maps
5921 * to obtain a result that is valid for the first k+1 basic maps.
5922 * In particular, the set where there is no solution is the set where
5923 * there is no solution for the first k basic maps and also no solution
5924 * for the ith basic map, i.e.,
5926 * todo^i = todo^k * todo_i
5928 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5929 * solutions, arbitrarily breaking ties in favor of res^k.
5930 * That is, when res^k(a) >= res_i(a), we pick res^k and
5931 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5932 * the lexicographic order.)
5933 * In practice, we compute
5935 * res^k * (res_i . "<=")
5939 * res_i * (res^k . "<")
5941 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5942 * where only one of res^k and res_i provides a solution and we simply pick
5949 * Note that we only compute these intersections when dom(res^k) intersects
5950 * dom(res_i). Otherwise, the only effect of these intersections is to
5951 * potentially break up res^k and res_i into smaller pieces.
5952 * We want to avoid such splintering as much as possible.
5953 * In fact, an earlier implementation of this function would look for
5954 * better results in the domain of res^k and for extra results in todo^k,
5955 * but this would always result in a splintering according to todo^k,
5956 * even when the domain of basic map i is disjoint from the domains of
5957 * the previous basic maps.
5959 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5960 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5961 __isl_give isl_set
**empty
, int max
)
5964 struct isl_map
*res
;
5965 struct isl_set
*todo
;
5970 if (isl_map_plain_is_empty(map
)) {
5978 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5979 isl_set_copy(dom
), &todo
, max
);
5981 for (i
= 1; i
< map
->n
; ++i
) {
5985 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5987 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5988 isl_set_copy(dom
), &todo_i
, max
);
5991 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5992 le
= isl_map_lex_le(dim
);
5994 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5995 le
= isl_map_lex_ge(dim
);
5997 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5998 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5999 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6000 le
= isl_map_intersect(le
, isl_map_copy(res
));
6002 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6003 res
= isl_map_intersect_domain(res
,
6004 isl_set_copy(todo_i
));
6005 res_i
= isl_map_intersect_domain(res_i
,
6006 isl_set_copy(todo
));
6009 res
= isl_map_union_disjoint(res
, res_i
);
6010 res
= isl_map_union_disjoint(res
, lt
);
6011 res
= isl_map_union_disjoint(res
, le
);
6013 todo
= isl_set_intersect(todo
, todo_i
);
6033 __isl_give isl_map
*isl_map_partial_lexmax(
6034 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6035 __isl_give isl_set
**empty
)
6037 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6040 __isl_give isl_map
*isl_map_partial_lexmin(
6041 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6042 __isl_give isl_set
**empty
)
6044 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6047 __isl_give isl_set
*isl_set_partial_lexmin(
6048 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6049 __isl_give isl_set
**empty
)
6051 return (struct isl_set
*)
6052 isl_map_partial_lexmin((struct isl_map
*)set
,
6056 __isl_give isl_set
*isl_set_partial_lexmax(
6057 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6058 __isl_give isl_set
**empty
)
6060 return (struct isl_set
*)
6061 isl_map_partial_lexmax((struct isl_map
*)set
,
6065 /* Compute the lexicographic minimum (or maximum if "max" is set)
6066 * of "bmap" over its domain.
6068 * Since we are not interested in the part of the domain space where
6069 * there is no solution, we initialize the domain to those constraints
6070 * of "bmap" that only involve the parameters and the input dimensions.
6071 * This relieves the parametric programming engine from detecting those
6072 * inequalities and transferring them to the context. More importantly,
6073 * it ensures that those inequalities are transferred first and not
6074 * intermixed with inequalities that actually split the domain.
6076 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6080 isl_basic_map
*copy
;
6083 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6084 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6085 copy
= isl_basic_map_copy(bmap
);
6086 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6087 isl_dim_div
, 0, n_div
);
6088 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6089 isl_dim_out
, 0, n_out
);
6090 dom
= isl_basic_map_domain(copy
);
6091 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6094 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6096 return isl_basic_map_lexopt(bmap
, 0);
6099 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6101 return isl_basic_map_lexopt(bmap
, 1);
6104 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6106 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6109 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6111 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6114 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
6116 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
6119 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
6121 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
6124 /* Extract the first and only affine expression from list
6125 * and then add it to *pwaff with the given dom.
6126 * This domain is known to be disjoint from other domains
6127 * because of the way isl_basic_map_foreach_lexmax works.
6129 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6130 __isl_take isl_aff_list
*list
, void *user
)
6132 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6134 isl_pw_aff
**pwaff
= user
;
6135 isl_pw_aff
*pwaff_i
;
6139 if (isl_aff_list_n_aff(list
) != 1)
6140 isl_die(ctx
, isl_error_internal
,
6141 "expecting single element list", goto error
);
6143 aff
= isl_aff_list_get_aff(list
, 0);
6144 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6146 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6148 isl_aff_list_free(list
);
6152 isl_basic_set_free(dom
);
6153 isl_aff_list_free(list
);
6157 /* Given a basic map with one output dimension, compute the minimum or
6158 * maximum of that dimension as an isl_pw_aff.
6160 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6161 * call update_dim_opt on each leaf of the result.
6163 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6166 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6170 dim
= isl_space_from_domain(isl_space_domain(dim
));
6171 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6172 pwaff
= isl_pw_aff_empty(dim
);
6174 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6176 return isl_pw_aff_free(pwaff
);
6181 /* Compute the minimum or maximum of the given output dimension
6182 * as a function of the parameters and the input dimensions,
6183 * but independently of the other output dimensions.
6185 * We first project out the other output dimension and then compute
6186 * the "lexicographic" maximum in each basic map, combining the results
6187 * using isl_pw_aff_union_max.
6189 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6196 n_out
= isl_map_dim(map
, isl_dim_out
);
6197 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6198 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6203 isl_space
*dim
= isl_map_get_space(map
);
6204 dim
= isl_space_domain(isl_space_from_range(dim
));
6206 return isl_pw_aff_empty(dim
);
6209 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6210 for (i
= 1; i
< map
->n
; ++i
) {
6211 isl_pw_aff
*pwaff_i
;
6213 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6214 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6222 /* Compute the maximum of the given output dimension as a function of the
6223 * parameters and input dimensions, but independently of
6224 * the other output dimensions.
6226 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6228 return map_dim_opt(map
, pos
, 1);
6231 /* Compute the minimum or maximum of the given set dimension
6232 * as a function of the parameters,
6233 * but independently of the other set dimensions.
6235 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6238 return map_dim_opt(set
, pos
, max
);
6241 /* Compute the maximum of the given set dimension as a function of the
6242 * parameters, but independently of the other set dimensions.
6244 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6246 return set_dim_opt(set
, pos
, 1);
6249 /* Compute the minimum of the given set dimension as a function of the
6250 * parameters, but independently of the other set dimensions.
6252 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6254 return set_dim_opt(set
, pos
, 0);
6257 /* Apply a preimage specified by "mat" on the parameters of "bset".
6258 * bset is assumed to have only parameters and divs.
6260 static struct isl_basic_set
*basic_set_parameter_preimage(
6261 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6268 bset
->dim
= isl_space_cow(bset
->dim
);
6272 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6274 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6276 bset
->dim
->nparam
= 0;
6277 bset
->dim
->n_out
= nparam
;
6278 bset
= isl_basic_set_preimage(bset
, mat
);
6280 bset
->dim
->nparam
= bset
->dim
->n_out
;
6281 bset
->dim
->n_out
= 0;
6286 isl_basic_set_free(bset
);
6290 /* Apply a preimage specified by "mat" on the parameters of "set".
6291 * set is assumed to have only parameters and divs.
6293 static struct isl_set
*set_parameter_preimage(
6294 struct isl_set
*set
, struct isl_mat
*mat
)
6296 isl_space
*dim
= NULL
;
6302 dim
= isl_space_copy(set
->dim
);
6303 dim
= isl_space_cow(dim
);
6307 nparam
= isl_set_dim(set
, isl_dim_param
);
6309 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6312 dim
->n_out
= nparam
;
6313 isl_set_reset_space(set
, dim
);
6314 set
= isl_set_preimage(set
, mat
);
6317 dim
= isl_space_copy(set
->dim
);
6318 dim
= isl_space_cow(dim
);
6321 dim
->nparam
= dim
->n_out
;
6323 isl_set_reset_space(set
, dim
);
6326 isl_space_free(dim
);
6333 /* Intersect the basic set "bset" with the affine space specified by the
6334 * equalities in "eq".
6336 static struct isl_basic_set
*basic_set_append_equalities(
6337 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6345 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6350 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6351 for (i
= 0; i
< eq
->n_row
; ++i
) {
6352 k
= isl_basic_set_alloc_equality(bset
);
6355 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6356 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6360 bset
= isl_basic_set_gauss(bset
, NULL
);
6361 bset
= isl_basic_set_finalize(bset
);
6366 isl_basic_set_free(bset
);
6370 /* Intersect the set "set" with the affine space specified by the
6371 * equalities in "eq".
6373 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6381 for (i
= 0; i
< set
->n
; ++i
) {
6382 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6395 /* Given a basic set "bset" that only involves parameters and existentially
6396 * quantified variables, return the index of the first equality
6397 * that only involves parameters. If there is no such equality then
6398 * return bset->n_eq.
6400 * This function assumes that isl_basic_set_gauss has been called on "bset".
6402 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6405 unsigned nparam
, n_div
;
6410 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6411 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6413 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6414 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6421 /* Compute an explicit representation for the existentially quantified
6422 * variables in "bset" by computing the "minimal value" of the set
6423 * variables. Since there are no set variables, the computation of
6424 * the minimal value essentially computes an explicit representation
6425 * of the non-empty part(s) of "bset".
6427 * The input only involves parameters and existentially quantified variables.
6428 * All equalities among parameters have been removed.
6430 * Since the existentially quantified variables in the result are in general
6431 * going to be different from those in the input, we first replace
6432 * them by the minimal number of variables based on their equalities.
6433 * This should simplify the parametric integer programming.
6435 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6437 isl_morph
*morph1
, *morph2
;
6443 if (bset
->n_eq
== 0)
6444 return isl_basic_set_lexmin(bset
);
6446 morph1
= isl_basic_set_parameter_compression(bset
);
6447 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6448 bset
= isl_basic_set_lift(bset
);
6449 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6450 bset
= isl_morph_basic_set(morph2
, bset
);
6451 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6452 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6454 set
= isl_basic_set_lexmin(bset
);
6456 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6461 /* Project the given basic set onto its parameter domain, possibly introducing
6462 * new, explicit, existential variables in the constraints.
6463 * The input has parameters and (possibly implicit) existential variables.
6464 * The output has the same parameters, but only
6465 * explicit existentially quantified variables.
6467 * The actual projection is performed by pip, but pip doesn't seem
6468 * to like equalities very much, so we first remove the equalities
6469 * among the parameters by performing a variable compression on
6470 * the parameters. Afterward, an inverse transformation is performed
6471 * and the equalities among the parameters are inserted back in.
6473 * The variable compression on the parameters may uncover additional
6474 * equalities that were only implicit before. We therefore check
6475 * if there are any new parameter equalities in the result and
6476 * if so recurse. The removal of parameter equalities is required
6477 * for the parameter compression performed by base_compute_divs.
6479 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6483 struct isl_mat
*T
, *T2
;
6484 struct isl_set
*set
;
6487 bset
= isl_basic_set_cow(bset
);
6491 if (bset
->n_eq
== 0)
6492 return base_compute_divs(bset
);
6494 bset
= isl_basic_set_gauss(bset
, NULL
);
6497 if (isl_basic_set_plain_is_empty(bset
))
6498 return isl_set_from_basic_set(bset
);
6500 i
= first_parameter_equality(bset
);
6501 if (i
== bset
->n_eq
)
6502 return base_compute_divs(bset
);
6504 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6505 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6507 eq
= isl_mat_cow(eq
);
6508 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6509 if (T
&& T
->n_col
== 0) {
6513 bset
= isl_basic_set_set_to_empty(bset
);
6514 return isl_set_from_basic_set(bset
);
6516 bset
= basic_set_parameter_preimage(bset
, T
);
6518 i
= first_parameter_equality(bset
);
6521 else if (i
== bset
->n_eq
)
6522 set
= base_compute_divs(bset
);
6524 set
= parameter_compute_divs(bset
);
6525 set
= set_parameter_preimage(set
, T2
);
6526 set
= set_append_equalities(set
, eq
);
6530 /* Insert the divs from "ls" before those of "bmap".
6532 * The number of columns is not changed, which means that the last
6533 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6534 * The caller is responsible for removing the same number of dimensions
6535 * from the space of "bmap".
6537 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6538 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6544 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6548 old_n_div
= bmap
->n_div
;
6549 bmap
= insert_div_rows(bmap
, n_div
);
6553 for (i
= 0; i
< n_div
; ++i
) {
6554 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6555 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6561 /* Replace the space of "bmap" by the space and divs of "ls".
6563 * If "ls" has any divs, then we simplify the result since we may
6564 * have discovered some additional equalities that could simplify
6565 * the div expressions.
6567 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6568 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6572 bmap
= isl_basic_map_cow(bmap
);
6576 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6577 bmap
= insert_divs_from_local_space(bmap
, ls
);
6581 isl_space_free(bmap
->dim
);
6582 bmap
->dim
= isl_local_space_get_space(ls
);
6586 isl_local_space_free(ls
);
6588 bmap
= isl_basic_map_simplify(bmap
);
6589 bmap
= isl_basic_map_finalize(bmap
);
6592 isl_basic_map_free(bmap
);
6593 isl_local_space_free(ls
);
6597 /* Replace the space of "map" by the space and divs of "ls".
6599 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6600 __isl_take isl_local_space
*ls
)
6604 map
= isl_map_cow(map
);
6608 for (i
= 0; i
< map
->n
; ++i
) {
6609 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6610 isl_local_space_copy(ls
));
6614 isl_space_free(map
->dim
);
6615 map
->dim
= isl_local_space_get_space(ls
);
6619 isl_local_space_free(ls
);
6622 isl_local_space_free(ls
);
6627 /* Compute an explicit representation for the existentially
6628 * quantified variables for which do not know any explicit representation yet.
6630 * We first sort the existentially quantified variables so that the
6631 * existentially quantified variables for which we already have an explicit
6632 * representation are placed before those for which we do not.
6633 * The input dimensions, the output dimensions and the existentially
6634 * quantified variables for which we already have an explicit
6635 * representation are then turned into parameters.
6636 * compute_divs returns a map with the same parameters and
6637 * no input or output dimensions and the dimension specification
6638 * is reset to that of the input, including the existentially quantified
6639 * variables for which we already had an explicit representation.
6641 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6643 struct isl_basic_set
*bset
;
6644 struct isl_set
*set
;
6645 struct isl_map
*map
;
6647 isl_local_space
*ls
;
6654 bmap
= isl_basic_map_sort_divs(bmap
);
6655 bmap
= isl_basic_map_cow(bmap
);
6659 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
6660 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
6663 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6664 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6665 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6666 dim
= isl_space_set_alloc(bmap
->ctx
,
6667 nparam
+ n_in
+ n_out
+ n_known
, 0);
6671 ls
= isl_basic_map_get_local_space(bmap
);
6672 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6673 n_known
, bmap
->n_div
- n_known
);
6675 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6676 swap_div(bmap
, i
- n_known
, i
);
6677 bmap
->n_div
-= n_known
;
6678 bmap
->extra
-= n_known
;
6680 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6681 bset
= (struct isl_basic_set
*)bmap
;
6683 set
= parameter_compute_divs(bset
);
6684 map
= (struct isl_map
*)set
;
6685 map
= replace_space_by_local_space(map
, ls
);
6689 isl_basic_map_free(bmap
);
6693 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6701 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6702 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6703 if (isl_int_is_zero(bmap
->div
[i
][0]))
6705 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6711 static int map_divs_known(__isl_keep isl_map
*map
)
6718 for (i
= 0; i
< map
->n
; ++i
) {
6719 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6727 /* If bmap contains any unknown divs, then compute explicit
6728 * expressions for them. However, this computation may be
6729 * quite expensive, so first try to remove divs that aren't
6732 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6735 struct isl_map
*map
;
6737 known
= isl_basic_map_divs_known(bmap
);
6741 return isl_map_from_basic_map(bmap
);
6743 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6745 known
= isl_basic_map_divs_known(bmap
);
6749 return isl_map_from_basic_map(bmap
);
6751 map
= compute_divs(bmap
);
6754 isl_basic_map_free(bmap
);
6758 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6762 struct isl_map
*res
;
6769 known
= map_divs_known(map
);
6777 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6778 for (i
= 1 ; i
< map
->n
; ++i
) {
6780 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6781 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6782 res
= isl_map_union_disjoint(res
, r2
);
6784 res
= isl_map_union(res
, r2
);
6791 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6793 return (struct isl_set
*)
6794 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6797 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6799 return (struct isl_set
*)
6800 isl_map_compute_divs((struct isl_map
*)set
);
6803 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6806 struct isl_set
*set
;
6811 map
= isl_map_cow(map
);
6815 set
= (struct isl_set
*)map
;
6816 set
->dim
= isl_space_domain(set
->dim
);
6819 for (i
= 0; i
< map
->n
; ++i
) {
6820 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6824 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6825 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6832 /* Return the union of "map1" and "map2", where we assume for now that
6833 * "map1" and "map2" are disjoint. Note that the basic maps inside
6834 * "map1" or "map2" may not be disjoint from each other.
6835 * Also note that this function is also called from isl_map_union,
6836 * which takes care of handling the situation where "map1" and "map2"
6837 * may not be disjoint.
6839 * If one of the inputs is empty, we can simply return the other input.
6840 * Similarly, if one of the inputs is universal, then it is equal to the union.
6842 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6843 __isl_take isl_map
*map2
)
6847 struct isl_map
*map
= NULL
;
6862 is_universe
= isl_map_plain_is_universe(map1
);
6863 if (is_universe
< 0)
6870 is_universe
= isl_map_plain_is_universe(map2
);
6871 if (is_universe
< 0)
6878 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6880 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6881 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6882 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6884 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6885 map1
->n
+ map2
->n
, flags
);
6888 for (i
= 0; i
< map1
->n
; ++i
) {
6889 map
= isl_map_add_basic_map(map
,
6890 isl_basic_map_copy(map1
->p
[i
]));
6894 for (i
= 0; i
< map2
->n
; ++i
) {
6895 map
= isl_map_add_basic_map(map
,
6896 isl_basic_map_copy(map2
->p
[i
]));
6910 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6911 __isl_take isl_map
*map2
)
6913 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6916 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6918 map1
= isl_map_union_disjoint(map1
, map2
);
6922 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6926 struct isl_set
*isl_set_union_disjoint(
6927 struct isl_set
*set1
, struct isl_set
*set2
)
6929 return (struct isl_set
*)
6930 isl_map_union_disjoint(
6931 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6934 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6936 return (struct isl_set
*)
6937 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6940 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6943 * "map" and "set" are assumed to be compatible and non-NULL.
6945 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6946 __isl_take isl_set
*set
,
6947 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6948 __isl_take isl_basic_set
*bset
))
6951 struct isl_map
*result
;
6954 if (isl_set_plain_is_universe(set
)) {
6959 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6960 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6961 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6963 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6964 map
->n
* set
->n
, flags
);
6965 for (i
= 0; result
&& i
< map
->n
; ++i
)
6966 for (j
= 0; j
< set
->n
; ++j
) {
6967 result
= isl_map_add_basic_map(result
,
6968 fn(isl_basic_map_copy(map
->p
[i
]),
6969 isl_basic_set_copy(set
->p
[j
])));
6979 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6980 __isl_take isl_set
*set
)
6985 if (!isl_map_compatible_range(map
, set
))
6986 isl_die(set
->ctx
, isl_error_invalid
,
6987 "incompatible spaces", goto error
);
6989 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6996 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6997 __isl_take isl_set
*set
)
6999 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7002 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7003 __isl_take isl_set
*set
)
7008 if (!isl_map_compatible_domain(map
, set
))
7009 isl_die(set
->ctx
, isl_error_invalid
,
7010 "incompatible spaces", goto error
);
7012 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7019 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7020 __isl_take isl_set
*set
)
7022 return isl_map_align_params_map_map_and(map
, set
,
7023 &map_intersect_domain
);
7026 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7027 __isl_take isl_map
*map2
)
7031 map1
= isl_map_reverse(map1
);
7032 map1
= isl_map_apply_range(map1
, map2
);
7033 return isl_map_reverse(map1
);
7040 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7041 __isl_take isl_map
*map2
)
7043 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7046 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7047 __isl_take isl_map
*map2
)
7049 isl_space
*dim_result
;
7050 struct isl_map
*result
;
7056 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7057 isl_space_copy(map2
->dim
));
7059 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7062 for (i
= 0; i
< map1
->n
; ++i
)
7063 for (j
= 0; j
< map2
->n
; ++j
) {
7064 result
= isl_map_add_basic_map(result
,
7065 isl_basic_map_apply_range(
7066 isl_basic_map_copy(map1
->p
[i
]),
7067 isl_basic_map_copy(map2
->p
[j
])));
7073 if (result
&& result
->n
<= 1)
7074 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7082 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7083 __isl_take isl_map
*map2
)
7085 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7089 * returns range - domain
7091 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7093 isl_space
*dims
, *target_dim
;
7094 struct isl_basic_set
*bset
;
7101 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
7102 bmap
->dim
, isl_dim_out
),
7104 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7105 dim
= isl_basic_map_n_in(bmap
);
7106 nparam
= isl_basic_map_n_param(bmap
);
7107 bset
= isl_basic_set_from_basic_map(bmap
);
7108 bset
= isl_basic_set_cow(bset
);
7109 dims
= isl_basic_set_get_space(bset
);
7110 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7111 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7112 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7113 for (i
= 0; i
< dim
; ++i
) {
7114 int j
= isl_basic_map_alloc_equality(
7115 (struct isl_basic_map
*)bset
);
7117 bset
= isl_basic_set_free(bset
);
7120 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7121 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7122 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7123 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7125 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7126 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7129 isl_basic_map_free(bmap
);
7134 * returns range - domain
7136 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7140 struct isl_set
*result
;
7145 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
7146 map
->dim
, isl_dim_out
),
7148 dim
= isl_map_get_space(map
);
7149 dim
= isl_space_domain(dim
);
7150 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7153 for (i
= 0; i
< map
->n
; ++i
)
7154 result
= isl_set_add_basic_set(result
,
7155 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7164 * returns [domain -> range] -> range - domain
7166 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7167 __isl_take isl_basic_map
*bmap
)
7171 isl_basic_map
*domain
;
7175 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
7176 isl_die(bmap
->ctx
, isl_error_invalid
,
7177 "domain and range don't match", goto error
);
7179 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7180 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7182 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7183 domain
= isl_basic_map_universe(dim
);
7185 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7186 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7187 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7189 total
= isl_basic_map_total_dim(bmap
);
7191 for (i
= 0; i
< n
; ++i
) {
7192 k
= isl_basic_map_alloc_equality(bmap
);
7195 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7196 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7197 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7198 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7201 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7202 return isl_basic_map_finalize(bmap
);
7204 isl_basic_map_free(bmap
);
7209 * returns [domain -> range] -> range - domain
7211 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7214 isl_space
*domain_dim
;
7219 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
7220 isl_die(map
->ctx
, isl_error_invalid
,
7221 "domain and range don't match", goto error
);
7223 map
= isl_map_cow(map
);
7227 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7228 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7229 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7232 for (i
= 0; i
< map
->n
; ++i
) {
7233 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7237 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7244 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7246 struct isl_basic_map
*bmap
;
7254 nparam
= dims
->nparam
;
7256 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7260 for (i
= 0; i
< dim
; ++i
) {
7261 int j
= isl_basic_map_alloc_equality(bmap
);
7264 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7265 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7266 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7268 return isl_basic_map_finalize(bmap
);
7270 isl_basic_map_free(bmap
);
7274 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7278 if (dim
->n_in
!= dim
->n_out
)
7279 isl_die(dim
->ctx
, isl_error_invalid
,
7280 "number of input and output dimensions needs to be "
7281 "the same", goto error
);
7282 return basic_map_identity(dim
);
7284 isl_space_free(dim
);
7288 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7290 if (!model
|| !model
->dim
)
7292 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7295 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7297 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7300 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7302 if (!model
|| !model
->dim
)
7304 return isl_map_identity(isl_space_copy(model
->dim
));
7307 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7309 if (!model
|| !model
->dim
)
7311 return isl_map_identity(isl_space_copy(model
->dim
));
7314 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7316 isl_space
*dim
= isl_set_get_space(set
);
7318 id
= isl_map_identity(isl_space_map_from_set(dim
));
7319 return isl_map_intersect_range(id
, set
);
7322 /* Construct a basic set with all set dimensions having only non-negative
7325 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7326 __isl_take isl_space
*space
)
7331 struct isl_basic_set
*bset
;
7335 nparam
= space
->nparam
;
7337 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7340 for (i
= 0; i
< dim
; ++i
) {
7341 int k
= isl_basic_set_alloc_inequality(bset
);
7344 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7345 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7349 isl_basic_set_free(bset
);
7353 /* Construct the half-space x_pos >= 0.
7355 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7359 isl_basic_set
*nonneg
;
7361 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7362 k
= isl_basic_set_alloc_inequality(nonneg
);
7365 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7366 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7368 return isl_basic_set_finalize(nonneg
);
7370 isl_basic_set_free(nonneg
);
7374 /* Construct the half-space x_pos <= -1.
7376 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7381 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7382 k
= isl_basic_set_alloc_inequality(neg
);
7385 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7386 isl_int_set_si(neg
->ineq
[k
][0], -1);
7387 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7389 return isl_basic_set_finalize(neg
);
7391 isl_basic_set_free(neg
);
7395 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7396 enum isl_dim_type type
, unsigned first
, unsigned n
)
7399 isl_basic_set
*nonneg
;
7407 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7409 for (i
= 0; i
< n
; ++i
) {
7410 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7411 pos(set
->dim
, type
) + first
+ i
);
7412 neg
= neg_halfspace(isl_set_get_space(set
),
7413 pos(set
->dim
, type
) + first
+ i
);
7415 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7424 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7425 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7432 if (isl_set_plain_is_empty(set
)) {
7437 return fn(set
, signs
, user
);
7440 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7442 half
= isl_set_intersect(half
, isl_set_copy(set
));
7443 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7447 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7449 half
= isl_set_intersect(half
, set
);
7450 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7456 /* Call "fn" on the intersections of "set" with each of the orthants
7457 * (except for obviously empty intersections). The orthant is identified
7458 * by the signs array, with each entry having value 1 or -1 according
7459 * to the sign of the corresponding variable.
7461 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7462 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7472 if (isl_set_plain_is_empty(set
))
7475 nparam
= isl_set_dim(set
, isl_dim_param
);
7476 nvar
= isl_set_dim(set
, isl_dim_set
);
7478 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7480 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7488 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7490 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7493 int isl_basic_map_is_subset(
7494 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7497 struct isl_map
*map1
;
7498 struct isl_map
*map2
;
7500 if (!bmap1
|| !bmap2
)
7503 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7504 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7506 is_subset
= isl_map_is_subset(map1
, map2
);
7514 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7515 __isl_keep isl_basic_set
*bset2
)
7517 return isl_basic_map_is_subset(bset1
, bset2
);
7520 int isl_basic_map_is_equal(
7521 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7525 if (!bmap1
|| !bmap2
)
7527 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7530 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7534 int isl_basic_set_is_equal(
7535 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7537 return isl_basic_map_is_equal(
7538 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7541 int isl_map_is_empty(struct isl_map
*map
)
7548 for (i
= 0; i
< map
->n
; ++i
) {
7549 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7558 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7560 return map
? map
->n
== 0 : -1;
7563 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7565 return isl_map_plain_is_empty(map
);
7568 int isl_set_plain_is_empty(struct isl_set
*set
)
7570 return set
? set
->n
== 0 : -1;
7573 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7575 return isl_set_plain_is_empty(set
);
7578 int isl_set_is_empty(struct isl_set
*set
)
7580 return isl_map_is_empty((struct isl_map
*)set
);
7583 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7588 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7591 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7596 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7599 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7605 is_subset
= isl_map_is_subset(map1
, map2
);
7608 is_subset
= isl_map_is_subset(map2
, map1
);
7612 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7614 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7617 int isl_basic_map_is_strict_subset(
7618 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7622 if (!bmap1
|| !bmap2
)
7624 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7627 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7628 if (is_subset
== -1)
7633 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7639 is_subset
= isl_map_is_subset(map1
, map2
);
7642 is_subset
= isl_map_is_subset(map2
, map1
);
7643 if (is_subset
== -1)
7648 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7650 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7653 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7657 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7660 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7664 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7667 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7674 for (i
= 0; i
< map
->n
; ++i
) {
7675 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7683 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7685 return isl_map_plain_is_universe((isl_map
*) set
);
7688 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7690 return isl_set_plain_is_universe(set
);
7693 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7695 struct isl_basic_set
*bset
= NULL
;
7696 struct isl_vec
*sample
= NULL
;
7703 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7706 if (isl_basic_map_is_universe(bmap
))
7709 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7710 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7711 copy
= isl_basic_map_remove_redundancies(copy
);
7712 empty
= isl_basic_map_plain_is_empty(copy
);
7713 isl_basic_map_free(copy
);
7717 total
= 1 + isl_basic_map_total_dim(bmap
);
7718 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7719 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7725 isl_vec_free(bmap
->sample
);
7726 bmap
->sample
= NULL
;
7727 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7730 sample
= isl_basic_set_sample_vec(bset
);
7733 empty
= sample
->size
== 0;
7734 isl_vec_free(bmap
->sample
);
7735 bmap
->sample
= sample
;
7737 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7742 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7746 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7749 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7751 return isl_basic_map_plain_is_empty(bmap
);
7754 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7758 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7761 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7763 return isl_basic_set_plain_is_empty(bset
);
7766 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7768 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7771 struct isl_map
*isl_basic_map_union(
7772 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7774 struct isl_map
*map
;
7775 if (!bmap1
|| !bmap2
)
7778 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7780 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7783 map
= isl_map_add_basic_map(map
, bmap1
);
7784 map
= isl_map_add_basic_map(map
, bmap2
);
7787 isl_basic_map_free(bmap1
);
7788 isl_basic_map_free(bmap2
);
7792 struct isl_set
*isl_basic_set_union(
7793 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7795 return (struct isl_set
*)isl_basic_map_union(
7796 (struct isl_basic_map
*)bset1
,
7797 (struct isl_basic_map
*)bset2
);
7800 /* Order divs such that any div only depends on previous divs */
7801 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7809 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7811 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7813 if (isl_int_is_zero(bmap
->div
[i
][0]))
7815 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7819 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7825 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7827 return (struct isl_basic_set
*)
7828 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7831 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7838 for (i
= 0; i
< map
->n
; ++i
) {
7839 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7850 /* Apply the expansion computed by isl_merge_divs.
7851 * The expansion itself is given by "exp" while the resulting
7852 * list of divs is given by "div".
7854 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7855 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7860 bset
= isl_basic_set_cow(bset
);
7864 if (div
->n_row
< bset
->n_div
)
7865 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7866 "not an expansion", goto error
);
7868 n_div
= bset
->n_div
;
7869 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7870 div
->n_row
- n_div
, 0,
7871 2 * (div
->n_row
- n_div
));
7873 for (i
= n_div
; i
< div
->n_row
; ++i
)
7874 if (isl_basic_set_alloc_div(bset
) < 0)
7878 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7879 if (j
>= 0 && exp
[j
] == i
) {
7881 isl_basic_map_swap_div(bset
, i
, j
);
7884 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7885 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7893 isl_basic_set_free(bset
);
7898 /* Look for a div in dst that corresponds to the div "div" in src.
7899 * The divs before "div" in src and dst are assumed to be the same.
7901 * Returns -1 if no corresponding div was found and the position
7902 * of the corresponding div in dst otherwise.
7904 static int find_div(struct isl_basic_map
*dst
,
7905 struct isl_basic_map
*src
, unsigned div
)
7909 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7911 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7912 for (i
= div
; i
< dst
->n_div
; ++i
)
7913 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7914 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7915 dst
->n_div
- div
) == -1)
7920 struct isl_basic_map
*isl_basic_map_align_divs(
7921 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7929 if (src
->n_div
== 0)
7932 for (i
= 0; i
< src
->n_div
; ++i
)
7933 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7935 src
= isl_basic_map_order_divs(src
);
7936 dst
= isl_basic_map_cow(dst
);
7937 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7938 src
->n_div
, 0, 2 * src
->n_div
);
7941 total
= isl_space_dim(src
->dim
, isl_dim_all
);
7942 for (i
= 0; i
< src
->n_div
; ++i
) {
7943 int j
= find_div(dst
, src
, i
);
7945 j
= isl_basic_map_alloc_div(dst
);
7948 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7949 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7950 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7954 isl_basic_map_swap_div(dst
, i
, j
);
7958 isl_basic_map_free(dst
);
7962 struct isl_basic_set
*isl_basic_set_align_divs(
7963 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7965 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7966 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7969 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7977 map
= isl_map_compute_divs(map
);
7978 map
= isl_map_cow(map
);
7982 for (i
= 1; i
< map
->n
; ++i
)
7983 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7984 for (i
= 1; i
< map
->n
; ++i
)
7985 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7987 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7991 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7993 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7996 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7997 __isl_take isl_map
*map
)
8001 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8002 map
= isl_map_intersect_domain(map
, set
);
8003 set
= isl_map_range(map
);
8011 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8012 __isl_take isl_map
*map
)
8014 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8017 /* There is no need to cow as removing empty parts doesn't change
8018 * the meaning of the set.
8020 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8027 for (i
= map
->n
- 1; i
>= 0; --i
)
8028 remove_if_empty(map
, i
);
8033 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8035 return (struct isl_set
*)
8036 isl_map_remove_empty_parts((struct isl_map
*)set
);
8039 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8041 struct isl_basic_map
*bmap
;
8042 if (!map
|| map
->n
== 0)
8044 bmap
= map
->p
[map
->n
-1];
8045 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8046 return isl_basic_map_copy(bmap
);
8049 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8051 return (struct isl_basic_set
*)
8052 isl_map_copy_basic_map((struct isl_map
*)set
);
8055 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8056 __isl_keep isl_basic_map
*bmap
)
8062 for (i
= map
->n
-1; i
>= 0; --i
) {
8063 if (map
->p
[i
] != bmap
)
8065 map
= isl_map_cow(map
);
8068 isl_basic_map_free(map
->p
[i
]);
8069 if (i
!= map
->n
-1) {
8070 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8071 map
->p
[i
] = map
->p
[map
->n
-1];
8082 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8083 struct isl_basic_set
*bset
)
8085 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8086 (struct isl_basic_map
*)bset
);
8089 /* Given two basic sets bset1 and bset2, compute the maximal difference
8090 * between the values of dimension pos in bset1 and those in bset2
8091 * for any common value of the parameters and dimensions preceding pos.
8093 static enum isl_lp_result
basic_set_maximal_difference_at(
8094 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8095 int pos
, isl_int
*opt
)
8098 struct isl_basic_map
*bmap1
= NULL
;
8099 struct isl_basic_map
*bmap2
= NULL
;
8100 struct isl_ctx
*ctx
;
8101 struct isl_vec
*obj
;
8104 unsigned dim1
, dim2
;
8105 enum isl_lp_result res
;
8107 if (!bset1
|| !bset2
)
8108 return isl_lp_error
;
8110 nparam
= isl_basic_set_n_param(bset1
);
8111 dim1
= isl_basic_set_n_dim(bset1
);
8112 dim2
= isl_basic_set_n_dim(bset2
);
8113 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8114 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8115 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8116 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8117 if (!bmap1
|| !bmap2
)
8119 bmap1
= isl_basic_map_cow(bmap1
);
8120 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8121 pos
, (dim1
- pos
) + (dim2
- pos
),
8122 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8123 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8126 total
= isl_basic_map_total_dim(bmap1
);
8128 obj
= isl_vec_alloc(ctx
, 1 + total
);
8131 isl_seq_clr(obj
->block
.data
, 1 + total
);
8132 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8133 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8134 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8136 isl_basic_map_free(bmap1
);
8140 isl_basic_map_free(bmap2
);
8142 isl_basic_map_free(bmap1
);
8143 return isl_lp_error
;
8146 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8147 * for any common value of the parameters and dimensions preceding pos
8148 * in both basic sets, the values of dimension pos in bset1 are
8149 * smaller or larger than those in bset2.
8152 * 1 if bset1 follows bset2
8153 * -1 if bset1 precedes bset2
8154 * 0 if bset1 and bset2 are incomparable
8155 * -2 if some error occurred.
8157 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8158 struct isl_basic_set
*bset2
, int pos
)
8161 enum isl_lp_result res
;
8166 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8168 if (res
== isl_lp_empty
)
8170 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8171 res
== isl_lp_unbounded
)
8173 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8182 /* Given two basic sets bset1 and bset2, check whether
8183 * for any common value of the parameters and dimensions preceding pos
8184 * there is a value of dimension pos in bset1 that is larger
8185 * than a value of the same dimension in bset2.
8188 * 1 if there exists such a pair
8189 * 0 if there is no such pair, but there is a pair of equal values
8191 * -2 if some error occurred.
8193 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8194 __isl_keep isl_basic_set
*bset2
, int pos
)
8197 enum isl_lp_result res
;
8202 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8204 if (res
== isl_lp_empty
)
8206 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8207 res
== isl_lp_unbounded
)
8209 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8211 else if (res
== isl_lp_ok
)
8220 /* Given two sets set1 and set2, check whether
8221 * for any common value of the parameters and dimensions preceding pos
8222 * there is a value of dimension pos in set1 that is larger
8223 * than a value of the same dimension in set2.
8226 * 1 if there exists such a pair
8227 * 0 if there is no such pair, but there is a pair of equal values
8229 * -2 if some error occurred.
8231 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8232 __isl_keep isl_set
*set2
, int pos
)
8240 for (i
= 0; i
< set1
->n
; ++i
)
8241 for (j
= 0; j
< set2
->n
; ++j
) {
8243 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8244 if (f
== 1 || f
== -2)
8253 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8254 unsigned pos
, isl_int
*val
)
8262 total
= isl_basic_map_total_dim(bmap
);
8263 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8264 for (; d
+1 > pos
; --d
)
8265 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8269 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8271 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8273 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8276 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8282 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8283 unsigned pos
, isl_int
*val
)
8295 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8298 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8299 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8300 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8301 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8305 isl_int_set(*val
, v
);
8311 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8312 unsigned pos
, isl_int
*val
)
8314 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8318 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8321 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8324 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8325 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8327 if (pos
>= isl_basic_map_dim(bmap
, type
))
8329 return isl_basic_map_plain_has_fixed_var(bmap
,
8330 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8333 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8334 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8336 if (pos
>= isl_map_dim(map
, type
))
8338 return isl_map_plain_has_fixed_var(map
,
8339 map_offset(map
, type
) - 1 + pos
, val
);
8342 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8343 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8345 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8348 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8349 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8351 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8354 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8355 * then return this fixed value in *val.
8357 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8358 unsigned dim
, isl_int
*val
)
8360 return isl_basic_set_plain_has_fixed_var(bset
,
8361 isl_basic_set_n_param(bset
) + dim
, val
);
8364 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8365 * then return this fixed value in *val.
8367 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8368 unsigned dim
, isl_int
*val
)
8370 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8373 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8374 unsigned dim
, isl_int
*val
)
8376 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8379 /* Check if input variable in has fixed value and if so and if val is not NULL,
8380 * then return this fixed value in *val.
8382 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8383 unsigned in
, isl_int
*val
)
8385 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8388 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8389 * and if val is not NULL, then return this lower bound in *val.
8391 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8392 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8394 int i
, i_eq
= -1, i_ineq
= -1;
8401 total
= isl_basic_set_total_dim(bset
);
8402 nparam
= isl_basic_set_n_param(bset
);
8403 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8404 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8410 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8411 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8413 if (i_eq
!= -1 || i_ineq
!= -1)
8417 if (i_eq
== -1 && i_ineq
== -1)
8419 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8420 /* The coefficient should always be one due to normalization. */
8421 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8423 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8425 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8426 total
- nparam
- dim
- 1) != -1)
8429 isl_int_neg(*val
, c
[0]);
8433 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8434 unsigned dim
, isl_int
*val
)
8446 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8450 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8452 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8453 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8455 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8459 isl_int_set(*val
, v
);
8470 /* uset_gist depends on constraints without existentially quantified
8471 * variables sorting first.
8473 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8475 const struct constraint
*c1
= (const struct constraint
*)p1
;
8476 const struct constraint
*c2
= (const struct constraint
*)p2
;
8478 unsigned size
= isl_min(c1
->size
, c2
->size
);
8480 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8481 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8486 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8489 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8490 struct isl_basic_map
*bmap
)
8493 struct constraint
*c
;
8498 total
= isl_basic_map_total_dim(bmap
);
8499 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8502 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8504 c
[i
].c
= bmap
->ineq
[i
];
8506 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8507 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8508 bmap
->ineq
[i
] = c
[i
].c
;
8512 isl_basic_map_free(bmap
);
8516 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8517 __isl_take isl_basic_set
*bset
)
8519 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8520 (struct isl_basic_map
*)bset
);
8523 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8527 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8529 bmap
= isl_basic_map_remove_redundancies(bmap
);
8530 bmap
= isl_basic_map_sort_constraints(bmap
);
8532 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8536 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8538 return (struct isl_basic_set
*)isl_basic_map_normalize(
8539 (struct isl_basic_map
*)bset
);
8542 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8543 const __isl_keep isl_basic_map
*bmap2
)
8550 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8551 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8552 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8553 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8554 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8555 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8556 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8557 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8558 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8559 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8560 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8562 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8564 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8566 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8567 return bmap1
->n_eq
- bmap2
->n_eq
;
8568 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8569 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8570 if (bmap1
->n_div
!= bmap2
->n_div
)
8571 return bmap1
->n_div
- bmap2
->n_div
;
8572 total
= isl_basic_map_total_dim(bmap1
);
8573 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8574 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8578 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8579 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8583 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8584 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8591 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8592 const __isl_keep isl_basic_set
*bset2
)
8594 return isl_basic_map_plain_cmp(bset1
, bset2
);
8597 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8603 if (set1
->n
!= set2
->n
)
8604 return set1
->n
- set2
->n
;
8606 for (i
= 0; i
< set1
->n
; ++i
) {
8607 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8615 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8616 __isl_keep isl_basic_map
*bmap2
)
8618 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8621 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8622 __isl_keep isl_basic_set
*bset2
)
8624 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8625 (isl_basic_map
*)bset2
);
8628 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8630 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8631 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8633 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8636 /* We normalize in place, but if anything goes wrong we need
8637 * to return NULL, so we need to make sure we don't change the
8638 * meaning of any possible other copies of map.
8640 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8643 struct isl_basic_map
*bmap
;
8647 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8649 for (i
= 0; i
< map
->n
; ++i
) {
8650 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8653 isl_basic_map_free(map
->p
[i
]);
8656 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8657 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8658 map
= isl_map_remove_empty_parts(map
);
8661 for (i
= map
->n
- 1; i
>= 1; --i
) {
8662 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8664 isl_basic_map_free(map
->p
[i
-1]);
8665 for (j
= i
; j
< map
->n
; ++j
)
8666 map
->p
[j
-1] = map
->p
[j
];
8676 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8678 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8681 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8691 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8694 map1
= isl_map_copy(map1
);
8695 map2
= isl_map_copy(map2
);
8696 map1
= isl_map_normalize(map1
);
8697 map2
= isl_map_normalize(map2
);
8700 equal
= map1
->n
== map2
->n
;
8701 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8702 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8715 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8717 return isl_map_plain_is_equal(map1
, map2
);
8720 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8722 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8723 (struct isl_map
*)set2
);
8726 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8728 return isl_set_plain_is_equal(set1
, set2
);
8731 /* Return an interval that ranges from min to max (inclusive)
8733 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8734 isl_int min
, isl_int max
)
8737 struct isl_basic_set
*bset
= NULL
;
8739 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8743 k
= isl_basic_set_alloc_inequality(bset
);
8746 isl_int_set_si(bset
->ineq
[k
][1], 1);
8747 isl_int_neg(bset
->ineq
[k
][0], min
);
8749 k
= isl_basic_set_alloc_inequality(bset
);
8752 isl_int_set_si(bset
->ineq
[k
][1], -1);
8753 isl_int_set(bset
->ineq
[k
][0], max
);
8757 isl_basic_set_free(bset
);
8761 /* Return the Cartesian product of the basic sets in list (in the given order).
8763 __isl_give isl_basic_set
*isl_basic_set_list_product(
8764 __isl_take
struct isl_basic_set_list
*list
)
8772 struct isl_basic_set
*product
= NULL
;
8776 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8777 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8778 nparam
= isl_basic_set_n_param(list
->p
[0]);
8779 dim
= isl_basic_set_n_dim(list
->p
[0]);
8780 extra
= list
->p
[0]->n_div
;
8781 n_eq
= list
->p
[0]->n_eq
;
8782 n_ineq
= list
->p
[0]->n_ineq
;
8783 for (i
= 1; i
< list
->n
; ++i
) {
8784 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8785 isl_assert(list
->ctx
,
8786 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8787 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8788 extra
+= list
->p
[i
]->n_div
;
8789 n_eq
+= list
->p
[i
]->n_eq
;
8790 n_ineq
+= list
->p
[i
]->n_ineq
;
8792 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8797 for (i
= 0; i
< list
->n
; ++i
) {
8798 isl_basic_set_add_constraints(product
,
8799 isl_basic_set_copy(list
->p
[i
]), dim
);
8800 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8802 isl_basic_set_list_free(list
);
8805 isl_basic_set_free(product
);
8806 isl_basic_set_list_free(list
);
8810 struct isl_basic_map
*isl_basic_map_product(
8811 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8813 isl_space
*dim_result
= NULL
;
8814 struct isl_basic_map
*bmap
;
8815 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8816 struct isl_dim_map
*dim_map1
, *dim_map2
;
8818 if (!bmap1
|| !bmap2
)
8821 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8822 bmap2
->dim
, isl_dim_param
), goto error
);
8823 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8824 isl_space_copy(bmap2
->dim
));
8826 in1
= isl_basic_map_n_in(bmap1
);
8827 in2
= isl_basic_map_n_in(bmap2
);
8828 out1
= isl_basic_map_n_out(bmap1
);
8829 out2
= isl_basic_map_n_out(bmap2
);
8830 nparam
= isl_basic_map_n_param(bmap1
);
8832 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8833 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8834 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8835 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8836 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8837 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8838 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8839 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8840 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8841 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8842 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8844 bmap
= isl_basic_map_alloc_space(dim_result
,
8845 bmap1
->n_div
+ bmap2
->n_div
,
8846 bmap1
->n_eq
+ bmap2
->n_eq
,
8847 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8848 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8849 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8850 bmap
= isl_basic_map_simplify(bmap
);
8851 return isl_basic_map_finalize(bmap
);
8853 isl_basic_map_free(bmap1
);
8854 isl_basic_map_free(bmap2
);
8858 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8859 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8861 isl_basic_map
*prod
;
8863 prod
= isl_basic_map_product(bmap1
, bmap2
);
8864 prod
= isl_basic_map_flatten(prod
);
8868 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8869 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8871 return isl_basic_map_flat_range_product(bset1
, bset2
);
8874 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8875 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8877 isl_space
*space_result
= NULL
;
8878 isl_basic_map
*bmap
;
8879 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8880 struct isl_dim_map
*dim_map1
, *dim_map2
;
8882 if (!bmap1
|| !bmap2
)
8885 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8886 isl_space_copy(bmap2
->dim
));
8888 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8889 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8890 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8891 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8893 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8894 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8895 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8896 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8897 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8898 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8899 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8900 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8901 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8902 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8903 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8905 bmap
= isl_basic_map_alloc_space(space_result
,
8906 bmap1
->n_div
+ bmap2
->n_div
,
8907 bmap1
->n_eq
+ bmap2
->n_eq
,
8908 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8909 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8910 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8911 bmap
= isl_basic_map_simplify(bmap
);
8912 return isl_basic_map_finalize(bmap
);
8914 isl_basic_map_free(bmap1
);
8915 isl_basic_map_free(bmap2
);
8919 __isl_give isl_basic_map
*isl_basic_map_range_product(
8920 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8922 isl_space
*dim_result
= NULL
;
8923 isl_basic_map
*bmap
;
8924 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8925 struct isl_dim_map
*dim_map1
, *dim_map2
;
8927 if (!bmap1
|| !bmap2
)
8930 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8931 bmap2
->dim
, isl_dim_param
))
8932 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8933 "parameters don't match", goto error
);
8935 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8936 isl_space_copy(bmap2
->dim
));
8938 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8939 out1
= isl_basic_map_n_out(bmap1
);
8940 out2
= isl_basic_map_n_out(bmap2
);
8941 nparam
= isl_basic_map_n_param(bmap1
);
8943 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8944 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8945 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8946 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8947 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8948 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8949 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8950 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8951 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8952 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8953 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8955 bmap
= isl_basic_map_alloc_space(dim_result
,
8956 bmap1
->n_div
+ bmap2
->n_div
,
8957 bmap1
->n_eq
+ bmap2
->n_eq
,
8958 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8959 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8960 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8961 bmap
= isl_basic_map_simplify(bmap
);
8962 return isl_basic_map_finalize(bmap
);
8964 isl_basic_map_free(bmap1
);
8965 isl_basic_map_free(bmap2
);
8969 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8970 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8972 isl_basic_map
*prod
;
8974 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8975 prod
= isl_basic_map_flatten_range(prod
);
8979 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8980 __isl_take isl_map
*map2
,
8981 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8982 __isl_take isl_space
*right
),
8983 __isl_give isl_basic_map
*(*basic_map_product
)(
8984 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8987 struct isl_map
*result
;
8993 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8994 map2
->dim
, isl_dim_param
), goto error
);
8996 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8997 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8998 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9000 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
9001 isl_space_copy(map2
->dim
)),
9002 map1
->n
* map2
->n
, flags
);
9005 for (i
= 0; i
< map1
->n
; ++i
)
9006 for (j
= 0; j
< map2
->n
; ++j
) {
9007 struct isl_basic_map
*part
;
9008 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9009 isl_basic_map_copy(map2
->p
[j
]));
9010 if (isl_basic_map_is_empty(part
))
9011 isl_basic_map_free(part
);
9013 result
= isl_map_add_basic_map(result
, part
);
9026 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9028 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9029 __isl_take isl_map
*map2
)
9031 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
9034 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9035 __isl_take isl_map
*map2
)
9037 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9040 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9042 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9043 __isl_take isl_map
*map2
)
9047 prod
= isl_map_product(map1
, map2
);
9048 prod
= isl_map_flatten(prod
);
9052 /* Given two set A and B, construct its Cartesian product A x B.
9054 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9056 return isl_map_range_product(set1
, set2
);
9059 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9060 __isl_take isl_set
*set2
)
9062 return isl_map_flat_range_product(set1
, set2
);
9065 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9067 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9068 __isl_take isl_map
*map2
)
9070 return map_product(map1
, map2
, &isl_space_domain_product
,
9071 &isl_basic_map_domain_product
);
9074 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9076 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9077 __isl_take isl_map
*map2
)
9079 return map_product(map1
, map2
, &isl_space_range_product
,
9080 &isl_basic_map_range_product
);
9083 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9084 __isl_take isl_map
*map2
)
9086 return isl_map_align_params_map_map_and(map1
, map2
,
9087 &map_domain_product_aligned
);
9090 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9091 __isl_take isl_map
*map2
)
9093 return isl_map_align_params_map_map_and(map1
, map2
,
9094 &map_range_product_aligned
);
9097 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9099 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9100 __isl_take isl_map
*map2
)
9104 prod
= isl_map_domain_product(map1
, map2
);
9105 prod
= isl_map_flatten_domain(prod
);
9109 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9111 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9112 __isl_take isl_map
*map2
)
9116 prod
= isl_map_range_product(map1
, map2
);
9117 prod
= isl_map_flatten_range(prod
);
9121 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9124 uint32_t hash
= isl_hash_init();
9129 bmap
= isl_basic_map_copy(bmap
);
9130 bmap
= isl_basic_map_normalize(bmap
);
9133 total
= isl_basic_map_total_dim(bmap
);
9134 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9135 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9137 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9138 isl_hash_hash(hash
, c_hash
);
9140 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9141 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9143 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9144 isl_hash_hash(hash
, c_hash
);
9146 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9147 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9149 if (isl_int_is_zero(bmap
->div
[i
][0]))
9151 isl_hash_byte(hash
, i
& 0xFF);
9152 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9153 isl_hash_hash(hash
, c_hash
);
9155 isl_basic_map_free(bmap
);
9159 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9161 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9164 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9171 map
= isl_map_copy(map
);
9172 map
= isl_map_normalize(map
);
9176 hash
= isl_hash_init();
9177 for (i
= 0; i
< map
->n
; ++i
) {
9179 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9180 isl_hash_hash(hash
, bmap_hash
);
9188 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9190 return isl_map_get_hash((isl_map
*)set
);
9193 /* Check if the value for dimension dim is completely determined
9194 * by the values of the other parameters and variables.
9195 * That is, check if dimension dim is involved in an equality.
9197 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9204 nparam
= isl_basic_set_n_param(bset
);
9205 for (i
= 0; i
< bset
->n_eq
; ++i
)
9206 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9211 /* Check if the value for dimension dim is completely determined
9212 * by the values of the other parameters and variables.
9213 * That is, check if dimension dim is involved in an equality
9214 * for each of the subsets.
9216 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
9222 for (i
= 0; i
< set
->n
; ++i
) {
9224 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
9231 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9233 return set
? set
->n
: 0;
9236 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9237 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9244 for (i
= 0; i
< map
->n
; ++i
)
9245 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9251 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9252 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9259 for (i
= 0; i
< set
->n
; ++i
)
9260 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9266 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9273 bset
= isl_basic_set_cow(bset
);
9277 dim
= isl_basic_set_get_space(bset
);
9278 dim
= isl_space_lift(dim
, bset
->n_div
);
9281 isl_space_free(bset
->dim
);
9283 bset
->extra
-= bset
->n_div
;
9286 bset
= isl_basic_set_finalize(bset
);
9290 isl_basic_set_free(bset
);
9294 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9300 set
= isl_set_align_divs(set
);
9305 set
= isl_set_cow(set
);
9309 n_div
= set
->p
[0]->n_div
;
9310 dim
= isl_set_get_space(set
);
9311 dim
= isl_space_lift(dim
, n_div
);
9314 isl_space_free(set
->dim
);
9317 for (i
= 0; i
< set
->n
; ++i
) {
9318 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9329 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9332 struct isl_basic_map
*bmap
;
9339 set
= isl_set_align_divs(set
);
9344 dim
= isl_set_get_space(set
);
9345 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9347 return isl_map_identity(isl_space_map_from_set(dim
));
9350 n_div
= set
->p
[0]->n_div
;
9351 dim
= isl_space_map_from_set(dim
);
9352 n_param
= isl_space_dim(dim
, isl_dim_param
);
9353 n_set
= isl_space_dim(dim
, isl_dim_in
);
9354 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9355 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9356 for (i
= 0; i
< n_set
; ++i
)
9357 bmap
= var_equal(bmap
, i
);
9359 total
= n_param
+ n_set
+ n_set
+ n_div
;
9360 for (i
= 0; i
< n_div
; ++i
) {
9361 k
= isl_basic_map_alloc_inequality(bmap
);
9364 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9365 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9366 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9367 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9368 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9369 set
->p
[0]->div
[i
][0]);
9371 l
= isl_basic_map_alloc_inequality(bmap
);
9374 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9375 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9376 set
->p
[0]->div
[i
][0]);
9377 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9381 bmap
= isl_basic_map_simplify(bmap
);
9382 bmap
= isl_basic_map_finalize(bmap
);
9383 return isl_map_from_basic_map(bmap
);
9386 isl_basic_map_free(bmap
);
9390 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9398 dim
= isl_basic_set_total_dim(bset
);
9399 size
+= bset
->n_eq
* (1 + dim
);
9400 size
+= bset
->n_ineq
* (1 + dim
);
9401 size
+= bset
->n_div
* (2 + dim
);
9406 int isl_set_size(__isl_keep isl_set
*set
)
9414 for (i
= 0; i
< set
->n
; ++i
)
9415 size
+= isl_basic_set_size(set
->p
[i
]);
9420 /* Check if there is any lower bound (if lower == 0) and/or upper
9421 * bound (if upper == 0) on the specified dim.
9423 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9424 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9431 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9433 pos
+= isl_basic_map_offset(bmap
, type
);
9435 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9436 if (isl_int_is_zero(bmap
->div
[i
][0]))
9438 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9442 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9443 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9446 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9447 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9454 return lower
&& upper
;
9457 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9458 enum isl_dim_type type
, unsigned pos
)
9460 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9463 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9464 enum isl_dim_type type
, unsigned pos
)
9466 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9469 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9470 enum isl_dim_type type
, unsigned pos
)
9472 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9475 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9476 enum isl_dim_type type
, unsigned pos
)
9483 for (i
= 0; i
< map
->n
; ++i
) {
9485 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9486 if (bounded
< 0 || !bounded
)
9493 /* Return 1 if the specified dim is involved in both an upper bound
9494 * and a lower bound.
9496 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9497 enum isl_dim_type type
, unsigned pos
)
9499 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9502 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9504 static int has_any_bound(__isl_keep isl_map
*map
,
9505 enum isl_dim_type type
, unsigned pos
,
9506 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9507 enum isl_dim_type type
, unsigned pos
))
9514 for (i
= 0; i
< map
->n
; ++i
) {
9516 bounded
= fn(map
->p
[i
], type
, pos
);
9517 if (bounded
< 0 || bounded
)
9524 /* Return 1 if the specified dim is involved in any lower bound.
9526 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9527 enum isl_dim_type type
, unsigned pos
)
9529 return has_any_bound(set
, type
, pos
,
9530 &isl_basic_map_dim_has_lower_bound
);
9533 /* Return 1 if the specified dim is involved in any upper bound.
9535 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9536 enum isl_dim_type type
, unsigned pos
)
9538 return has_any_bound(set
, type
, pos
,
9539 &isl_basic_map_dim_has_upper_bound
);
9542 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9544 static int has_bound(__isl_keep isl_map
*map
,
9545 enum isl_dim_type type
, unsigned pos
,
9546 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9547 enum isl_dim_type type
, unsigned pos
))
9554 for (i
= 0; i
< map
->n
; ++i
) {
9556 bounded
= fn(map
->p
[i
], type
, pos
);
9557 if (bounded
< 0 || !bounded
)
9564 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9566 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9567 enum isl_dim_type type
, unsigned pos
)
9569 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9572 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9574 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9575 enum isl_dim_type type
, unsigned pos
)
9577 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9580 /* For each of the "n" variables starting at "first", determine
9581 * the sign of the variable and put the results in the first "n"
9582 * elements of the array "signs".
9584 * 1 means that the variable is non-negative
9585 * -1 means that the variable is non-positive
9586 * 0 means the variable attains both positive and negative values.
9588 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9589 unsigned first
, unsigned n
, int *signs
)
9591 isl_vec
*bound
= NULL
;
9592 struct isl_tab
*tab
= NULL
;
9593 struct isl_tab_undo
*snap
;
9596 if (!bset
|| !signs
)
9599 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9600 tab
= isl_tab_from_basic_set(bset
, 0);
9604 isl_seq_clr(bound
->el
, bound
->size
);
9605 isl_int_set_si(bound
->el
[0], -1);
9607 snap
= isl_tab_snap(tab
);
9608 for (i
= 0; i
< n
; ++i
) {
9611 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9612 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9615 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9616 if (isl_tab_rollback(tab
, snap
) < 0)
9624 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9625 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9628 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9629 if (isl_tab_rollback(tab
, snap
) < 0)
9632 signs
[i
] = empty
? -1 : 0;
9636 isl_vec_free(bound
);
9640 isl_vec_free(bound
);
9644 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9645 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9647 if (!bset
|| !signs
)
9649 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9652 first
+= pos(bset
->dim
, type
) - 1;
9653 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9656 /* Check if the given basic map is obviously single-valued.
9657 * In particular, for each output dimension, check that there is
9658 * an equality that defines the output dimension in terms of
9659 * earlier dimensions.
9661 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9671 total
= 1 + isl_basic_map_total_dim(bmap
);
9672 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9673 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9675 for (i
= 0; i
< n_out
; ++i
) {
9676 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9677 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9679 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9680 total
- (o_out
+ i
+ 1)) == -1)
9683 if (j
>= bmap
->n_eq
)
9690 /* Check if the given basic map is single-valued.
9695 * and check if the result is a subset of the identity mapping.
9697 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9700 isl_basic_map
*test
;
9704 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9708 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9709 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9711 space
= isl_basic_map_get_space(bmap
);
9712 space
= isl_space_map_from_set(isl_space_range(space
));
9713 id
= isl_basic_map_identity(space
);
9715 sv
= isl_basic_map_is_subset(test
, id
);
9717 isl_basic_map_free(test
);
9718 isl_basic_map_free(id
);
9723 /* Check if the given map is obviously single-valued.
9725 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9734 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9737 /* Check if the given map is single-valued.
9742 * and check if the result is a subset of the identity mapping.
9744 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9751 sv
= isl_map_plain_is_single_valued(map
);
9755 test
= isl_map_reverse(isl_map_copy(map
));
9756 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9758 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9759 id
= isl_map_identity(dim
);
9761 sv
= isl_map_is_subset(test
, id
);
9769 int isl_map_is_injective(__isl_keep isl_map
*map
)
9773 map
= isl_map_copy(map
);
9774 map
= isl_map_reverse(map
);
9775 in
= isl_map_is_single_valued(map
);
9781 /* Check if the given map is obviously injective.
9783 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9787 map
= isl_map_copy(map
);
9788 map
= isl_map_reverse(map
);
9789 in
= isl_map_plain_is_single_valued(map
);
9795 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9799 sv
= isl_map_is_single_valued(map
);
9803 return isl_map_is_injective(map
);
9806 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9808 return isl_map_is_single_valued((isl_map
*)set
);
9811 int isl_map_is_translation(__isl_keep isl_map
*map
)
9816 delta
= isl_map_deltas(isl_map_copy(map
));
9817 ok
= isl_set_is_singleton(delta
);
9818 isl_set_free(delta
);
9823 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9825 if (isl_seq_first_non_zero(p
, pos
) != -1)
9827 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9832 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9841 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9844 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9845 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9846 for (j
= 0; j
< nvar
; ++j
) {
9847 int lower
= 0, upper
= 0;
9848 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9849 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9851 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9857 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9858 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9860 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9862 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9867 if (!lower
|| !upper
)
9874 int isl_set_is_box(__isl_keep isl_set
*set
)
9881 return isl_basic_set_is_box(set
->p
[0]);
9884 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9889 return isl_space_is_wrapping(bset
->dim
);
9892 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9897 return isl_space_is_wrapping(set
->dim
);
9900 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9902 bmap
= isl_basic_map_cow(bmap
);
9906 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9910 bmap
= isl_basic_map_finalize(bmap
);
9912 return (isl_basic_set
*)bmap
;
9914 isl_basic_map_free(bmap
);
9918 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9922 map
= isl_map_cow(map
);
9926 for (i
= 0; i
< map
->n
; ++i
) {
9927 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9931 map
->dim
= isl_space_wrap(map
->dim
);
9935 return (isl_set
*)map
;
9941 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9943 bset
= isl_basic_set_cow(bset
);
9947 bset
->dim
= isl_space_unwrap(bset
->dim
);
9951 bset
= isl_basic_set_finalize(bset
);
9953 return (isl_basic_map
*)bset
;
9955 isl_basic_set_free(bset
);
9959 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9966 if (!isl_set_is_wrapping(set
))
9967 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9970 set
= isl_set_cow(set
);
9974 for (i
= 0; i
< set
->n
; ++i
) {
9975 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9980 set
->dim
= isl_space_unwrap(set
->dim
);
9984 return (isl_map
*)set
;
9990 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9991 enum isl_dim_type type
)
9996 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9999 bmap
= isl_basic_map_cow(bmap
);
10003 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
10007 bmap
= isl_basic_map_finalize(bmap
);
10011 isl_basic_map_free(bmap
);
10015 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10016 enum isl_dim_type type
)
10023 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10026 map
= isl_map_cow(map
);
10030 for (i
= 0; i
< map
->n
; ++i
) {
10031 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10035 map
->dim
= isl_space_reset(map
->dim
, type
);
10045 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10050 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10053 bmap
= isl_basic_map_cow(bmap
);
10057 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10061 bmap
= isl_basic_map_finalize(bmap
);
10065 isl_basic_map_free(bmap
);
10069 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10071 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
10074 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10075 __isl_take isl_basic_map
*bmap
)
10080 if (!bmap
->dim
->nested
[0])
10083 bmap
= isl_basic_map_cow(bmap
);
10087 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10091 bmap
= isl_basic_map_finalize(bmap
);
10095 isl_basic_map_free(bmap
);
10099 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10100 __isl_take isl_basic_map
*bmap
)
10105 if (!bmap
->dim
->nested
[1])
10108 bmap
= isl_basic_map_cow(bmap
);
10112 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
10116 bmap
= isl_basic_map_finalize(bmap
);
10120 isl_basic_map_free(bmap
);
10124 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
10131 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
10134 map
= isl_map_cow(map
);
10138 for (i
= 0; i
< map
->n
; ++i
) {
10139 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
10143 map
->dim
= isl_space_flatten(map
->dim
);
10153 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
10155 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
10158 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
10160 isl_space
*dim
, *flat_dim
;
10163 dim
= isl_set_get_space(set
);
10164 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
10165 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
10166 map
= isl_map_intersect_domain(map
, set
);
10171 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
10178 if (!map
->dim
->nested
[0])
10181 map
= isl_map_cow(map
);
10185 for (i
= 0; i
< map
->n
; ++i
) {
10186 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
10190 map
->dim
= isl_space_flatten_domain(map
->dim
);
10200 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
10207 if (!map
->dim
->nested
[1])
10210 map
= isl_map_cow(map
);
10214 for (i
= 0; i
< map
->n
; ++i
) {
10215 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
10219 map
->dim
= isl_space_flatten_range(map
->dim
);
10229 /* Reorder the dimensions of "bmap" according to the given dim_map
10230 * and set the dimension specification to "dim".
10232 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
10233 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
10235 isl_basic_map
*res
;
10238 bmap
= isl_basic_map_cow(bmap
);
10239 if (!bmap
|| !dim
|| !dim_map
)
10242 flags
= bmap
->flags
;
10243 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
10244 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
10245 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
10246 res
= isl_basic_map_alloc_space(dim
,
10247 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
10248 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
10250 res
->flags
= flags
;
10251 res
= isl_basic_map_finalize(res
);
10255 isl_basic_map_free(bmap
);
10256 isl_space_free(dim
);
10260 /* Reorder the dimensions of "map" according to given reordering.
10262 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
10263 __isl_take isl_reordering
*r
)
10266 struct isl_dim_map
*dim_map
;
10268 map
= isl_map_cow(map
);
10269 dim_map
= isl_dim_map_from_reordering(r
);
10270 if (!map
|| !r
|| !dim_map
)
10273 for (i
= 0; i
< map
->n
; ++i
) {
10274 struct isl_dim_map
*dim_map_i
;
10276 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10278 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10279 isl_space_copy(r
->dim
), dim_map_i
);
10285 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10287 isl_reordering_free(r
);
10293 isl_reordering_free(r
);
10297 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10298 __isl_take isl_reordering
*r
)
10300 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10303 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10304 __isl_take isl_space
*model
)
10308 if (!map
|| !model
)
10311 ctx
= isl_space_get_ctx(model
);
10312 if (!isl_space_has_named_params(model
))
10313 isl_die(ctx
, isl_error_invalid
,
10314 "model has unnamed parameters", goto error
);
10315 if (!isl_space_has_named_params(map
->dim
))
10316 isl_die(ctx
, isl_error_invalid
,
10317 "relation has unnamed parameters", goto error
);
10318 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10319 isl_reordering
*exp
;
10321 model
= isl_space_drop_dims(model
, isl_dim_in
,
10322 0, isl_space_dim(model
, isl_dim_in
));
10323 model
= isl_space_drop_dims(model
, isl_dim_out
,
10324 0, isl_space_dim(model
, isl_dim_out
));
10325 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10326 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10327 map
= isl_map_realign(map
, exp
);
10330 isl_space_free(model
);
10333 isl_space_free(model
);
10338 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10339 __isl_take isl_space
*model
)
10341 return isl_map_align_params(set
, model
);
10344 /* Align the parameters of "bmap" to those of "model", introducing
10345 * additional parameters if needed.
10347 __isl_give isl_basic_map
*isl_basic_map_align_params(
10348 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10352 if (!bmap
|| !model
)
10355 ctx
= isl_space_get_ctx(model
);
10356 if (!isl_space_has_named_params(model
))
10357 isl_die(ctx
, isl_error_invalid
,
10358 "model has unnamed parameters", goto error
);
10359 if (!isl_space_has_named_params(bmap
->dim
))
10360 isl_die(ctx
, isl_error_invalid
,
10361 "relation has unnamed parameters", goto error
);
10362 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10363 isl_reordering
*exp
;
10364 struct isl_dim_map
*dim_map
;
10366 model
= isl_space_drop_dims(model
, isl_dim_in
,
10367 0, isl_space_dim(model
, isl_dim_in
));
10368 model
= isl_space_drop_dims(model
, isl_dim_out
,
10369 0, isl_space_dim(model
, isl_dim_out
));
10370 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10371 exp
= isl_reordering_extend_space(exp
,
10372 isl_basic_map_get_space(bmap
));
10373 dim_map
= isl_dim_map_from_reordering(exp
);
10374 bmap
= isl_basic_map_realign(bmap
,
10375 exp
? isl_space_copy(exp
->dim
) : NULL
,
10376 isl_dim_map_extend(dim_map
, bmap
));
10377 isl_reordering_free(exp
);
10381 isl_space_free(model
);
10384 isl_space_free(model
);
10385 isl_basic_map_free(bmap
);
10389 /* Align the parameters of "bset" to those of "model", introducing
10390 * additional parameters if needed.
10392 __isl_give isl_basic_set
*isl_basic_set_align_params(
10393 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10395 return isl_basic_map_align_params(bset
, model
);
10398 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10399 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10400 enum isl_dim_type c2
, enum isl_dim_type c3
,
10401 enum isl_dim_type c4
, enum isl_dim_type c5
)
10403 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10404 struct isl_mat
*mat
;
10410 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10411 isl_basic_map_total_dim(bmap
) + 1);
10414 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10415 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10416 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10417 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10418 isl_int_set(mat
->row
[i
][pos
],
10419 bmap
->eq
[i
][off
+ k
]);
10427 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10428 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10429 enum isl_dim_type c2
, enum isl_dim_type c3
,
10430 enum isl_dim_type c4
, enum isl_dim_type c5
)
10432 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10433 struct isl_mat
*mat
;
10439 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10440 isl_basic_map_total_dim(bmap
) + 1);
10443 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10444 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10445 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10446 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10447 isl_int_set(mat
->row
[i
][pos
],
10448 bmap
->ineq
[i
][off
+ k
]);
10456 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10457 __isl_take isl_space
*dim
,
10458 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10459 enum isl_dim_type c2
, enum isl_dim_type c3
,
10460 enum isl_dim_type c4
, enum isl_dim_type c5
)
10462 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10463 isl_basic_map
*bmap
;
10469 if (!dim
|| !eq
|| !ineq
)
10472 if (eq
->n_col
!= ineq
->n_col
)
10473 isl_die(dim
->ctx
, isl_error_invalid
,
10474 "equalities and inequalities matrices should have "
10475 "same number of columns", goto error
);
10477 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10479 if (eq
->n_col
< total
)
10480 isl_die(dim
->ctx
, isl_error_invalid
,
10481 "number of columns too small", goto error
);
10483 extra
= eq
->n_col
- total
;
10485 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10486 eq
->n_row
, ineq
->n_row
);
10489 for (i
= 0; i
< extra
; ++i
) {
10490 k
= isl_basic_map_alloc_div(bmap
);
10493 isl_int_set_si(bmap
->div
[k
][0], 0);
10495 for (i
= 0; i
< eq
->n_row
; ++i
) {
10496 l
= isl_basic_map_alloc_equality(bmap
);
10499 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10500 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10501 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10502 isl_int_set(bmap
->eq
[l
][off
+ k
],
10508 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10509 l
= isl_basic_map_alloc_inequality(bmap
);
10512 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10513 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10514 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10515 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10516 ineq
->row
[i
][pos
]);
10522 isl_space_free(dim
);
10524 isl_mat_free(ineq
);
10526 bmap
= isl_basic_map_simplify(bmap
);
10527 return isl_basic_map_finalize(bmap
);
10529 isl_space_free(dim
);
10531 isl_mat_free(ineq
);
10535 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10536 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10537 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10539 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10540 c1
, c2
, c3
, c4
, isl_dim_in
);
10543 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10544 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10545 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10547 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10548 c1
, c2
, c3
, c4
, isl_dim_in
);
10551 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10552 __isl_take isl_space
*dim
,
10553 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10554 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10556 return (isl_basic_set
*)
10557 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10558 c1
, c2
, c3
, c4
, isl_dim_in
);
10561 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10566 return isl_space_can_zip(bmap
->dim
);
10569 int isl_map_can_zip(__isl_keep isl_map
*map
)
10574 return isl_space_can_zip(map
->dim
);
10577 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10578 * (A -> C) -> (B -> D).
10580 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10589 if (!isl_basic_map_can_zip(bmap
))
10590 isl_die(bmap
->ctx
, isl_error_invalid
,
10591 "basic map cannot be zipped", goto error
);
10592 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10593 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10594 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10595 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10596 bmap
= isl_basic_map_cow(bmap
);
10597 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10600 bmap
->dim
= isl_space_zip(bmap
->dim
);
10605 isl_basic_map_free(bmap
);
10609 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10610 * (A -> C) -> (B -> D).
10612 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10619 if (!isl_map_can_zip(map
))
10620 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10623 map
= isl_map_cow(map
);
10627 for (i
= 0; i
< map
->n
; ++i
) {
10628 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10633 map
->dim
= isl_space_zip(map
->dim
);
10643 /* Can we apply isl_basic_map_curry to "bmap"?
10644 * That is, does it have a nested relation in its domain?
10646 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10651 return isl_space_can_curry(bmap
->dim
);
10654 /* Can we apply isl_map_curry to "map"?
10655 * That is, does it have a nested relation in its domain?
10657 int isl_map_can_curry(__isl_keep isl_map
*map
)
10662 return isl_space_can_curry(map
->dim
);
10665 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10668 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10674 if (!isl_basic_map_can_curry(bmap
))
10675 isl_die(bmap
->ctx
, isl_error_invalid
,
10676 "basic map cannot be curried", goto error
);
10677 bmap
= isl_basic_map_cow(bmap
);
10680 bmap
->dim
= isl_space_curry(bmap
->dim
);
10685 isl_basic_map_free(bmap
);
10689 /* Given a map (A -> B) -> C, return the corresponding map
10692 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10699 if (!isl_map_can_curry(map
))
10700 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10703 map
= isl_map_cow(map
);
10707 for (i
= 0; i
< map
->n
; ++i
) {
10708 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10713 map
->dim
= isl_space_curry(map
->dim
);
10723 /* Can we apply isl_basic_map_uncurry to "bmap"?
10724 * That is, does it have a nested relation in its domain?
10726 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10731 return isl_space_can_uncurry(bmap
->dim
);
10734 /* Can we apply isl_map_uncurry to "map"?
10735 * That is, does it have a nested relation in its domain?
10737 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10742 return isl_space_can_uncurry(map
->dim
);
10745 /* Given a basic map A -> (B -> C), return the corresponding basic map
10748 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10754 if (!isl_basic_map_can_uncurry(bmap
))
10755 isl_die(bmap
->ctx
, isl_error_invalid
,
10756 "basic map cannot be uncurried",
10757 return isl_basic_map_free(bmap
));
10758 bmap
= isl_basic_map_cow(bmap
);
10761 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10763 return isl_basic_map_free(bmap
);
10767 /* Given a map A -> (B -> C), return the corresponding map
10770 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10777 if (!isl_map_can_uncurry(map
))
10778 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10779 return isl_map_free(map
));
10781 map
= isl_map_cow(map
);
10785 for (i
= 0; i
< map
->n
; ++i
) {
10786 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10788 return isl_map_free(map
);
10791 map
->dim
= isl_space_uncurry(map
->dim
);
10793 return isl_map_free(map
);
10798 /* Construct a basic map mapping the domain of the affine expression
10799 * to a one-dimensional range prescribed by the affine expression.
10801 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10805 isl_local_space
*ls
;
10806 isl_basic_map
*bmap
;
10811 ls
= isl_aff_get_local_space(aff
);
10812 bmap
= isl_basic_map_from_local_space(ls
);
10813 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10814 k
= isl_basic_map_alloc_equality(bmap
);
10818 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10819 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10820 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10821 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10822 aff
->v
->size
- (pos
+ 1));
10825 bmap
= isl_basic_map_finalize(bmap
);
10829 isl_basic_map_free(bmap
);
10833 /* Construct a map mapping the domain of the affine expression
10834 * to a one-dimensional range prescribed by the affine expression.
10836 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10838 isl_basic_map
*bmap
;
10840 bmap
= isl_basic_map_from_aff(aff
);
10841 return isl_map_from_basic_map(bmap
);
10844 /* Construct a basic map mapping the domain the multi-affine expression
10845 * to its range, with each dimension in the range equated to the
10846 * corresponding affine expression.
10848 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10849 __isl_take isl_multi_aff
*maff
)
10853 isl_basic_map
*bmap
;
10858 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10859 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10860 "invalid space", return isl_multi_aff_free(maff
));
10862 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10863 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10865 for (i
= 0; i
< maff
->n
; ++i
) {
10867 isl_basic_map
*bmap_i
;
10869 aff
= isl_aff_copy(maff
->p
[i
]);
10870 bmap_i
= isl_basic_map_from_aff(aff
);
10872 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10875 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10877 isl_multi_aff_free(maff
);
10881 /* Construct a map mapping the domain the multi-affine expression
10882 * to its range, with each dimension in the range equated to the
10883 * corresponding affine expression.
10885 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10887 isl_basic_map
*bmap
;
10889 bmap
= isl_basic_map_from_multi_aff(maff
);
10890 return isl_map_from_basic_map(bmap
);
10893 /* Construct a basic map mapping a domain in the given space to
10894 * to an n-dimensional range, with n the number of elements in the list,
10895 * where each coordinate in the range is prescribed by the
10896 * corresponding affine expression.
10897 * The domains of all affine expressions in the list are assumed to match
10900 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10901 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10905 isl_basic_map
*bmap
;
10910 dim
= isl_space_from_domain(domain_dim
);
10911 bmap
= isl_basic_map_universe(dim
);
10913 for (i
= 0; i
< list
->n
; ++i
) {
10915 isl_basic_map
*bmap_i
;
10917 aff
= isl_aff_copy(list
->p
[i
]);
10918 bmap_i
= isl_basic_map_from_aff(aff
);
10920 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10923 isl_aff_list_free(list
);
10927 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10928 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10930 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10933 /* Construct a basic map where the given dimensions are equal to each other.
10935 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10936 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10938 isl_basic_map
*bmap
= NULL
;
10944 if (pos1
>= isl_space_dim(space
, type1
))
10945 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10946 "index out of bounds", goto error
);
10947 if (pos2
>= isl_space_dim(space
, type2
))
10948 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10949 "index out of bounds", goto error
);
10951 if (type1
== type2
&& pos1
== pos2
)
10952 return isl_basic_map_universe(space
);
10954 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10955 i
= isl_basic_map_alloc_equality(bmap
);
10958 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10959 pos1
+= isl_basic_map_offset(bmap
, type1
);
10960 pos2
+= isl_basic_map_offset(bmap
, type2
);
10961 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10962 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10963 bmap
= isl_basic_map_finalize(bmap
);
10964 isl_space_free(space
);
10967 isl_space_free(space
);
10968 isl_basic_map_free(bmap
);
10972 /* Add a constraint imposing that the given two dimensions are equal.
10974 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10975 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10979 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10981 bmap
= isl_basic_map_intersect(bmap
, eq
);
10986 /* Add a constraint imposing that the given two dimensions are equal.
10988 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10989 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10991 isl_basic_map
*bmap
;
10993 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10995 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11000 /* Add a constraint imposing that the given two dimensions have opposite values.
11002 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
11003 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11005 isl_basic_map
*bmap
= NULL
;
11011 if (pos1
>= isl_map_dim(map
, type1
))
11012 isl_die(map
->ctx
, isl_error_invalid
,
11013 "index out of bounds", goto error
);
11014 if (pos2
>= isl_map_dim(map
, type2
))
11015 isl_die(map
->ctx
, isl_error_invalid
,
11016 "index out of bounds", goto error
);
11018 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11019 i
= isl_basic_map_alloc_equality(bmap
);
11022 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11023 pos1
+= isl_basic_map_offset(bmap
, type1
);
11024 pos2
+= isl_basic_map_offset(bmap
, type2
);
11025 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11026 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11027 bmap
= isl_basic_map_finalize(bmap
);
11029 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11033 isl_basic_map_free(bmap
);
11038 /* Add a constraint imposing that the value of the first dimension is
11039 * greater than or equal to that of the second.
11041 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
11042 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11045 isl_local_space
*ls
;
11050 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
11051 isl_die(bmap
->ctx
, isl_error_invalid
,
11052 "index out of bounds", return isl_basic_map_free(bmap
));
11053 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
11054 isl_die(bmap
->ctx
, isl_error_invalid
,
11055 "index out of bounds", return isl_basic_map_free(bmap
));
11057 if (type1
== type2
&& pos1
== pos2
)
11060 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
11061 c
= isl_inequality_alloc(ls
);
11062 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11063 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11064 bmap
= isl_basic_map_add_constraint(bmap
, c
);
11069 /* Add a constraint imposing that the value of the first dimension is
11070 * greater than that of the second.
11072 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
11073 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11075 isl_basic_map
*bmap
= NULL
;
11081 if (pos1
>= isl_map_dim(map
, type1
))
11082 isl_die(map
->ctx
, isl_error_invalid
,
11083 "index out of bounds", goto error
);
11084 if (pos2
>= isl_map_dim(map
, type2
))
11085 isl_die(map
->ctx
, isl_error_invalid
,
11086 "index out of bounds", goto error
);
11088 if (type1
== type2
&& pos1
== pos2
) {
11089 isl_space
*space
= isl_map_get_space(map
);
11091 return isl_map_empty(space
);
11094 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
11095 i
= isl_basic_map_alloc_inequality(bmap
);
11098 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11099 pos1
+= isl_basic_map_offset(bmap
, type1
);
11100 pos2
+= isl_basic_map_offset(bmap
, type2
);
11101 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
11102 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
11103 isl_int_set_si(bmap
->ineq
[i
][0], -1);
11104 bmap
= isl_basic_map_finalize(bmap
);
11106 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11110 isl_basic_map_free(bmap
);
11115 /* Add a constraint imposing that the value of the first dimension is
11116 * smaller than that of the second.
11118 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
11119 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11121 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
11124 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
11128 isl_local_space
*ls
;
11133 if (!isl_basic_map_divs_known(bmap
))
11134 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11135 "some divs are unknown", return NULL
);
11137 ls
= isl_basic_map_get_local_space(bmap
);
11138 div
= isl_local_space_get_div(ls
, pos
);
11139 isl_local_space_free(ls
);
11144 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
11147 return isl_basic_map_get_div(bset
, pos
);
11150 /* Plug in "subs" for dimension "type", "pos" of "bset".
11152 * Let i be the dimension to replace and let "subs" be of the form
11156 * Any integer division with a non-zero coefficient for i,
11158 * floor((a i + g)/m)
11162 * floor((a f + d g)/(m d))
11164 * Constraints of the form
11172 * We currently require that "subs" is an integral expression.
11173 * Handling rational expressions may require us to add stride constraints
11174 * as we do in isl_basic_set_preimage_multi_aff.
11176 __isl_give isl_basic_set
*isl_basic_set_substitute(
11177 __isl_take isl_basic_set
*bset
,
11178 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11184 if (bset
&& isl_basic_set_plain_is_empty(bset
))
11187 bset
= isl_basic_set_cow(bset
);
11188 if (!bset
|| !subs
)
11191 ctx
= isl_basic_set_get_ctx(bset
);
11192 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
11193 isl_die(ctx
, isl_error_invalid
,
11194 "spaces don't match", goto error
);
11195 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
11196 isl_die(ctx
, isl_error_unsupported
,
11197 "cannot handle divs yet", goto error
);
11198 if (!isl_int_is_one(subs
->v
->el
[0]))
11199 isl_die(ctx
, isl_error_invalid
,
11200 "can only substitute integer expressions", goto error
);
11202 pos
+= isl_basic_set_offset(bset
, type
);
11206 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11207 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
11209 isl_int_set(v
, bset
->eq
[i
][pos
]);
11210 isl_int_set_si(bset
->eq
[i
][pos
], 0);
11211 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
11212 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11215 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11216 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
11218 isl_int_set(v
, bset
->ineq
[i
][pos
]);
11219 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
11220 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
11221 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11224 for (i
= 0; i
< bset
->n_div
; ++i
) {
11225 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
11227 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
11228 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
11229 isl_seq_combine(bset
->div
[i
] + 1,
11230 subs
->v
->el
[0], bset
->div
[i
] + 1,
11231 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11232 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
11237 bset
= isl_basic_set_simplify(bset
);
11238 return isl_basic_set_finalize(bset
);
11240 isl_basic_set_free(bset
);
11244 /* Plug in "subs" for dimension "type", "pos" of "set".
11246 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
11247 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11251 if (set
&& isl_set_plain_is_empty(set
))
11254 set
= isl_set_cow(set
);
11258 for (i
= set
->n
- 1; i
>= 0; --i
) {
11259 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
11260 if (remove_if_empty(set
, i
) < 0)
11270 /* Check if the range of "ma" is compatible with "space".
11271 * Return -1 if anything is wrong.
11273 static int check_space_compatible_range_multi_aff(
11274 __isl_keep isl_space
*space
, __isl_keep isl_multi_aff
*ma
)
11277 isl_space
*ma_space
;
11279 ma_space
= isl_multi_aff_get_space(ma
);
11280 m
= isl_space_is_range_internal(space
, ma_space
);
11281 isl_space_free(ma_space
);
11283 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11284 "spaces don't match", return -1);
11288 /* Check if the range of "ma" is compatible with "bset".
11289 * Return -1 if anything is wrong.
11291 static int check_basic_set_compatible_range_multi_aff(
11292 __isl_keep isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11294 return check_space_compatible_range_multi_aff(bset
->dim
, ma
);
11297 /* Copy the divs from "ma" to "bset", adding zeros for the coefficients
11298 * of the other divs in "bset".
11300 static int set_ma_divs(__isl_keep isl_basic_set
*bset
,
11301 __isl_keep isl_multi_aff
*ma
, int n_div
)
11304 isl_local_space
*ls
;
11309 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11313 for (i
= 0; i
< n_div
; ++i
) {
11314 isl_seq_cpy(bset
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
11315 isl_seq_clr(bset
->div
[i
] + ls
->div
->n_col
, bset
->n_div
- n_div
);
11316 if (isl_basic_set_add_div_constraints(bset
, i
) < 0)
11320 isl_local_space_free(ls
);
11323 isl_local_space_free(ls
);
11327 /* How many stride constraints does "ma" enforce?
11328 * That is, how many of the affine expressions have a denominator
11329 * different from one?
11331 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11336 for (i
= 0; i
< ma
->n
; ++i
)
11337 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11343 /* For each affine expression in ma of the form
11345 * x_i = (f_i y + h_i)/m_i
11347 * with m_i different from one, add a constraint to "bset"
11350 * f_i y + h_i = m_i alpha_i
11352 * with alpha_i an additional existentially quantified variable.
11354 static __isl_give isl_basic_set
*add_ma_strides(
11355 __isl_take isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11361 total
= isl_basic_set_total_dim(bset
);
11362 for (i
= 0; i
< ma
->n
; ++i
) {
11365 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11367 div
= isl_basic_set_alloc_div(bset
);
11368 k
= isl_basic_set_alloc_equality(bset
);
11369 if (div
< 0 || k
< 0)
11371 isl_int_set_si(bset
->div
[div
][0], 0);
11372 len
= ma
->p
[i
]->v
->size
;
11373 isl_seq_cpy(bset
->eq
[k
], ma
->p
[i
]->v
->el
+ 1, len
- 1);
11374 isl_seq_clr(bset
->eq
[k
] + len
- 1, 1 + total
- (len
- 1));
11375 isl_int_neg(bset
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11381 isl_basic_set_free(bset
);
11385 /* Compute the preimage of "bset" under the function represented by "ma".
11386 * In other words, plug in "ma" in "bset". The result is a basic set
11387 * that lives in the domain space of "ma".
11389 * If bset is represented by
11391 * A(p) + B x + C(divs) >= 0
11393 * and ma is represented by
11395 * x = D(p) + F(y) + G(divs')
11397 * then the result is
11399 * A(p) + B D(p) + B F(y) + B G(divs') + C(divs) >= 0
11401 * The divs in the input set are similarly adjusted.
11404 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
11408 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
11410 * If bset is not a rational set and if F(y) involves any denominators
11412 * x_i = (f_i y + h_i)/m_i
11414 * the additional constraints are added to ensure that we only
11415 * map back integer points. That is we enforce
11417 * f_i y + h_i = m_i alpha_i
11419 * with alpha_i an additional existentially quantified variable.
11421 * We first copy over the divs from "ma".
11422 * Then we add the modified constraints and divs from "bset".
11423 * Finally, we add the stride constraints, if needed.
11425 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11426 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11430 isl_basic_set
*res
= NULL
;
11431 int n_div_bset
, n_div_ma
;
11432 isl_int f
, c1
, c2
, g
;
11433 int rational
, strides
;
11440 ma
= isl_multi_aff_align_divs(ma
);
11443 if (check_basic_set_compatible_range_multi_aff(bset
, ma
) < 0)
11446 n_div_bset
= isl_basic_set_dim(bset
, isl_dim_div
);
11447 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11449 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
11450 rational
= isl_basic_set_is_rational(bset
);
11451 strides
= rational
? 0 : multi_aff_strides(ma
);
11452 res
= isl_basic_set_alloc_space(space
, n_div_ma
+ n_div_bset
+ strides
,
11453 bset
->n_eq
+ strides
, bset
->n_ineq
+ 2 * n_div_ma
);
11455 res
= isl_basic_set_set_rational(res
);
11457 for (i
= 0; i
< n_div_ma
+ n_div_bset
; ++i
)
11458 if (isl_basic_set_alloc_div(res
) < 0)
11461 if (set_ma_divs(res
, ma
, n_div_ma
) < 0)
11464 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11465 k
= isl_basic_set_alloc_equality(res
);
11468 isl_seq_preimage(res
->eq
[k
], bset
->eq
[i
], ma
, n_div_ma
,
11469 n_div_bset
, f
, c1
, c2
, g
, 0);
11472 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11473 k
= isl_basic_set_alloc_inequality(res
);
11476 isl_seq_preimage(res
->ineq
[k
], bset
->ineq
[i
], ma
, n_div_ma
,
11477 n_div_bset
, f
, c1
, c2
, g
, 0);
11480 for (i
= 0; i
< bset
->n_div
; ++i
) {
11481 if (isl_int_is_zero(bset
->div
[i
][0])) {
11482 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11485 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bset
->div
[i
],
11486 ma
, n_div_ma
, n_div_bset
, f
, c1
, c2
, g
, 1);
11490 res
= add_ma_strides(res
, ma
);
11496 isl_basic_set_free(bset
);
11497 isl_multi_aff_free(ma
);
11498 res
= isl_basic_set_simplify(res
);
11499 return isl_basic_set_finalize(res
);
11505 isl_basic_set_free(bset
);
11506 isl_multi_aff_free(ma
);
11507 isl_basic_set_free(res
);
11511 /* Check if the range of "ma" is compatible with "set".
11512 * Return -1 if anything is wrong.
11514 static int check_set_compatible_range_multi_aff(
11515 __isl_keep isl_set
*set
, __isl_keep isl_multi_aff
*ma
)
11517 return check_space_compatible_range_multi_aff(set
->dim
, ma
);
11520 /* Compute the preimage of "set" under the function represented by "ma".
11521 * In other words, plug in "ma" in "set. The result is a set
11522 * that lives in the domain space of "ma".
11524 static __isl_give isl_set
*set_preimage_multi_aff(__isl_take isl_set
*set
,
11525 __isl_take isl_multi_aff
*ma
)
11529 set
= isl_set_cow(set
);
11530 ma
= isl_multi_aff_align_divs(ma
);
11533 if (check_set_compatible_range_multi_aff(set
, ma
) < 0)
11536 for (i
= 0; i
< set
->n
; ++i
) {
11537 set
->p
[i
] = isl_basic_set_preimage_multi_aff(set
->p
[i
],
11538 isl_multi_aff_copy(ma
));
11543 isl_space_free(set
->dim
);
11544 set
->dim
= isl_multi_aff_get_domain_space(ma
);
11548 isl_multi_aff_free(ma
);
11550 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
11551 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
11554 isl_multi_aff_free(ma
);
11559 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11560 __isl_take isl_multi_aff
*ma
)
11565 if (isl_space_match(set
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11566 return set_preimage_multi_aff(set
, ma
);
11568 if (!isl_space_has_named_params(set
->dim
) ||
11569 !isl_space_has_named_params(ma
->space
))
11570 isl_die(set
->ctx
, isl_error_invalid
,
11571 "unaligned unnamed parameters", goto error
);
11572 set
= isl_set_align_params(set
, isl_multi_aff_get_space(ma
));
11573 ma
= isl_multi_aff_align_params(ma
, isl_set_get_space(set
));
11575 return set_preimage_multi_aff(set
, ma
);
11577 isl_multi_aff_free(ma
);
11578 return isl_set_free(set
);
11581 /* Compute the preimage of "set" under the function represented by "pma".
11582 * In other words, plug in "pma" in "set. The result is a set
11583 * that lives in the domain space of "pma".
11585 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11586 __isl_take isl_pw_multi_aff
*pma
)
11595 isl_pw_multi_aff_free(pma
);
11596 res
= isl_set_empty(isl_set_get_space(set
));
11601 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11602 isl_multi_aff_copy(pma
->p
[0].maff
));
11603 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11605 for (i
= 1; i
< pma
->n
; ++i
) {
11608 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11609 isl_multi_aff_copy(pma
->p
[i
].maff
));
11610 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11611 res
= isl_set_union(res
, res_i
);
11614 isl_pw_multi_aff_free(pma
);
11618 isl_pw_multi_aff_free(pma
);
11623 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11624 __isl_take isl_pw_multi_aff
*pma
)
11629 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11630 return set_preimage_pw_multi_aff(set
, pma
);
11632 if (!isl_space_has_named_params(set
->dim
) ||
11633 !isl_space_has_named_params(pma
->dim
))
11634 isl_die(set
->ctx
, isl_error_invalid
,
11635 "unaligned unnamed parameters", goto error
);
11636 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11637 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11639 return set_preimage_pw_multi_aff(set
, pma
);
11641 isl_pw_multi_aff_free(pma
);
11642 return isl_set_free(set
);