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
);
3069 return isl_basic_map_set_to_empty(res
);
3071 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3072 return isl_basic_map_finalize(res
);
3075 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3076 __isl_take isl_basic_set
*bset
,
3077 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3079 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3082 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3083 enum isl_dim_type type
, unsigned n
)
3087 return isl_basic_map_insert_dims(bmap
, type
,
3088 isl_basic_map_dim(bmap
, type
), n
);
3091 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3092 enum isl_dim_type type
, unsigned n
)
3096 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3097 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3099 isl_basic_set_free(bset
);
3103 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3104 enum isl_dim_type type
)
3108 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3111 space
= isl_map_get_space(map
);
3112 space
= isl_space_reset(space
, type
);
3113 map
= isl_map_reset_space(map
, space
);
3117 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3118 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3123 return map_space_reset(map
, type
);
3125 map
= isl_map_cow(map
);
3129 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3133 for (i
= 0; i
< map
->n
; ++i
) {
3134 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3145 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3146 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3148 return isl_map_insert_dims(set
, type
, pos
, n
);
3151 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3152 enum isl_dim_type type
, unsigned n
)
3156 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3159 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3160 enum isl_dim_type type
, unsigned n
)
3164 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3165 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3171 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3172 __isl_take isl_basic_map
*bmap
,
3173 enum isl_dim_type dst_type
, unsigned dst_pos
,
3174 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3176 struct isl_dim_map
*dim_map
;
3177 struct isl_basic_map
*res
;
3178 enum isl_dim_type t
;
3179 unsigned total
, off
;
3186 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3189 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3192 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3194 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3195 pos(bmap
->dim
, src_type
) + src_pos
+
3196 ((src_type
< dst_type
) ? n
: 0)) {
3197 bmap
= isl_basic_map_cow(bmap
);
3201 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3202 src_type
, src_pos
, n
);
3206 bmap
= isl_basic_map_finalize(bmap
);
3211 total
= isl_basic_map_total_dim(bmap
);
3212 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3215 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3216 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3217 if (t
== dst_type
) {
3218 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3221 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3224 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3225 dst_pos
, size
- dst_pos
, off
);
3226 off
+= size
- dst_pos
;
3227 } else if (t
== src_type
) {
3228 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3231 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3232 src_pos
+ n
, size
- src_pos
- n
, off
);
3233 off
+= size
- src_pos
- n
;
3235 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3239 isl_dim_map_div(dim_map
, bmap
, off
);
3241 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3242 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3243 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3247 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3248 src_type
, src_pos
, n
);
3252 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3253 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3254 bmap
= isl_basic_map_finalize(bmap
);
3258 isl_basic_map_free(bmap
);
3262 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3263 enum isl_dim_type dst_type
, unsigned dst_pos
,
3264 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3266 return (isl_basic_set
*)isl_basic_map_move_dims(
3267 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3270 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3271 enum isl_dim_type dst_type
, unsigned dst_pos
,
3272 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3276 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3277 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3278 src_type
, src_pos
, n
);
3284 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3285 enum isl_dim_type dst_type
, unsigned dst_pos
,
3286 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3295 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3298 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3301 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3303 map
= isl_map_cow(map
);
3307 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3311 for (i
= 0; i
< map
->n
; ++i
) {
3312 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3314 src_type
, src_pos
, n
);
3325 /* Move the specified dimensions to the last columns right before
3326 * the divs. Don't change the dimension specification of bmap.
3327 * That's the responsibility of the caller.
3329 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3330 enum isl_dim_type type
, unsigned first
, unsigned n
)
3332 struct isl_dim_map
*dim_map
;
3333 struct isl_basic_map
*res
;
3334 enum isl_dim_type t
;
3335 unsigned total
, off
;
3339 if (pos(bmap
->dim
, type
) + first
+ n
==
3340 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3343 total
= isl_basic_map_total_dim(bmap
);
3344 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3347 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3348 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3350 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3353 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3354 first
, n
, total
- bmap
->n_div
- n
);
3355 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3356 first
+ n
, size
- (first
+ n
), off
);
3357 off
+= size
- (first
+ n
);
3359 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3363 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3365 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3366 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3367 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3371 /* Insert "n" rows in the divs of "bmap".
3373 * The number of columns is not changed, which means that the last
3374 * dimensions of "bmap" are being reintepreted as the new divs.
3375 * The space of "bmap" is not adjusted, however, which means
3376 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3377 * from the space of "bmap" is the responsibility of the caller.
3379 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3387 bmap
= isl_basic_map_cow(bmap
);
3391 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3392 old
= bmap
->block2
.data
;
3393 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3394 (bmap
->extra
+ n
) * (1 + row_size
));
3395 if (!bmap
->block2
.data
)
3396 return isl_basic_map_free(bmap
);
3397 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3399 return isl_basic_map_free(bmap
);
3400 for (i
= 0; i
< n
; ++i
) {
3401 new_div
[i
] = bmap
->block2
.data
+
3402 (bmap
->extra
+ i
) * (1 + row_size
);
3403 isl_seq_clr(new_div
[i
], 1 + row_size
);
3405 for (i
= 0; i
< bmap
->extra
; ++i
)
3406 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3408 bmap
->div
= new_div
;
3415 /* Turn the n dimensions of type type, starting at first
3416 * into existentially quantified variables.
3418 __isl_give isl_basic_map
*isl_basic_map_project_out(
3419 __isl_take isl_basic_map
*bmap
,
3420 enum isl_dim_type type
, unsigned first
, unsigned n
)
3423 return basic_map_space_reset(bmap
, type
);
3428 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3429 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3431 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3434 bmap
= move_last(bmap
, type
, first
, n
);
3435 bmap
= isl_basic_map_cow(bmap
);
3436 bmap
= insert_div_rows(bmap
, n
);
3440 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3443 bmap
= isl_basic_map_simplify(bmap
);
3444 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3445 return isl_basic_map_finalize(bmap
);
3447 isl_basic_map_free(bmap
);
3451 /* Turn the n dimensions of type type, starting at first
3452 * into existentially quantified variables.
3454 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3455 enum isl_dim_type type
, unsigned first
, unsigned n
)
3457 return (isl_basic_set
*)isl_basic_map_project_out(
3458 (isl_basic_map
*)bset
, type
, first
, n
);
3461 /* Turn the n dimensions of type type, starting at first
3462 * into existentially quantified variables.
3464 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3465 enum isl_dim_type type
, unsigned first
, unsigned n
)
3473 return map_space_reset(map
, type
);
3475 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3477 map
= isl_map_cow(map
);
3481 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3485 for (i
= 0; i
< map
->n
; ++i
) {
3486 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3497 /* Turn the n dimensions of type type, starting at first
3498 * into existentially quantified variables.
3500 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3501 enum isl_dim_type type
, unsigned first
, unsigned n
)
3503 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3506 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3510 for (i
= 0; i
< n
; ++i
) {
3511 j
= isl_basic_map_alloc_div(bmap
);
3514 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3518 isl_basic_map_free(bmap
);
3522 struct isl_basic_map
*isl_basic_map_apply_range(
3523 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3525 isl_space
*dim_result
= NULL
;
3526 struct isl_basic_map
*bmap
;
3527 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3528 struct isl_dim_map
*dim_map1
, *dim_map2
;
3530 if (!bmap1
|| !bmap2
)
3533 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3534 isl_space_copy(bmap2
->dim
));
3536 n_in
= isl_basic_map_n_in(bmap1
);
3537 n_out
= isl_basic_map_n_out(bmap2
);
3538 n
= isl_basic_map_n_out(bmap1
);
3539 nparam
= isl_basic_map_n_param(bmap1
);
3541 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3542 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3543 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3544 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3545 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3546 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3547 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3548 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3549 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3550 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3551 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3553 bmap
= isl_basic_map_alloc_space(dim_result
,
3554 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3555 bmap1
->n_eq
+ bmap2
->n_eq
,
3556 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3557 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3558 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3559 bmap
= add_divs(bmap
, n
);
3560 bmap
= isl_basic_map_simplify(bmap
);
3561 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3562 return isl_basic_map_finalize(bmap
);
3564 isl_basic_map_free(bmap1
);
3565 isl_basic_map_free(bmap2
);
3569 struct isl_basic_set
*isl_basic_set_apply(
3570 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3575 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3578 return (struct isl_basic_set
*)
3579 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3581 isl_basic_set_free(bset
);
3582 isl_basic_map_free(bmap
);
3586 struct isl_basic_map
*isl_basic_map_apply_domain(
3587 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3589 if (!bmap1
|| !bmap2
)
3592 isl_assert(bmap1
->ctx
,
3593 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3594 isl_assert(bmap1
->ctx
,
3595 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3598 bmap1
= isl_basic_map_reverse(bmap1
);
3599 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3600 return isl_basic_map_reverse(bmap1
);
3602 isl_basic_map_free(bmap1
);
3603 isl_basic_map_free(bmap2
);
3607 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3608 * A \cap B -> f(A) + f(B)
3610 struct isl_basic_map
*isl_basic_map_sum(
3611 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3613 unsigned n_in
, n_out
, nparam
, total
, pos
;
3614 struct isl_basic_map
*bmap
= NULL
;
3615 struct isl_dim_map
*dim_map1
, *dim_map2
;
3618 if (!bmap1
|| !bmap2
)
3621 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3624 nparam
= isl_basic_map_n_param(bmap1
);
3625 n_in
= isl_basic_map_n_in(bmap1
);
3626 n_out
= isl_basic_map_n_out(bmap1
);
3628 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3629 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3630 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3631 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3632 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3633 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3634 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3635 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3636 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3637 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3638 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3640 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3641 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3642 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3643 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3644 for (i
= 0; i
< n_out
; ++i
) {
3645 int j
= isl_basic_map_alloc_equality(bmap
);
3648 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3649 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3650 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3651 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3653 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3654 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3655 bmap
= add_divs(bmap
, 2 * n_out
);
3657 bmap
= isl_basic_map_simplify(bmap
);
3658 return isl_basic_map_finalize(bmap
);
3660 isl_basic_map_free(bmap
);
3661 isl_basic_map_free(bmap1
);
3662 isl_basic_map_free(bmap2
);
3666 /* Given two maps A -> f(A) and B -> g(B), construct a map
3667 * A \cap B -> f(A) + f(B)
3669 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3671 struct isl_map
*result
;
3677 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3679 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3680 map1
->n
* map2
->n
, 0);
3683 for (i
= 0; i
< map1
->n
; ++i
)
3684 for (j
= 0; j
< map2
->n
; ++j
) {
3685 struct isl_basic_map
*part
;
3686 part
= isl_basic_map_sum(
3687 isl_basic_map_copy(map1
->p
[i
]),
3688 isl_basic_map_copy(map2
->p
[j
]));
3689 if (isl_basic_map_is_empty(part
))
3690 isl_basic_map_free(part
);
3692 result
= isl_map_add_basic_map(result
, part
);
3705 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3706 __isl_take isl_set
*set2
)
3708 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3711 /* Given a basic map A -> f(A), construct A -> -f(A).
3713 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3718 bmap
= isl_basic_map_cow(bmap
);
3722 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3723 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3724 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3725 for (j
= 0; j
< n
; ++j
)
3726 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3727 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3728 for (j
= 0; j
< n
; ++j
)
3729 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3730 for (i
= 0; i
< bmap
->n_div
; ++i
)
3731 for (j
= 0; j
< n
; ++j
)
3732 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3733 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3734 return isl_basic_map_finalize(bmap
);
3737 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3739 return isl_basic_map_neg(bset
);
3742 /* Given a map A -> f(A), construct A -> -f(A).
3744 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3748 map
= isl_map_cow(map
);
3752 for (i
= 0; i
< map
->n
; ++i
) {
3753 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3764 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3766 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3769 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3770 * A -> floor(f(A)/d).
3772 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3775 unsigned n_in
, n_out
, nparam
, total
, pos
;
3776 struct isl_basic_map
*result
= NULL
;
3777 struct isl_dim_map
*dim_map
;
3783 nparam
= isl_basic_map_n_param(bmap
);
3784 n_in
= isl_basic_map_n_in(bmap
);
3785 n_out
= isl_basic_map_n_out(bmap
);
3787 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3788 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3789 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3790 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3791 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3792 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3794 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3795 bmap
->n_div
+ n_out
,
3796 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3797 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3798 result
= add_divs(result
, n_out
);
3799 for (i
= 0; i
< n_out
; ++i
) {
3801 j
= isl_basic_map_alloc_inequality(result
);
3804 isl_seq_clr(result
->ineq
[j
], 1+total
);
3805 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3806 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3807 j
= isl_basic_map_alloc_inequality(result
);
3810 isl_seq_clr(result
->ineq
[j
], 1+total
);
3811 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3812 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3813 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3816 result
= isl_basic_map_simplify(result
);
3817 return isl_basic_map_finalize(result
);
3819 isl_basic_map_free(result
);
3823 /* Given a map A -> f(A) and an integer d, construct a map
3824 * A -> floor(f(A)/d).
3826 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3830 map
= isl_map_cow(map
);
3834 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3835 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3836 for (i
= 0; i
< map
->n
; ++i
) {
3837 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3848 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3854 i
= isl_basic_map_alloc_equality(bmap
);
3857 nparam
= isl_basic_map_n_param(bmap
);
3858 n_in
= isl_basic_map_n_in(bmap
);
3859 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3860 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3861 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3862 return isl_basic_map_finalize(bmap
);
3864 isl_basic_map_free(bmap
);
3868 /* Add a constraints to "bmap" expressing i_pos < o_pos
3870 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3876 i
= isl_basic_map_alloc_inequality(bmap
);
3879 nparam
= isl_basic_map_n_param(bmap
);
3880 n_in
= isl_basic_map_n_in(bmap
);
3881 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3882 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3883 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3884 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3885 return isl_basic_map_finalize(bmap
);
3887 isl_basic_map_free(bmap
);
3891 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3893 static __isl_give isl_basic_map
*var_less_or_equal(
3894 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3900 i
= isl_basic_map_alloc_inequality(bmap
);
3903 nparam
= isl_basic_map_n_param(bmap
);
3904 n_in
= isl_basic_map_n_in(bmap
);
3905 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3906 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3907 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3908 return isl_basic_map_finalize(bmap
);
3910 isl_basic_map_free(bmap
);
3914 /* Add a constraints to "bmap" expressing i_pos > o_pos
3916 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3922 i
= isl_basic_map_alloc_inequality(bmap
);
3925 nparam
= isl_basic_map_n_param(bmap
);
3926 n_in
= isl_basic_map_n_in(bmap
);
3927 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3928 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3929 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3930 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3931 return isl_basic_map_finalize(bmap
);
3933 isl_basic_map_free(bmap
);
3937 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3939 static __isl_give isl_basic_map
*var_more_or_equal(
3940 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3946 i
= isl_basic_map_alloc_inequality(bmap
);
3949 nparam
= isl_basic_map_n_param(bmap
);
3950 n_in
= isl_basic_map_n_in(bmap
);
3951 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3952 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3953 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3954 return isl_basic_map_finalize(bmap
);
3956 isl_basic_map_free(bmap
);
3960 __isl_give isl_basic_map
*isl_basic_map_equal(
3961 __isl_take isl_space
*dim
, unsigned n_equal
)
3964 struct isl_basic_map
*bmap
;
3965 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3968 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3969 bmap
= var_equal(bmap
, i
);
3970 return isl_basic_map_finalize(bmap
);
3973 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3975 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3979 struct isl_basic_map
*bmap
;
3980 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3983 for (i
= 0; i
< pos
&& bmap
; ++i
)
3984 bmap
= var_equal(bmap
, i
);
3986 bmap
= var_less(bmap
, pos
);
3987 return isl_basic_map_finalize(bmap
);
3990 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3992 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3993 __isl_take isl_space
*dim
, unsigned pos
)
3996 isl_basic_map
*bmap
;
3998 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3999 for (i
= 0; i
< pos
; ++i
)
4000 bmap
= var_equal(bmap
, i
);
4001 bmap
= var_less_or_equal(bmap
, pos
);
4002 return isl_basic_map_finalize(bmap
);
4005 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4007 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4011 struct isl_basic_map
*bmap
;
4012 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4015 for (i
= 0; i
< pos
&& bmap
; ++i
)
4016 bmap
= var_equal(bmap
, i
);
4018 bmap
= var_more(bmap
, pos
);
4019 return isl_basic_map_finalize(bmap
);
4022 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4024 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4025 __isl_take isl_space
*dim
, unsigned pos
)
4028 isl_basic_map
*bmap
;
4030 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4031 for (i
= 0; i
< pos
; ++i
)
4032 bmap
= var_equal(bmap
, i
);
4033 bmap
= var_more_or_equal(bmap
, pos
);
4034 return isl_basic_map_finalize(bmap
);
4037 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4038 unsigned n
, int equal
)
4040 struct isl_map
*map
;
4043 if (n
== 0 && equal
)
4044 return isl_map_universe(dims
);
4046 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4048 for (i
= 0; i
+ 1 < n
; ++i
)
4049 map
= isl_map_add_basic_map(map
,
4050 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4053 map
= isl_map_add_basic_map(map
,
4054 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4056 map
= isl_map_add_basic_map(map
,
4057 isl_basic_map_less_at(dims
, n
- 1));
4059 isl_space_free(dims
);
4064 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4068 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4071 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4073 return map_lex_lte_first(dim
, n
, 0);
4076 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4078 return map_lex_lte_first(dim
, n
, 1);
4081 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4083 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4086 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4088 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4091 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4092 unsigned n
, int equal
)
4094 struct isl_map
*map
;
4097 if (n
== 0 && equal
)
4098 return isl_map_universe(dims
);
4100 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4102 for (i
= 0; i
+ 1 < n
; ++i
)
4103 map
= isl_map_add_basic_map(map
,
4104 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4107 map
= isl_map_add_basic_map(map
,
4108 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4110 map
= isl_map_add_basic_map(map
,
4111 isl_basic_map_more_at(dims
, n
- 1));
4113 isl_space_free(dims
);
4118 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4122 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4125 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4127 return map_lex_gte_first(dim
, n
, 0);
4130 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4132 return map_lex_gte_first(dim
, n
, 1);
4135 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4137 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4140 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4142 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4145 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4146 __isl_take isl_set
*set2
)
4149 map
= isl_map_lex_le(isl_set_get_space(set1
));
4150 map
= isl_map_intersect_domain(map
, set1
);
4151 map
= isl_map_intersect_range(map
, set2
);
4155 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4156 __isl_take isl_set
*set2
)
4159 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4160 map
= isl_map_intersect_domain(map
, set1
);
4161 map
= isl_map_intersect_range(map
, set2
);
4165 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4166 __isl_take isl_set
*set2
)
4169 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4170 map
= isl_map_intersect_domain(map
, set1
);
4171 map
= isl_map_intersect_range(map
, set2
);
4175 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4176 __isl_take isl_set
*set2
)
4179 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4180 map
= isl_map_intersect_domain(map
, set1
);
4181 map
= isl_map_intersect_range(map
, set2
);
4185 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4186 __isl_take isl_map
*map2
)
4189 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4190 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4191 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4195 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4196 __isl_take isl_map
*map2
)
4199 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4200 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4201 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4205 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4206 __isl_take isl_map
*map2
)
4209 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4210 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4211 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4215 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4216 __isl_take isl_map
*map2
)
4219 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4220 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4221 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4225 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4226 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4228 struct isl_basic_map
*bmap
;
4230 bset
= isl_basic_set_cow(bset
);
4234 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4235 isl_space_free(bset
->dim
);
4236 bmap
= (struct isl_basic_map
*) bset
;
4238 return isl_basic_map_finalize(bmap
);
4240 isl_basic_set_free(bset
);
4241 isl_space_free(dim
);
4245 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4249 if (bmap
->dim
->n_in
== 0)
4250 return (struct isl_basic_set
*)bmap
;
4251 bmap
= isl_basic_map_cow(bmap
);
4254 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4257 bmap
= isl_basic_map_finalize(bmap
);
4258 return (struct isl_basic_set
*)bmap
;
4260 isl_basic_map_free(bmap
);
4264 /* For a div d = floor(f/m), add the constraints
4267 * -(f-(n-1)) + m d >= 0
4269 * Note that the second constraint is the negation of
4273 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4274 unsigned pos
, isl_int
*div
)
4277 unsigned total
= isl_basic_map_total_dim(bmap
);
4279 i
= isl_basic_map_alloc_inequality(bmap
);
4282 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4283 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4285 j
= isl_basic_map_alloc_inequality(bmap
);
4288 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4289 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4290 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4294 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4295 unsigned pos
, isl_int
*div
)
4297 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4301 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4303 unsigned total
= isl_basic_map_total_dim(bmap
);
4304 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4306 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4310 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4312 return isl_basic_map_add_div_constraints(bset
, div
);
4315 struct isl_basic_set
*isl_basic_map_underlying_set(
4316 struct isl_basic_map
*bmap
)
4320 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4322 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4323 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4324 return (struct isl_basic_set
*)bmap
;
4325 bmap
= isl_basic_map_cow(bmap
);
4328 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4331 bmap
->extra
-= bmap
->n_div
;
4333 bmap
= isl_basic_map_finalize(bmap
);
4334 return (struct isl_basic_set
*)bmap
;
4336 isl_basic_map_free(bmap
);
4340 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4341 __isl_take isl_basic_set
*bset
)
4343 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4346 struct isl_basic_map
*isl_basic_map_overlying_set(
4347 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4349 struct isl_basic_map
*bmap
;
4350 struct isl_ctx
*ctx
;
4357 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4358 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4359 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4361 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4362 isl_basic_map_free(like
);
4363 return (struct isl_basic_map
*)bset
;
4365 bset
= isl_basic_set_cow(bset
);
4368 total
= bset
->dim
->n_out
+ bset
->extra
;
4369 bmap
= (struct isl_basic_map
*)bset
;
4370 isl_space_free(bmap
->dim
);
4371 bmap
->dim
= isl_space_copy(like
->dim
);
4374 bmap
->n_div
= like
->n_div
;
4375 bmap
->extra
+= like
->n_div
;
4379 ltotal
= total
- bmap
->extra
+ like
->extra
;
4382 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4383 bmap
->extra
* (1 + 1 + total
));
4384 if (isl_blk_is_error(bmap
->block2
))
4386 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4390 for (i
= 0; i
< bmap
->extra
; ++i
)
4391 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4392 for (i
= 0; i
< like
->n_div
; ++i
) {
4393 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4394 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4396 bmap
= isl_basic_map_extend_constraints(bmap
,
4397 0, 2 * like
->n_div
);
4398 for (i
= 0; i
< like
->n_div
; ++i
) {
4401 if (isl_int_is_zero(bmap
->div
[i
][0]))
4403 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4404 bmap
= isl_basic_map_free(bmap
);
4407 isl_basic_map_free(like
);
4408 bmap
= isl_basic_map_simplify(bmap
);
4409 bmap
= isl_basic_map_finalize(bmap
);
4412 isl_basic_map_free(like
);
4413 isl_basic_set_free(bset
);
4417 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4418 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4420 return (struct isl_basic_set
*)
4421 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4424 struct isl_set
*isl_set_from_underlying_set(
4425 struct isl_set
*set
, struct isl_basic_set
*like
)
4431 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4433 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4434 isl_basic_set_free(like
);
4437 set
= isl_set_cow(set
);
4440 for (i
= 0; i
< set
->n
; ++i
) {
4441 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4442 isl_basic_set_copy(like
));
4446 isl_space_free(set
->dim
);
4447 set
->dim
= isl_space_copy(like
->dim
);
4450 isl_basic_set_free(like
);
4453 isl_basic_set_free(like
);
4458 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4462 map
= isl_map_cow(map
);
4465 map
->dim
= isl_space_cow(map
->dim
);
4469 for (i
= 1; i
< map
->n
; ++i
)
4470 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4472 for (i
= 0; i
< map
->n
; ++i
) {
4473 map
->p
[i
] = (struct isl_basic_map
*)
4474 isl_basic_map_underlying_set(map
->p
[i
]);
4479 map
->dim
= isl_space_underlying(map
->dim
, 0);
4481 isl_space_free(map
->dim
);
4482 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4486 return (struct isl_set
*)map
;
4492 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4494 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4497 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4498 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4500 bmap
= isl_basic_map_cow(bmap
);
4504 isl_space_free(bmap
->dim
);
4507 bmap
= isl_basic_map_finalize(bmap
);
4511 isl_basic_map_free(bmap
);
4512 isl_space_free(dim
);
4516 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4517 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4519 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4523 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4524 __isl_take isl_space
*dim
)
4528 map
= isl_map_cow(map
);
4532 for (i
= 0; i
< map
->n
; ++i
) {
4533 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4534 isl_space_copy(dim
));
4538 isl_space_free(map
->dim
);
4544 isl_space_free(dim
);
4548 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4549 __isl_take isl_space
*dim
)
4551 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4554 /* Compute the parameter domain of the given basic set.
4556 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4561 if (isl_basic_set_is_params(bset
))
4564 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4565 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4566 space
= isl_basic_set_get_space(bset
);
4567 space
= isl_space_params(space
);
4568 bset
= isl_basic_set_reset_space(bset
, space
);
4572 /* Construct a zero-dimensional basic set with the given parameter domain.
4574 __isl_give isl_basic_set
*isl_basic_set_from_params(
4575 __isl_take isl_basic_set
*bset
)
4578 space
= isl_basic_set_get_space(bset
);
4579 space
= isl_space_set_from_params(space
);
4580 bset
= isl_basic_set_reset_space(bset
, space
);
4584 /* Compute the parameter domain of the given set.
4586 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4591 if (isl_set_is_params(set
))
4594 n
= isl_set_dim(set
, isl_dim_set
);
4595 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4596 space
= isl_set_get_space(set
);
4597 space
= isl_space_params(space
);
4598 set
= isl_set_reset_space(set
, space
);
4602 /* Construct a zero-dimensional set with the given parameter domain.
4604 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4607 space
= isl_set_get_space(set
);
4608 space
= isl_space_set_from_params(space
);
4609 set
= isl_set_reset_space(set
, space
);
4613 /* Compute the parameter domain of the given map.
4615 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4620 n
= isl_map_dim(map
, isl_dim_in
);
4621 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4622 n
= isl_map_dim(map
, isl_dim_out
);
4623 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4624 space
= isl_map_get_space(map
);
4625 space
= isl_space_params(space
);
4626 map
= isl_map_reset_space(map
, space
);
4630 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4633 struct isl_basic_set
*domain
;
4639 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4641 n_in
= isl_basic_map_n_in(bmap
);
4642 n_out
= isl_basic_map_n_out(bmap
);
4643 domain
= isl_basic_set_from_basic_map(bmap
);
4644 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4646 domain
= isl_basic_set_reset_space(domain
, dim
);
4651 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4655 return isl_space_may_be_set(bmap
->dim
);
4658 /* Is this basic map actually a set?
4659 * Users should never call this function. Outside of isl,
4660 * the type should indicate whether something is a set or a map.
4662 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4666 return isl_space_is_set(bmap
->dim
);
4669 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4673 if (isl_basic_map_is_set(bmap
))
4675 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4678 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4679 __isl_take isl_basic_map
*bmap
)
4683 isl_basic_map
*domain
;
4684 int nparam
, n_in
, n_out
;
4687 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4688 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4689 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4691 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4692 domain
= isl_basic_map_universe(dim
);
4694 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4695 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4696 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4698 total
= isl_basic_map_total_dim(bmap
);
4700 for (i
= 0; i
< n_in
; ++i
) {
4701 k
= isl_basic_map_alloc_equality(bmap
);
4704 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4705 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4706 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4709 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4710 return isl_basic_map_finalize(bmap
);
4712 isl_basic_map_free(bmap
);
4716 __isl_give isl_basic_map
*isl_basic_map_range_map(
4717 __isl_take isl_basic_map
*bmap
)
4721 isl_basic_map
*range
;
4722 int nparam
, n_in
, n_out
;
4725 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4726 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4727 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4729 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4730 range
= isl_basic_map_universe(dim
);
4732 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4733 bmap
= isl_basic_map_apply_range(bmap
, range
);
4734 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4736 total
= isl_basic_map_total_dim(bmap
);
4738 for (i
= 0; i
< n_out
; ++i
) {
4739 k
= isl_basic_map_alloc_equality(bmap
);
4742 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4743 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4744 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4747 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4748 return isl_basic_map_finalize(bmap
);
4750 isl_basic_map_free(bmap
);
4754 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4758 return isl_space_may_be_set(map
->dim
);
4761 /* Is this map actually a set?
4762 * Users should never call this function. Outside of isl,
4763 * the type should indicate whether something is a set or a map.
4765 int isl_map_is_set(__isl_keep isl_map
*map
)
4769 return isl_space_is_set(map
->dim
);
4772 struct isl_set
*isl_map_range(struct isl_map
*map
)
4775 struct isl_set
*set
;
4779 if (isl_map_is_set(map
))
4780 return (isl_set
*)map
;
4782 map
= isl_map_cow(map
);
4786 set
= (struct isl_set
*) map
;
4787 set
->dim
= isl_space_range(set
->dim
);
4790 for (i
= 0; i
< map
->n
; ++i
) {
4791 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4795 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4796 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4803 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4806 isl_space
*domain_dim
;
4808 map
= isl_map_cow(map
);
4812 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4813 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4814 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4817 for (i
= 0; i
< map
->n
; ++i
) {
4818 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4822 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4823 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4830 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4833 isl_space
*range_dim
;
4835 map
= isl_map_cow(map
);
4839 range_dim
= isl_space_range(isl_map_get_space(map
));
4840 range_dim
= isl_space_from_range(range_dim
);
4841 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4842 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4845 for (i
= 0; i
< map
->n
; ++i
) {
4846 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4850 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4851 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4858 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4859 __isl_take isl_space
*dim
)
4862 struct isl_map
*map
= NULL
;
4864 set
= isl_set_cow(set
);
4867 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4868 map
= (struct isl_map
*)set
;
4869 for (i
= 0; i
< set
->n
; ++i
) {
4870 map
->p
[i
] = isl_basic_map_from_basic_set(
4871 set
->p
[i
], isl_space_copy(dim
));
4875 isl_space_free(map
->dim
);
4879 isl_space_free(dim
);
4884 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4885 __isl_take isl_basic_set
*bset
)
4887 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4890 __isl_give isl_basic_map
*isl_basic_map_from_range(
4891 __isl_take isl_basic_set
*bset
)
4894 space
= isl_basic_set_get_space(bset
);
4895 space
= isl_space_from_range(space
);
4896 bset
= isl_basic_set_reset_space(bset
, space
);
4897 return (isl_basic_map
*)bset
;
4900 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4903 space
= isl_set_get_space(set
);
4904 space
= isl_space_from_range(space
);
4905 set
= isl_set_reset_space(set
, space
);
4906 return (struct isl_map
*)set
;
4909 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4911 return isl_map_reverse(isl_map_from_range(set
));
4914 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4915 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4917 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4920 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4921 __isl_take isl_set
*range
)
4923 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4926 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4929 struct isl_set
*set
= NULL
;
4933 map
= isl_map_cow(map
);
4936 map
->dim
= isl_space_as_set_space(map
->dim
);
4939 set
= (struct isl_set
*)map
;
4940 for (i
= 0; i
< map
->n
; ++i
) {
4941 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4951 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4954 struct isl_map
*map
;
4959 isl_die(dim
->ctx
, isl_error_internal
,
4960 "negative number of basic maps", goto error
);
4961 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4962 sizeof(struct isl_map
) +
4963 (n
- 1) * sizeof(struct isl_basic_map
*));
4967 map
->ctx
= dim
->ctx
;
4968 isl_ctx_ref(map
->ctx
);
4976 isl_space_free(dim
);
4980 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4981 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4984 struct isl_map
*map
;
4987 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4991 map
= isl_map_alloc_space(dims
, n
, flags
);
4995 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4997 struct isl_basic_map
*bmap
;
4998 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4999 bmap
= isl_basic_map_set_to_empty(bmap
);
5003 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5005 struct isl_basic_set
*bset
;
5006 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5007 bset
= isl_basic_set_set_to_empty(bset
);
5011 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5013 struct isl_basic_map
*bmap
;
5016 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5017 bmap
= isl_basic_map_set_to_empty(bmap
);
5021 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5023 struct isl_basic_map
*bmap
;
5026 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5027 bmap
= isl_basic_map_set_to_empty(bmap
);
5031 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5033 struct isl_basic_set
*bset
;
5036 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5037 bset
= isl_basic_set_set_to_empty(bset
);
5041 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5043 struct isl_basic_map
*bmap
;
5044 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5045 bmap
= isl_basic_map_finalize(bmap
);
5049 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5051 struct isl_basic_set
*bset
;
5052 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5053 bset
= isl_basic_set_finalize(bset
);
5057 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5060 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5061 isl_basic_map
*bmap
;
5063 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5064 for (i
= 0; i
< total
; ++i
) {
5065 int k
= isl_basic_map_alloc_inequality(bmap
);
5068 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5069 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5073 isl_basic_map_free(bmap
);
5077 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5079 return isl_basic_map_nat_universe(dim
);
5082 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5084 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5087 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5089 return isl_map_nat_universe(dim
);
5092 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5093 __isl_keep isl_basic_map
*model
)
5097 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5100 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5104 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5107 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5108 __isl_keep isl_set
*model
)
5112 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5115 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5117 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5120 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5124 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5127 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5131 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5134 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5136 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5139 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5143 return isl_set_empty(isl_space_copy(model
->dim
));
5146 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5148 struct isl_map
*map
;
5151 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5152 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5156 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5158 struct isl_set
*set
;
5161 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5162 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5166 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5170 return isl_set_universe(isl_space_copy(model
->dim
));
5173 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5176 struct isl_map
*dup
;
5180 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5181 for (i
= 0; i
< map
->n
; ++i
)
5182 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5186 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5187 __isl_take isl_basic_map
*bmap
)
5191 if (isl_basic_map_plain_is_empty(bmap
)) {
5192 isl_basic_map_free(bmap
);
5195 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5196 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5197 map
->p
[map
->n
] = bmap
;
5199 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5205 isl_basic_map_free(bmap
);
5209 void *isl_map_free(struct isl_map
*map
)
5219 isl_ctx_deref(map
->ctx
);
5220 for (i
= 0; i
< map
->n
; ++i
)
5221 isl_basic_map_free(map
->p
[i
]);
5222 isl_space_free(map
->dim
);
5228 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5229 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5233 base
= isl_map_cow(base
);
5237 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5240 for (i
= 0; i
< base
->n
; ++i
) {
5241 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5242 isl_space_copy(base
->dim
), 0, 0, 0);
5252 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5253 unsigned nparam
, unsigned dim
)
5255 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5259 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5260 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5264 bmap
= isl_basic_map_cow(bmap
);
5265 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5266 j
= isl_basic_map_alloc_equality(bmap
);
5269 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5270 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5271 isl_int_set_si(bmap
->eq
[j
][0], value
);
5272 bmap
= isl_basic_map_simplify(bmap
);
5273 return isl_basic_map_finalize(bmap
);
5275 isl_basic_map_free(bmap
);
5279 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5280 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5284 bmap
= isl_basic_map_cow(bmap
);
5285 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5286 j
= isl_basic_map_alloc_equality(bmap
);
5289 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5290 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5291 isl_int_set(bmap
->eq
[j
][0], value
);
5292 bmap
= isl_basic_map_simplify(bmap
);
5293 return isl_basic_map_finalize(bmap
);
5295 isl_basic_map_free(bmap
);
5299 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5300 enum isl_dim_type type
, unsigned pos
, int value
)
5304 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5305 return isl_basic_map_fix_pos_si(bmap
,
5306 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5308 isl_basic_map_free(bmap
);
5312 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5313 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5317 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5318 return isl_basic_map_fix_pos(bmap
,
5319 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5321 isl_basic_map_free(bmap
);
5325 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5326 enum isl_dim_type type
, unsigned pos
, int value
)
5328 return (struct isl_basic_set
*)
5329 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5333 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5334 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5336 return (struct isl_basic_set
*)
5337 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5341 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5342 unsigned input
, int value
)
5344 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5347 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5348 unsigned dim
, int value
)
5350 return (struct isl_basic_set
*)
5351 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5352 isl_dim_set
, dim
, value
);
5355 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5357 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5364 isl_basic_map_free(map
->p
[i
]);
5365 if (i
!= map
->n
- 1) {
5366 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5367 map
->p
[i
] = map
->p
[map
->n
- 1];
5374 /* Perform "fn" on each basic map of "map", where we may not be holding
5375 * the only reference to "map".
5376 * In particular, "fn" should be a semantics preserving operation
5377 * that we want to apply to all copies of "map". We therefore need
5378 * to be careful not to modify "map" in a way that breaks "map"
5379 * in case anything goes wrong.
5381 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5382 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5384 struct isl_basic_map
*bmap
;
5390 for (i
= map
->n
- 1; i
>= 0; --i
) {
5391 bmap
= isl_basic_map_copy(map
->p
[i
]);
5395 isl_basic_map_free(map
->p
[i
]);
5397 if (remove_if_empty(map
, i
) < 0)
5407 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5408 enum isl_dim_type type
, unsigned pos
, int value
)
5412 map
= isl_map_cow(map
);
5416 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5417 for (i
= map
->n
- 1; i
>= 0; --i
) {
5418 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5419 if (remove_if_empty(map
, i
) < 0)
5422 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5429 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5430 enum isl_dim_type type
, unsigned pos
, int value
)
5432 return (struct isl_set
*)
5433 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5436 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5437 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5441 map
= isl_map_cow(map
);
5445 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5446 for (i
= 0; i
< map
->n
; ++i
) {
5447 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5451 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5458 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5459 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5461 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5464 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5465 unsigned input
, int value
)
5467 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5470 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5472 return (struct isl_set
*)
5473 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5476 static __isl_give isl_basic_map
*basic_map_bound_si(
5477 __isl_take isl_basic_map
*bmap
,
5478 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5484 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5485 pos
+= isl_basic_map_offset(bmap
, type
);
5486 bmap
= isl_basic_map_cow(bmap
);
5487 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5488 j
= isl_basic_map_alloc_inequality(bmap
);
5491 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5493 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5494 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5496 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5497 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5499 bmap
= isl_basic_map_simplify(bmap
);
5500 return isl_basic_map_finalize(bmap
);
5502 isl_basic_map_free(bmap
);
5506 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5507 __isl_take isl_basic_map
*bmap
,
5508 enum isl_dim_type type
, unsigned pos
, int value
)
5510 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5513 /* Constrain the values of the given dimension to be no greater than "value".
5515 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5516 __isl_take isl_basic_map
*bmap
,
5517 enum isl_dim_type type
, unsigned pos
, int value
)
5519 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5522 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5523 unsigned dim
, isl_int value
)
5527 bset
= isl_basic_set_cow(bset
);
5528 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5529 j
= isl_basic_set_alloc_inequality(bset
);
5532 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5533 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5534 isl_int_neg(bset
->ineq
[j
][0], value
);
5535 bset
= isl_basic_set_simplify(bset
);
5536 return isl_basic_set_finalize(bset
);
5538 isl_basic_set_free(bset
);
5542 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5543 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5547 map
= isl_map_cow(map
);
5551 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5552 for (i
= 0; i
< map
->n
; ++i
) {
5553 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5554 type
, pos
, value
, upper
);
5558 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5565 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5566 enum isl_dim_type type
, unsigned pos
, int value
)
5568 return map_bound_si(map
, type
, pos
, value
, 0);
5571 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5572 enum isl_dim_type type
, unsigned pos
, int value
)
5574 return map_bound_si(map
, type
, pos
, value
, 1);
5577 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5578 enum isl_dim_type type
, unsigned pos
, int value
)
5580 return (struct isl_set
*)
5581 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5584 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5585 enum isl_dim_type type
, unsigned pos
, int value
)
5587 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5590 /* Bound the given variable of "bmap" from below (or above is "upper"
5591 * is set) to "value".
5593 static __isl_give isl_basic_map
*basic_map_bound(
5594 __isl_take isl_basic_map
*bmap
,
5595 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5601 if (pos
>= isl_basic_map_dim(bmap
, type
))
5602 isl_die(bmap
->ctx
, isl_error_invalid
,
5603 "index out of bounds", goto error
);
5604 pos
+= isl_basic_map_offset(bmap
, type
);
5605 bmap
= isl_basic_map_cow(bmap
);
5606 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5607 j
= isl_basic_map_alloc_inequality(bmap
);
5610 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5612 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5613 isl_int_set(bmap
->ineq
[j
][0], value
);
5615 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5616 isl_int_neg(bmap
->ineq
[j
][0], value
);
5618 bmap
= isl_basic_map_simplify(bmap
);
5619 return isl_basic_map_finalize(bmap
);
5621 isl_basic_map_free(bmap
);
5625 /* Bound the given variable of "map" from below (or above is "upper"
5626 * is set) to "value".
5628 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5629 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5633 map
= isl_map_cow(map
);
5637 if (pos
>= isl_map_dim(map
, type
))
5638 isl_die(map
->ctx
, isl_error_invalid
,
5639 "index out of bounds", goto error
);
5640 for (i
= map
->n
- 1; i
>= 0; --i
) {
5641 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5642 if (remove_if_empty(map
, i
) < 0)
5645 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5652 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5653 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5655 return map_bound(map
, type
, pos
, value
, 0);
5658 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5659 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5661 return map_bound(map
, type
, pos
, value
, 1);
5664 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5665 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5667 return isl_map_lower_bound(set
, type
, pos
, value
);
5670 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5671 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5673 return isl_map_upper_bound(set
, type
, pos
, value
);
5676 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5681 set
= isl_set_cow(set
);
5685 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5686 for (i
= 0; i
< set
->n
; ++i
) {
5687 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5697 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5701 map
= isl_map_cow(map
);
5705 map
->dim
= isl_space_reverse(map
->dim
);
5708 for (i
= 0; i
< map
->n
; ++i
) {
5709 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5713 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5720 static struct isl_map
*isl_basic_map_partial_lexopt(
5721 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5722 struct isl_set
**empty
, int max
)
5726 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5727 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5729 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5731 isl_basic_map_free(bmap
);
5732 isl_basic_set_free(dom
);
5738 struct isl_map
*isl_basic_map_partial_lexmax(
5739 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5740 struct isl_set
**empty
)
5742 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5745 struct isl_map
*isl_basic_map_partial_lexmin(
5746 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5747 struct isl_set
**empty
)
5749 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5752 struct isl_set
*isl_basic_set_partial_lexmin(
5753 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5754 struct isl_set
**empty
)
5756 return (struct isl_set
*)
5757 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5761 struct isl_set
*isl_basic_set_partial_lexmax(
5762 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5763 struct isl_set
**empty
)
5765 return (struct isl_set
*)
5766 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5770 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5771 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5772 __isl_give isl_set
**empty
)
5774 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5777 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5778 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5779 __isl_give isl_set
**empty
)
5781 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5784 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5785 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5786 __isl_give isl_set
**empty
)
5788 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5791 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5792 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5793 __isl_give isl_set
**empty
)
5795 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5798 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5799 __isl_take isl_basic_map
*bmap
, int max
)
5801 isl_basic_set
*dom
= NULL
;
5802 isl_space
*dom_space
;
5806 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5807 dom
= isl_basic_set_universe(dom_space
);
5808 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5810 isl_basic_map_free(bmap
);
5814 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5815 __isl_take isl_basic_map
*bmap
)
5817 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5821 #define TYPE isl_pw_multi_aff
5823 #define SUFFIX _pw_multi_aff
5825 #define EMPTY isl_pw_multi_aff_empty
5827 #define ADD isl_pw_multi_aff_union_add
5828 #include "isl_map_lexopt_templ.c"
5830 /* Given a map "map", compute the lexicographically minimal
5831 * (or maximal) image element for each domain element in dom,
5832 * in the form of an isl_pw_multi_aff.
5833 * Set *empty to those elements in dom that do not have an image element.
5835 * We first compute the lexicographically minimal or maximal element
5836 * in the first basic map. This results in a partial solution "res"
5837 * and a subset "todo" of dom that still need to be handled.
5838 * We then consider each of the remaining maps in "map" and successively
5839 * update both "res" and "todo".
5841 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5842 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5843 __isl_give isl_set
**empty
, int max
)
5846 isl_pw_multi_aff
*res
;
5852 if (isl_map_plain_is_empty(map
)) {
5857 return isl_pw_multi_aff_from_map(map
);
5860 res
= basic_map_partial_lexopt_pw_multi_aff(
5861 isl_basic_map_copy(map
->p
[0]),
5862 isl_set_copy(dom
), &todo
, max
);
5864 for (i
= 1; i
< map
->n
; ++i
) {
5865 isl_pw_multi_aff
*res_i
;
5868 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5869 isl_basic_map_copy(map
->p
[i
]),
5870 isl_set_copy(dom
), &todo_i
, max
);
5873 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5875 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5877 todo
= isl_set_intersect(todo
, todo_i
);
5898 #define TYPE isl_map
5902 #define EMPTY isl_map_empty
5904 #define ADD isl_map_union_disjoint
5905 #include "isl_map_lexopt_templ.c"
5907 /* Given a map "map", compute the lexicographically minimal
5908 * (or maximal) image element for each domain element in dom.
5909 * Set *empty to those elements in dom that do not have an image element.
5911 * We first compute the lexicographically minimal or maximal element
5912 * in the first basic map. This results in a partial solution "res"
5913 * and a subset "todo" of dom that still need to be handled.
5914 * We then consider each of the remaining maps in "map" and successively
5915 * update both "res" and "todo".
5917 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5918 * Assume we are computing the lexicographical maximum.
5919 * We first compute the lexicographically maximal element in basic map i.
5920 * This results in a partial solution res_i and a subset todo_i.
5921 * Then we combine these results with those obtain for the first k basic maps
5922 * to obtain a result that is valid for the first k+1 basic maps.
5923 * In particular, the set where there is no solution is the set where
5924 * there is no solution for the first k basic maps and also no solution
5925 * for the ith basic map, i.e.,
5927 * todo^i = todo^k * todo_i
5929 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5930 * solutions, arbitrarily breaking ties in favor of res^k.
5931 * That is, when res^k(a) >= res_i(a), we pick res^k and
5932 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5933 * the lexicographic order.)
5934 * In practice, we compute
5936 * res^k * (res_i . "<=")
5940 * res_i * (res^k . "<")
5942 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5943 * where only one of res^k and res_i provides a solution and we simply pick
5950 * Note that we only compute these intersections when dom(res^k) intersects
5951 * dom(res_i). Otherwise, the only effect of these intersections is to
5952 * potentially break up res^k and res_i into smaller pieces.
5953 * We want to avoid such splintering as much as possible.
5954 * In fact, an earlier implementation of this function would look for
5955 * better results in the domain of res^k and for extra results in todo^k,
5956 * but this would always result in a splintering according to todo^k,
5957 * even when the domain of basic map i is disjoint from the domains of
5958 * the previous basic maps.
5960 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5961 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5962 __isl_give isl_set
**empty
, int max
)
5965 struct isl_map
*res
;
5966 struct isl_set
*todo
;
5971 if (isl_map_plain_is_empty(map
)) {
5979 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5980 isl_set_copy(dom
), &todo
, max
);
5982 for (i
= 1; i
< map
->n
; ++i
) {
5986 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5988 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5989 isl_set_copy(dom
), &todo_i
, max
);
5992 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5993 le
= isl_map_lex_le(dim
);
5995 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5996 le
= isl_map_lex_ge(dim
);
5998 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5999 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
6000 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6001 le
= isl_map_intersect(le
, isl_map_copy(res
));
6003 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6004 res
= isl_map_intersect_domain(res
,
6005 isl_set_copy(todo_i
));
6006 res_i
= isl_map_intersect_domain(res_i
,
6007 isl_set_copy(todo
));
6010 res
= isl_map_union_disjoint(res
, res_i
);
6011 res
= isl_map_union_disjoint(res
, lt
);
6012 res
= isl_map_union_disjoint(res
, le
);
6014 todo
= isl_set_intersect(todo
, todo_i
);
6034 __isl_give isl_map
*isl_map_partial_lexmax(
6035 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6036 __isl_give isl_set
**empty
)
6038 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6041 __isl_give isl_map
*isl_map_partial_lexmin(
6042 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6043 __isl_give isl_set
**empty
)
6045 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6048 __isl_give isl_set
*isl_set_partial_lexmin(
6049 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6050 __isl_give isl_set
**empty
)
6052 return (struct isl_set
*)
6053 isl_map_partial_lexmin((struct isl_map
*)set
,
6057 __isl_give isl_set
*isl_set_partial_lexmax(
6058 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6059 __isl_give isl_set
**empty
)
6061 return (struct isl_set
*)
6062 isl_map_partial_lexmax((struct isl_map
*)set
,
6066 /* Compute the lexicographic minimum (or maximum if "max" is set)
6067 * of "bmap" over its domain.
6069 * Since we are not interested in the part of the domain space where
6070 * there is no solution, we initialize the domain to those constraints
6071 * of "bmap" that only involve the parameters and the input dimensions.
6072 * This relieves the parametric programming engine from detecting those
6073 * inequalities and transferring them to the context. More importantly,
6074 * it ensures that those inequalities are transferred first and not
6075 * intermixed with inequalities that actually split the domain.
6077 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6081 isl_basic_map
*copy
;
6084 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6085 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6086 copy
= isl_basic_map_copy(bmap
);
6087 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6088 isl_dim_div
, 0, n_div
);
6089 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6090 isl_dim_out
, 0, n_out
);
6091 dom
= isl_basic_map_domain(copy
);
6092 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6095 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6097 return isl_basic_map_lexopt(bmap
, 0);
6100 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6102 return isl_basic_map_lexopt(bmap
, 1);
6105 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6107 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6110 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6112 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6115 /* Extract the first and only affine expression from list
6116 * and then add it to *pwaff with the given dom.
6117 * This domain is known to be disjoint from other domains
6118 * because of the way isl_basic_map_foreach_lexmax works.
6120 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6121 __isl_take isl_aff_list
*list
, void *user
)
6123 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6125 isl_pw_aff
**pwaff
= user
;
6126 isl_pw_aff
*pwaff_i
;
6130 if (isl_aff_list_n_aff(list
) != 1)
6131 isl_die(ctx
, isl_error_internal
,
6132 "expecting single element list", goto error
);
6134 aff
= isl_aff_list_get_aff(list
, 0);
6135 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6137 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6139 isl_aff_list_free(list
);
6143 isl_basic_set_free(dom
);
6144 isl_aff_list_free(list
);
6148 /* Given a basic map with one output dimension, compute the minimum or
6149 * maximum of that dimension as an isl_pw_aff.
6151 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6152 * call update_dim_opt on each leaf of the result.
6154 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6157 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6161 dim
= isl_space_from_domain(isl_space_domain(dim
));
6162 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6163 pwaff
= isl_pw_aff_empty(dim
);
6165 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6167 return isl_pw_aff_free(pwaff
);
6172 /* Compute the minimum or maximum of the given output dimension
6173 * as a function of the parameters and the input dimensions,
6174 * but independently of the other output dimensions.
6176 * We first project out the other output dimension and then compute
6177 * the "lexicographic" maximum in each basic map, combining the results
6178 * using isl_pw_aff_union_max.
6180 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6187 n_out
= isl_map_dim(map
, isl_dim_out
);
6188 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6189 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6194 isl_space
*dim
= isl_map_get_space(map
);
6195 dim
= isl_space_domain(isl_space_from_range(dim
));
6197 return isl_pw_aff_empty(dim
);
6200 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6201 for (i
= 1; i
< map
->n
; ++i
) {
6202 isl_pw_aff
*pwaff_i
;
6204 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6205 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6213 /* Compute the maximum of the given output dimension as a function of the
6214 * parameters and input dimensions, but independently of
6215 * the other output dimensions.
6217 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6219 return map_dim_opt(map
, pos
, 1);
6222 /* Compute the minimum or maximum of the given set dimension
6223 * as a function of the parameters,
6224 * but independently of the other set dimensions.
6226 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6229 return map_dim_opt(set
, pos
, max
);
6232 /* Compute the maximum of the given set dimension as a function of the
6233 * parameters, but independently of the other set dimensions.
6235 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6237 return set_dim_opt(set
, pos
, 1);
6240 /* Compute the minimum of the given set dimension as a function of the
6241 * parameters, but independently of the other set dimensions.
6243 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6245 return set_dim_opt(set
, pos
, 0);
6248 /* Apply a preimage specified by "mat" on the parameters of "bset".
6249 * bset is assumed to have only parameters and divs.
6251 static struct isl_basic_set
*basic_set_parameter_preimage(
6252 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6259 bset
->dim
= isl_space_cow(bset
->dim
);
6263 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6265 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6267 bset
->dim
->nparam
= 0;
6268 bset
->dim
->n_out
= nparam
;
6269 bset
= isl_basic_set_preimage(bset
, mat
);
6271 bset
->dim
->nparam
= bset
->dim
->n_out
;
6272 bset
->dim
->n_out
= 0;
6277 isl_basic_set_free(bset
);
6281 /* Apply a preimage specified by "mat" on the parameters of "set".
6282 * set is assumed to have only parameters and divs.
6284 static struct isl_set
*set_parameter_preimage(
6285 struct isl_set
*set
, struct isl_mat
*mat
)
6287 isl_space
*dim
= NULL
;
6293 dim
= isl_space_copy(set
->dim
);
6294 dim
= isl_space_cow(dim
);
6298 nparam
= isl_set_dim(set
, isl_dim_param
);
6300 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6303 dim
->n_out
= nparam
;
6304 isl_set_reset_space(set
, dim
);
6305 set
= isl_set_preimage(set
, mat
);
6308 dim
= isl_space_copy(set
->dim
);
6309 dim
= isl_space_cow(dim
);
6312 dim
->nparam
= dim
->n_out
;
6314 isl_set_reset_space(set
, dim
);
6317 isl_space_free(dim
);
6324 /* Intersect the basic set "bset" with the affine space specified by the
6325 * equalities in "eq".
6327 static struct isl_basic_set
*basic_set_append_equalities(
6328 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6336 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6341 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6342 for (i
= 0; i
< eq
->n_row
; ++i
) {
6343 k
= isl_basic_set_alloc_equality(bset
);
6346 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6347 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6351 bset
= isl_basic_set_gauss(bset
, NULL
);
6352 bset
= isl_basic_set_finalize(bset
);
6357 isl_basic_set_free(bset
);
6361 /* Intersect the set "set" with the affine space specified by the
6362 * equalities in "eq".
6364 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6372 for (i
= 0; i
< set
->n
; ++i
) {
6373 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6386 /* Given a basic set "bset" that only involves parameters and existentially
6387 * quantified variables, return the index of the first equality
6388 * that only involves parameters. If there is no such equality then
6389 * return bset->n_eq.
6391 * This function assumes that isl_basic_set_gauss has been called on "bset".
6393 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6396 unsigned nparam
, n_div
;
6401 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6402 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6404 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6405 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6412 /* Compute an explicit representation for the existentially quantified
6413 * variables in "bset" by computing the "minimal value" of the set
6414 * variables. Since there are no set variables, the computation of
6415 * the minimal value essentially computes an explicit representation
6416 * of the non-empty part(s) of "bset".
6418 * The input only involves parameters and existentially quantified variables.
6419 * All equalities among parameters have been removed.
6421 * Since the existentially quantified variables in the result are in general
6422 * going to be different from those in the input, we first replace
6423 * them by the minimal number of variables based on their equalities.
6424 * This should simplify the parametric integer programming.
6426 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6428 isl_morph
*morph1
, *morph2
;
6434 if (bset
->n_eq
== 0)
6435 return isl_basic_set_lexmin(bset
);
6437 morph1
= isl_basic_set_parameter_compression(bset
);
6438 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6439 bset
= isl_basic_set_lift(bset
);
6440 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6441 bset
= isl_morph_basic_set(morph2
, bset
);
6442 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6443 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6445 set
= isl_basic_set_lexmin(bset
);
6447 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6452 /* Project the given basic set onto its parameter domain, possibly introducing
6453 * new, explicit, existential variables in the constraints.
6454 * The input has parameters and (possibly implicit) existential variables.
6455 * The output has the same parameters, but only
6456 * explicit existentially quantified variables.
6458 * The actual projection is performed by pip, but pip doesn't seem
6459 * to like equalities very much, so we first remove the equalities
6460 * among the parameters by performing a variable compression on
6461 * the parameters. Afterward, an inverse transformation is performed
6462 * and the equalities among the parameters are inserted back in.
6464 * The variable compression on the parameters may uncover additional
6465 * equalities that were only implicit before. We therefore check
6466 * if there are any new parameter equalities in the result and
6467 * if so recurse. The removal of parameter equalities is required
6468 * for the parameter compression performed by base_compute_divs.
6470 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6474 struct isl_mat
*T
, *T2
;
6475 struct isl_set
*set
;
6478 bset
= isl_basic_set_cow(bset
);
6482 if (bset
->n_eq
== 0)
6483 return base_compute_divs(bset
);
6485 bset
= isl_basic_set_gauss(bset
, NULL
);
6488 if (isl_basic_set_plain_is_empty(bset
))
6489 return isl_set_from_basic_set(bset
);
6491 i
= first_parameter_equality(bset
);
6492 if (i
== bset
->n_eq
)
6493 return base_compute_divs(bset
);
6495 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6496 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6498 eq
= isl_mat_cow(eq
);
6499 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6500 if (T
&& T
->n_col
== 0) {
6504 bset
= isl_basic_set_set_to_empty(bset
);
6505 return isl_set_from_basic_set(bset
);
6507 bset
= basic_set_parameter_preimage(bset
, T
);
6509 i
= first_parameter_equality(bset
);
6512 else if (i
== bset
->n_eq
)
6513 set
= base_compute_divs(bset
);
6515 set
= parameter_compute_divs(bset
);
6516 set
= set_parameter_preimage(set
, T2
);
6517 set
= set_append_equalities(set
, eq
);
6521 /* Insert the divs from "ls" before those of "bmap".
6523 * The number of columns is not changed, which means that the last
6524 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6525 * The caller is responsible for removing the same number of dimensions
6526 * from the space of "bmap".
6528 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6529 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6535 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6539 old_n_div
= bmap
->n_div
;
6540 bmap
= insert_div_rows(bmap
, n_div
);
6544 for (i
= 0; i
< n_div
; ++i
) {
6545 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6546 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6552 /* Replace the space of "bmap" by the space and divs of "ls".
6554 * If "ls" has any divs, then we simplify the result since we may
6555 * have discovered some additional equalities that could simplify
6556 * the div expressions.
6558 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6559 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6563 bmap
= isl_basic_map_cow(bmap
);
6567 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6568 bmap
= insert_divs_from_local_space(bmap
, ls
);
6572 isl_space_free(bmap
->dim
);
6573 bmap
->dim
= isl_local_space_get_space(ls
);
6577 isl_local_space_free(ls
);
6579 bmap
= isl_basic_map_simplify(bmap
);
6580 bmap
= isl_basic_map_finalize(bmap
);
6583 isl_basic_map_free(bmap
);
6584 isl_local_space_free(ls
);
6588 /* Replace the space of "map" by the space and divs of "ls".
6590 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6591 __isl_take isl_local_space
*ls
)
6595 map
= isl_map_cow(map
);
6599 for (i
= 0; i
< map
->n
; ++i
) {
6600 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6601 isl_local_space_copy(ls
));
6605 isl_space_free(map
->dim
);
6606 map
->dim
= isl_local_space_get_space(ls
);
6610 isl_local_space_free(ls
);
6613 isl_local_space_free(ls
);
6618 /* Compute an explicit representation for the existentially
6619 * quantified variables for which do not know any explicit representation yet.
6621 * We first sort the existentially quantified variables so that the
6622 * existentially quantified variables for which we already have an explicit
6623 * representation are placed before those for which we do not.
6624 * The input dimensions, the output dimensions and the existentially
6625 * quantified variables for which we already have an explicit
6626 * representation are then turned into parameters.
6627 * compute_divs returns a map with the same parameters and
6628 * no input or output dimensions and the dimension specification
6629 * is reset to that of the input, including the existentially quantified
6630 * variables for which we already had an explicit representation.
6632 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6634 struct isl_basic_set
*bset
;
6635 struct isl_set
*set
;
6636 struct isl_map
*map
;
6638 isl_local_space
*ls
;
6645 bmap
= isl_basic_map_sort_divs(bmap
);
6646 bmap
= isl_basic_map_cow(bmap
);
6650 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
6651 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
6654 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6655 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6656 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6657 dim
= isl_space_set_alloc(bmap
->ctx
,
6658 nparam
+ n_in
+ n_out
+ n_known
, 0);
6662 ls
= isl_basic_map_get_local_space(bmap
);
6663 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6664 n_known
, bmap
->n_div
- n_known
);
6666 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6667 swap_div(bmap
, i
- n_known
, i
);
6668 bmap
->n_div
-= n_known
;
6669 bmap
->extra
-= n_known
;
6671 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6672 bset
= (struct isl_basic_set
*)bmap
;
6674 set
= parameter_compute_divs(bset
);
6675 map
= (struct isl_map
*)set
;
6676 map
= replace_space_by_local_space(map
, ls
);
6680 isl_basic_map_free(bmap
);
6684 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6692 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6693 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6694 if (isl_int_is_zero(bmap
->div
[i
][0]))
6696 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6702 static int map_divs_known(__isl_keep isl_map
*map
)
6709 for (i
= 0; i
< map
->n
; ++i
) {
6710 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6718 /* If bmap contains any unknown divs, then compute explicit
6719 * expressions for them. However, this computation may be
6720 * quite expensive, so first try to remove divs that aren't
6723 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6726 struct isl_map
*map
;
6728 known
= isl_basic_map_divs_known(bmap
);
6732 return isl_map_from_basic_map(bmap
);
6734 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6736 known
= isl_basic_map_divs_known(bmap
);
6740 return isl_map_from_basic_map(bmap
);
6742 map
= compute_divs(bmap
);
6745 isl_basic_map_free(bmap
);
6749 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6753 struct isl_map
*res
;
6760 known
= map_divs_known(map
);
6768 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6769 for (i
= 1 ; i
< map
->n
; ++i
) {
6771 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6772 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6773 res
= isl_map_union_disjoint(res
, r2
);
6775 res
= isl_map_union(res
, r2
);
6782 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6784 return (struct isl_set
*)
6785 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6788 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6790 return (struct isl_set
*)
6791 isl_map_compute_divs((struct isl_map
*)set
);
6794 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6797 struct isl_set
*set
;
6802 map
= isl_map_cow(map
);
6806 set
= (struct isl_set
*)map
;
6807 set
->dim
= isl_space_domain(set
->dim
);
6810 for (i
= 0; i
< map
->n
; ++i
) {
6811 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6815 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6816 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6823 /* Return the union of "map1" and "map2", where we assume for now that
6824 * "map1" and "map2" are disjoint. Note that the basic maps inside
6825 * "map1" or "map2" may not be disjoint from each other.
6826 * Also note that this function is also called from isl_map_union,
6827 * which takes care of handling the situation where "map1" and "map2"
6828 * may not be disjoint.
6830 * If one of the inputs is empty, we can simply return the other input.
6831 * Similarly, if one of the inputs is universal, then it is equal to the union.
6833 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6834 __isl_take isl_map
*map2
)
6838 struct isl_map
*map
= NULL
;
6853 is_universe
= isl_map_plain_is_universe(map1
);
6854 if (is_universe
< 0)
6861 is_universe
= isl_map_plain_is_universe(map2
);
6862 if (is_universe
< 0)
6869 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6871 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6872 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6873 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6875 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6876 map1
->n
+ map2
->n
, flags
);
6879 for (i
= 0; i
< map1
->n
; ++i
) {
6880 map
= isl_map_add_basic_map(map
,
6881 isl_basic_map_copy(map1
->p
[i
]));
6885 for (i
= 0; i
< map2
->n
; ++i
) {
6886 map
= isl_map_add_basic_map(map
,
6887 isl_basic_map_copy(map2
->p
[i
]));
6901 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6902 __isl_take isl_map
*map2
)
6904 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6907 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6909 map1
= isl_map_union_disjoint(map1
, map2
);
6913 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6917 struct isl_set
*isl_set_union_disjoint(
6918 struct isl_set
*set1
, struct isl_set
*set2
)
6920 return (struct isl_set
*)
6921 isl_map_union_disjoint(
6922 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6925 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6927 return (struct isl_set
*)
6928 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6931 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6934 * "map" and "set" are assumed to be compatible and non-NULL.
6936 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6937 __isl_take isl_set
*set
,
6938 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6939 __isl_take isl_basic_set
*bset
))
6942 struct isl_map
*result
;
6945 if (isl_set_plain_is_universe(set
)) {
6950 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6951 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6952 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6954 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6955 map
->n
* set
->n
, flags
);
6956 for (i
= 0; result
&& i
< map
->n
; ++i
)
6957 for (j
= 0; j
< set
->n
; ++j
) {
6958 result
= isl_map_add_basic_map(result
,
6959 fn(isl_basic_map_copy(map
->p
[i
]),
6960 isl_basic_set_copy(set
->p
[j
])));
6970 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6971 __isl_take isl_set
*set
)
6976 if (!isl_map_compatible_range(map
, set
))
6977 isl_die(set
->ctx
, isl_error_invalid
,
6978 "incompatible spaces", goto error
);
6980 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6987 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6988 __isl_take isl_set
*set
)
6990 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6993 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
6994 __isl_take isl_set
*set
)
6999 if (!isl_map_compatible_domain(map
, set
))
7000 isl_die(set
->ctx
, isl_error_invalid
,
7001 "incompatible spaces", goto error
);
7003 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7010 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7011 __isl_take isl_set
*set
)
7013 return isl_map_align_params_map_map_and(map
, set
,
7014 &map_intersect_domain
);
7017 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7018 __isl_take isl_map
*map2
)
7022 map1
= isl_map_reverse(map1
);
7023 map1
= isl_map_apply_range(map1
, map2
);
7024 return isl_map_reverse(map1
);
7031 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7032 __isl_take isl_map
*map2
)
7034 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7037 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7038 __isl_take isl_map
*map2
)
7040 isl_space
*dim_result
;
7041 struct isl_map
*result
;
7047 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7048 isl_space_copy(map2
->dim
));
7050 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7053 for (i
= 0; i
< map1
->n
; ++i
)
7054 for (j
= 0; j
< map2
->n
; ++j
) {
7055 result
= isl_map_add_basic_map(result
,
7056 isl_basic_map_apply_range(
7057 isl_basic_map_copy(map1
->p
[i
]),
7058 isl_basic_map_copy(map2
->p
[j
])));
7064 if (result
&& result
->n
<= 1)
7065 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7073 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7074 __isl_take isl_map
*map2
)
7076 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7080 * returns range - domain
7082 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7084 isl_space
*dims
, *target_dim
;
7085 struct isl_basic_set
*bset
;
7092 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
7093 bmap
->dim
, isl_dim_out
),
7095 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7096 dim
= isl_basic_map_n_in(bmap
);
7097 nparam
= isl_basic_map_n_param(bmap
);
7098 bset
= isl_basic_set_from_basic_map(bmap
);
7099 bset
= isl_basic_set_cow(bset
);
7100 dims
= isl_basic_set_get_space(bset
);
7101 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7102 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7103 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7104 for (i
= 0; i
< dim
; ++i
) {
7105 int j
= isl_basic_map_alloc_equality(
7106 (struct isl_basic_map
*)bset
);
7108 bset
= isl_basic_set_free(bset
);
7111 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7112 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7113 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7114 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7116 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7117 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7120 isl_basic_map_free(bmap
);
7125 * returns range - domain
7127 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7131 struct isl_set
*result
;
7136 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
7137 map
->dim
, isl_dim_out
),
7139 dim
= isl_map_get_space(map
);
7140 dim
= isl_space_domain(dim
);
7141 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7144 for (i
= 0; i
< map
->n
; ++i
)
7145 result
= isl_set_add_basic_set(result
,
7146 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7155 * returns [domain -> range] -> range - domain
7157 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7158 __isl_take isl_basic_map
*bmap
)
7162 isl_basic_map
*domain
;
7166 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
7167 isl_die(bmap
->ctx
, isl_error_invalid
,
7168 "domain and range don't match", goto error
);
7170 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7171 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7173 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7174 domain
= isl_basic_map_universe(dim
);
7176 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7177 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7178 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7180 total
= isl_basic_map_total_dim(bmap
);
7182 for (i
= 0; i
< n
; ++i
) {
7183 k
= isl_basic_map_alloc_equality(bmap
);
7186 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7187 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7188 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7189 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7192 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7193 return isl_basic_map_finalize(bmap
);
7195 isl_basic_map_free(bmap
);
7200 * returns [domain -> range] -> range - domain
7202 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7205 isl_space
*domain_dim
;
7210 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
7211 isl_die(map
->ctx
, isl_error_invalid
,
7212 "domain and range don't match", goto error
);
7214 map
= isl_map_cow(map
);
7218 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7219 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7220 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7223 for (i
= 0; i
< map
->n
; ++i
) {
7224 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7228 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7235 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7237 struct isl_basic_map
*bmap
;
7245 nparam
= dims
->nparam
;
7247 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7251 for (i
= 0; i
< dim
; ++i
) {
7252 int j
= isl_basic_map_alloc_equality(bmap
);
7255 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7256 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7257 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7259 return isl_basic_map_finalize(bmap
);
7261 isl_basic_map_free(bmap
);
7265 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7269 if (dim
->n_in
!= dim
->n_out
)
7270 isl_die(dim
->ctx
, isl_error_invalid
,
7271 "number of input and output dimensions needs to be "
7272 "the same", goto error
);
7273 return basic_map_identity(dim
);
7275 isl_space_free(dim
);
7279 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7281 if (!model
|| !model
->dim
)
7283 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7286 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7288 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7291 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7293 if (!model
|| !model
->dim
)
7295 return isl_map_identity(isl_space_copy(model
->dim
));
7298 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7300 if (!model
|| !model
->dim
)
7302 return isl_map_identity(isl_space_copy(model
->dim
));
7305 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7307 isl_space
*dim
= isl_set_get_space(set
);
7309 id
= isl_map_identity(isl_space_map_from_set(dim
));
7310 return isl_map_intersect_range(id
, set
);
7313 /* Construct a basic set with all set dimensions having only non-negative
7316 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7317 __isl_take isl_space
*space
)
7322 struct isl_basic_set
*bset
;
7326 nparam
= space
->nparam
;
7328 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7331 for (i
= 0; i
< dim
; ++i
) {
7332 int k
= isl_basic_set_alloc_inequality(bset
);
7335 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7336 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7340 isl_basic_set_free(bset
);
7344 /* Construct the half-space x_pos >= 0.
7346 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7350 isl_basic_set
*nonneg
;
7352 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7353 k
= isl_basic_set_alloc_inequality(nonneg
);
7356 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7357 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7359 return isl_basic_set_finalize(nonneg
);
7361 isl_basic_set_free(nonneg
);
7365 /* Construct the half-space x_pos <= -1.
7367 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7372 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7373 k
= isl_basic_set_alloc_inequality(neg
);
7376 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7377 isl_int_set_si(neg
->ineq
[k
][0], -1);
7378 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7380 return isl_basic_set_finalize(neg
);
7382 isl_basic_set_free(neg
);
7386 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7387 enum isl_dim_type type
, unsigned first
, unsigned n
)
7390 isl_basic_set
*nonneg
;
7398 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7400 for (i
= 0; i
< n
; ++i
) {
7401 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7402 pos(set
->dim
, type
) + first
+ i
);
7403 neg
= neg_halfspace(isl_set_get_space(set
),
7404 pos(set
->dim
, type
) + first
+ i
);
7406 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7415 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7416 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7423 if (isl_set_plain_is_empty(set
)) {
7428 return fn(set
, signs
, user
);
7431 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7433 half
= isl_set_intersect(half
, isl_set_copy(set
));
7434 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7438 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7440 half
= isl_set_intersect(half
, set
);
7441 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7447 /* Call "fn" on the intersections of "set" with each of the orthants
7448 * (except for obviously empty intersections). The orthant is identified
7449 * by the signs array, with each entry having value 1 or -1 according
7450 * to the sign of the corresponding variable.
7452 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7453 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7463 if (isl_set_plain_is_empty(set
))
7466 nparam
= isl_set_dim(set
, isl_dim_param
);
7467 nvar
= isl_set_dim(set
, isl_dim_set
);
7469 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7471 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7479 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7481 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7484 int isl_basic_map_is_subset(
7485 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7488 struct isl_map
*map1
;
7489 struct isl_map
*map2
;
7491 if (!bmap1
|| !bmap2
)
7494 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7495 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7497 is_subset
= isl_map_is_subset(map1
, map2
);
7505 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7506 __isl_keep isl_basic_set
*bset2
)
7508 return isl_basic_map_is_subset(bset1
, bset2
);
7511 int isl_basic_map_is_equal(
7512 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7516 if (!bmap1
|| !bmap2
)
7518 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7521 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7525 int isl_basic_set_is_equal(
7526 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7528 return isl_basic_map_is_equal(
7529 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7532 int isl_map_is_empty(struct isl_map
*map
)
7539 for (i
= 0; i
< map
->n
; ++i
) {
7540 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7549 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7551 return map
? map
->n
== 0 : -1;
7554 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7556 return isl_map_plain_is_empty(map
);
7559 int isl_set_plain_is_empty(struct isl_set
*set
)
7561 return set
? set
->n
== 0 : -1;
7564 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7566 return isl_set_plain_is_empty(set
);
7569 int isl_set_is_empty(struct isl_set
*set
)
7571 return isl_map_is_empty((struct isl_map
*)set
);
7574 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7579 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7582 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7587 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7590 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7596 is_subset
= isl_map_is_subset(map1
, map2
);
7599 is_subset
= isl_map_is_subset(map2
, map1
);
7603 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7605 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7608 int isl_basic_map_is_strict_subset(
7609 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7613 if (!bmap1
|| !bmap2
)
7615 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7618 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7619 if (is_subset
== -1)
7624 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7630 is_subset
= isl_map_is_subset(map1
, map2
);
7633 is_subset
= isl_map_is_subset(map2
, map1
);
7634 if (is_subset
== -1)
7639 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7641 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7644 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7648 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7651 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7655 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7658 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7665 for (i
= 0; i
< map
->n
; ++i
) {
7666 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7674 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7676 return isl_map_plain_is_universe((isl_map
*) set
);
7679 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7681 return isl_set_plain_is_universe(set
);
7684 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7686 struct isl_basic_set
*bset
= NULL
;
7687 struct isl_vec
*sample
= NULL
;
7694 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7697 if (isl_basic_map_is_universe(bmap
))
7700 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7701 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7702 copy
= isl_basic_map_remove_redundancies(copy
);
7703 empty
= isl_basic_map_plain_is_empty(copy
);
7704 isl_basic_map_free(copy
);
7708 total
= 1 + isl_basic_map_total_dim(bmap
);
7709 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7710 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7716 isl_vec_free(bmap
->sample
);
7717 bmap
->sample
= NULL
;
7718 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7721 sample
= isl_basic_set_sample_vec(bset
);
7724 empty
= sample
->size
== 0;
7725 isl_vec_free(bmap
->sample
);
7726 bmap
->sample
= sample
;
7728 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7733 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7737 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7740 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7742 return isl_basic_map_plain_is_empty(bmap
);
7745 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7749 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7752 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7754 return isl_basic_set_plain_is_empty(bset
);
7757 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7759 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7762 struct isl_map
*isl_basic_map_union(
7763 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7765 struct isl_map
*map
;
7766 if (!bmap1
|| !bmap2
)
7769 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7771 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7774 map
= isl_map_add_basic_map(map
, bmap1
);
7775 map
= isl_map_add_basic_map(map
, bmap2
);
7778 isl_basic_map_free(bmap1
);
7779 isl_basic_map_free(bmap2
);
7783 struct isl_set
*isl_basic_set_union(
7784 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7786 return (struct isl_set
*)isl_basic_map_union(
7787 (struct isl_basic_map
*)bset1
,
7788 (struct isl_basic_map
*)bset2
);
7791 /* Order divs such that any div only depends on previous divs */
7792 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7800 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7802 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7804 if (isl_int_is_zero(bmap
->div
[i
][0]))
7806 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7810 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7816 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7818 return (struct isl_basic_set
*)
7819 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7822 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7829 for (i
= 0; i
< map
->n
; ++i
) {
7830 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7841 /* Apply the expansion computed by isl_merge_divs.
7842 * The expansion itself is given by "exp" while the resulting
7843 * list of divs is given by "div".
7845 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7846 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7851 bset
= isl_basic_set_cow(bset
);
7855 if (div
->n_row
< bset
->n_div
)
7856 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7857 "not an expansion", goto error
);
7859 n_div
= bset
->n_div
;
7860 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7861 div
->n_row
- n_div
, 0,
7862 2 * (div
->n_row
- n_div
));
7864 for (i
= n_div
; i
< div
->n_row
; ++i
)
7865 if (isl_basic_set_alloc_div(bset
) < 0)
7869 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7870 if (j
>= 0 && exp
[j
] == i
) {
7872 isl_basic_map_swap_div(bset
, i
, j
);
7875 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7876 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7884 isl_basic_set_free(bset
);
7889 /* Look for a div in dst that corresponds to the div "div" in src.
7890 * The divs before "div" in src and dst are assumed to be the same.
7892 * Returns -1 if no corresponding div was found and the position
7893 * of the corresponding div in dst otherwise.
7895 static int find_div(struct isl_basic_map
*dst
,
7896 struct isl_basic_map
*src
, unsigned div
)
7900 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7902 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7903 for (i
= div
; i
< dst
->n_div
; ++i
)
7904 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7905 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7906 dst
->n_div
- div
) == -1)
7911 struct isl_basic_map
*isl_basic_map_align_divs(
7912 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7920 if (src
->n_div
== 0)
7923 for (i
= 0; i
< src
->n_div
; ++i
)
7924 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7926 src
= isl_basic_map_order_divs(src
);
7927 dst
= isl_basic_map_cow(dst
);
7928 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7929 src
->n_div
, 0, 2 * src
->n_div
);
7932 total
= isl_space_dim(src
->dim
, isl_dim_all
);
7933 for (i
= 0; i
< src
->n_div
; ++i
) {
7934 int j
= find_div(dst
, src
, i
);
7936 j
= isl_basic_map_alloc_div(dst
);
7939 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7940 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7941 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7945 isl_basic_map_swap_div(dst
, i
, j
);
7949 isl_basic_map_free(dst
);
7953 struct isl_basic_set
*isl_basic_set_align_divs(
7954 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7956 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7957 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7960 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7968 map
= isl_map_compute_divs(map
);
7969 map
= isl_map_cow(map
);
7973 for (i
= 1; i
< map
->n
; ++i
)
7974 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7975 for (i
= 1; i
< map
->n
; ++i
)
7976 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7978 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7982 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7984 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7987 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7988 __isl_take isl_map
*map
)
7992 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7993 map
= isl_map_intersect_domain(map
, set
);
7994 set
= isl_map_range(map
);
8002 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8003 __isl_take isl_map
*map
)
8005 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8008 /* There is no need to cow as removing empty parts doesn't change
8009 * the meaning of the set.
8011 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8018 for (i
= map
->n
- 1; i
>= 0; --i
)
8019 remove_if_empty(map
, i
);
8024 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8026 return (struct isl_set
*)
8027 isl_map_remove_empty_parts((struct isl_map
*)set
);
8030 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8032 struct isl_basic_map
*bmap
;
8033 if (!map
|| map
->n
== 0)
8035 bmap
= map
->p
[map
->n
-1];
8036 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8037 return isl_basic_map_copy(bmap
);
8040 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8042 return (struct isl_basic_set
*)
8043 isl_map_copy_basic_map((struct isl_map
*)set
);
8046 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8047 __isl_keep isl_basic_map
*bmap
)
8053 for (i
= map
->n
-1; i
>= 0; --i
) {
8054 if (map
->p
[i
] != bmap
)
8056 map
= isl_map_cow(map
);
8059 isl_basic_map_free(map
->p
[i
]);
8060 if (i
!= map
->n
-1) {
8061 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8062 map
->p
[i
] = map
->p
[map
->n
-1];
8073 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8074 struct isl_basic_set
*bset
)
8076 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8077 (struct isl_basic_map
*)bset
);
8080 /* Given two basic sets bset1 and bset2, compute the maximal difference
8081 * between the values of dimension pos in bset1 and those in bset2
8082 * for any common value of the parameters and dimensions preceding pos.
8084 static enum isl_lp_result
basic_set_maximal_difference_at(
8085 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8086 int pos
, isl_int
*opt
)
8089 struct isl_basic_map
*bmap1
= NULL
;
8090 struct isl_basic_map
*bmap2
= NULL
;
8091 struct isl_ctx
*ctx
;
8092 struct isl_vec
*obj
;
8095 unsigned dim1
, dim2
;
8096 enum isl_lp_result res
;
8098 if (!bset1
|| !bset2
)
8099 return isl_lp_error
;
8101 nparam
= isl_basic_set_n_param(bset1
);
8102 dim1
= isl_basic_set_n_dim(bset1
);
8103 dim2
= isl_basic_set_n_dim(bset2
);
8104 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8105 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8106 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8107 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8108 if (!bmap1
|| !bmap2
)
8110 bmap1
= isl_basic_map_cow(bmap1
);
8111 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8112 pos
, (dim1
- pos
) + (dim2
- pos
),
8113 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8114 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8117 total
= isl_basic_map_total_dim(bmap1
);
8119 obj
= isl_vec_alloc(ctx
, 1 + total
);
8122 isl_seq_clr(obj
->block
.data
, 1 + total
);
8123 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8124 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8125 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8127 isl_basic_map_free(bmap1
);
8131 isl_basic_map_free(bmap2
);
8133 isl_basic_map_free(bmap1
);
8134 return isl_lp_error
;
8137 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8138 * for any common value of the parameters and dimensions preceding pos
8139 * in both basic sets, the values of dimension pos in bset1 are
8140 * smaller or larger than those in bset2.
8143 * 1 if bset1 follows bset2
8144 * -1 if bset1 precedes bset2
8145 * 0 if bset1 and bset2 are incomparable
8146 * -2 if some error occurred.
8148 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8149 struct isl_basic_set
*bset2
, int pos
)
8152 enum isl_lp_result res
;
8157 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8159 if (res
== isl_lp_empty
)
8161 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8162 res
== isl_lp_unbounded
)
8164 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8173 /* Given two basic sets bset1 and bset2, check whether
8174 * for any common value of the parameters and dimensions preceding pos
8175 * there is a value of dimension pos in bset1 that is larger
8176 * than a value of the same dimension in bset2.
8179 * 1 if there exists such a pair
8180 * 0 if there is no such pair, but there is a pair of equal values
8182 * -2 if some error occurred.
8184 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8185 __isl_keep isl_basic_set
*bset2
, int pos
)
8188 enum isl_lp_result res
;
8193 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8195 if (res
== isl_lp_empty
)
8197 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8198 res
== isl_lp_unbounded
)
8200 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8202 else if (res
== isl_lp_ok
)
8211 /* Given two sets set1 and set2, check whether
8212 * for any common value of the parameters and dimensions preceding pos
8213 * there is a value of dimension pos in set1 that is larger
8214 * than a value of the same dimension in set2.
8217 * 1 if there exists such a pair
8218 * 0 if there is no such pair, but there is a pair of equal values
8220 * -2 if some error occurred.
8222 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8223 __isl_keep isl_set
*set2
, int pos
)
8231 for (i
= 0; i
< set1
->n
; ++i
)
8232 for (j
= 0; j
< set2
->n
; ++j
) {
8234 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8235 if (f
== 1 || f
== -2)
8244 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8245 unsigned pos
, isl_int
*val
)
8253 total
= isl_basic_map_total_dim(bmap
);
8254 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8255 for (; d
+1 > pos
; --d
)
8256 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8260 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8262 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8264 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8267 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8273 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8274 unsigned pos
, isl_int
*val
)
8286 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8289 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8290 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8291 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8292 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8296 isl_int_set(*val
, v
);
8302 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8303 unsigned pos
, isl_int
*val
)
8305 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8309 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8312 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8315 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8316 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8318 if (pos
>= isl_basic_map_dim(bmap
, type
))
8320 return isl_basic_map_plain_has_fixed_var(bmap
,
8321 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8324 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8325 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8327 if (pos
>= isl_map_dim(map
, type
))
8329 return isl_map_plain_has_fixed_var(map
,
8330 map_offset(map
, type
) - 1 + pos
, val
);
8333 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8334 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8336 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8339 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8340 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8342 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8345 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8346 * then return this fixed value in *val.
8348 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8349 unsigned dim
, isl_int
*val
)
8351 return isl_basic_set_plain_has_fixed_var(bset
,
8352 isl_basic_set_n_param(bset
) + dim
, val
);
8355 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8356 * then return this fixed value in *val.
8358 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8359 unsigned dim
, isl_int
*val
)
8361 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8364 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8365 unsigned dim
, isl_int
*val
)
8367 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8370 /* Check if input variable in has fixed value and if so and if val is not NULL,
8371 * then return this fixed value in *val.
8373 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8374 unsigned in
, isl_int
*val
)
8376 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8379 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8380 * and if val is not NULL, then return this lower bound in *val.
8382 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8383 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8385 int i
, i_eq
= -1, i_ineq
= -1;
8392 total
= isl_basic_set_total_dim(bset
);
8393 nparam
= isl_basic_set_n_param(bset
);
8394 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8395 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8401 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8402 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8404 if (i_eq
!= -1 || i_ineq
!= -1)
8408 if (i_eq
== -1 && i_ineq
== -1)
8410 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8411 /* The coefficient should always be one due to normalization. */
8412 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8414 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8416 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8417 total
- nparam
- dim
- 1) != -1)
8420 isl_int_neg(*val
, c
[0]);
8424 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8425 unsigned dim
, isl_int
*val
)
8437 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8441 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8443 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8444 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8446 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8450 isl_int_set(*val
, v
);
8461 /* uset_gist depends on constraints without existentially quantified
8462 * variables sorting first.
8464 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8466 const struct constraint
*c1
= (const struct constraint
*)p1
;
8467 const struct constraint
*c2
= (const struct constraint
*)p2
;
8469 unsigned size
= isl_min(c1
->size
, c2
->size
);
8471 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8472 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8477 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8480 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8481 struct isl_basic_map
*bmap
)
8484 struct constraint
*c
;
8489 total
= isl_basic_map_total_dim(bmap
);
8490 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8493 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8495 c
[i
].c
= bmap
->ineq
[i
];
8497 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8498 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8499 bmap
->ineq
[i
] = c
[i
].c
;
8503 isl_basic_map_free(bmap
);
8507 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8508 __isl_take isl_basic_set
*bset
)
8510 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8511 (struct isl_basic_map
*)bset
);
8514 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8518 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8520 bmap
= isl_basic_map_remove_redundancies(bmap
);
8521 bmap
= isl_basic_map_sort_constraints(bmap
);
8523 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8527 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8529 return (struct isl_basic_set
*)isl_basic_map_normalize(
8530 (struct isl_basic_map
*)bset
);
8533 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8534 const __isl_keep isl_basic_map
*bmap2
)
8541 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8542 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8543 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8544 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8545 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8546 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8547 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8548 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8549 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8550 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8551 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8553 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8555 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8557 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8558 return bmap1
->n_eq
- bmap2
->n_eq
;
8559 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8560 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8561 if (bmap1
->n_div
!= bmap2
->n_div
)
8562 return bmap1
->n_div
- bmap2
->n_div
;
8563 total
= isl_basic_map_total_dim(bmap1
);
8564 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8565 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8569 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8570 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8574 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8575 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8582 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8583 const __isl_keep isl_basic_set
*bset2
)
8585 return isl_basic_map_plain_cmp(bset1
, bset2
);
8588 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8594 if (set1
->n
!= set2
->n
)
8595 return set1
->n
- set2
->n
;
8597 for (i
= 0; i
< set1
->n
; ++i
) {
8598 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8606 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8607 __isl_keep isl_basic_map
*bmap2
)
8609 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8612 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8613 __isl_keep isl_basic_set
*bset2
)
8615 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8616 (isl_basic_map
*)bset2
);
8619 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8621 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8622 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8624 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8627 /* We normalize in place, but if anything goes wrong we need
8628 * to return NULL, so we need to make sure we don't change the
8629 * meaning of any possible other copies of map.
8631 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8634 struct isl_basic_map
*bmap
;
8638 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8640 for (i
= 0; i
< map
->n
; ++i
) {
8641 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8644 isl_basic_map_free(map
->p
[i
]);
8647 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8648 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8649 map
= isl_map_remove_empty_parts(map
);
8652 for (i
= map
->n
- 1; i
>= 1; --i
) {
8653 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8655 isl_basic_map_free(map
->p
[i
-1]);
8656 for (j
= i
; j
< map
->n
; ++j
)
8657 map
->p
[j
-1] = map
->p
[j
];
8667 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8669 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8672 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8682 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8685 map1
= isl_map_copy(map1
);
8686 map2
= isl_map_copy(map2
);
8687 map1
= isl_map_normalize(map1
);
8688 map2
= isl_map_normalize(map2
);
8691 equal
= map1
->n
== map2
->n
;
8692 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8693 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8706 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8708 return isl_map_plain_is_equal(map1
, map2
);
8711 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8713 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8714 (struct isl_map
*)set2
);
8717 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8719 return isl_set_plain_is_equal(set1
, set2
);
8722 /* Return an interval that ranges from min to max (inclusive)
8724 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8725 isl_int min
, isl_int max
)
8728 struct isl_basic_set
*bset
= NULL
;
8730 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8734 k
= isl_basic_set_alloc_inequality(bset
);
8737 isl_int_set_si(bset
->ineq
[k
][1], 1);
8738 isl_int_neg(bset
->ineq
[k
][0], min
);
8740 k
= isl_basic_set_alloc_inequality(bset
);
8743 isl_int_set_si(bset
->ineq
[k
][1], -1);
8744 isl_int_set(bset
->ineq
[k
][0], max
);
8748 isl_basic_set_free(bset
);
8752 /* Return the Cartesian product of the basic sets in list (in the given order).
8754 __isl_give isl_basic_set
*isl_basic_set_list_product(
8755 __isl_take
struct isl_basic_set_list
*list
)
8763 struct isl_basic_set
*product
= NULL
;
8767 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8768 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8769 nparam
= isl_basic_set_n_param(list
->p
[0]);
8770 dim
= isl_basic_set_n_dim(list
->p
[0]);
8771 extra
= list
->p
[0]->n_div
;
8772 n_eq
= list
->p
[0]->n_eq
;
8773 n_ineq
= list
->p
[0]->n_ineq
;
8774 for (i
= 1; i
< list
->n
; ++i
) {
8775 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8776 isl_assert(list
->ctx
,
8777 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8778 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8779 extra
+= list
->p
[i
]->n_div
;
8780 n_eq
+= list
->p
[i
]->n_eq
;
8781 n_ineq
+= list
->p
[i
]->n_ineq
;
8783 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8788 for (i
= 0; i
< list
->n
; ++i
) {
8789 isl_basic_set_add_constraints(product
,
8790 isl_basic_set_copy(list
->p
[i
]), dim
);
8791 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8793 isl_basic_set_list_free(list
);
8796 isl_basic_set_free(product
);
8797 isl_basic_set_list_free(list
);
8801 struct isl_basic_map
*isl_basic_map_product(
8802 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8804 isl_space
*dim_result
= NULL
;
8805 struct isl_basic_map
*bmap
;
8806 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8807 struct isl_dim_map
*dim_map1
, *dim_map2
;
8809 if (!bmap1
|| !bmap2
)
8812 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8813 bmap2
->dim
, isl_dim_param
), goto error
);
8814 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8815 isl_space_copy(bmap2
->dim
));
8817 in1
= isl_basic_map_n_in(bmap1
);
8818 in2
= isl_basic_map_n_in(bmap2
);
8819 out1
= isl_basic_map_n_out(bmap1
);
8820 out2
= isl_basic_map_n_out(bmap2
);
8821 nparam
= isl_basic_map_n_param(bmap1
);
8823 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8824 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8825 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8826 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8827 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8828 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8829 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8830 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8831 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8832 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8833 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8835 bmap
= isl_basic_map_alloc_space(dim_result
,
8836 bmap1
->n_div
+ bmap2
->n_div
,
8837 bmap1
->n_eq
+ bmap2
->n_eq
,
8838 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8839 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8840 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8841 bmap
= isl_basic_map_simplify(bmap
);
8842 return isl_basic_map_finalize(bmap
);
8844 isl_basic_map_free(bmap1
);
8845 isl_basic_map_free(bmap2
);
8849 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8850 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8852 isl_basic_map
*prod
;
8854 prod
= isl_basic_map_product(bmap1
, bmap2
);
8855 prod
= isl_basic_map_flatten(prod
);
8859 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8860 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8862 return isl_basic_map_flat_range_product(bset1
, bset2
);
8865 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8866 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8868 isl_space
*space_result
= NULL
;
8869 isl_basic_map
*bmap
;
8870 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8871 struct isl_dim_map
*dim_map1
, *dim_map2
;
8873 if (!bmap1
|| !bmap2
)
8876 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8877 isl_space_copy(bmap2
->dim
));
8879 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8880 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8881 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8882 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8884 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8885 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8886 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8887 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8888 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8889 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8890 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8891 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8892 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8893 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8894 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8896 bmap
= isl_basic_map_alloc_space(space_result
,
8897 bmap1
->n_div
+ bmap2
->n_div
,
8898 bmap1
->n_eq
+ bmap2
->n_eq
,
8899 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8900 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8901 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8902 bmap
= isl_basic_map_simplify(bmap
);
8903 return isl_basic_map_finalize(bmap
);
8905 isl_basic_map_free(bmap1
);
8906 isl_basic_map_free(bmap2
);
8910 __isl_give isl_basic_map
*isl_basic_map_range_product(
8911 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8913 isl_space
*dim_result
= NULL
;
8914 isl_basic_map
*bmap
;
8915 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8916 struct isl_dim_map
*dim_map1
, *dim_map2
;
8918 if (!bmap1
|| !bmap2
)
8921 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8922 bmap2
->dim
, isl_dim_param
))
8923 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8924 "parameters don't match", goto error
);
8926 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8927 isl_space_copy(bmap2
->dim
));
8929 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8930 out1
= isl_basic_map_n_out(bmap1
);
8931 out2
= isl_basic_map_n_out(bmap2
);
8932 nparam
= isl_basic_map_n_param(bmap1
);
8934 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8935 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8936 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8937 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8938 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8939 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8940 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8941 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8942 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8943 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8944 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8946 bmap
= isl_basic_map_alloc_space(dim_result
,
8947 bmap1
->n_div
+ bmap2
->n_div
,
8948 bmap1
->n_eq
+ bmap2
->n_eq
,
8949 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8950 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8951 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8952 bmap
= isl_basic_map_simplify(bmap
);
8953 return isl_basic_map_finalize(bmap
);
8955 isl_basic_map_free(bmap1
);
8956 isl_basic_map_free(bmap2
);
8960 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8961 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8963 isl_basic_map
*prod
;
8965 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8966 prod
= isl_basic_map_flatten_range(prod
);
8970 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8971 __isl_take isl_map
*map2
,
8972 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8973 __isl_take isl_space
*right
),
8974 __isl_give isl_basic_map
*(*basic_map_product
)(
8975 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8978 struct isl_map
*result
;
8984 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8985 map2
->dim
, isl_dim_param
), goto error
);
8987 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8988 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8989 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8991 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8992 isl_space_copy(map2
->dim
)),
8993 map1
->n
* map2
->n
, flags
);
8996 for (i
= 0; i
< map1
->n
; ++i
)
8997 for (j
= 0; j
< map2
->n
; ++j
) {
8998 struct isl_basic_map
*part
;
8999 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9000 isl_basic_map_copy(map2
->p
[j
]));
9001 if (isl_basic_map_is_empty(part
))
9002 isl_basic_map_free(part
);
9004 result
= isl_map_add_basic_map(result
, part
);
9017 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9019 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9020 __isl_take isl_map
*map2
)
9022 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
9025 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9026 __isl_take isl_map
*map2
)
9028 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9031 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9033 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9034 __isl_take isl_map
*map2
)
9038 prod
= isl_map_product(map1
, map2
);
9039 prod
= isl_map_flatten(prod
);
9043 /* Given two set A and B, construct its Cartesian product A x B.
9045 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9047 return isl_map_range_product(set1
, set2
);
9050 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9051 __isl_take isl_set
*set2
)
9053 return isl_map_flat_range_product(set1
, set2
);
9056 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9058 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9059 __isl_take isl_map
*map2
)
9061 return map_product(map1
, map2
, &isl_space_domain_product
,
9062 &isl_basic_map_domain_product
);
9065 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9067 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9068 __isl_take isl_map
*map2
)
9070 return map_product(map1
, map2
, &isl_space_range_product
,
9071 &isl_basic_map_range_product
);
9074 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9075 __isl_take isl_map
*map2
)
9077 return isl_map_align_params_map_map_and(map1
, map2
,
9078 &map_domain_product_aligned
);
9081 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9082 __isl_take isl_map
*map2
)
9084 return isl_map_align_params_map_map_and(map1
, map2
,
9085 &map_range_product_aligned
);
9088 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9090 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9091 __isl_take isl_map
*map2
)
9095 prod
= isl_map_domain_product(map1
, map2
);
9096 prod
= isl_map_flatten_domain(prod
);
9100 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9102 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9103 __isl_take isl_map
*map2
)
9107 prod
= isl_map_range_product(map1
, map2
);
9108 prod
= isl_map_flatten_range(prod
);
9112 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9115 uint32_t hash
= isl_hash_init();
9120 bmap
= isl_basic_map_copy(bmap
);
9121 bmap
= isl_basic_map_normalize(bmap
);
9124 total
= isl_basic_map_total_dim(bmap
);
9125 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9126 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9128 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9129 isl_hash_hash(hash
, c_hash
);
9131 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9132 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9134 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9135 isl_hash_hash(hash
, c_hash
);
9137 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9138 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9140 if (isl_int_is_zero(bmap
->div
[i
][0]))
9142 isl_hash_byte(hash
, i
& 0xFF);
9143 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9144 isl_hash_hash(hash
, c_hash
);
9146 isl_basic_map_free(bmap
);
9150 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9152 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9155 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9162 map
= isl_map_copy(map
);
9163 map
= isl_map_normalize(map
);
9167 hash
= isl_hash_init();
9168 for (i
= 0; i
< map
->n
; ++i
) {
9170 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9171 isl_hash_hash(hash
, bmap_hash
);
9179 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9181 return isl_map_get_hash((isl_map
*)set
);
9184 /* Check if the value for dimension dim is completely determined
9185 * by the values of the other parameters and variables.
9186 * That is, check if dimension dim is involved in an equality.
9188 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9195 nparam
= isl_basic_set_n_param(bset
);
9196 for (i
= 0; i
< bset
->n_eq
; ++i
)
9197 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9202 /* Check if the value for dimension dim is completely determined
9203 * by the values of the other parameters and variables.
9204 * That is, check if dimension dim is involved in an equality
9205 * for each of the subsets.
9207 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
9213 for (i
= 0; i
< set
->n
; ++i
) {
9215 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
9222 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9224 return set
? set
->n
: 0;
9227 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9228 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9235 for (i
= 0; i
< map
->n
; ++i
)
9236 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9242 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9243 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9250 for (i
= 0; i
< set
->n
; ++i
)
9251 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9257 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9264 bset
= isl_basic_set_cow(bset
);
9268 dim
= isl_basic_set_get_space(bset
);
9269 dim
= isl_space_lift(dim
, bset
->n_div
);
9272 isl_space_free(bset
->dim
);
9274 bset
->extra
-= bset
->n_div
;
9277 bset
= isl_basic_set_finalize(bset
);
9281 isl_basic_set_free(bset
);
9285 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9291 set
= isl_set_align_divs(set
);
9296 set
= isl_set_cow(set
);
9300 n_div
= set
->p
[0]->n_div
;
9301 dim
= isl_set_get_space(set
);
9302 dim
= isl_space_lift(dim
, n_div
);
9305 isl_space_free(set
->dim
);
9308 for (i
= 0; i
< set
->n
; ++i
) {
9309 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9320 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9323 struct isl_basic_map
*bmap
;
9330 set
= isl_set_align_divs(set
);
9335 dim
= isl_set_get_space(set
);
9336 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9338 return isl_map_identity(isl_space_map_from_set(dim
));
9341 n_div
= set
->p
[0]->n_div
;
9342 dim
= isl_space_map_from_set(dim
);
9343 n_param
= isl_space_dim(dim
, isl_dim_param
);
9344 n_set
= isl_space_dim(dim
, isl_dim_in
);
9345 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9346 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9347 for (i
= 0; i
< n_set
; ++i
)
9348 bmap
= var_equal(bmap
, i
);
9350 total
= n_param
+ n_set
+ n_set
+ n_div
;
9351 for (i
= 0; i
< n_div
; ++i
) {
9352 k
= isl_basic_map_alloc_inequality(bmap
);
9355 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9356 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9357 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9358 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9359 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9360 set
->p
[0]->div
[i
][0]);
9362 l
= isl_basic_map_alloc_inequality(bmap
);
9365 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9366 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9367 set
->p
[0]->div
[i
][0]);
9368 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9372 bmap
= isl_basic_map_simplify(bmap
);
9373 bmap
= isl_basic_map_finalize(bmap
);
9374 return isl_map_from_basic_map(bmap
);
9377 isl_basic_map_free(bmap
);
9381 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9389 dim
= isl_basic_set_total_dim(bset
);
9390 size
+= bset
->n_eq
* (1 + dim
);
9391 size
+= bset
->n_ineq
* (1 + dim
);
9392 size
+= bset
->n_div
* (2 + dim
);
9397 int isl_set_size(__isl_keep isl_set
*set
)
9405 for (i
= 0; i
< set
->n
; ++i
)
9406 size
+= isl_basic_set_size(set
->p
[i
]);
9411 /* Check if there is any lower bound (if lower == 0) and/or upper
9412 * bound (if upper == 0) on the specified dim.
9414 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9415 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9422 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9424 pos
+= isl_basic_map_offset(bmap
, type
);
9426 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9427 if (isl_int_is_zero(bmap
->div
[i
][0]))
9429 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9433 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9434 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9437 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9438 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9445 return lower
&& upper
;
9448 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9449 enum isl_dim_type type
, unsigned pos
)
9451 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9454 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9455 enum isl_dim_type type
, unsigned pos
)
9457 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9460 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9461 enum isl_dim_type type
, unsigned pos
)
9463 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9466 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9467 enum isl_dim_type type
, unsigned pos
)
9474 for (i
= 0; i
< map
->n
; ++i
) {
9476 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9477 if (bounded
< 0 || !bounded
)
9484 /* Return 1 if the specified dim is involved in both an upper bound
9485 * and a lower bound.
9487 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9488 enum isl_dim_type type
, unsigned pos
)
9490 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9493 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9495 static int has_any_bound(__isl_keep isl_map
*map
,
9496 enum isl_dim_type type
, unsigned pos
,
9497 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9498 enum isl_dim_type type
, unsigned pos
))
9505 for (i
= 0; i
< map
->n
; ++i
) {
9507 bounded
= fn(map
->p
[i
], type
, pos
);
9508 if (bounded
< 0 || bounded
)
9515 /* Return 1 if the specified dim is involved in any lower bound.
9517 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9518 enum isl_dim_type type
, unsigned pos
)
9520 return has_any_bound(set
, type
, pos
,
9521 &isl_basic_map_dim_has_lower_bound
);
9524 /* Return 1 if the specified dim is involved in any upper bound.
9526 int isl_set_dim_has_any_upper_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_upper_bound
);
9533 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9535 static int has_bound(__isl_keep isl_map
*map
,
9536 enum isl_dim_type type
, unsigned pos
,
9537 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9538 enum isl_dim_type type
, unsigned pos
))
9545 for (i
= 0; i
< map
->n
; ++i
) {
9547 bounded
= fn(map
->p
[i
], type
, pos
);
9548 if (bounded
< 0 || !bounded
)
9555 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9557 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9558 enum isl_dim_type type
, unsigned pos
)
9560 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9563 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9565 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9566 enum isl_dim_type type
, unsigned pos
)
9568 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9571 /* For each of the "n" variables starting at "first", determine
9572 * the sign of the variable and put the results in the first "n"
9573 * elements of the array "signs".
9575 * 1 means that the variable is non-negative
9576 * -1 means that the variable is non-positive
9577 * 0 means the variable attains both positive and negative values.
9579 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9580 unsigned first
, unsigned n
, int *signs
)
9582 isl_vec
*bound
= NULL
;
9583 struct isl_tab
*tab
= NULL
;
9584 struct isl_tab_undo
*snap
;
9587 if (!bset
|| !signs
)
9590 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9591 tab
= isl_tab_from_basic_set(bset
, 0);
9595 isl_seq_clr(bound
->el
, bound
->size
);
9596 isl_int_set_si(bound
->el
[0], -1);
9598 snap
= isl_tab_snap(tab
);
9599 for (i
= 0; i
< n
; ++i
) {
9602 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9603 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9606 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9607 if (isl_tab_rollback(tab
, snap
) < 0)
9615 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9616 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9619 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9620 if (isl_tab_rollback(tab
, snap
) < 0)
9623 signs
[i
] = empty
? -1 : 0;
9627 isl_vec_free(bound
);
9631 isl_vec_free(bound
);
9635 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9636 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9638 if (!bset
|| !signs
)
9640 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9643 first
+= pos(bset
->dim
, type
) - 1;
9644 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9647 /* Check if the given basic map is obviously single-valued.
9648 * In particular, for each output dimension, check that there is
9649 * an equality that defines the output dimension in terms of
9650 * earlier dimensions.
9652 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9662 total
= 1 + isl_basic_map_total_dim(bmap
);
9663 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9664 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9666 for (i
= 0; i
< n_out
; ++i
) {
9667 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9668 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9670 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9671 total
- (o_out
+ i
+ 1)) == -1)
9674 if (j
>= bmap
->n_eq
)
9681 /* Check if the given basic map is single-valued.
9686 * and check if the result is a subset of the identity mapping.
9688 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9691 isl_basic_map
*test
;
9695 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9699 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9700 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9702 space
= isl_basic_map_get_space(bmap
);
9703 space
= isl_space_map_from_set(isl_space_range(space
));
9704 id
= isl_basic_map_identity(space
);
9706 sv
= isl_basic_map_is_subset(test
, id
);
9708 isl_basic_map_free(test
);
9709 isl_basic_map_free(id
);
9714 /* Check if the given map is obviously single-valued.
9716 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9725 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9728 /* Check if the given map is single-valued.
9733 * and check if the result is a subset of the identity mapping.
9735 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9742 sv
= isl_map_plain_is_single_valued(map
);
9746 test
= isl_map_reverse(isl_map_copy(map
));
9747 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9749 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9750 id
= isl_map_identity(dim
);
9752 sv
= isl_map_is_subset(test
, id
);
9760 int isl_map_is_injective(__isl_keep isl_map
*map
)
9764 map
= isl_map_copy(map
);
9765 map
= isl_map_reverse(map
);
9766 in
= isl_map_is_single_valued(map
);
9772 /* Check if the given map is obviously injective.
9774 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9778 map
= isl_map_copy(map
);
9779 map
= isl_map_reverse(map
);
9780 in
= isl_map_plain_is_single_valued(map
);
9786 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9790 sv
= isl_map_is_single_valued(map
);
9794 return isl_map_is_injective(map
);
9797 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9799 return isl_map_is_single_valued((isl_map
*)set
);
9802 int isl_map_is_translation(__isl_keep isl_map
*map
)
9807 delta
= isl_map_deltas(isl_map_copy(map
));
9808 ok
= isl_set_is_singleton(delta
);
9809 isl_set_free(delta
);
9814 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9816 if (isl_seq_first_non_zero(p
, pos
) != -1)
9818 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9823 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9832 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9835 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9836 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9837 for (j
= 0; j
< nvar
; ++j
) {
9838 int lower
= 0, upper
= 0;
9839 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9840 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9842 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9848 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9849 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9851 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9853 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9858 if (!lower
|| !upper
)
9865 int isl_set_is_box(__isl_keep isl_set
*set
)
9872 return isl_basic_set_is_box(set
->p
[0]);
9875 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9880 return isl_space_is_wrapping(bset
->dim
);
9883 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9888 return isl_space_is_wrapping(set
->dim
);
9891 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9893 bmap
= isl_basic_map_cow(bmap
);
9897 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9901 bmap
= isl_basic_map_finalize(bmap
);
9903 return (isl_basic_set
*)bmap
;
9905 isl_basic_map_free(bmap
);
9909 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9913 map
= isl_map_cow(map
);
9917 for (i
= 0; i
< map
->n
; ++i
) {
9918 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9922 map
->dim
= isl_space_wrap(map
->dim
);
9926 return (isl_set
*)map
;
9932 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9934 bset
= isl_basic_set_cow(bset
);
9938 bset
->dim
= isl_space_unwrap(bset
->dim
);
9942 bset
= isl_basic_set_finalize(bset
);
9944 return (isl_basic_map
*)bset
;
9946 isl_basic_set_free(bset
);
9950 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9957 if (!isl_set_is_wrapping(set
))
9958 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9961 set
= isl_set_cow(set
);
9965 for (i
= 0; i
< set
->n
; ++i
) {
9966 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9971 set
->dim
= isl_space_unwrap(set
->dim
);
9975 return (isl_map
*)set
;
9981 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9982 enum isl_dim_type type
)
9987 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9990 bmap
= isl_basic_map_cow(bmap
);
9994 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9998 bmap
= isl_basic_map_finalize(bmap
);
10002 isl_basic_map_free(bmap
);
10006 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10007 enum isl_dim_type type
)
10014 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10017 map
= isl_map_cow(map
);
10021 for (i
= 0; i
< map
->n
; ++i
) {
10022 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10026 map
->dim
= isl_space_reset(map
->dim
, type
);
10036 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10041 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10044 bmap
= isl_basic_map_cow(bmap
);
10048 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10052 bmap
= isl_basic_map_finalize(bmap
);
10056 isl_basic_map_free(bmap
);
10060 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10062 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
10065 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10066 __isl_take isl_basic_map
*bmap
)
10071 if (!bmap
->dim
->nested
[0])
10074 bmap
= isl_basic_map_cow(bmap
);
10078 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10082 bmap
= isl_basic_map_finalize(bmap
);
10086 isl_basic_map_free(bmap
);
10090 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10091 __isl_take isl_basic_map
*bmap
)
10096 if (!bmap
->dim
->nested
[1])
10099 bmap
= isl_basic_map_cow(bmap
);
10103 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
10107 bmap
= isl_basic_map_finalize(bmap
);
10111 isl_basic_map_free(bmap
);
10115 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
10122 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
10125 map
= isl_map_cow(map
);
10129 for (i
= 0; i
< map
->n
; ++i
) {
10130 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
10134 map
->dim
= isl_space_flatten(map
->dim
);
10144 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
10146 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
10149 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
10151 isl_space
*dim
, *flat_dim
;
10154 dim
= isl_set_get_space(set
);
10155 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
10156 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
10157 map
= isl_map_intersect_domain(map
, set
);
10162 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
10169 if (!map
->dim
->nested
[0])
10172 map
= isl_map_cow(map
);
10176 for (i
= 0; i
< map
->n
; ++i
) {
10177 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
10181 map
->dim
= isl_space_flatten_domain(map
->dim
);
10191 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
10198 if (!map
->dim
->nested
[1])
10201 map
= isl_map_cow(map
);
10205 for (i
= 0; i
< map
->n
; ++i
) {
10206 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
10210 map
->dim
= isl_space_flatten_range(map
->dim
);
10220 /* Reorder the dimensions of "bmap" according to the given dim_map
10221 * and set the dimension specification to "dim".
10223 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
10224 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
10226 isl_basic_map
*res
;
10229 bmap
= isl_basic_map_cow(bmap
);
10230 if (!bmap
|| !dim
|| !dim_map
)
10233 flags
= bmap
->flags
;
10234 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
10235 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
10236 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
10237 res
= isl_basic_map_alloc_space(dim
,
10238 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
10239 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
10241 res
->flags
= flags
;
10242 res
= isl_basic_map_finalize(res
);
10246 isl_basic_map_free(bmap
);
10247 isl_space_free(dim
);
10251 /* Reorder the dimensions of "map" according to given reordering.
10253 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
10254 __isl_take isl_reordering
*r
)
10257 struct isl_dim_map
*dim_map
;
10259 map
= isl_map_cow(map
);
10260 dim_map
= isl_dim_map_from_reordering(r
);
10261 if (!map
|| !r
|| !dim_map
)
10264 for (i
= 0; i
< map
->n
; ++i
) {
10265 struct isl_dim_map
*dim_map_i
;
10267 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10269 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10270 isl_space_copy(r
->dim
), dim_map_i
);
10276 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10278 isl_reordering_free(r
);
10284 isl_reordering_free(r
);
10288 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10289 __isl_take isl_reordering
*r
)
10291 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10294 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10295 __isl_take isl_space
*model
)
10299 if (!map
|| !model
)
10302 ctx
= isl_space_get_ctx(model
);
10303 if (!isl_space_has_named_params(model
))
10304 isl_die(ctx
, isl_error_invalid
,
10305 "model has unnamed parameters", goto error
);
10306 if (!isl_space_has_named_params(map
->dim
))
10307 isl_die(ctx
, isl_error_invalid
,
10308 "relation has unnamed parameters", goto error
);
10309 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10310 isl_reordering
*exp
;
10312 model
= isl_space_drop_dims(model
, isl_dim_in
,
10313 0, isl_space_dim(model
, isl_dim_in
));
10314 model
= isl_space_drop_dims(model
, isl_dim_out
,
10315 0, isl_space_dim(model
, isl_dim_out
));
10316 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10317 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10318 map
= isl_map_realign(map
, exp
);
10321 isl_space_free(model
);
10324 isl_space_free(model
);
10329 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10330 __isl_take isl_space
*model
)
10332 return isl_map_align_params(set
, model
);
10335 /* Align the parameters of "bmap" to those of "model", introducing
10336 * additional parameters if needed.
10338 __isl_give isl_basic_map
*isl_basic_map_align_params(
10339 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10343 if (!bmap
|| !model
)
10346 ctx
= isl_space_get_ctx(model
);
10347 if (!isl_space_has_named_params(model
))
10348 isl_die(ctx
, isl_error_invalid
,
10349 "model has unnamed parameters", goto error
);
10350 if (!isl_space_has_named_params(bmap
->dim
))
10351 isl_die(ctx
, isl_error_invalid
,
10352 "relation has unnamed parameters", goto error
);
10353 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10354 isl_reordering
*exp
;
10355 struct isl_dim_map
*dim_map
;
10357 model
= isl_space_drop_dims(model
, isl_dim_in
,
10358 0, isl_space_dim(model
, isl_dim_in
));
10359 model
= isl_space_drop_dims(model
, isl_dim_out
,
10360 0, isl_space_dim(model
, isl_dim_out
));
10361 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10362 exp
= isl_reordering_extend_space(exp
,
10363 isl_basic_map_get_space(bmap
));
10364 dim_map
= isl_dim_map_from_reordering(exp
);
10365 bmap
= isl_basic_map_realign(bmap
,
10366 exp
? isl_space_copy(exp
->dim
) : NULL
,
10367 isl_dim_map_extend(dim_map
, bmap
));
10368 isl_reordering_free(exp
);
10372 isl_space_free(model
);
10375 isl_space_free(model
);
10376 isl_basic_map_free(bmap
);
10380 /* Align the parameters of "bset" to those of "model", introducing
10381 * additional parameters if needed.
10383 __isl_give isl_basic_set
*isl_basic_set_align_params(
10384 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10386 return isl_basic_map_align_params(bset
, model
);
10389 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10390 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10391 enum isl_dim_type c2
, enum isl_dim_type c3
,
10392 enum isl_dim_type c4
, enum isl_dim_type c5
)
10394 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10395 struct isl_mat
*mat
;
10401 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10402 isl_basic_map_total_dim(bmap
) + 1);
10405 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10406 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10407 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10408 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10409 isl_int_set(mat
->row
[i
][pos
],
10410 bmap
->eq
[i
][off
+ k
]);
10418 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10419 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10420 enum isl_dim_type c2
, enum isl_dim_type c3
,
10421 enum isl_dim_type c4
, enum isl_dim_type c5
)
10423 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10424 struct isl_mat
*mat
;
10430 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10431 isl_basic_map_total_dim(bmap
) + 1);
10434 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10435 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10436 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10437 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10438 isl_int_set(mat
->row
[i
][pos
],
10439 bmap
->ineq
[i
][off
+ k
]);
10447 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10448 __isl_take isl_space
*dim
,
10449 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10450 enum isl_dim_type c2
, enum isl_dim_type c3
,
10451 enum isl_dim_type c4
, enum isl_dim_type c5
)
10453 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10454 isl_basic_map
*bmap
;
10460 if (!dim
|| !eq
|| !ineq
)
10463 if (eq
->n_col
!= ineq
->n_col
)
10464 isl_die(dim
->ctx
, isl_error_invalid
,
10465 "equalities and inequalities matrices should have "
10466 "same number of columns", goto error
);
10468 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10470 if (eq
->n_col
< total
)
10471 isl_die(dim
->ctx
, isl_error_invalid
,
10472 "number of columns too small", goto error
);
10474 extra
= eq
->n_col
- total
;
10476 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10477 eq
->n_row
, ineq
->n_row
);
10480 for (i
= 0; i
< extra
; ++i
) {
10481 k
= isl_basic_map_alloc_div(bmap
);
10484 isl_int_set_si(bmap
->div
[k
][0], 0);
10486 for (i
= 0; i
< eq
->n_row
; ++i
) {
10487 l
= isl_basic_map_alloc_equality(bmap
);
10490 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10491 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10492 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10493 isl_int_set(bmap
->eq
[l
][off
+ k
],
10499 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10500 l
= isl_basic_map_alloc_inequality(bmap
);
10503 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10504 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10505 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10506 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10507 ineq
->row
[i
][pos
]);
10513 isl_space_free(dim
);
10515 isl_mat_free(ineq
);
10517 bmap
= isl_basic_map_simplify(bmap
);
10518 return isl_basic_map_finalize(bmap
);
10520 isl_space_free(dim
);
10522 isl_mat_free(ineq
);
10526 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10527 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10528 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10530 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10531 c1
, c2
, c3
, c4
, isl_dim_in
);
10534 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10535 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10536 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10538 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10539 c1
, c2
, c3
, c4
, isl_dim_in
);
10542 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10543 __isl_take isl_space
*dim
,
10544 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, 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_set
*)
10548 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10549 c1
, c2
, c3
, c4
, isl_dim_in
);
10552 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10557 return isl_space_can_zip(bmap
->dim
);
10560 int isl_map_can_zip(__isl_keep isl_map
*map
)
10565 return isl_space_can_zip(map
->dim
);
10568 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10569 * (A -> C) -> (B -> D).
10571 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10580 if (!isl_basic_map_can_zip(bmap
))
10581 isl_die(bmap
->ctx
, isl_error_invalid
,
10582 "basic map cannot be zipped", goto error
);
10583 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10584 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10585 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10586 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10587 bmap
= isl_basic_map_cow(bmap
);
10588 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10591 bmap
->dim
= isl_space_zip(bmap
->dim
);
10596 isl_basic_map_free(bmap
);
10600 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10601 * (A -> C) -> (B -> D).
10603 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10610 if (!isl_map_can_zip(map
))
10611 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10614 map
= isl_map_cow(map
);
10618 for (i
= 0; i
< map
->n
; ++i
) {
10619 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10624 map
->dim
= isl_space_zip(map
->dim
);
10634 /* Can we apply isl_basic_map_curry to "bmap"?
10635 * That is, does it have a nested relation in its domain?
10637 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10642 return isl_space_can_curry(bmap
->dim
);
10645 /* Can we apply isl_map_curry to "map"?
10646 * That is, does it have a nested relation in its domain?
10648 int isl_map_can_curry(__isl_keep isl_map
*map
)
10653 return isl_space_can_curry(map
->dim
);
10656 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10659 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10665 if (!isl_basic_map_can_curry(bmap
))
10666 isl_die(bmap
->ctx
, isl_error_invalid
,
10667 "basic map cannot be curried", goto error
);
10668 bmap
= isl_basic_map_cow(bmap
);
10671 bmap
->dim
= isl_space_curry(bmap
->dim
);
10676 isl_basic_map_free(bmap
);
10680 /* Given a map (A -> B) -> C, return the corresponding map
10683 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10690 if (!isl_map_can_curry(map
))
10691 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10694 map
= isl_map_cow(map
);
10698 for (i
= 0; i
< map
->n
; ++i
) {
10699 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10704 map
->dim
= isl_space_curry(map
->dim
);
10714 /* Can we apply isl_basic_map_uncurry to "bmap"?
10715 * That is, does it have a nested relation in its domain?
10717 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10722 return isl_space_can_uncurry(bmap
->dim
);
10725 /* Can we apply isl_map_uncurry to "map"?
10726 * That is, does it have a nested relation in its domain?
10728 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10733 return isl_space_can_uncurry(map
->dim
);
10736 /* Given a basic map A -> (B -> C), return the corresponding basic map
10739 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10745 if (!isl_basic_map_can_uncurry(bmap
))
10746 isl_die(bmap
->ctx
, isl_error_invalid
,
10747 "basic map cannot be uncurried",
10748 return isl_basic_map_free(bmap
));
10749 bmap
= isl_basic_map_cow(bmap
);
10752 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10754 return isl_basic_map_free(bmap
);
10758 /* Given a map A -> (B -> C), return the corresponding map
10761 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10768 if (!isl_map_can_uncurry(map
))
10769 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10770 return isl_map_free(map
));
10772 map
= isl_map_cow(map
);
10776 for (i
= 0; i
< map
->n
; ++i
) {
10777 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10779 return isl_map_free(map
);
10782 map
->dim
= isl_space_uncurry(map
->dim
);
10784 return isl_map_free(map
);
10789 /* Construct a basic map mapping the domain of the affine expression
10790 * to a one-dimensional range prescribed by the affine expression.
10792 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10796 isl_local_space
*ls
;
10797 isl_basic_map
*bmap
;
10802 ls
= isl_aff_get_local_space(aff
);
10803 bmap
= isl_basic_map_from_local_space(ls
);
10804 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10805 k
= isl_basic_map_alloc_equality(bmap
);
10809 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10810 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10811 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10812 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10813 aff
->v
->size
- (pos
+ 1));
10816 bmap
= isl_basic_map_finalize(bmap
);
10820 isl_basic_map_free(bmap
);
10824 /* Construct a map mapping the domain of the affine expression
10825 * to a one-dimensional range prescribed by the affine expression.
10827 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10829 isl_basic_map
*bmap
;
10831 bmap
= isl_basic_map_from_aff(aff
);
10832 return isl_map_from_basic_map(bmap
);
10835 /* Construct a basic map mapping the domain the multi-affine expression
10836 * to its range, with each dimension in the range equated to the
10837 * corresponding affine expression.
10839 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10840 __isl_take isl_multi_aff
*maff
)
10844 isl_basic_map
*bmap
;
10849 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10850 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10851 "invalid space", return isl_multi_aff_free(maff
));
10853 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10854 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10856 for (i
= 0; i
< maff
->n
; ++i
) {
10858 isl_basic_map
*bmap_i
;
10860 aff
= isl_aff_copy(maff
->p
[i
]);
10861 bmap_i
= isl_basic_map_from_aff(aff
);
10863 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10866 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10868 isl_multi_aff_free(maff
);
10872 /* Construct a map mapping the domain the multi-affine expression
10873 * to its range, with each dimension in the range equated to the
10874 * corresponding affine expression.
10876 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10878 isl_basic_map
*bmap
;
10880 bmap
= isl_basic_map_from_multi_aff(maff
);
10881 return isl_map_from_basic_map(bmap
);
10884 /* Construct a basic map mapping a domain in the given space to
10885 * to an n-dimensional range, with n the number of elements in the list,
10886 * where each coordinate in the range is prescribed by the
10887 * corresponding affine expression.
10888 * The domains of all affine expressions in the list are assumed to match
10891 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10892 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10896 isl_basic_map
*bmap
;
10901 dim
= isl_space_from_domain(domain_dim
);
10902 bmap
= isl_basic_map_universe(dim
);
10904 for (i
= 0; i
< list
->n
; ++i
) {
10906 isl_basic_map
*bmap_i
;
10908 aff
= isl_aff_copy(list
->p
[i
]);
10909 bmap_i
= isl_basic_map_from_aff(aff
);
10911 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10914 isl_aff_list_free(list
);
10918 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10919 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10921 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10924 /* Construct a basic map where the given dimensions are equal to each other.
10926 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10927 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10929 isl_basic_map
*bmap
= NULL
;
10935 if (pos1
>= isl_space_dim(space
, type1
))
10936 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10937 "index out of bounds", goto error
);
10938 if (pos2
>= isl_space_dim(space
, type2
))
10939 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10940 "index out of bounds", goto error
);
10942 if (type1
== type2
&& pos1
== pos2
)
10943 return isl_basic_map_universe(space
);
10945 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10946 i
= isl_basic_map_alloc_equality(bmap
);
10949 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10950 pos1
+= isl_basic_map_offset(bmap
, type1
);
10951 pos2
+= isl_basic_map_offset(bmap
, type2
);
10952 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10953 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10954 bmap
= isl_basic_map_finalize(bmap
);
10955 isl_space_free(space
);
10958 isl_space_free(space
);
10959 isl_basic_map_free(bmap
);
10963 /* Add a constraint imposing that the given two dimensions are equal.
10965 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10966 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10970 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10972 bmap
= isl_basic_map_intersect(bmap
, eq
);
10977 /* Add a constraint imposing that the given two dimensions are equal.
10979 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10980 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10982 isl_basic_map
*bmap
;
10984 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10986 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10991 /* Add a constraint imposing that the given two dimensions have opposite values.
10993 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10994 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10996 isl_basic_map
*bmap
= NULL
;
11002 if (pos1
>= isl_map_dim(map
, type1
))
11003 isl_die(map
->ctx
, isl_error_invalid
,
11004 "index out of bounds", goto error
);
11005 if (pos2
>= isl_map_dim(map
, type2
))
11006 isl_die(map
->ctx
, isl_error_invalid
,
11007 "index out of bounds", goto error
);
11009 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11010 i
= isl_basic_map_alloc_equality(bmap
);
11013 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11014 pos1
+= isl_basic_map_offset(bmap
, type1
);
11015 pos2
+= isl_basic_map_offset(bmap
, type2
);
11016 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11017 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11018 bmap
= isl_basic_map_finalize(bmap
);
11020 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11024 isl_basic_map_free(bmap
);
11029 /* Add a constraint imposing that the value of the first dimension is
11030 * greater than or equal to that of the second.
11032 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
11033 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11036 isl_local_space
*ls
;
11041 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
11042 isl_die(bmap
->ctx
, isl_error_invalid
,
11043 "index out of bounds", return isl_basic_map_free(bmap
));
11044 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
11045 isl_die(bmap
->ctx
, isl_error_invalid
,
11046 "index out of bounds", return isl_basic_map_free(bmap
));
11048 if (type1
== type2
&& pos1
== pos2
)
11051 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
11052 c
= isl_inequality_alloc(ls
);
11053 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11054 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11055 bmap
= isl_basic_map_add_constraint(bmap
, c
);
11060 /* Add a constraint imposing that the value of the first dimension is
11061 * greater than that of the second.
11063 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
11064 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11066 isl_basic_map
*bmap
= NULL
;
11072 if (pos1
>= isl_map_dim(map
, type1
))
11073 isl_die(map
->ctx
, isl_error_invalid
,
11074 "index out of bounds", goto error
);
11075 if (pos2
>= isl_map_dim(map
, type2
))
11076 isl_die(map
->ctx
, isl_error_invalid
,
11077 "index out of bounds", goto error
);
11079 if (type1
== type2
&& pos1
== pos2
) {
11080 isl_space
*space
= isl_map_get_space(map
);
11082 return isl_map_empty(space
);
11085 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
11086 i
= isl_basic_map_alloc_inequality(bmap
);
11089 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11090 pos1
+= isl_basic_map_offset(bmap
, type1
);
11091 pos2
+= isl_basic_map_offset(bmap
, type2
);
11092 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
11093 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
11094 isl_int_set_si(bmap
->ineq
[i
][0], -1);
11095 bmap
= isl_basic_map_finalize(bmap
);
11097 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11101 isl_basic_map_free(bmap
);
11106 /* Add a constraint imposing that the value of the first dimension is
11107 * smaller than that of the second.
11109 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
11110 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11112 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
11115 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
11119 isl_local_space
*ls
;
11124 if (!isl_basic_map_divs_known(bmap
))
11125 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11126 "some divs are unknown", return NULL
);
11128 ls
= isl_basic_map_get_local_space(bmap
);
11129 div
= isl_local_space_get_div(ls
, pos
);
11130 isl_local_space_free(ls
);
11135 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
11138 return isl_basic_map_get_div(bset
, pos
);
11141 /* Plug in "subs" for dimension "type", "pos" of "bset".
11143 * Let i be the dimension to replace and let "subs" be of the form
11147 * Any integer division with a non-zero coefficient for i,
11149 * floor((a i + g)/m)
11153 * floor((a f + d g)/(m d))
11155 * Constraints of the form
11163 * We currently require that "subs" is an integral expression.
11164 * Handling rational expressions may require us to add stride constraints
11165 * as we do in isl_basic_set_preimage_multi_aff.
11167 __isl_give isl_basic_set
*isl_basic_set_substitute(
11168 __isl_take isl_basic_set
*bset
,
11169 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11175 if (bset
&& isl_basic_set_plain_is_empty(bset
))
11178 bset
= isl_basic_set_cow(bset
);
11179 if (!bset
|| !subs
)
11182 ctx
= isl_basic_set_get_ctx(bset
);
11183 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
11184 isl_die(ctx
, isl_error_invalid
,
11185 "spaces don't match", goto error
);
11186 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
11187 isl_die(ctx
, isl_error_unsupported
,
11188 "cannot handle divs yet", goto error
);
11189 if (!isl_int_is_one(subs
->v
->el
[0]))
11190 isl_die(ctx
, isl_error_invalid
,
11191 "can only substitute integer expressions", goto error
);
11193 pos
+= isl_basic_set_offset(bset
, type
);
11197 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11198 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
11200 isl_int_set(v
, bset
->eq
[i
][pos
]);
11201 isl_int_set_si(bset
->eq
[i
][pos
], 0);
11202 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
11203 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11206 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11207 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
11209 isl_int_set(v
, bset
->ineq
[i
][pos
]);
11210 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
11211 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
11212 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11215 for (i
= 0; i
< bset
->n_div
; ++i
) {
11216 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
11218 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
11219 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
11220 isl_seq_combine(bset
->div
[i
] + 1,
11221 subs
->v
->el
[0], bset
->div
[i
] + 1,
11222 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11223 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
11228 bset
= isl_basic_set_simplify(bset
);
11229 return isl_basic_set_finalize(bset
);
11231 isl_basic_set_free(bset
);
11235 /* Plug in "subs" for dimension "type", "pos" of "set".
11237 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
11238 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11242 if (set
&& isl_set_plain_is_empty(set
))
11245 set
= isl_set_cow(set
);
11249 for (i
= set
->n
- 1; i
>= 0; --i
) {
11250 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
11251 if (remove_if_empty(set
, i
) < 0)
11261 /* Check if the range of "ma" is compatible with the domain or range
11262 * (depending on "type") of "bmap".
11263 * Return -1 if anything is wrong.
11265 static int check_basic_map_compatible_range_multi_aff(
11266 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
11267 __isl_keep isl_multi_aff
*ma
)
11270 isl_space
*ma_space
;
11272 ma_space
= isl_multi_aff_get_space(ma
);
11273 m
= isl_space_tuple_match(bmap
->dim
, type
, ma_space
, isl_dim_out
);
11274 isl_space_free(ma_space
);
11276 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11277 "spaces don't match", return -1);
11281 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
11282 * coefficients before the transformed range of dimensions,
11283 * the "n_after" coefficients after the transformed range of dimensions
11284 * and the coefficients of the other divs in "bmap".
11286 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
11287 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
11292 isl_local_space
*ls
;
11297 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11301 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
11302 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
11303 for (i
= 0; i
< n_div
; ++i
) {
11304 int o_bmap
= 0, o_ls
= 0;
11306 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
11307 o_bmap
+= 1 + 1 + n_param
;
11308 o_ls
+= 1 + 1 + n_param
;
11309 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
11310 o_bmap
+= n_before
;
11311 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11312 ls
->div
->row
[i
] + o_ls
, n_set
);
11315 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
11317 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11318 ls
->div
->row
[i
] + o_ls
, n_div
);
11321 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
11322 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
11326 isl_local_space_free(ls
);
11329 isl_local_space_free(ls
);
11333 /* How many stride constraints does "ma" enforce?
11334 * That is, how many of the affine expressions have a denominator
11335 * different from one?
11337 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11342 for (i
= 0; i
< ma
->n
; ++i
)
11343 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11349 /* For each affine expression in ma of the form
11351 * x_i = (f_i y + h_i)/m_i
11353 * with m_i different from one, add a constraint to "bmap"
11356 * f_i y + h_i = m_i alpha_i
11358 * with alpha_i an additional existentially quantified variable.
11360 static __isl_give isl_basic_map
*add_ma_strides(
11361 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
11362 int n_before
, int n_after
)
11371 total
= isl_basic_map_total_dim(bmap
);
11372 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
11373 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
11374 n_div
= isl_multi_aff_dim(ma
, isl_dim_div
);
11375 for (i
= 0; i
< ma
->n
; ++i
) {
11376 int o_bmap
= 0, o_ma
= 1;
11378 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11380 div
= isl_basic_map_alloc_div(bmap
);
11381 k
= isl_basic_map_alloc_equality(bmap
);
11382 if (div
< 0 || k
< 0)
11384 isl_int_set_si(bmap
->div
[div
][0], 0);
11385 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11386 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
11387 o_bmap
+= 1 + n_param
;
11388 o_ma
+= 1 + n_param
;
11389 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
11390 o_bmap
+= n_before
;
11391 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11392 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
11395 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
11397 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11398 ma
->p
[i
]->v
->el
+ o_ma
, n_div
);
11401 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
11402 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11408 isl_basic_map_free(bmap
);
11412 /* Replace the domain or range space (depending on "type) of "space" by "set".
11414 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
11415 enum isl_dim_type type
, __isl_take isl_space
*set
)
11417 if (type
== isl_dim_in
) {
11418 space
= isl_space_range(space
);
11419 space
= isl_space_map_from_domain_and_range(set
, space
);
11421 space
= isl_space_domain(space
);
11422 space
= isl_space_map_from_domain_and_range(space
, set
);
11428 /* Compute the preimage of the domain or range (depending on "type")
11429 * of "bmap" under the function represented by "ma".
11430 * In other words, plug in "ma" in the domain or range of "bmap".
11431 * The result is a basic map that lives in the same space as "bmap"
11432 * except that the domain or range has been replaced by
11433 * the domain space of "ma".
11435 * If bmap is represented by
11437 * A(p) + S u + B x + T v + C(divs) >= 0,
11439 * where u and x are input and output dimensions if type == isl_dim_out
11440 * while x and v are input and output dimensions if type == isl_dim_in,
11441 * and ma is represented by
11443 * x = D(p) + F(y) + G(divs')
11445 * then the result is
11447 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
11449 * The divs in the input set are similarly adjusted.
11452 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
11456 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
11457 * B_i G(divs') + c_i(divs))/n_i)
11459 * If bmap is not a rational map and if F(y) involves any denominators
11461 * x_i = (f_i y + h_i)/m_i
11463 * then additional constraints are added to ensure that we only
11464 * map back integer points. That is we enforce
11466 * f_i y + h_i = m_i alpha_i
11468 * with alpha_i an additional existentially quantified variable.
11470 * We first copy over the divs from "ma".
11471 * Then we add the modified constraints and divs from "bmap".
11472 * Finally, we add the stride constraints, if needed.
11474 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
11475 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
11476 __isl_take isl_multi_aff
*ma
)
11480 isl_basic_map
*res
= NULL
;
11481 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
11482 isl_int f
, c1
, c2
, g
;
11483 int rational
, strides
;
11490 ma
= isl_multi_aff_align_divs(ma
);
11493 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
11496 if (type
== isl_dim_in
) {
11498 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
11500 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
11503 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
11504 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11506 space
= isl_multi_aff_get_domain_space(ma
);
11507 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
11508 rational
= isl_basic_map_is_rational(bmap
);
11509 strides
= rational
? 0 : multi_aff_strides(ma
);
11510 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
11511 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
11513 res
= isl_basic_map_set_rational(res
);
11515 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
11516 if (isl_basic_map_alloc_div(res
) < 0)
11519 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
11522 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
11523 k
= isl_basic_map_alloc_equality(res
);
11526 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
11527 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11530 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11531 k
= isl_basic_map_alloc_inequality(res
);
11534 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
11535 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11538 for (i
= 0; i
< bmap
->n_div
; ++i
) {
11539 if (isl_int_is_zero(bmap
->div
[i
][0])) {
11540 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11543 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
11544 n_before
, n_after
, n_div_ma
, n_div_bmap
,
11549 res
= add_ma_strides(res
, ma
, n_before
, n_after
);
11555 isl_basic_map_free(bmap
);
11556 isl_multi_aff_free(ma
);
11557 res
= isl_basic_set_simplify(res
);
11558 return isl_basic_map_finalize(res
);
11564 isl_basic_map_free(bmap
);
11565 isl_multi_aff_free(ma
);
11566 isl_basic_map_free(res
);
11570 /* Compute the preimage of "bset" under the function represented by "ma".
11571 * In other words, plug in "ma" in "bset". The result is a basic set
11572 * that lives in the domain space of "ma".
11574 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11575 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11577 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
11580 /* Check if the range of "ma" is compatible with the domain or range
11581 * (depending on "type") of "map".
11582 * Return -1 if anything is wrong.
11584 static int check_map_compatible_range_multi_aff(
11585 __isl_keep isl_map
*map
, enum isl_dim_type type
,
11586 __isl_keep isl_multi_aff
*ma
)
11589 isl_space
*ma_space
;
11591 ma_space
= isl_multi_aff_get_space(ma
);
11592 m
= isl_space_tuple_match(map
->dim
, type
, ma_space
, isl_dim_out
);
11593 isl_space_free(ma_space
);
11595 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11596 "spaces don't match", return -1);
11600 /* Compute the preimage of the domain or range (depending on "type")
11601 * of "map" under the function represented by "ma".
11602 * In other words, plug in "ma" in the domain or range of "map".
11603 * The result is a map that lives in the same space as "map"
11604 * except that the domain or range has been replaced by
11605 * the domain space of "ma".
11607 * The parameters are assumed to have been aligned.
11609 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
11610 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11615 map
= isl_map_cow(map
);
11616 ma
= isl_multi_aff_align_divs(ma
);
11619 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
11622 for (i
= 0; i
< map
->n
; ++i
) {
11623 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
11624 isl_multi_aff_copy(ma
));
11629 space
= isl_multi_aff_get_domain_space(ma
);
11630 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
11632 isl_space_free(map
->dim
);
11637 isl_multi_aff_free(ma
);
11639 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
11640 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
11643 isl_multi_aff_free(ma
);
11648 /* Compute the preimage of the domain or range (depending on "type")
11649 * of "map" under the function represented by "ma".
11650 * In other words, plug in "ma" in the domain or range of "map".
11651 * The result is a map that lives in the same space as "map"
11652 * except that the domain or range has been replaced by
11653 * the domain space of "ma".
11655 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
11656 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11661 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11662 return map_preimage_multi_aff(map
, type
, ma
);
11664 if (!isl_space_has_named_params(map
->dim
) ||
11665 !isl_space_has_named_params(ma
->space
))
11666 isl_die(map
->ctx
, isl_error_invalid
,
11667 "unaligned unnamed parameters", goto error
);
11668 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
11669 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
11671 return map_preimage_multi_aff(map
, type
, ma
);
11673 isl_multi_aff_free(ma
);
11674 return isl_map_free(map
);
11677 /* Compute the preimage of "set" under the function represented by "ma".
11678 * In other words, plug in "ma" "set". The result is a set
11679 * that lives in the domain space of "ma".
11681 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11682 __isl_take isl_multi_aff
*ma
)
11684 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
11687 /* Compute the preimage of the domain of "map" under the function
11688 * represented by "ma".
11689 * In other words, plug in "ma" in the domain of "map".
11690 * The result is a map that lives in the same space as "map"
11691 * except that the domain has been replaced by the domain space of "ma".
11693 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
11694 __isl_take isl_multi_aff
*ma
)
11696 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
11699 /* Compute the preimage of "set" under the function represented by "pma".
11700 * In other words, plug in "pma" in "set. The result is a set
11701 * that lives in the domain space of "pma".
11703 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11704 __isl_take isl_pw_multi_aff
*pma
)
11713 isl_pw_multi_aff_free(pma
);
11714 res
= isl_set_empty(isl_set_get_space(set
));
11719 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11720 isl_multi_aff_copy(pma
->p
[0].maff
));
11721 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11723 for (i
= 1; i
< pma
->n
; ++i
) {
11726 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11727 isl_multi_aff_copy(pma
->p
[i
].maff
));
11728 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11729 res
= isl_set_union(res
, res_i
);
11732 isl_pw_multi_aff_free(pma
);
11736 isl_pw_multi_aff_free(pma
);
11741 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11742 __isl_take isl_pw_multi_aff
*pma
)
11747 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11748 return set_preimage_pw_multi_aff(set
, pma
);
11750 if (!isl_space_has_named_params(set
->dim
) ||
11751 !isl_space_has_named_params(pma
->dim
))
11752 isl_die(set
->ctx
, isl_error_invalid
,
11753 "unaligned unnamed parameters", goto error
);
11754 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11755 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11757 return set_preimage_pw_multi_aff(set
, pma
);
11759 isl_pw_multi_aff_free(pma
);
11760 return isl_set_free(set
);