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>
37 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
40 case isl_dim_param
: return dim
->nparam
;
41 case isl_dim_in
: return dim
->n_in
;
42 case isl_dim_out
: return dim
->n_out
;
43 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
48 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
51 case isl_dim_param
: return 1;
52 case isl_dim_in
: return 1 + dim
->nparam
;
53 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
58 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
59 enum isl_dim_type type
)
64 case isl_dim_cst
: return 1;
67 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
68 case isl_dim_div
: return bmap
->n_div
;
69 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
74 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
76 return map
? n(map
->dim
, type
) : 0;
79 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
81 return set
? n(set
->dim
, type
) : 0;
84 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
85 enum isl_dim_type type
)
87 isl_space
*dim
= bmap
->dim
;
89 case isl_dim_cst
: return 0;
90 case isl_dim_param
: return 1;
91 case isl_dim_in
: return 1 + dim
->nparam
;
92 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
93 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
98 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
99 enum isl_dim_type type
)
101 return isl_basic_map_offset(bset
, type
);
104 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
106 return pos(map
->dim
, type
);
109 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
110 enum isl_dim_type type
)
112 return isl_basic_map_dim(bset
, type
);
115 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
117 return isl_basic_set_dim(bset
, isl_dim_set
);
120 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
122 return isl_basic_set_dim(bset
, isl_dim_param
);
125 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
129 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
132 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
134 return isl_set_dim(set
, isl_dim_set
);
137 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
139 return isl_set_dim(set
, isl_dim_param
);
142 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
144 return bmap
? bmap
->dim
->n_in
: 0;
147 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
149 return bmap
? bmap
->dim
->n_out
: 0;
152 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
154 return bmap
? bmap
->dim
->nparam
: 0;
157 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
159 return bmap
? bmap
->n_div
: 0;
162 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
164 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
167 unsigned isl_map_n_in(const struct isl_map
*map
)
169 return map
? map
->dim
->n_in
: 0;
172 unsigned isl_map_n_out(const struct isl_map
*map
)
174 return map
? map
->dim
->n_out
: 0;
177 unsigned isl_map_n_param(const struct isl_map
*map
)
179 return map
? map
->dim
->nparam
: 0;
182 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
187 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
190 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
193 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
194 struct isl_basic_set
*bset
)
199 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
202 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
205 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
210 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
213 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
216 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
217 struct isl_basic_set
*bset
)
222 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
225 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
228 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
230 return bmap
? bmap
->ctx
: NULL
;
233 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
235 return bset
? bset
->ctx
: NULL
;
238 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
240 return map
? map
->ctx
: NULL
;
243 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
245 return set
? set
->ctx
: NULL
;
248 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
252 return isl_space_copy(bmap
->dim
);
255 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
259 return isl_space_copy(bset
->dim
);
262 /* Extract the divs in "bmap" as a matrix.
264 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
275 ctx
= isl_basic_map_get_ctx(bmap
);
276 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
277 cols
= 1 + 1 + total
+ bmap
->n_div
;
278 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
282 for (i
= 0; i
< bmap
->n_div
; ++i
)
283 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
288 __isl_give isl_local_space
*isl_basic_map_get_local_space(
289 __isl_keep isl_basic_map
*bmap
)
296 div
= isl_basic_map_get_divs(bmap
);
297 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
300 __isl_give isl_local_space
*isl_basic_set_get_local_space(
301 __isl_keep isl_basic_set
*bset
)
303 return isl_basic_map_get_local_space(bset
);
306 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
307 __isl_take isl_local_space
*ls
)
316 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
317 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
318 n_div
, 0, 2 * n_div
);
320 for (i
= 0; i
< n_div
; ++i
)
321 if (isl_basic_map_alloc_div(bmap
) < 0)
324 for (i
= 0; i
< n_div
; ++i
) {
325 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
326 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
330 isl_local_space_free(ls
);
333 isl_local_space_free(ls
);
334 isl_basic_map_free(bmap
);
338 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
339 __isl_take isl_local_space
*ls
)
341 return isl_basic_map_from_local_space(ls
);
344 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
348 return isl_space_copy(map
->dim
);
351 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
355 return isl_space_copy(set
->dim
);
358 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
359 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
361 bmap
= isl_basic_map_cow(bmap
);
364 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
367 bmap
= isl_basic_map_finalize(bmap
);
370 isl_basic_map_free(bmap
);
374 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
375 __isl_take isl_basic_set
*bset
, const char *s
)
377 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
380 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
381 enum isl_dim_type type
)
383 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
386 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
387 enum isl_dim_type type
, const char *s
)
391 map
= isl_map_cow(map
);
395 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
399 for (i
= 0; i
< map
->n
; ++i
) {
400 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
411 /* Does the input or output tuple have a name?
413 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
415 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
418 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
419 enum isl_dim_type type
)
421 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
424 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
427 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
430 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
431 enum isl_dim_type type
, __isl_take isl_id
*id
)
433 map
= isl_map_cow(map
);
435 return isl_id_free(id
);
437 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
439 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
442 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
443 __isl_take isl_id
*id
)
445 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
448 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
449 enum isl_dim_type type
)
451 map
= isl_map_cow(map
);
455 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
457 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
460 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
462 return isl_map_reset_tuple_id(set
, isl_dim_set
);
465 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
467 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
470 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
471 enum isl_dim_type type
)
473 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
476 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
478 return isl_map_has_tuple_id(set
, isl_dim_set
);
481 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
483 return isl_map_get_tuple_id(set
, isl_dim_set
);
486 /* Does the set tuple have a name?
488 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
490 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
494 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
496 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
499 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
501 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
504 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
505 enum isl_dim_type type
, unsigned pos
)
507 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
510 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
511 enum isl_dim_type type
, unsigned pos
)
513 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
516 /* Does the given dimension have a name?
518 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
519 enum isl_dim_type type
, unsigned pos
)
521 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
524 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
525 enum isl_dim_type type
, unsigned pos
)
527 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
530 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
531 enum isl_dim_type type
, unsigned pos
)
533 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
536 /* Does the given dimension have a name?
538 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
539 enum isl_dim_type type
, unsigned pos
)
541 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
544 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
545 __isl_take isl_basic_map
*bmap
,
546 enum isl_dim_type type
, unsigned pos
, const char *s
)
548 bmap
= isl_basic_map_cow(bmap
);
551 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
554 return isl_basic_map_finalize(bmap
);
556 isl_basic_map_free(bmap
);
560 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
561 enum isl_dim_type type
, unsigned pos
, const char *s
)
565 map
= isl_map_cow(map
);
569 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
573 for (i
= 0; i
< map
->n
; ++i
) {
574 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
585 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
586 __isl_take isl_basic_set
*bset
,
587 enum isl_dim_type type
, unsigned pos
, const char *s
)
589 return (isl_basic_set
*)isl_basic_map_set_dim_name(
590 (isl_basic_map
*)bset
, type
, pos
, s
);
593 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
594 enum isl_dim_type type
, unsigned pos
, const char *s
)
596 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
599 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
600 enum isl_dim_type type
, unsigned pos
)
602 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
605 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
606 enum isl_dim_type type
, unsigned pos
)
608 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
611 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
612 enum isl_dim_type type
, unsigned pos
)
614 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
617 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
618 enum isl_dim_type type
, unsigned pos
)
620 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
623 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
624 enum isl_dim_type type
, unsigned pos
)
626 return isl_map_has_dim_id(set
, type
, pos
);
629 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
630 enum isl_dim_type type
, unsigned pos
)
632 return isl_map_get_dim_id(set
, type
, pos
);
635 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
636 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
638 map
= isl_map_cow(map
);
640 return isl_id_free(id
);
642 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
644 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
647 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
648 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
650 return isl_map_set_dim_id(set
, type
, pos
, id
);
653 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
654 __isl_keep isl_id
*id
)
658 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
661 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
662 __isl_keep isl_id
*id
)
664 return isl_map_find_dim_by_id(set
, type
, id
);
667 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
672 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
675 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
678 return isl_map_find_dim_by_name(set
, type
, name
);
681 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
685 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
688 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
690 return isl_basic_map_is_rational(bset
);
693 /* Does "bmap" contain any rational points?
695 * If "bmap" has an equality for each dimension, equating the dimension
696 * to an integer constant, then it has no rational points, even if it
697 * is marked as rational.
699 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
701 int has_rational
= 1;
706 if (isl_basic_map_plain_is_empty(bmap
))
708 if (!isl_basic_map_is_rational(bmap
))
710 bmap
= isl_basic_map_copy(bmap
);
711 bmap
= isl_basic_map_implicit_equalities(bmap
);
714 total
= isl_basic_map_total_dim(bmap
);
715 if (bmap
->n_eq
== total
) {
717 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
718 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
721 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
722 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
724 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
732 isl_basic_map_free(bmap
);
737 /* Does "map" contain any rational points?
739 int isl_map_has_rational(__isl_keep isl_map
*map
)
746 for (i
= 0; i
< map
->n
; ++i
) {
747 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
748 if (has_rational
< 0)
756 /* Does "set" contain any rational points?
758 int isl_set_has_rational(__isl_keep isl_set
*set
)
760 return isl_map_has_rational(set
);
763 /* Is this basic set a parameter domain?
765 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
769 return isl_space_is_params(bset
->dim
);
772 /* Is this set a parameter domain?
774 int isl_set_is_params(__isl_keep isl_set
*set
)
778 return isl_space_is_params(set
->dim
);
781 /* Is this map actually a parameter domain?
782 * Users should never call this function. Outside of isl,
783 * a map can never be a parameter domain.
785 int isl_map_is_params(__isl_keep isl_map
*map
)
789 return isl_space_is_params(map
->dim
);
792 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
793 struct isl_basic_map
*bmap
, unsigned extra
,
794 unsigned n_eq
, unsigned n_ineq
)
797 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
802 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
803 if (isl_blk_is_error(bmap
->block
))
806 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
811 bmap
->block2
= isl_blk_empty();
814 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
815 if (isl_blk_is_error(bmap
->block2
))
818 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
823 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
824 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
826 for (i
= 0; i
< extra
; ++i
)
827 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
831 bmap
->c_size
= n_eq
+ n_ineq
;
832 bmap
->eq
= bmap
->ineq
+ n_ineq
;
841 isl_basic_map_free(bmap
);
845 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
846 unsigned nparam
, unsigned dim
, unsigned extra
,
847 unsigned n_eq
, unsigned n_ineq
)
849 struct isl_basic_map
*bmap
;
852 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
856 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
857 return (struct isl_basic_set
*)bmap
;
860 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
861 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
863 struct isl_basic_map
*bmap
;
866 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
867 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
868 return (struct isl_basic_set
*)bmap
;
874 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
875 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
877 struct isl_basic_map
*bmap
;
881 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
886 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
892 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
893 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
894 unsigned n_eq
, unsigned n_ineq
)
896 struct isl_basic_map
*bmap
;
899 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
903 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
907 static void dup_constraints(
908 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
911 unsigned total
= isl_basic_map_total_dim(src
);
913 for (i
= 0; i
< src
->n_eq
; ++i
) {
914 int j
= isl_basic_map_alloc_equality(dst
);
915 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
918 for (i
= 0; i
< src
->n_ineq
; ++i
) {
919 int j
= isl_basic_map_alloc_inequality(dst
);
920 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
923 for (i
= 0; i
< src
->n_div
; ++i
) {
924 int j
= isl_basic_map_alloc_div(dst
);
925 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
927 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
930 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
932 struct isl_basic_map
*dup
;
936 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
937 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
940 dup_constraints(dup
, bmap
);
941 dup
->flags
= bmap
->flags
;
942 dup
->sample
= isl_vec_copy(bmap
->sample
);
946 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
948 struct isl_basic_map
*dup
;
950 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
951 return (struct isl_basic_set
*)dup
;
954 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
959 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
963 return isl_basic_set_dup(bset
);
966 struct isl_set
*isl_set_copy(struct isl_set
*set
)
975 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
980 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
984 bmap
= isl_basic_map_dup(bmap
);
986 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
990 struct isl_map
*isl_map_copy(struct isl_map
*map
)
999 void *isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1004 if (--bmap
->ref
> 0)
1007 isl_ctx_deref(bmap
->ctx
);
1009 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1011 isl_blk_free(bmap
->ctx
, bmap
->block
);
1012 isl_vec_free(bmap
->sample
);
1013 isl_space_free(bmap
->dim
);
1019 void *isl_basic_set_free(struct isl_basic_set
*bset
)
1021 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1024 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1026 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1029 __isl_give isl_map
*isl_map_align_params_map_map_and(
1030 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1031 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1032 __isl_take isl_map
*map2
))
1036 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1037 return fn(map1
, map2
);
1038 if (!isl_space_has_named_params(map1
->dim
) ||
1039 !isl_space_has_named_params(map2
->dim
))
1040 isl_die(map1
->ctx
, isl_error_invalid
,
1041 "unaligned unnamed parameters", goto error
);
1042 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1043 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1044 return fn(map1
, map2
);
1051 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1052 __isl_keep isl_map
*map2
,
1053 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1059 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1060 return fn(map1
, map2
);
1061 if (!isl_space_has_named_params(map1
->dim
) ||
1062 !isl_space_has_named_params(map2
->dim
))
1063 isl_die(map1
->ctx
, isl_error_invalid
,
1064 "unaligned unnamed parameters", return -1);
1065 map1
= isl_map_copy(map1
);
1066 map2
= isl_map_copy(map2
);
1067 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1068 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1075 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1077 struct isl_ctx
*ctx
;
1081 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1082 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1084 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1085 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1086 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1087 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1088 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1089 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1091 int j
= isl_basic_map_alloc_inequality(bmap
);
1095 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1096 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1103 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1104 bmap
->extra
- bmap
->n_div
);
1105 return bmap
->n_eq
++;
1108 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1110 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1113 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1117 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1122 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1124 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1127 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1132 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1134 if (pos
!= bmap
->n_eq
- 1) {
1136 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1137 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1143 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1145 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1148 /* Turn inequality "pos" of "bmap" into an equality.
1150 * In particular, we move the inequality in front of the equalities
1151 * and move the last inequality in the position of the moved inequality.
1152 * Note that isl_tab_make_equalities_explicit depends on this particular
1153 * change in the ordering of the constraints.
1155 void isl_basic_map_inequality_to_equality(
1156 struct isl_basic_map
*bmap
, unsigned pos
)
1160 t
= bmap
->ineq
[pos
];
1161 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1162 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1167 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1168 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1169 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1170 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1173 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1175 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1178 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1180 struct isl_ctx
*ctx
;
1184 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1185 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1186 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1187 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1188 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1189 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1190 1 + isl_basic_map_total_dim(bmap
),
1191 bmap
->extra
- bmap
->n_div
);
1192 return bmap
->n_ineq
++;
1195 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1197 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1200 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1204 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1209 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1211 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1214 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1219 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1221 if (pos
!= bmap
->n_ineq
- 1) {
1222 t
= bmap
->ineq
[pos
];
1223 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1224 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1225 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1231 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1233 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1236 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1241 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1244 k
= isl_basic_map_alloc_equality(bmap
);
1247 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1250 isl_basic_map_free(bmap
);
1254 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1257 return (isl_basic_set
*)
1258 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1261 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1266 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1269 k
= isl_basic_map_alloc_inequality(bmap
);
1272 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1275 isl_basic_map_free(bmap
);
1279 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1282 return (isl_basic_set
*)
1283 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1286 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1290 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1291 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1292 1 + 1 + isl_basic_map_total_dim(bmap
),
1293 bmap
->extra
- bmap
->n_div
);
1294 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1295 return bmap
->n_div
++;
1298 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1300 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1303 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1307 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1312 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1314 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1317 /* Copy constraint from src to dst, putting the vars of src at offset
1318 * dim_off in dst and the divs of src at offset div_off in dst.
1319 * If both sets are actually map, then dim_off applies to the input
1322 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1323 struct isl_basic_map
*src_map
, isl_int
*src
,
1324 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1326 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1327 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1328 unsigned src_in
= isl_basic_map_n_in(src_map
);
1329 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1330 unsigned src_out
= isl_basic_map_n_out(src_map
);
1331 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1332 isl_int_set(dst
[0], src
[0]);
1333 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1334 if (dst_nparam
> src_nparam
)
1335 isl_seq_clr(dst
+1+src_nparam
,
1336 dst_nparam
- src_nparam
);
1337 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1338 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1340 isl_min(dst_in
-in_off
, src_in
));
1341 if (dst_in
-in_off
> src_in
)
1342 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1343 dst_in
- in_off
- src_in
);
1344 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1345 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1346 src
+1+src_nparam
+src_in
,
1347 isl_min(dst_out
-out_off
, src_out
));
1348 if (dst_out
-out_off
> src_out
)
1349 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1350 dst_out
- out_off
- src_out
);
1351 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1352 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1353 src
+1+src_nparam
+src_in
+src_out
,
1354 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1355 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1356 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1357 div_off
+src_map
->n_div
,
1358 dst_map
->n_div
- div_off
- src_map
->n_div
);
1361 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1362 struct isl_basic_map
*src_map
, isl_int
*src
,
1363 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1365 isl_int_set(dst
[0], src
[0]);
1366 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1369 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1370 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1375 if (!bmap1
|| !bmap2
)
1378 div_off
= bmap1
->n_div
;
1380 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1381 int i1
= isl_basic_map_alloc_equality(bmap1
);
1384 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1385 i_pos
, o_pos
, div_off
);
1388 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1389 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1392 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1393 i_pos
, o_pos
, div_off
);
1396 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1397 int i1
= isl_basic_map_alloc_div(bmap1
);
1400 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1401 i_pos
, o_pos
, div_off
);
1404 isl_basic_map_free(bmap2
);
1409 isl_basic_map_free(bmap1
);
1410 isl_basic_map_free(bmap2
);
1414 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1415 struct isl_basic_set
*bset2
, unsigned pos
)
1417 return (struct isl_basic_set
*)
1418 add_constraints((struct isl_basic_map
*)bset1
,
1419 (struct isl_basic_map
*)bset2
, 0, pos
);
1422 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1423 __isl_take isl_space
*dim
, unsigned extra
,
1424 unsigned n_eq
, unsigned n_ineq
)
1426 struct isl_basic_map
*ext
;
1436 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1437 base
->extra
>= base
->n_div
+ extra
;
1439 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1440 room_for_ineq(base
, n_ineq
)) {
1441 isl_space_free(dim
);
1445 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1446 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1447 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1448 extra
+= base
->extra
;
1450 n_ineq
+= base
->n_ineq
;
1452 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1458 ext
->sample
= isl_vec_copy(base
->sample
);
1459 flags
= base
->flags
;
1460 ext
= add_constraints(ext
, base
, 0, 0);
1463 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1469 isl_space_free(dim
);
1470 isl_basic_map_free(base
);
1474 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1475 __isl_take isl_space
*dim
, unsigned extra
,
1476 unsigned n_eq
, unsigned n_ineq
)
1478 return (struct isl_basic_set
*)
1479 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1480 extra
, n_eq
, n_ineq
);
1483 struct isl_basic_map
*isl_basic_map_extend_constraints(
1484 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1488 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1492 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1493 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1494 unsigned n_eq
, unsigned n_ineq
)
1496 struct isl_basic_map
*bmap
;
1501 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1505 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1508 isl_basic_map_free(base
);
1512 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1513 unsigned nparam
, unsigned dim
, unsigned extra
,
1514 unsigned n_eq
, unsigned n_ineq
)
1516 return (struct isl_basic_set
*)
1517 isl_basic_map_extend((struct isl_basic_map
*)base
,
1518 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1521 struct isl_basic_set
*isl_basic_set_extend_constraints(
1522 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1524 return (struct isl_basic_set
*)
1525 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1529 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1531 return (struct isl_basic_set
*)
1532 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1535 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1540 if (bmap
->ref
> 1) {
1542 bmap
= isl_basic_map_dup(bmap
);
1545 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1549 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1557 return isl_set_dup(set
);
1560 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1568 return isl_map_dup(map
);
1571 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1572 unsigned a_len
, unsigned b_len
)
1574 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1575 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1576 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1579 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1580 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1588 isl_assert(bmap
->ctx
,
1589 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1591 if (n1
== 0 || n2
== 0)
1594 bmap
= isl_basic_map_cow(bmap
);
1598 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1599 if (isl_blk_is_error(blk
))
1602 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1604 bmap
->eq
[i
] + pos
, n1
, n2
);
1606 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1608 bmap
->ineq
[i
] + pos
, n1
, n2
);
1610 for (i
= 0; i
< bmap
->n_div
; ++i
)
1612 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1614 isl_blk_free(bmap
->ctx
, blk
);
1616 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1617 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1618 return isl_basic_map_finalize(bmap
);
1620 isl_basic_map_free(bmap
);
1624 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1625 __isl_take isl_basic_set
*bset
, unsigned n
)
1633 nparam
= isl_basic_set_n_param(bset
);
1634 dim
= isl_basic_set_n_dim(bset
);
1635 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1637 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1639 isl_basic_set_free(bset
);
1643 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1649 total
= isl_basic_map_total_dim(bmap
);
1650 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1651 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1653 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1655 i
= isl_basic_map_alloc_equality(bmap
);
1659 isl_int_set_si(bmap
->eq
[i
][0], 1);
1660 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1661 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1662 isl_vec_free(bmap
->sample
);
1663 bmap
->sample
= NULL
;
1664 return isl_basic_map_finalize(bmap
);
1666 isl_basic_map_free(bmap
);
1670 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1672 return (struct isl_basic_set
*)
1673 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1676 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1679 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1681 isl_int
*t
= bmap
->div
[a
];
1682 bmap
->div
[a
] = bmap
->div
[b
];
1686 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1687 * div definitions accordingly.
1689 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1692 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1694 swap_div(bmap
, a
, b
);
1696 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1697 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1699 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1700 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1702 for (i
= 0; i
< bmap
->n_div
; ++i
)
1703 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1704 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1707 /* Eliminate the specified n dimensions starting at first from the
1708 * constraints, without removing the dimensions from the space.
1709 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1711 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1712 enum isl_dim_type type
, unsigned first
, unsigned n
)
1721 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1722 isl_die(map
->ctx
, isl_error_invalid
,
1723 "index out of bounds", goto error
);
1725 map
= isl_map_cow(map
);
1729 for (i
= 0; i
< map
->n
; ++i
) {
1730 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1740 /* Eliminate the specified n dimensions starting at first from the
1741 * constraints, without removing the dimensions from the space.
1742 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1744 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1745 enum isl_dim_type type
, unsigned first
, unsigned n
)
1747 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1750 /* Eliminate the specified n dimensions starting at first from the
1751 * constraints, without removing the dimensions from the space.
1752 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1754 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1755 unsigned first
, unsigned n
)
1757 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1760 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1761 __isl_take isl_basic_map
*bmap
)
1765 bmap
= isl_basic_map_eliminate_vars(bmap
,
1766 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1770 return isl_basic_map_finalize(bmap
);
1773 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1774 __isl_take isl_basic_set
*bset
)
1776 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1777 (struct isl_basic_map
*)bset
);
1780 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1789 map
= isl_map_cow(map
);
1793 for (i
= 0; i
< map
->n
; ++i
) {
1794 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1804 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1806 return isl_map_remove_divs(set
);
1809 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1810 enum isl_dim_type type
, unsigned first
, unsigned n
)
1814 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1816 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1818 bmap
= isl_basic_map_eliminate_vars(bmap
,
1819 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1822 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1824 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1827 isl_basic_map_free(bmap
);
1831 /* Return true if the definition of the given div (recursively) involves
1832 * any of the given variables.
1834 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1835 unsigned first
, unsigned n
)
1838 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1840 if (isl_int_is_zero(bmap
->div
[div
][0]))
1842 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1845 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1846 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1848 if (div_involves_vars(bmap
, i
, first
, n
))
1855 /* Try and add a lower and/or upper bound on "div" to "bmap"
1856 * based on inequality "i".
1857 * "total" is the total number of variables (excluding the divs).
1858 * "v" is a temporary object that can be used during the calculations.
1859 * If "lb" is set, then a lower bound should be constructed.
1860 * If "ub" is set, then an upper bound should be constructed.
1862 * The calling function has already checked that the inequality does not
1863 * reference "div", but we still need to check that the inequality is
1864 * of the right form. We'll consider the case where we want to construct
1865 * a lower bound. The construction of upper bounds is similar.
1867 * Let "div" be of the form
1869 * q = floor((a + f(x))/d)
1871 * We essentially check if constraint "i" is of the form
1875 * so that we can use it to derive a lower bound on "div".
1876 * However, we allow a slightly more general form
1880 * with the condition that the coefficients of g(x) - f(x) are all
1882 * Rewriting this constraint as
1886 * adding a + f(x) to both sides and dividing by d, we obtain
1888 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1890 * Taking the floor on both sides, we obtain
1892 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1896 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1898 * In the case of an upper bound, we construct the constraint
1900 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1903 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1904 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1905 unsigned total
, isl_int v
, int lb
, int ub
)
1909 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1911 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1912 bmap
->div
[div
][1 + 1 + j
]);
1913 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1916 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1917 bmap
->div
[div
][1 + 1 + j
]);
1918 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1924 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1926 int k
= isl_basic_map_alloc_inequality(bmap
);
1929 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1930 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1931 bmap
->div
[div
][1 + j
]);
1932 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1933 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1935 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1938 int k
= isl_basic_map_alloc_inequality(bmap
);
1941 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1942 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1943 bmap
->div
[div
][1 + j
]);
1944 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1945 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1947 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1952 isl_basic_map_free(bmap
);
1956 /* This function is called right before "div" is eliminated from "bmap"
1957 * using Fourier-Motzkin.
1958 * Look through the constraints of "bmap" for constraints on the argument
1959 * of the integer division and use them to construct constraints on the
1960 * integer division itself. These constraints can then be combined
1961 * during the Fourier-Motzkin elimination.
1962 * Note that it is only useful to introduce lower bounds on "div"
1963 * if "bmap" already contains upper bounds on "div" as the newly
1964 * introduce lower bounds can then be combined with the pre-existing
1965 * upper bounds. Similarly for upper bounds.
1966 * We therefore first check if "bmap" contains any lower and/or upper bounds
1969 * It is interesting to note that the introduction of these constraints
1970 * can indeed lead to more accurate results, even when compared to
1971 * deriving constraints on the argument of "div" from constraints on "div".
1972 * Consider, for example, the set
1974 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1976 * The second constraint can be rewritten as
1978 * 2 * [(-i-2j+3)/4] + k >= 0
1980 * from which we can derive
1982 * -i - 2j + 3 >= -2k
1988 * Combined with the first constraint, we obtain
1990 * -3 <= 3 + 2k or k >= -3
1992 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1993 * the first constraint, we obtain
1995 * [(i + 2j)/4] >= [-3/4] = -1
1997 * Combining this constraint with the second constraint, we obtain
2001 static __isl_give isl_basic_map
*insert_bounds_on_div(
2002 __isl_take isl_basic_map
*bmap
, int div
)
2005 int check_lb
, check_ub
;
2012 if (isl_int_is_zero(bmap
->div
[div
][0]))
2015 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2019 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2020 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2027 if (!check_lb
&& !check_ub
)
2032 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2033 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2036 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2037 check_lb
, check_ub
);
2045 /* Remove all divs (recursively) involving any of the given dimensions
2046 * in their definitions.
2048 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2049 __isl_take isl_basic_map
*bmap
,
2050 enum isl_dim_type type
, unsigned first
, unsigned n
)
2056 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2058 first
+= isl_basic_map_offset(bmap
, type
);
2060 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2061 if (!div_involves_vars(bmap
, i
, first
, n
))
2063 bmap
= insert_bounds_on_div(bmap
, i
);
2064 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2072 isl_basic_map_free(bmap
);
2076 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2077 __isl_take isl_basic_set
*bset
,
2078 enum isl_dim_type type
, unsigned first
, unsigned n
)
2080 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2083 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2084 enum isl_dim_type type
, unsigned first
, unsigned n
)
2093 map
= isl_map_cow(map
);
2097 for (i
= 0; i
< map
->n
; ++i
) {
2098 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2109 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2110 enum isl_dim_type type
, unsigned first
, unsigned n
)
2112 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2116 /* Does the desciption of "bmap" depend on the specified dimensions?
2117 * We also check whether the dimensions appear in any of the div definitions.
2118 * In principle there is no need for this check. If the dimensions appear
2119 * in a div definition, they also appear in the defining constraints of that
2122 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2123 enum isl_dim_type type
, unsigned first
, unsigned n
)
2130 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2131 isl_die(bmap
->ctx
, isl_error_invalid
,
2132 "index out of bounds", return -1);
2134 first
+= isl_basic_map_offset(bmap
, type
);
2135 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2136 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2138 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2139 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2141 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2142 if (isl_int_is_zero(bmap
->div
[i
][0]))
2144 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2151 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2152 enum isl_dim_type type
, unsigned first
, unsigned n
)
2159 if (first
+ n
> isl_map_dim(map
, type
))
2160 isl_die(map
->ctx
, isl_error_invalid
,
2161 "index out of bounds", return -1);
2163 for (i
= 0; i
< map
->n
; ++i
) {
2164 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2166 if (involves
< 0 || involves
)
2173 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2174 enum isl_dim_type type
, unsigned first
, unsigned n
)
2176 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2179 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2180 enum isl_dim_type type
, unsigned first
, unsigned n
)
2182 return isl_map_involves_dims(set
, type
, first
, n
);
2185 /* Return true if the definition of the given div is unknown or depends
2188 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2191 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2193 if (isl_int_is_zero(bmap
->div
[div
][0]))
2196 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2197 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2199 if (div_is_unknown(bmap
, i
))
2206 /* Remove all divs that are unknown or defined in terms of unknown divs.
2208 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2209 __isl_take isl_basic_map
*bmap
)
2216 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2217 if (!div_is_unknown(bmap
, i
))
2219 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2228 /* Remove all divs that are unknown or defined in terms of unknown divs.
2230 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2231 __isl_take isl_basic_set
*bset
)
2233 return isl_basic_map_remove_unknown_divs(bset
);
2236 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2245 map
= isl_map_cow(map
);
2249 for (i
= 0; i
< map
->n
; ++i
) {
2250 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2260 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2262 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2265 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2266 __isl_take isl_basic_set
*bset
,
2267 enum isl_dim_type type
, unsigned first
, unsigned n
)
2269 return (isl_basic_set
*)
2270 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2273 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2274 enum isl_dim_type type
, unsigned first
, unsigned n
)
2281 map
= isl_map_cow(map
);
2284 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2286 for (i
= 0; i
< map
->n
; ++i
) {
2287 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2288 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2292 map
= isl_map_drop(map
, type
, first
, n
);
2299 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2300 enum isl_dim_type type
, unsigned first
, unsigned n
)
2302 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2305 /* Project out n inputs starting at first using Fourier-Motzkin */
2306 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2307 unsigned first
, unsigned n
)
2309 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2312 static void dump_term(struct isl_basic_map
*bmap
,
2313 isl_int c
, int pos
, FILE *out
)
2316 unsigned in
= isl_basic_map_n_in(bmap
);
2317 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2318 unsigned nparam
= isl_basic_map_n_param(bmap
);
2320 isl_int_print(out
, c
, 0);
2322 if (!isl_int_is_one(c
))
2323 isl_int_print(out
, c
, 0);
2324 if (pos
< 1 + nparam
) {
2325 name
= isl_space_get_dim_name(bmap
->dim
,
2326 isl_dim_param
, pos
- 1);
2328 fprintf(out
, "%s", name
);
2330 fprintf(out
, "p%d", pos
- 1);
2331 } else if (pos
< 1 + nparam
+ in
)
2332 fprintf(out
, "i%d", pos
- 1 - nparam
);
2333 else if (pos
< 1 + nparam
+ dim
)
2334 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2336 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2340 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2341 int sign
, FILE *out
)
2345 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2349 for (i
= 0, first
= 1; i
< len
; ++i
) {
2350 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2353 fprintf(out
, " + ");
2355 isl_int_abs(v
, c
[i
]);
2356 dump_term(bmap
, v
, i
, out
);
2363 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2364 const char *op
, FILE *out
, int indent
)
2368 fprintf(out
, "%*s", indent
, "");
2370 dump_constraint_sign(bmap
, c
, 1, out
);
2371 fprintf(out
, " %s ", op
);
2372 dump_constraint_sign(bmap
, c
, -1, out
);
2376 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2377 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2379 fprintf(out
, "%*s", indent
, "");
2380 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2385 static void dump_constraints(struct isl_basic_map
*bmap
,
2386 isl_int
**c
, unsigned n
,
2387 const char *op
, FILE *out
, int indent
)
2391 for (i
= 0; i
< n
; ++i
)
2392 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2395 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2399 unsigned total
= isl_basic_map_total_dim(bmap
);
2401 for (j
= 0; j
< 1 + total
; ++j
) {
2402 if (isl_int_is_zero(exp
[j
]))
2404 if (!first
&& isl_int_is_pos(exp
[j
]))
2406 dump_term(bmap
, exp
[j
], j
, out
);
2411 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2415 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2416 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2418 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2419 fprintf(out
, "%*s", indent
, "");
2420 fprintf(out
, "e%d = [(", i
);
2421 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2423 isl_int_print(out
, bmap
->div
[i
][0], 0);
2424 fprintf(out
, "]\n");
2428 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2429 FILE *out
, int indent
)
2432 fprintf(out
, "null basic set\n");
2436 fprintf(out
, "%*s", indent
, "");
2437 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2438 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2439 bset
->extra
, bset
->flags
);
2440 dump((struct isl_basic_map
*)bset
, out
, indent
);
2443 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2444 FILE *out
, int indent
)
2447 fprintf(out
, "null basic map\n");
2451 fprintf(out
, "%*s", indent
, "");
2452 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2453 "flags: %x, n_name: %d\n",
2455 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2456 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2457 dump(bmap
, out
, indent
);
2460 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2465 total
= isl_basic_map_total_dim(bmap
);
2466 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2467 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2468 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2469 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2473 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2476 struct isl_set
*set
;
2480 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2481 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2482 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2483 sizeof(struct isl_set
) +
2484 (n
- 1) * sizeof(struct isl_basic_set
*));
2488 set
->ctx
= dim
->ctx
;
2489 isl_ctx_ref(set
->ctx
);
2497 isl_space_free(dim
);
2501 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2502 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2504 struct isl_set
*set
;
2507 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2511 set
= isl_set_alloc_space(dims
, n
, flags
);
2515 /* Make sure "map" has room for at least "n" more basic maps.
2517 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2520 struct isl_map
*grown
= NULL
;
2524 isl_assert(map
->ctx
, n
>= 0, goto error
);
2525 if (map
->n
+ n
<= map
->size
)
2527 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2530 for (i
= 0; i
< map
->n
; ++i
) {
2531 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2539 isl_map_free(grown
);
2544 /* Make sure "set" has room for at least "n" more basic sets.
2546 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2548 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2551 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2554 struct isl_set
*dup
;
2559 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2562 for (i
= 0; i
< set
->n
; ++i
)
2563 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2567 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2569 return isl_map_from_basic_map(bset
);
2572 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2574 struct isl_map
*map
;
2579 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2580 return isl_map_add_basic_map(map
, bmap
);
2583 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2584 __isl_take isl_basic_set
*bset
)
2586 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2587 (struct isl_basic_map
*)bset
);
2590 void *isl_set_free(__isl_take isl_set
*set
)
2600 isl_ctx_deref(set
->ctx
);
2601 for (i
= 0; i
< set
->n
; ++i
)
2602 isl_basic_set_free(set
->p
[i
]);
2603 isl_space_free(set
->dim
);
2609 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2614 fprintf(out
, "null set\n");
2618 fprintf(out
, "%*s", indent
, "");
2619 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2620 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2622 for (i
= 0; i
< set
->n
; ++i
) {
2623 fprintf(out
, "%*s", indent
, "");
2624 fprintf(out
, "basic set %d:\n", i
);
2625 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2629 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2634 fprintf(out
, "null map\n");
2638 fprintf(out
, "%*s", indent
, "");
2639 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2640 "flags: %x, n_name: %d\n",
2641 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2642 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2643 for (i
= 0; i
< map
->n
; ++i
) {
2644 fprintf(out
, "%*s", indent
, "");
2645 fprintf(out
, "basic map %d:\n", i
);
2646 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2650 struct isl_basic_map
*isl_basic_map_intersect_domain(
2651 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2653 struct isl_basic_map
*bmap_domain
;
2658 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2659 bset
->dim
, isl_dim_param
), goto error
);
2661 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2662 isl_assert(bset
->ctx
,
2663 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2665 bmap
= isl_basic_map_cow(bmap
);
2668 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2669 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2670 bmap_domain
= isl_basic_map_from_domain(bset
);
2671 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2673 bmap
= isl_basic_map_simplify(bmap
);
2674 return isl_basic_map_finalize(bmap
);
2676 isl_basic_map_free(bmap
);
2677 isl_basic_set_free(bset
);
2681 struct isl_basic_map
*isl_basic_map_intersect_range(
2682 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2684 struct isl_basic_map
*bmap_range
;
2689 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2690 bset
->dim
, isl_dim_param
), goto error
);
2692 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2693 isl_assert(bset
->ctx
,
2694 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2696 if (isl_basic_set_is_universe(bset
)) {
2697 isl_basic_set_free(bset
);
2701 bmap
= isl_basic_map_cow(bmap
);
2704 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2705 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2706 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2707 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2709 bmap
= isl_basic_map_simplify(bmap
);
2710 return isl_basic_map_finalize(bmap
);
2712 isl_basic_map_free(bmap
);
2713 isl_basic_set_free(bset
);
2717 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2723 total
= 1 + isl_basic_map_total_dim(bmap
);
2724 if (total
!= vec
->size
)
2729 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2730 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2731 if (!isl_int_is_zero(s
)) {
2737 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2738 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2739 if (isl_int_is_neg(s
)) {
2750 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2752 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2755 struct isl_basic_map
*isl_basic_map_intersect(
2756 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2758 struct isl_vec
*sample
= NULL
;
2760 if (!bmap1
|| !bmap2
)
2763 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2764 bmap2
->dim
, isl_dim_param
), goto error
);
2765 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2766 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2767 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2768 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2769 return isl_basic_map_intersect(bmap2
, bmap1
);
2771 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2772 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2773 isl_assert(bmap1
->ctx
,
2774 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2776 if (bmap1
->sample
&&
2777 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2778 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2779 sample
= isl_vec_copy(bmap1
->sample
);
2780 else if (bmap2
->sample
&&
2781 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2782 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2783 sample
= isl_vec_copy(bmap2
->sample
);
2785 bmap1
= isl_basic_map_cow(bmap1
);
2788 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2789 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2790 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2793 isl_vec_free(sample
);
2795 isl_vec_free(bmap1
->sample
);
2796 bmap1
->sample
= sample
;
2799 bmap1
= isl_basic_map_simplify(bmap1
);
2800 return isl_basic_map_finalize(bmap1
);
2803 isl_vec_free(sample
);
2804 isl_basic_map_free(bmap1
);
2805 isl_basic_map_free(bmap2
);
2809 struct isl_basic_set
*isl_basic_set_intersect(
2810 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2812 return (struct isl_basic_set
*)
2813 isl_basic_map_intersect(
2814 (struct isl_basic_map
*)bset1
,
2815 (struct isl_basic_map
*)bset2
);
2818 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2819 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2821 return isl_basic_set_intersect(bset1
, bset2
);
2824 /* Special case of isl_map_intersect, where both map1 and map2
2825 * are convex, without any divs and such that either map1 or map2
2826 * contains a single constraint. This constraint is then simply
2827 * added to the other map.
2829 static __isl_give isl_map
*map_intersect_add_constraint(
2830 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2832 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2833 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2834 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2835 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2837 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2838 return isl_map_intersect(map2
, map1
);
2840 isl_assert(map2
->ctx
,
2841 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2843 map1
= isl_map_cow(map1
);
2846 if (isl_map_plain_is_empty(map1
)) {
2850 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2851 if (map2
->p
[0]->n_eq
== 1)
2852 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2854 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2855 map2
->p
[0]->ineq
[0]);
2857 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2858 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2862 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2863 isl_basic_map_free(map1
->p
[0]);
2876 /* map2 may be either a parameter domain or a map living in the same
2879 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2880 __isl_take isl_map
*map2
)
2889 if ((isl_map_plain_is_empty(map1
) ||
2890 isl_map_plain_is_universe(map2
)) &&
2891 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2895 if ((isl_map_plain_is_empty(map2
) ||
2896 isl_map_plain_is_universe(map1
)) &&
2897 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2902 if (map1
->n
== 1 && map2
->n
== 1 &&
2903 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2904 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2905 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2906 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2907 return map_intersect_add_constraint(map1
, map2
);
2909 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2910 isl_space_dim(map2
->dim
, isl_dim_param
))
2911 isl_assert(map1
->ctx
,
2912 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2914 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2915 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2916 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2918 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2919 map1
->n
* map2
->n
, flags
);
2922 for (i
= 0; i
< map1
->n
; ++i
)
2923 for (j
= 0; j
< map2
->n
; ++j
) {
2924 struct isl_basic_map
*part
;
2925 part
= isl_basic_map_intersect(
2926 isl_basic_map_copy(map1
->p
[i
]),
2927 isl_basic_map_copy(map2
->p
[j
]));
2928 if (isl_basic_map_is_empty(part
) < 0)
2929 part
= isl_basic_map_free(part
);
2930 result
= isl_map_add_basic_map(result
, part
);
2943 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2944 __isl_take isl_map
*map2
)
2948 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2949 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2950 "spaces don't match", goto error
);
2951 return map_intersect_internal(map1
, map2
);
2958 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2959 __isl_take isl_map
*map2
)
2961 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2964 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2966 return (struct isl_set
*)
2967 isl_map_intersect((struct isl_map
*)set1
,
2968 (struct isl_map
*)set2
);
2971 /* map_intersect_internal accepts intersections
2972 * with parameter domains, so we can just call that function.
2974 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2975 __isl_take isl_set
*params
)
2977 return map_intersect_internal(map
, params
);
2980 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2981 __isl_take isl_map
*map2
)
2983 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2986 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2987 __isl_take isl_set
*params
)
2989 return isl_map_intersect_params(set
, params
);
2992 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2995 struct isl_basic_set
*bset
;
3000 bmap
= isl_basic_map_cow(bmap
);
3003 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3004 in
= isl_basic_map_n_in(bmap
);
3005 bset
= isl_basic_set_from_basic_map(bmap
);
3006 bset
= isl_basic_set_swap_vars(bset
, in
);
3007 return isl_basic_map_from_basic_set(bset
, dim
);
3010 static __isl_give isl_basic_map
*basic_map_space_reset(
3011 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3017 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3020 space
= isl_basic_map_get_space(bmap
);
3021 space
= isl_space_reset(space
, type
);
3022 bmap
= isl_basic_map_reset_space(bmap
, space
);
3026 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3027 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3028 unsigned pos
, unsigned n
)
3031 struct isl_basic_map
*res
;
3032 struct isl_dim_map
*dim_map
;
3033 unsigned total
, off
;
3034 enum isl_dim_type t
;
3037 return basic_map_space_reset(bmap
, type
);
3042 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3044 total
= isl_basic_map_total_dim(bmap
) + n
;
3045 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3047 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3049 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3051 unsigned size
= isl_basic_map_dim(bmap
, t
);
3052 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3054 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3055 pos
, size
- pos
, off
+ pos
+ n
);
3057 off
+= isl_space_dim(res_dim
, t
);
3059 isl_dim_map_div(dim_map
, bmap
, off
);
3061 res
= isl_basic_map_alloc_space(res_dim
,
3062 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3063 if (isl_basic_map_is_rational(bmap
))
3064 res
= isl_basic_map_set_rational(res
);
3065 if (isl_basic_map_plain_is_empty(bmap
)) {
3066 isl_basic_map_free(bmap
);
3067 return isl_basic_map_set_to_empty(res
);
3069 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3070 return isl_basic_map_finalize(res
);
3073 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3074 __isl_take isl_basic_set
*bset
,
3075 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3077 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3080 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3081 enum isl_dim_type type
, unsigned n
)
3085 return isl_basic_map_insert_dims(bmap
, type
,
3086 isl_basic_map_dim(bmap
, type
), n
);
3089 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3090 enum isl_dim_type type
, unsigned n
)
3094 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3095 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3097 isl_basic_set_free(bset
);
3101 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3102 enum isl_dim_type type
)
3106 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3109 space
= isl_map_get_space(map
);
3110 space
= isl_space_reset(space
, type
);
3111 map
= isl_map_reset_space(map
, space
);
3115 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3116 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3121 return map_space_reset(map
, type
);
3123 map
= isl_map_cow(map
);
3127 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3131 for (i
= 0; i
< map
->n
; ++i
) {
3132 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3143 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3144 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3146 return isl_map_insert_dims(set
, type
, pos
, n
);
3149 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3150 enum isl_dim_type type
, unsigned n
)
3154 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3157 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3158 enum isl_dim_type type
, unsigned n
)
3162 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3163 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3169 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3170 __isl_take isl_basic_map
*bmap
,
3171 enum isl_dim_type dst_type
, unsigned dst_pos
,
3172 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3174 struct isl_dim_map
*dim_map
;
3175 struct isl_basic_map
*res
;
3176 enum isl_dim_type t
;
3177 unsigned total
, off
;
3184 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3187 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3190 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3192 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3193 pos(bmap
->dim
, src_type
) + src_pos
+
3194 ((src_type
< dst_type
) ? n
: 0)) {
3195 bmap
= isl_basic_map_cow(bmap
);
3199 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3200 src_type
, src_pos
, n
);
3204 bmap
= isl_basic_map_finalize(bmap
);
3209 total
= isl_basic_map_total_dim(bmap
);
3210 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3213 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3214 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3215 if (t
== dst_type
) {
3216 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3219 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3222 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3223 dst_pos
, size
- dst_pos
, off
);
3224 off
+= size
- dst_pos
;
3225 } else if (t
== src_type
) {
3226 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3229 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3230 src_pos
+ n
, size
- src_pos
- n
, off
);
3231 off
+= size
- src_pos
- n
;
3233 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3237 isl_dim_map_div(dim_map
, bmap
, off
);
3239 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3240 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3241 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3245 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3246 src_type
, src_pos
, n
);
3250 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3251 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3252 bmap
= isl_basic_map_finalize(bmap
);
3256 isl_basic_map_free(bmap
);
3260 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3261 enum isl_dim_type dst_type
, unsigned dst_pos
,
3262 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3264 return (isl_basic_set
*)isl_basic_map_move_dims(
3265 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3268 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3269 enum isl_dim_type dst_type
, unsigned dst_pos
,
3270 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3274 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3275 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3276 src_type
, src_pos
, n
);
3282 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3283 enum isl_dim_type dst_type
, unsigned dst_pos
,
3284 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3293 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3296 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3299 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3301 map
= isl_map_cow(map
);
3305 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3309 for (i
= 0; i
< map
->n
; ++i
) {
3310 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3312 src_type
, src_pos
, n
);
3323 /* Move the specified dimensions to the last columns right before
3324 * the divs. Don't change the dimension specification of bmap.
3325 * That's the responsibility of the caller.
3327 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3328 enum isl_dim_type type
, unsigned first
, unsigned n
)
3330 struct isl_dim_map
*dim_map
;
3331 struct isl_basic_map
*res
;
3332 enum isl_dim_type t
;
3333 unsigned total
, off
;
3337 if (pos(bmap
->dim
, type
) + first
+ n
==
3338 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3341 total
= isl_basic_map_total_dim(bmap
);
3342 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3345 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3346 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3348 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3351 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3352 first
, n
, total
- bmap
->n_div
- n
);
3353 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3354 first
+ n
, size
- (first
+ n
), off
);
3355 off
+= size
- (first
+ n
);
3357 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3361 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3363 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3364 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3365 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3369 /* Insert "n" rows in the divs of "bmap".
3371 * The number of columns is not changed, which means that the last
3372 * dimensions of "bmap" are being reintepreted as the new divs.
3373 * The space of "bmap" is not adjusted, however, which means
3374 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3375 * from the space of "bmap" is the responsibility of the caller.
3377 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3385 bmap
= isl_basic_map_cow(bmap
);
3389 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3390 old
= bmap
->block2
.data
;
3391 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3392 (bmap
->extra
+ n
) * (1 + row_size
));
3393 if (!bmap
->block2
.data
)
3394 return isl_basic_map_free(bmap
);
3395 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3397 return isl_basic_map_free(bmap
);
3398 for (i
= 0; i
< n
; ++i
) {
3399 new_div
[i
] = bmap
->block2
.data
+
3400 (bmap
->extra
+ i
) * (1 + row_size
);
3401 isl_seq_clr(new_div
[i
], 1 + row_size
);
3403 for (i
= 0; i
< bmap
->extra
; ++i
)
3404 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3406 bmap
->div
= new_div
;
3413 /* Turn the n dimensions of type type, starting at first
3414 * into existentially quantified variables.
3416 __isl_give isl_basic_map
*isl_basic_map_project_out(
3417 __isl_take isl_basic_map
*bmap
,
3418 enum isl_dim_type type
, unsigned first
, unsigned n
)
3421 return basic_map_space_reset(bmap
, type
);
3426 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3427 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3429 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3432 bmap
= move_last(bmap
, type
, first
, n
);
3433 bmap
= isl_basic_map_cow(bmap
);
3434 bmap
= insert_div_rows(bmap
, n
);
3438 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3441 bmap
= isl_basic_map_simplify(bmap
);
3442 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3443 return isl_basic_map_finalize(bmap
);
3445 isl_basic_map_free(bmap
);
3449 /* Turn the n dimensions of type type, starting at first
3450 * into existentially quantified variables.
3452 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3453 enum isl_dim_type type
, unsigned first
, unsigned n
)
3455 return (isl_basic_set
*)isl_basic_map_project_out(
3456 (isl_basic_map
*)bset
, type
, first
, n
);
3459 /* Turn the n dimensions of type type, starting at first
3460 * into existentially quantified variables.
3462 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3463 enum isl_dim_type type
, unsigned first
, unsigned n
)
3471 return map_space_reset(map
, type
);
3473 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3475 map
= isl_map_cow(map
);
3479 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3483 for (i
= 0; i
< map
->n
; ++i
) {
3484 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3495 /* Turn the n dimensions of type type, starting at first
3496 * into existentially quantified variables.
3498 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3499 enum isl_dim_type type
, unsigned first
, unsigned n
)
3501 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3504 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3508 for (i
= 0; i
< n
; ++i
) {
3509 j
= isl_basic_map_alloc_div(bmap
);
3512 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3516 isl_basic_map_free(bmap
);
3520 struct isl_basic_map
*isl_basic_map_apply_range(
3521 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3523 isl_space
*dim_result
= NULL
;
3524 struct isl_basic_map
*bmap
;
3525 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3526 struct isl_dim_map
*dim_map1
, *dim_map2
;
3528 if (!bmap1
|| !bmap2
)
3531 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3532 isl_space_copy(bmap2
->dim
));
3534 n_in
= isl_basic_map_n_in(bmap1
);
3535 n_out
= isl_basic_map_n_out(bmap2
);
3536 n
= isl_basic_map_n_out(bmap1
);
3537 nparam
= isl_basic_map_n_param(bmap1
);
3539 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3540 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3541 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3542 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3543 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3544 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3545 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3546 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3547 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3548 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3549 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3551 bmap
= isl_basic_map_alloc_space(dim_result
,
3552 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3553 bmap1
->n_eq
+ bmap2
->n_eq
,
3554 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3555 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3556 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3557 bmap
= add_divs(bmap
, n
);
3558 bmap
= isl_basic_map_simplify(bmap
);
3559 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3560 return isl_basic_map_finalize(bmap
);
3562 isl_basic_map_free(bmap1
);
3563 isl_basic_map_free(bmap2
);
3567 struct isl_basic_set
*isl_basic_set_apply(
3568 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3573 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3576 return (struct isl_basic_set
*)
3577 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3579 isl_basic_set_free(bset
);
3580 isl_basic_map_free(bmap
);
3584 struct isl_basic_map
*isl_basic_map_apply_domain(
3585 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3587 if (!bmap1
|| !bmap2
)
3590 isl_assert(bmap1
->ctx
,
3591 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3592 isl_assert(bmap1
->ctx
,
3593 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3596 bmap1
= isl_basic_map_reverse(bmap1
);
3597 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3598 return isl_basic_map_reverse(bmap1
);
3600 isl_basic_map_free(bmap1
);
3601 isl_basic_map_free(bmap2
);
3605 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3606 * A \cap B -> f(A) + f(B)
3608 struct isl_basic_map
*isl_basic_map_sum(
3609 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3611 unsigned n_in
, n_out
, nparam
, total
, pos
;
3612 struct isl_basic_map
*bmap
= NULL
;
3613 struct isl_dim_map
*dim_map1
, *dim_map2
;
3616 if (!bmap1
|| !bmap2
)
3619 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3622 nparam
= isl_basic_map_n_param(bmap1
);
3623 n_in
= isl_basic_map_n_in(bmap1
);
3624 n_out
= isl_basic_map_n_out(bmap1
);
3626 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3627 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3628 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3629 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3630 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3631 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3632 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3633 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3634 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3635 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3636 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3638 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3639 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3640 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3641 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3642 for (i
= 0; i
< n_out
; ++i
) {
3643 int j
= isl_basic_map_alloc_equality(bmap
);
3646 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3647 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3648 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3649 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3651 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3652 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3653 bmap
= add_divs(bmap
, 2 * n_out
);
3655 bmap
= isl_basic_map_simplify(bmap
);
3656 return isl_basic_map_finalize(bmap
);
3658 isl_basic_map_free(bmap
);
3659 isl_basic_map_free(bmap1
);
3660 isl_basic_map_free(bmap2
);
3664 /* Given two maps A -> f(A) and B -> g(B), construct a map
3665 * A \cap B -> f(A) + f(B)
3667 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3669 struct isl_map
*result
;
3675 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3677 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3678 map1
->n
* map2
->n
, 0);
3681 for (i
= 0; i
< map1
->n
; ++i
)
3682 for (j
= 0; j
< map2
->n
; ++j
) {
3683 struct isl_basic_map
*part
;
3684 part
= isl_basic_map_sum(
3685 isl_basic_map_copy(map1
->p
[i
]),
3686 isl_basic_map_copy(map2
->p
[j
]));
3687 if (isl_basic_map_is_empty(part
))
3688 isl_basic_map_free(part
);
3690 result
= isl_map_add_basic_map(result
, part
);
3703 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3704 __isl_take isl_set
*set2
)
3706 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3709 /* Given a basic map A -> f(A), construct A -> -f(A).
3711 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3716 bmap
= isl_basic_map_cow(bmap
);
3720 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3721 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3722 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3723 for (j
= 0; j
< n
; ++j
)
3724 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3725 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3726 for (j
= 0; j
< n
; ++j
)
3727 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3728 for (i
= 0; i
< bmap
->n_div
; ++i
)
3729 for (j
= 0; j
< n
; ++j
)
3730 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3731 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3732 return isl_basic_map_finalize(bmap
);
3735 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3737 return isl_basic_map_neg(bset
);
3740 /* Given a map A -> f(A), construct A -> -f(A).
3742 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3746 map
= isl_map_cow(map
);
3750 for (i
= 0; i
< map
->n
; ++i
) {
3751 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3762 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3764 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3767 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3768 * A -> floor(f(A)/d).
3770 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3773 unsigned n_in
, n_out
, nparam
, total
, pos
;
3774 struct isl_basic_map
*result
= NULL
;
3775 struct isl_dim_map
*dim_map
;
3781 nparam
= isl_basic_map_n_param(bmap
);
3782 n_in
= isl_basic_map_n_in(bmap
);
3783 n_out
= isl_basic_map_n_out(bmap
);
3785 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3786 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3787 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3788 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3789 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3790 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3792 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3793 bmap
->n_div
+ n_out
,
3794 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3795 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3796 result
= add_divs(result
, n_out
);
3797 for (i
= 0; i
< n_out
; ++i
) {
3799 j
= isl_basic_map_alloc_inequality(result
);
3802 isl_seq_clr(result
->ineq
[j
], 1+total
);
3803 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3804 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3805 j
= isl_basic_map_alloc_inequality(result
);
3808 isl_seq_clr(result
->ineq
[j
], 1+total
);
3809 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3810 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3811 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3814 result
= isl_basic_map_simplify(result
);
3815 return isl_basic_map_finalize(result
);
3817 isl_basic_map_free(result
);
3821 /* Given a map A -> f(A) and an integer d, construct a map
3822 * A -> floor(f(A)/d).
3824 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3828 map
= isl_map_cow(map
);
3832 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3833 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3834 for (i
= 0; i
< map
->n
; ++i
) {
3835 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3846 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3852 i
= isl_basic_map_alloc_equality(bmap
);
3855 nparam
= isl_basic_map_n_param(bmap
);
3856 n_in
= isl_basic_map_n_in(bmap
);
3857 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3858 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3859 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3860 return isl_basic_map_finalize(bmap
);
3862 isl_basic_map_free(bmap
);
3866 /* Add a constraints to "bmap" expressing i_pos < o_pos
3868 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3874 i
= isl_basic_map_alloc_inequality(bmap
);
3877 nparam
= isl_basic_map_n_param(bmap
);
3878 n_in
= isl_basic_map_n_in(bmap
);
3879 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3880 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3881 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3882 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3883 return isl_basic_map_finalize(bmap
);
3885 isl_basic_map_free(bmap
);
3889 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3891 static __isl_give isl_basic_map
*var_less_or_equal(
3892 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3898 i
= isl_basic_map_alloc_inequality(bmap
);
3901 nparam
= isl_basic_map_n_param(bmap
);
3902 n_in
= isl_basic_map_n_in(bmap
);
3903 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3904 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3905 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3906 return isl_basic_map_finalize(bmap
);
3908 isl_basic_map_free(bmap
);
3912 /* Add a constraints to "bmap" expressing i_pos > o_pos
3914 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3920 i
= isl_basic_map_alloc_inequality(bmap
);
3923 nparam
= isl_basic_map_n_param(bmap
);
3924 n_in
= isl_basic_map_n_in(bmap
);
3925 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3926 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3927 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3928 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3929 return isl_basic_map_finalize(bmap
);
3931 isl_basic_map_free(bmap
);
3935 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3937 static __isl_give isl_basic_map
*var_more_or_equal(
3938 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3944 i
= isl_basic_map_alloc_inequality(bmap
);
3947 nparam
= isl_basic_map_n_param(bmap
);
3948 n_in
= isl_basic_map_n_in(bmap
);
3949 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3950 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3951 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3952 return isl_basic_map_finalize(bmap
);
3954 isl_basic_map_free(bmap
);
3958 __isl_give isl_basic_map
*isl_basic_map_equal(
3959 __isl_take isl_space
*dim
, unsigned n_equal
)
3962 struct isl_basic_map
*bmap
;
3963 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3966 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3967 bmap
= var_equal(bmap
, i
);
3968 return isl_basic_map_finalize(bmap
);
3971 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3973 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3977 struct isl_basic_map
*bmap
;
3978 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3981 for (i
= 0; i
< pos
&& bmap
; ++i
)
3982 bmap
= var_equal(bmap
, i
);
3984 bmap
= var_less(bmap
, pos
);
3985 return isl_basic_map_finalize(bmap
);
3988 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3990 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3991 __isl_take isl_space
*dim
, unsigned pos
)
3994 isl_basic_map
*bmap
;
3996 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3997 for (i
= 0; i
< pos
; ++i
)
3998 bmap
= var_equal(bmap
, i
);
3999 bmap
= var_less_or_equal(bmap
, pos
);
4000 return isl_basic_map_finalize(bmap
);
4003 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4005 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4009 struct isl_basic_map
*bmap
;
4010 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4013 for (i
= 0; i
< pos
&& bmap
; ++i
)
4014 bmap
= var_equal(bmap
, i
);
4016 bmap
= var_more(bmap
, pos
);
4017 return isl_basic_map_finalize(bmap
);
4020 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4022 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4023 __isl_take isl_space
*dim
, unsigned pos
)
4026 isl_basic_map
*bmap
;
4028 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4029 for (i
= 0; i
< pos
; ++i
)
4030 bmap
= var_equal(bmap
, i
);
4031 bmap
= var_more_or_equal(bmap
, pos
);
4032 return isl_basic_map_finalize(bmap
);
4035 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4036 unsigned n
, int equal
)
4038 struct isl_map
*map
;
4041 if (n
== 0 && equal
)
4042 return isl_map_universe(dims
);
4044 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4046 for (i
= 0; i
+ 1 < n
; ++i
)
4047 map
= isl_map_add_basic_map(map
,
4048 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4051 map
= isl_map_add_basic_map(map
,
4052 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4054 map
= isl_map_add_basic_map(map
,
4055 isl_basic_map_less_at(dims
, n
- 1));
4057 isl_space_free(dims
);
4062 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4066 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4069 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4071 return map_lex_lte_first(dim
, n
, 0);
4074 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4076 return map_lex_lte_first(dim
, n
, 1);
4079 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4081 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4084 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4086 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4089 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4090 unsigned n
, int equal
)
4092 struct isl_map
*map
;
4095 if (n
== 0 && equal
)
4096 return isl_map_universe(dims
);
4098 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4100 for (i
= 0; i
+ 1 < n
; ++i
)
4101 map
= isl_map_add_basic_map(map
,
4102 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4105 map
= isl_map_add_basic_map(map
,
4106 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4108 map
= isl_map_add_basic_map(map
,
4109 isl_basic_map_more_at(dims
, n
- 1));
4111 isl_space_free(dims
);
4116 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4120 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4123 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4125 return map_lex_gte_first(dim
, n
, 0);
4128 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4130 return map_lex_gte_first(dim
, n
, 1);
4133 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4135 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4138 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4140 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4143 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4144 __isl_take isl_set
*set2
)
4147 map
= isl_map_lex_le(isl_set_get_space(set1
));
4148 map
= isl_map_intersect_domain(map
, set1
);
4149 map
= isl_map_intersect_range(map
, set2
);
4153 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4154 __isl_take isl_set
*set2
)
4157 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4158 map
= isl_map_intersect_domain(map
, set1
);
4159 map
= isl_map_intersect_range(map
, set2
);
4163 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4164 __isl_take isl_set
*set2
)
4167 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4168 map
= isl_map_intersect_domain(map
, set1
);
4169 map
= isl_map_intersect_range(map
, set2
);
4173 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4174 __isl_take isl_set
*set2
)
4177 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4178 map
= isl_map_intersect_domain(map
, set1
);
4179 map
= isl_map_intersect_range(map
, set2
);
4183 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4184 __isl_take isl_map
*map2
)
4187 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4188 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4189 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4193 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4194 __isl_take isl_map
*map2
)
4197 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4198 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4199 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4203 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4204 __isl_take isl_map
*map2
)
4207 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4208 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4209 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4213 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4214 __isl_take isl_map
*map2
)
4217 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4218 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4219 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4223 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4224 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4226 struct isl_basic_map
*bmap
;
4228 bset
= isl_basic_set_cow(bset
);
4232 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4233 isl_space_free(bset
->dim
);
4234 bmap
= (struct isl_basic_map
*) bset
;
4236 return isl_basic_map_finalize(bmap
);
4238 isl_basic_set_free(bset
);
4239 isl_space_free(dim
);
4243 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4247 if (bmap
->dim
->n_in
== 0)
4248 return (struct isl_basic_set
*)bmap
;
4249 bmap
= isl_basic_map_cow(bmap
);
4252 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4255 bmap
= isl_basic_map_finalize(bmap
);
4256 return (struct isl_basic_set
*)bmap
;
4258 isl_basic_map_free(bmap
);
4262 /* For a div d = floor(f/m), add the constraints
4265 * -(f-(n-1)) + m d >= 0
4267 * Note that the second constraint is the negation of
4271 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4272 unsigned pos
, isl_int
*div
)
4275 unsigned total
= isl_basic_map_total_dim(bmap
);
4277 i
= isl_basic_map_alloc_inequality(bmap
);
4280 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4281 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4283 j
= isl_basic_map_alloc_inequality(bmap
);
4286 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4287 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4288 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4292 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4293 unsigned pos
, isl_int
*div
)
4295 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4299 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4301 unsigned total
= isl_basic_map_total_dim(bmap
);
4302 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4304 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4308 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4310 return isl_basic_map_add_div_constraints(bset
, div
);
4313 struct isl_basic_set
*isl_basic_map_underlying_set(
4314 struct isl_basic_map
*bmap
)
4318 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4320 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4321 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4322 return (struct isl_basic_set
*)bmap
;
4323 bmap
= isl_basic_map_cow(bmap
);
4326 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4329 bmap
->extra
-= bmap
->n_div
;
4331 bmap
= isl_basic_map_finalize(bmap
);
4332 return (struct isl_basic_set
*)bmap
;
4334 isl_basic_map_free(bmap
);
4338 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4339 __isl_take isl_basic_set
*bset
)
4341 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4344 struct isl_basic_map
*isl_basic_map_overlying_set(
4345 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4347 struct isl_basic_map
*bmap
;
4348 struct isl_ctx
*ctx
;
4355 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4356 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4357 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4359 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4360 isl_basic_map_free(like
);
4361 return (struct isl_basic_map
*)bset
;
4363 bset
= isl_basic_set_cow(bset
);
4366 total
= bset
->dim
->n_out
+ bset
->extra
;
4367 bmap
= (struct isl_basic_map
*)bset
;
4368 isl_space_free(bmap
->dim
);
4369 bmap
->dim
= isl_space_copy(like
->dim
);
4372 bmap
->n_div
= like
->n_div
;
4373 bmap
->extra
+= like
->n_div
;
4377 ltotal
= total
- bmap
->extra
+ like
->extra
;
4380 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4381 bmap
->extra
* (1 + 1 + total
));
4382 if (isl_blk_is_error(bmap
->block2
))
4384 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4388 for (i
= 0; i
< bmap
->extra
; ++i
)
4389 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4390 for (i
= 0; i
< like
->n_div
; ++i
) {
4391 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4392 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4394 bmap
= isl_basic_map_extend_constraints(bmap
,
4395 0, 2 * like
->n_div
);
4396 for (i
= 0; i
< like
->n_div
; ++i
) {
4399 if (isl_int_is_zero(bmap
->div
[i
][0]))
4401 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4402 bmap
= isl_basic_map_free(bmap
);
4405 isl_basic_map_free(like
);
4406 bmap
= isl_basic_map_simplify(bmap
);
4407 bmap
= isl_basic_map_finalize(bmap
);
4410 isl_basic_map_free(like
);
4411 isl_basic_set_free(bset
);
4415 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4416 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4418 return (struct isl_basic_set
*)
4419 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4422 struct isl_set
*isl_set_from_underlying_set(
4423 struct isl_set
*set
, struct isl_basic_set
*like
)
4429 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4431 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4432 isl_basic_set_free(like
);
4435 set
= isl_set_cow(set
);
4438 for (i
= 0; i
< set
->n
; ++i
) {
4439 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4440 isl_basic_set_copy(like
));
4444 isl_space_free(set
->dim
);
4445 set
->dim
= isl_space_copy(like
->dim
);
4448 isl_basic_set_free(like
);
4451 isl_basic_set_free(like
);
4456 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4460 map
= isl_map_cow(map
);
4463 map
->dim
= isl_space_cow(map
->dim
);
4467 for (i
= 1; i
< map
->n
; ++i
)
4468 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4470 for (i
= 0; i
< map
->n
; ++i
) {
4471 map
->p
[i
] = (struct isl_basic_map
*)
4472 isl_basic_map_underlying_set(map
->p
[i
]);
4477 map
->dim
= isl_space_underlying(map
->dim
, 0);
4479 isl_space_free(map
->dim
);
4480 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4484 return (struct isl_set
*)map
;
4490 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4492 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4495 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4496 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4498 bmap
= isl_basic_map_cow(bmap
);
4502 isl_space_free(bmap
->dim
);
4505 bmap
= isl_basic_map_finalize(bmap
);
4509 isl_basic_map_free(bmap
);
4510 isl_space_free(dim
);
4514 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4515 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4517 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4521 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4522 __isl_take isl_space
*dim
)
4526 map
= isl_map_cow(map
);
4530 for (i
= 0; i
< map
->n
; ++i
) {
4531 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4532 isl_space_copy(dim
));
4536 isl_space_free(map
->dim
);
4542 isl_space_free(dim
);
4546 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4547 __isl_take isl_space
*dim
)
4549 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4552 /* Compute the parameter domain of the given basic set.
4554 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4559 if (isl_basic_set_is_params(bset
))
4562 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4563 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4564 space
= isl_basic_set_get_space(bset
);
4565 space
= isl_space_params(space
);
4566 bset
= isl_basic_set_reset_space(bset
, space
);
4570 /* Construct a zero-dimensional basic set with the given parameter domain.
4572 __isl_give isl_basic_set
*isl_basic_set_from_params(
4573 __isl_take isl_basic_set
*bset
)
4576 space
= isl_basic_set_get_space(bset
);
4577 space
= isl_space_set_from_params(space
);
4578 bset
= isl_basic_set_reset_space(bset
, space
);
4582 /* Compute the parameter domain of the given set.
4584 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4589 if (isl_set_is_params(set
))
4592 n
= isl_set_dim(set
, isl_dim_set
);
4593 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4594 space
= isl_set_get_space(set
);
4595 space
= isl_space_params(space
);
4596 set
= isl_set_reset_space(set
, space
);
4600 /* Construct a zero-dimensional set with the given parameter domain.
4602 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4605 space
= isl_set_get_space(set
);
4606 space
= isl_space_set_from_params(space
);
4607 set
= isl_set_reset_space(set
, space
);
4611 /* Compute the parameter domain of the given map.
4613 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4618 n
= isl_map_dim(map
, isl_dim_in
);
4619 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4620 n
= isl_map_dim(map
, isl_dim_out
);
4621 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4622 space
= isl_map_get_space(map
);
4623 space
= isl_space_params(space
);
4624 map
= isl_map_reset_space(map
, space
);
4628 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4631 struct isl_basic_set
*domain
;
4637 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4639 n_in
= isl_basic_map_n_in(bmap
);
4640 n_out
= isl_basic_map_n_out(bmap
);
4641 domain
= isl_basic_set_from_basic_map(bmap
);
4642 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4644 domain
= isl_basic_set_reset_space(domain
, dim
);
4649 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4653 return isl_space_may_be_set(bmap
->dim
);
4656 /* Is this basic map actually a set?
4657 * Users should never call this function. Outside of isl,
4658 * the type should indicate whether something is a set or a map.
4660 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4664 return isl_space_is_set(bmap
->dim
);
4667 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4671 if (isl_basic_map_is_set(bmap
))
4673 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4676 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4677 __isl_take isl_basic_map
*bmap
)
4681 isl_basic_map
*domain
;
4682 int nparam
, n_in
, n_out
;
4685 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4686 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4687 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4689 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4690 domain
= isl_basic_map_universe(dim
);
4692 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4693 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4694 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4696 total
= isl_basic_map_total_dim(bmap
);
4698 for (i
= 0; i
< n_in
; ++i
) {
4699 k
= isl_basic_map_alloc_equality(bmap
);
4702 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4703 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4704 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4707 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4708 return isl_basic_map_finalize(bmap
);
4710 isl_basic_map_free(bmap
);
4714 __isl_give isl_basic_map
*isl_basic_map_range_map(
4715 __isl_take isl_basic_map
*bmap
)
4719 isl_basic_map
*range
;
4720 int nparam
, n_in
, n_out
;
4723 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4724 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4725 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4727 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4728 range
= isl_basic_map_universe(dim
);
4730 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4731 bmap
= isl_basic_map_apply_range(bmap
, range
);
4732 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4734 total
= isl_basic_map_total_dim(bmap
);
4736 for (i
= 0; i
< n_out
; ++i
) {
4737 k
= isl_basic_map_alloc_equality(bmap
);
4740 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4741 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4742 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4745 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4746 return isl_basic_map_finalize(bmap
);
4748 isl_basic_map_free(bmap
);
4752 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4756 return isl_space_may_be_set(map
->dim
);
4759 /* Is this map actually a set?
4760 * Users should never call this function. Outside of isl,
4761 * the type should indicate whether something is a set or a map.
4763 int isl_map_is_set(__isl_keep isl_map
*map
)
4767 return isl_space_is_set(map
->dim
);
4770 struct isl_set
*isl_map_range(struct isl_map
*map
)
4773 struct isl_set
*set
;
4777 if (isl_map_is_set(map
))
4778 return (isl_set
*)map
;
4780 map
= isl_map_cow(map
);
4784 set
= (struct isl_set
*) map
;
4785 set
->dim
= isl_space_range(set
->dim
);
4788 for (i
= 0; i
< map
->n
; ++i
) {
4789 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4793 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4794 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4801 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4804 isl_space
*domain_dim
;
4806 map
= isl_map_cow(map
);
4810 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4811 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4812 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4815 for (i
= 0; i
< map
->n
; ++i
) {
4816 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4820 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4821 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4828 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4831 isl_space
*range_dim
;
4833 map
= isl_map_cow(map
);
4837 range_dim
= isl_space_range(isl_map_get_space(map
));
4838 range_dim
= isl_space_from_range(range_dim
);
4839 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4840 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4843 for (i
= 0; i
< map
->n
; ++i
) {
4844 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4848 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4849 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4856 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4857 __isl_take isl_space
*dim
)
4860 struct isl_map
*map
= NULL
;
4862 set
= isl_set_cow(set
);
4865 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4866 map
= (struct isl_map
*)set
;
4867 for (i
= 0; i
< set
->n
; ++i
) {
4868 map
->p
[i
] = isl_basic_map_from_basic_set(
4869 set
->p
[i
], isl_space_copy(dim
));
4873 isl_space_free(map
->dim
);
4877 isl_space_free(dim
);
4882 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4883 __isl_take isl_basic_set
*bset
)
4885 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4888 __isl_give isl_basic_map
*isl_basic_map_from_range(
4889 __isl_take isl_basic_set
*bset
)
4892 space
= isl_basic_set_get_space(bset
);
4893 space
= isl_space_from_range(space
);
4894 bset
= isl_basic_set_reset_space(bset
, space
);
4895 return (isl_basic_map
*)bset
;
4898 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4901 space
= isl_set_get_space(set
);
4902 space
= isl_space_from_range(space
);
4903 set
= isl_set_reset_space(set
, space
);
4904 return (struct isl_map
*)set
;
4907 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4909 return isl_map_reverse(isl_map_from_range(set
));
4912 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4913 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4915 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4918 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4919 __isl_take isl_set
*range
)
4921 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4924 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4927 struct isl_set
*set
= NULL
;
4931 map
= isl_map_cow(map
);
4934 map
->dim
= isl_space_as_set_space(map
->dim
);
4937 set
= (struct isl_set
*)map
;
4938 for (i
= 0; i
< map
->n
; ++i
) {
4939 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4949 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4952 struct isl_map
*map
;
4957 isl_die(dim
->ctx
, isl_error_internal
,
4958 "negative number of basic maps", goto error
);
4959 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4960 sizeof(struct isl_map
) +
4961 (n
- 1) * sizeof(struct isl_basic_map
*));
4965 map
->ctx
= dim
->ctx
;
4966 isl_ctx_ref(map
->ctx
);
4974 isl_space_free(dim
);
4978 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4979 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4982 struct isl_map
*map
;
4985 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4989 map
= isl_map_alloc_space(dims
, n
, flags
);
4993 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4995 struct isl_basic_map
*bmap
;
4996 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4997 bmap
= isl_basic_map_set_to_empty(bmap
);
5001 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5003 struct isl_basic_set
*bset
;
5004 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5005 bset
= isl_basic_set_set_to_empty(bset
);
5009 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5011 struct isl_basic_map
*bmap
;
5014 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5015 bmap
= isl_basic_map_set_to_empty(bmap
);
5019 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5021 struct isl_basic_map
*bmap
;
5024 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5025 bmap
= isl_basic_map_set_to_empty(bmap
);
5029 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5031 struct isl_basic_set
*bset
;
5034 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5035 bset
= isl_basic_set_set_to_empty(bset
);
5039 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5041 struct isl_basic_map
*bmap
;
5042 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5043 bmap
= isl_basic_map_finalize(bmap
);
5047 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5049 struct isl_basic_set
*bset
;
5050 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5051 bset
= isl_basic_set_finalize(bset
);
5055 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5058 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5059 isl_basic_map
*bmap
;
5061 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5062 for (i
= 0; i
< total
; ++i
) {
5063 int k
= isl_basic_map_alloc_inequality(bmap
);
5066 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5067 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5071 isl_basic_map_free(bmap
);
5075 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5077 return isl_basic_map_nat_universe(dim
);
5080 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5082 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5085 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5087 return isl_map_nat_universe(dim
);
5090 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5091 __isl_keep isl_basic_map
*model
)
5095 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5098 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5102 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5105 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5106 __isl_keep isl_set
*model
)
5110 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5113 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5115 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5118 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5122 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5125 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5129 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5132 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5134 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5137 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5141 return isl_set_empty(isl_space_copy(model
->dim
));
5144 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5146 struct isl_map
*map
;
5149 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5150 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5154 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5156 struct isl_set
*set
;
5159 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5160 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5164 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5168 return isl_set_universe(isl_space_copy(model
->dim
));
5171 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5174 struct isl_map
*dup
;
5178 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5179 for (i
= 0; i
< map
->n
; ++i
)
5180 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5184 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5185 __isl_take isl_basic_map
*bmap
)
5189 if (isl_basic_map_plain_is_empty(bmap
)) {
5190 isl_basic_map_free(bmap
);
5193 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5194 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5195 map
->p
[map
->n
] = bmap
;
5197 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5203 isl_basic_map_free(bmap
);
5207 void *isl_map_free(struct isl_map
*map
)
5217 isl_ctx_deref(map
->ctx
);
5218 for (i
= 0; i
< map
->n
; ++i
)
5219 isl_basic_map_free(map
->p
[i
]);
5220 isl_space_free(map
->dim
);
5226 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5227 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5231 base
= isl_map_cow(base
);
5235 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5238 for (i
= 0; i
< base
->n
; ++i
) {
5239 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5240 isl_space_copy(base
->dim
), 0, 0, 0);
5250 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5251 unsigned nparam
, unsigned dim
)
5253 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5257 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5258 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5262 bmap
= isl_basic_map_cow(bmap
);
5263 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5264 j
= isl_basic_map_alloc_equality(bmap
);
5267 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5268 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5269 isl_int_set_si(bmap
->eq
[j
][0], value
);
5270 bmap
= isl_basic_map_simplify(bmap
);
5271 return isl_basic_map_finalize(bmap
);
5273 isl_basic_map_free(bmap
);
5277 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5278 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5282 bmap
= isl_basic_map_cow(bmap
);
5283 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5284 j
= isl_basic_map_alloc_equality(bmap
);
5287 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5288 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5289 isl_int_set(bmap
->eq
[j
][0], value
);
5290 bmap
= isl_basic_map_simplify(bmap
);
5291 return isl_basic_map_finalize(bmap
);
5293 isl_basic_map_free(bmap
);
5297 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5298 enum isl_dim_type type
, unsigned pos
, int value
)
5302 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5303 return isl_basic_map_fix_pos_si(bmap
,
5304 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5306 isl_basic_map_free(bmap
);
5310 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5311 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5315 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5316 return isl_basic_map_fix_pos(bmap
,
5317 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5319 isl_basic_map_free(bmap
);
5323 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5324 enum isl_dim_type type
, unsigned pos
, int value
)
5326 return (struct isl_basic_set
*)
5327 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5331 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5332 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5334 return (struct isl_basic_set
*)
5335 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5339 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5340 unsigned input
, int value
)
5342 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5345 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5346 unsigned dim
, int value
)
5348 return (struct isl_basic_set
*)
5349 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5350 isl_dim_set
, dim
, value
);
5353 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5355 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5362 isl_basic_map_free(map
->p
[i
]);
5363 if (i
!= map
->n
- 1) {
5364 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5365 map
->p
[i
] = map
->p
[map
->n
- 1];
5372 /* Perform "fn" on each basic map of "map", where we may not be holding
5373 * the only reference to "map".
5374 * In particular, "fn" should be a semantics preserving operation
5375 * that we want to apply to all copies of "map". We therefore need
5376 * to be careful not to modify "map" in a way that breaks "map"
5377 * in case anything goes wrong.
5379 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5380 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5382 struct isl_basic_map
*bmap
;
5388 for (i
= map
->n
- 1; i
>= 0; --i
) {
5389 bmap
= isl_basic_map_copy(map
->p
[i
]);
5393 isl_basic_map_free(map
->p
[i
]);
5395 if (remove_if_empty(map
, i
) < 0)
5405 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5406 enum isl_dim_type type
, unsigned pos
, int value
)
5410 map
= isl_map_cow(map
);
5414 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5415 for (i
= map
->n
- 1; i
>= 0; --i
) {
5416 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5417 if (remove_if_empty(map
, i
) < 0)
5420 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5427 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5428 enum isl_dim_type type
, unsigned pos
, int value
)
5430 return (struct isl_set
*)
5431 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5434 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5435 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5439 map
= isl_map_cow(map
);
5443 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5444 for (i
= 0; i
< map
->n
; ++i
) {
5445 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5449 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5456 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5457 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5459 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5462 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5463 unsigned input
, int value
)
5465 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5468 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5470 return (struct isl_set
*)
5471 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5474 static __isl_give isl_basic_map
*basic_map_bound_si(
5475 __isl_take isl_basic_map
*bmap
,
5476 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5482 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5483 pos
+= isl_basic_map_offset(bmap
, type
);
5484 bmap
= isl_basic_map_cow(bmap
);
5485 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5486 j
= isl_basic_map_alloc_inequality(bmap
);
5489 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5491 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5492 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5494 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5495 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5497 bmap
= isl_basic_map_simplify(bmap
);
5498 return isl_basic_map_finalize(bmap
);
5500 isl_basic_map_free(bmap
);
5504 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5505 __isl_take isl_basic_map
*bmap
,
5506 enum isl_dim_type type
, unsigned pos
, int value
)
5508 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5511 /* Constrain the values of the given dimension to be no greater than "value".
5513 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5514 __isl_take isl_basic_map
*bmap
,
5515 enum isl_dim_type type
, unsigned pos
, int value
)
5517 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5520 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5521 unsigned dim
, isl_int value
)
5525 bset
= isl_basic_set_cow(bset
);
5526 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5527 j
= isl_basic_set_alloc_inequality(bset
);
5530 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5531 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5532 isl_int_neg(bset
->ineq
[j
][0], value
);
5533 bset
= isl_basic_set_simplify(bset
);
5534 return isl_basic_set_finalize(bset
);
5536 isl_basic_set_free(bset
);
5540 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5541 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5545 map
= isl_map_cow(map
);
5549 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5550 for (i
= 0; i
< map
->n
; ++i
) {
5551 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5552 type
, pos
, value
, upper
);
5556 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5563 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5564 enum isl_dim_type type
, unsigned pos
, int value
)
5566 return map_bound_si(map
, type
, pos
, value
, 0);
5569 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5570 enum isl_dim_type type
, unsigned pos
, int value
)
5572 return map_bound_si(map
, type
, pos
, value
, 1);
5575 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5576 enum isl_dim_type type
, unsigned pos
, int value
)
5578 return (struct isl_set
*)
5579 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5582 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5583 enum isl_dim_type type
, unsigned pos
, int value
)
5585 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5588 /* Bound the given variable of "bmap" from below (or above is "upper"
5589 * is set) to "value".
5591 static __isl_give isl_basic_map
*basic_map_bound(
5592 __isl_take isl_basic_map
*bmap
,
5593 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5599 if (pos
>= isl_basic_map_dim(bmap
, type
))
5600 isl_die(bmap
->ctx
, isl_error_invalid
,
5601 "index out of bounds", goto error
);
5602 pos
+= isl_basic_map_offset(bmap
, type
);
5603 bmap
= isl_basic_map_cow(bmap
);
5604 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5605 j
= isl_basic_map_alloc_inequality(bmap
);
5608 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5610 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5611 isl_int_set(bmap
->ineq
[j
][0], value
);
5613 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5614 isl_int_neg(bmap
->ineq
[j
][0], value
);
5616 bmap
= isl_basic_map_simplify(bmap
);
5617 return isl_basic_map_finalize(bmap
);
5619 isl_basic_map_free(bmap
);
5623 /* Bound the given variable of "map" from below (or above is "upper"
5624 * is set) to "value".
5626 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5627 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5631 map
= isl_map_cow(map
);
5635 if (pos
>= isl_map_dim(map
, type
))
5636 isl_die(map
->ctx
, isl_error_invalid
,
5637 "index out of bounds", goto error
);
5638 for (i
= map
->n
- 1; i
>= 0; --i
) {
5639 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5640 if (remove_if_empty(map
, i
) < 0)
5643 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5650 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5651 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5653 return map_bound(map
, type
, pos
, value
, 0);
5656 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5657 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5659 return map_bound(map
, type
, pos
, value
, 1);
5662 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5663 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5665 return isl_map_lower_bound(set
, type
, pos
, value
);
5668 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5669 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5671 return isl_map_upper_bound(set
, type
, pos
, value
);
5674 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5679 set
= isl_set_cow(set
);
5683 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5684 for (i
= 0; i
< set
->n
; ++i
) {
5685 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5695 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5699 map
= isl_map_cow(map
);
5703 map
->dim
= isl_space_reverse(map
->dim
);
5706 for (i
= 0; i
< map
->n
; ++i
) {
5707 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5711 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5718 static struct isl_map
*isl_basic_map_partial_lexopt(
5719 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5720 struct isl_set
**empty
, int max
)
5724 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5725 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5727 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5729 isl_basic_map_free(bmap
);
5730 isl_basic_set_free(dom
);
5736 struct isl_map
*isl_basic_map_partial_lexmax(
5737 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5738 struct isl_set
**empty
)
5740 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5743 struct isl_map
*isl_basic_map_partial_lexmin(
5744 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5745 struct isl_set
**empty
)
5747 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5750 struct isl_set
*isl_basic_set_partial_lexmin(
5751 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5752 struct isl_set
**empty
)
5754 return (struct isl_set
*)
5755 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5759 struct isl_set
*isl_basic_set_partial_lexmax(
5760 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5761 struct isl_set
**empty
)
5763 return (struct isl_set
*)
5764 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5768 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5769 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5770 __isl_give isl_set
**empty
)
5772 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5775 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5776 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5777 __isl_give isl_set
**empty
)
5779 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5782 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5783 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5784 __isl_give isl_set
**empty
)
5786 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5789 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5790 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5791 __isl_give isl_set
**empty
)
5793 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5796 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5797 __isl_take isl_basic_map
*bmap
, int max
)
5799 isl_basic_set
*dom
= NULL
;
5800 isl_space
*dom_space
;
5804 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5805 dom
= isl_basic_set_universe(dom_space
);
5806 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5808 isl_basic_map_free(bmap
);
5812 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5813 __isl_take isl_basic_map
*bmap
)
5815 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5819 #define TYPE isl_pw_multi_aff
5821 #define SUFFIX _pw_multi_aff
5823 #define EMPTY isl_pw_multi_aff_empty
5825 #define ADD isl_pw_multi_aff_union_add
5826 #include "isl_map_lexopt_templ.c"
5828 /* Given a map "map", compute the lexicographically minimal
5829 * (or maximal) image element for each domain element in dom,
5830 * in the form of an isl_pw_multi_aff.
5831 * Set *empty to those elements in dom that do not have an image element.
5833 * We first compute the lexicographically minimal or maximal element
5834 * in the first basic map. This results in a partial solution "res"
5835 * and a subset "todo" of dom that still need to be handled.
5836 * We then consider each of the remaining maps in "map" and successively
5837 * update both "res" and "todo".
5839 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5840 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5841 __isl_give isl_set
**empty
, int max
)
5844 isl_pw_multi_aff
*res
;
5850 if (isl_map_plain_is_empty(map
)) {
5855 return isl_pw_multi_aff_from_map(map
);
5858 res
= basic_map_partial_lexopt_pw_multi_aff(
5859 isl_basic_map_copy(map
->p
[0]),
5860 isl_set_copy(dom
), &todo
, max
);
5862 for (i
= 1; i
< map
->n
; ++i
) {
5863 isl_pw_multi_aff
*res_i
;
5866 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5867 isl_basic_map_copy(map
->p
[i
]),
5868 isl_set_copy(dom
), &todo_i
, max
);
5871 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5873 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5875 todo
= isl_set_intersect(todo
, todo_i
);
5896 #define TYPE isl_map
5900 #define EMPTY isl_map_empty
5902 #define ADD isl_map_union_disjoint
5903 #include "isl_map_lexopt_templ.c"
5905 /* Given a map "map", compute the lexicographically minimal
5906 * (or maximal) image element for each domain element in dom.
5907 * Set *empty to those elements in dom that do not have an image element.
5909 * We first compute the lexicographically minimal or maximal element
5910 * in the first basic map. This results in a partial solution "res"
5911 * and a subset "todo" of dom that still need to be handled.
5912 * We then consider each of the remaining maps in "map" and successively
5913 * update both "res" and "todo".
5915 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5916 * Assume we are computing the lexicographical maximum.
5917 * We first compute the lexicographically maximal element in basic map i.
5918 * This results in a partial solution res_i and a subset todo_i.
5919 * Then we combine these results with those obtain for the first k basic maps
5920 * to obtain a result that is valid for the first k+1 basic maps.
5921 * In particular, the set where there is no solution is the set where
5922 * there is no solution for the first k basic maps and also no solution
5923 * for the ith basic map, i.e.,
5925 * todo^i = todo^k * todo_i
5927 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5928 * solutions, arbitrarily breaking ties in favor of res^k.
5929 * That is, when res^k(a) >= res_i(a), we pick res^k and
5930 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5931 * the lexicographic order.)
5932 * In practice, we compute
5934 * res^k * (res_i . "<=")
5938 * res_i * (res^k . "<")
5940 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5941 * where only one of res^k and res_i provides a solution and we simply pick
5948 * Note that we only compute these intersections when dom(res^k) intersects
5949 * dom(res_i). Otherwise, the only effect of these intersections is to
5950 * potentially break up res^k and res_i into smaller pieces.
5951 * We want to avoid such splintering as much as possible.
5952 * In fact, an earlier implementation of this function would look for
5953 * better results in the domain of res^k and for extra results in todo^k,
5954 * but this would always result in a splintering according to todo^k,
5955 * even when the domain of basic map i is disjoint from the domains of
5956 * the previous basic maps.
5958 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5959 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5960 __isl_give isl_set
**empty
, int max
)
5963 struct isl_map
*res
;
5964 struct isl_set
*todo
;
5969 if (isl_map_plain_is_empty(map
)) {
5977 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5978 isl_set_copy(dom
), &todo
, max
);
5980 for (i
= 1; i
< map
->n
; ++i
) {
5984 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5986 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5987 isl_set_copy(dom
), &todo_i
, max
);
5990 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5991 le
= isl_map_lex_le(dim
);
5993 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5994 le
= isl_map_lex_ge(dim
);
5996 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5997 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5998 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5999 le
= isl_map_intersect(le
, isl_map_copy(res
));
6001 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6002 res
= isl_map_intersect_domain(res
,
6003 isl_set_copy(todo_i
));
6004 res_i
= isl_map_intersect_domain(res_i
,
6005 isl_set_copy(todo
));
6008 res
= isl_map_union_disjoint(res
, res_i
);
6009 res
= isl_map_union_disjoint(res
, lt
);
6010 res
= isl_map_union_disjoint(res
, le
);
6012 todo
= isl_set_intersect(todo
, todo_i
);
6032 __isl_give isl_map
*isl_map_partial_lexmax(
6033 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6034 __isl_give isl_set
**empty
)
6036 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6039 __isl_give isl_map
*isl_map_partial_lexmin(
6040 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6041 __isl_give isl_set
**empty
)
6043 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6046 __isl_give isl_set
*isl_set_partial_lexmin(
6047 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6048 __isl_give isl_set
**empty
)
6050 return (struct isl_set
*)
6051 isl_map_partial_lexmin((struct isl_map
*)set
,
6055 __isl_give isl_set
*isl_set_partial_lexmax(
6056 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6057 __isl_give isl_set
**empty
)
6059 return (struct isl_set
*)
6060 isl_map_partial_lexmax((struct isl_map
*)set
,
6064 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6066 struct isl_basic_set
*dom
= NULL
;
6071 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
6072 dom
= isl_basic_set_universe(dom_dim
);
6073 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6075 isl_basic_map_free(bmap
);
6079 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6081 return isl_basic_map_lexopt(bmap
, 0);
6084 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6086 return isl_basic_map_lexopt(bmap
, 1);
6089 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6091 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6094 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6096 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6099 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
6101 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
6104 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
6106 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
6109 /* Extract the first and only affine expression from list
6110 * and then add it to *pwaff with the given dom.
6111 * This domain is known to be disjoint from other domains
6112 * because of the way isl_basic_map_foreach_lexmax works.
6114 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6115 __isl_take isl_aff_list
*list
, void *user
)
6117 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6119 isl_pw_aff
**pwaff
= user
;
6120 isl_pw_aff
*pwaff_i
;
6124 if (isl_aff_list_n_aff(list
) != 1)
6125 isl_die(ctx
, isl_error_internal
,
6126 "expecting single element list", goto error
);
6128 aff
= isl_aff_list_get_aff(list
, 0);
6129 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6131 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6133 isl_aff_list_free(list
);
6137 isl_basic_set_free(dom
);
6138 isl_aff_list_free(list
);
6142 /* Given a basic map with one output dimension, compute the minimum or
6143 * maximum of that dimension as an isl_pw_aff.
6145 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6146 * call update_dim_opt on each leaf of the result.
6148 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6151 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6155 dim
= isl_space_from_domain(isl_space_domain(dim
));
6156 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6157 pwaff
= isl_pw_aff_empty(dim
);
6159 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6161 return isl_pw_aff_free(pwaff
);
6166 /* Compute the minimum or maximum of the given output dimension
6167 * as a function of the parameters and the input dimensions,
6168 * but independently of the other output dimensions.
6170 * We first project out the other output dimension and then compute
6171 * the "lexicographic" maximum in each basic map, combining the results
6172 * using isl_pw_aff_union_max.
6174 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6181 n_out
= isl_map_dim(map
, isl_dim_out
);
6182 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6183 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6188 isl_space
*dim
= isl_map_get_space(map
);
6189 dim
= isl_space_domain(isl_space_from_range(dim
));
6191 return isl_pw_aff_empty(dim
);
6194 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6195 for (i
= 1; i
< map
->n
; ++i
) {
6196 isl_pw_aff
*pwaff_i
;
6198 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6199 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6207 /* Compute the maximum of the given output dimension as a function of the
6208 * parameters and input dimensions, but independently of
6209 * the other output dimensions.
6211 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6213 return map_dim_opt(map
, pos
, 1);
6216 /* Compute the minimum or maximum of the given set dimension
6217 * as a function of the parameters,
6218 * but independently of the other set dimensions.
6220 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6223 return map_dim_opt(set
, pos
, max
);
6226 /* Compute the maximum of the given set dimension as a function of the
6227 * parameters, but independently of the other set dimensions.
6229 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6231 return set_dim_opt(set
, pos
, 1);
6234 /* Compute the minimum of the given set dimension as a function of the
6235 * parameters, but independently of the other set dimensions.
6237 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6239 return set_dim_opt(set
, pos
, 0);
6242 /* Apply a preimage specified by "mat" on the parameters of "bset".
6243 * bset is assumed to have only parameters and divs.
6245 static struct isl_basic_set
*basic_set_parameter_preimage(
6246 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6253 bset
->dim
= isl_space_cow(bset
->dim
);
6257 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6259 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6261 bset
->dim
->nparam
= 0;
6262 bset
->dim
->n_out
= nparam
;
6263 bset
= isl_basic_set_preimage(bset
, mat
);
6265 bset
->dim
->nparam
= bset
->dim
->n_out
;
6266 bset
->dim
->n_out
= 0;
6271 isl_basic_set_free(bset
);
6275 /* Apply a preimage specified by "mat" on the parameters of "set".
6276 * set is assumed to have only parameters and divs.
6278 static struct isl_set
*set_parameter_preimage(
6279 struct isl_set
*set
, struct isl_mat
*mat
)
6281 isl_space
*dim
= NULL
;
6287 dim
= isl_space_copy(set
->dim
);
6288 dim
= isl_space_cow(dim
);
6292 nparam
= isl_set_dim(set
, isl_dim_param
);
6294 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6297 dim
->n_out
= nparam
;
6298 isl_set_reset_space(set
, dim
);
6299 set
= isl_set_preimage(set
, mat
);
6302 dim
= isl_space_copy(set
->dim
);
6303 dim
= isl_space_cow(dim
);
6306 dim
->nparam
= dim
->n_out
;
6308 isl_set_reset_space(set
, dim
);
6311 isl_space_free(dim
);
6318 /* Intersect the basic set "bset" with the affine space specified by the
6319 * equalities in "eq".
6321 static struct isl_basic_set
*basic_set_append_equalities(
6322 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6330 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6335 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6336 for (i
= 0; i
< eq
->n_row
; ++i
) {
6337 k
= isl_basic_set_alloc_equality(bset
);
6340 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6341 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6345 bset
= isl_basic_set_gauss(bset
, NULL
);
6346 bset
= isl_basic_set_finalize(bset
);
6351 isl_basic_set_free(bset
);
6355 /* Intersect the set "set" with the affine space specified by the
6356 * equalities in "eq".
6358 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6366 for (i
= 0; i
< set
->n
; ++i
) {
6367 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6380 /* Project the given basic set onto its parameter domain, possibly introducing
6381 * new, explicit, existential variables in the constraints.
6382 * The input has parameters and (possibly implicit) existential variables.
6383 * The output has the same parameters, but only
6384 * explicit existentially quantified variables.
6386 * The actual projection is performed by pip, but pip doesn't seem
6387 * to like equalities very much, so we first remove the equalities
6388 * among the parameters by performing a variable compression on
6389 * the parameters. Afterward, an inverse transformation is performed
6390 * and the equalities among the parameters are inserted back in.
6392 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6396 struct isl_mat
*T
, *T2
;
6397 struct isl_set
*set
;
6398 unsigned nparam
, n_div
;
6400 bset
= isl_basic_set_cow(bset
);
6404 if (bset
->n_eq
== 0)
6405 return isl_basic_set_lexmin(bset
);
6407 bset
= isl_basic_set_gauss(bset
, NULL
);
6410 if (isl_basic_set_plain_is_empty(bset
))
6411 return isl_set_from_basic_set(bset
);
6413 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6414 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6416 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6417 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6420 if (i
== bset
->n_eq
)
6421 return isl_basic_set_lexmin(bset
);
6423 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6425 eq
= isl_mat_cow(eq
);
6426 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6427 if (T
&& T
->n_col
== 0) {
6431 bset
= isl_basic_set_set_to_empty(bset
);
6432 return isl_set_from_basic_set(bset
);
6434 bset
= basic_set_parameter_preimage(bset
, T
);
6436 set
= isl_basic_set_lexmin(bset
);
6437 set
= set_parameter_preimage(set
, T2
);
6438 set
= set_append_equalities(set
, eq
);
6442 /* Insert the divs from "ls" before those of "bmap".
6444 * The number of columns is not changed, which means that the last
6445 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6446 * The caller is responsible for removing the same number of dimensions
6447 * from the space of "bmap".
6449 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6450 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6456 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6460 old_n_div
= bmap
->n_div
;
6461 bmap
= insert_div_rows(bmap
, n_div
);
6465 for (i
= 0; i
< n_div
; ++i
) {
6466 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6467 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6473 /* Replace the space of "bmap" by the space and divs of "ls".
6475 * If "ls" has any divs, then we simplify the result since we may
6476 * have discovered some additional equalities that could simplify
6477 * the div expressions.
6479 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6480 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6484 bmap
= isl_basic_map_cow(bmap
);
6488 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6489 bmap
= insert_divs_from_local_space(bmap
, ls
);
6493 isl_space_free(bmap
->dim
);
6494 bmap
->dim
= isl_local_space_get_space(ls
);
6498 isl_local_space_free(ls
);
6500 bmap
= isl_basic_map_simplify(bmap
);
6501 bmap
= isl_basic_map_finalize(bmap
);
6504 isl_basic_map_free(bmap
);
6505 isl_local_space_free(ls
);
6509 /* Replace the space of "map" by the space and divs of "ls".
6511 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6512 __isl_take isl_local_space
*ls
)
6516 map
= isl_map_cow(map
);
6520 for (i
= 0; i
< map
->n
; ++i
) {
6521 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6522 isl_local_space_copy(ls
));
6526 isl_space_free(map
->dim
);
6527 map
->dim
= isl_local_space_get_space(ls
);
6531 isl_local_space_free(ls
);
6534 isl_local_space_free(ls
);
6539 /* Compute an explicit representation for the existentially
6540 * quantified variables for which do not know any explicit representation yet.
6542 * We first sort the existentially quantified variables so that the
6543 * existentially quantified variables for which we already have an explicit
6544 * representation are placed before those for which we do not.
6545 * The input dimensions, the output dimensions and the existentially
6546 * quantified variables for which we already have an explicit
6547 * representation are then turned into parameters.
6548 * compute_divs returns a map with the same parameters and
6549 * no input or output dimensions and the dimension specification
6550 * is reset to that of the input, including the existentially quantified
6551 * variables for which we already had an explicit representation.
6553 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6555 struct isl_basic_set
*bset
;
6556 struct isl_set
*set
;
6557 struct isl_map
*map
;
6559 isl_local_space
*ls
;
6566 bmap
= isl_basic_map_sort_divs(bmap
);
6567 bmap
= isl_basic_map_cow(bmap
);
6571 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
6572 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
6575 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6576 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6577 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6578 dim
= isl_space_set_alloc(bmap
->ctx
,
6579 nparam
+ n_in
+ n_out
+ n_known
, 0);
6583 ls
= isl_basic_map_get_local_space(bmap
);
6584 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6585 n_known
, bmap
->n_div
- n_known
);
6587 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6588 swap_div(bmap
, i
- n_known
, i
);
6589 bmap
->n_div
-= n_known
;
6590 bmap
->extra
-= n_known
;
6592 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6593 bset
= (struct isl_basic_set
*)bmap
;
6595 set
= parameter_compute_divs(bset
);
6596 map
= (struct isl_map
*)set
;
6597 map
= replace_space_by_local_space(map
, ls
);
6601 isl_basic_map_free(bmap
);
6605 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6613 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6614 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6615 if (isl_int_is_zero(bmap
->div
[i
][0]))
6617 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6623 static int map_divs_known(__isl_keep isl_map
*map
)
6630 for (i
= 0; i
< map
->n
; ++i
) {
6631 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6639 /* If bmap contains any unknown divs, then compute explicit
6640 * expressions for them. However, this computation may be
6641 * quite expensive, so first try to remove divs that aren't
6644 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6647 struct isl_map
*map
;
6649 known
= isl_basic_map_divs_known(bmap
);
6653 return isl_map_from_basic_map(bmap
);
6655 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6657 known
= isl_basic_map_divs_known(bmap
);
6661 return isl_map_from_basic_map(bmap
);
6663 map
= compute_divs(bmap
);
6666 isl_basic_map_free(bmap
);
6670 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6674 struct isl_map
*res
;
6681 known
= map_divs_known(map
);
6689 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6690 for (i
= 1 ; i
< map
->n
; ++i
) {
6692 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6693 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6694 res
= isl_map_union_disjoint(res
, r2
);
6696 res
= isl_map_union(res
, r2
);
6703 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6705 return (struct isl_set
*)
6706 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6709 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6711 return (struct isl_set
*)
6712 isl_map_compute_divs((struct isl_map
*)set
);
6715 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6718 struct isl_set
*set
;
6723 map
= isl_map_cow(map
);
6727 set
= (struct isl_set
*)map
;
6728 set
->dim
= isl_space_domain(set
->dim
);
6731 for (i
= 0; i
< map
->n
; ++i
) {
6732 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6736 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6737 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6744 /* Return the union of "map1" and "map2", where we assume for now that
6745 * "map1" and "map2" are disjoint. Note that the basic maps inside
6746 * "map1" or "map2" may not be disjoint from each other.
6747 * Also note that this function is also called from isl_map_union,
6748 * which takes care of handling the situation where "map1" and "map2"
6749 * may not be disjoint.
6751 * If one of the inputs is empty, we can simply return the other input.
6752 * Similarly, if one of the inputs is universal, then it is equal to the union.
6754 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6755 __isl_take isl_map
*map2
)
6759 struct isl_map
*map
= NULL
;
6774 is_universe
= isl_map_plain_is_universe(map1
);
6775 if (is_universe
< 0)
6782 is_universe
= isl_map_plain_is_universe(map2
);
6783 if (is_universe
< 0)
6790 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6792 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6793 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6794 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6796 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6797 map1
->n
+ map2
->n
, flags
);
6800 for (i
= 0; i
< map1
->n
; ++i
) {
6801 map
= isl_map_add_basic_map(map
,
6802 isl_basic_map_copy(map1
->p
[i
]));
6806 for (i
= 0; i
< map2
->n
; ++i
) {
6807 map
= isl_map_add_basic_map(map
,
6808 isl_basic_map_copy(map2
->p
[i
]));
6822 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6823 __isl_take isl_map
*map2
)
6825 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6828 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6830 map1
= isl_map_union_disjoint(map1
, map2
);
6834 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6838 struct isl_set
*isl_set_union_disjoint(
6839 struct isl_set
*set1
, struct isl_set
*set2
)
6841 return (struct isl_set
*)
6842 isl_map_union_disjoint(
6843 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6846 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6848 return (struct isl_set
*)
6849 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6852 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6855 * "map" and "set" are assumed to be compatible and non-NULL.
6857 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6858 __isl_take isl_set
*set
,
6859 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6860 __isl_take isl_basic_set
*bset
))
6863 struct isl_map
*result
;
6866 if (isl_set_plain_is_universe(set
)) {
6871 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6872 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6873 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6875 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6876 map
->n
* set
->n
, flags
);
6877 for (i
= 0; result
&& i
< map
->n
; ++i
)
6878 for (j
= 0; j
< set
->n
; ++j
) {
6879 result
= isl_map_add_basic_map(result
,
6880 fn(isl_basic_map_copy(map
->p
[i
]),
6881 isl_basic_set_copy(set
->p
[j
])));
6891 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6892 __isl_take isl_set
*set
)
6897 if (!isl_map_compatible_range(map
, set
))
6898 isl_die(set
->ctx
, isl_error_invalid
,
6899 "incompatible spaces", goto error
);
6901 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6908 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6909 __isl_take isl_set
*set
)
6911 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6914 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
6915 __isl_take isl_set
*set
)
6920 if (!isl_map_compatible_domain(map
, set
))
6921 isl_die(set
->ctx
, isl_error_invalid
,
6922 "incompatible spaces", goto error
);
6924 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
6931 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
6932 __isl_take isl_set
*set
)
6934 return isl_map_align_params_map_map_and(map
, set
,
6935 &map_intersect_domain
);
6938 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6939 __isl_take isl_map
*map2
)
6943 map1
= isl_map_reverse(map1
);
6944 map1
= isl_map_apply_range(map1
, map2
);
6945 return isl_map_reverse(map1
);
6952 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6953 __isl_take isl_map
*map2
)
6955 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6958 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6959 __isl_take isl_map
*map2
)
6961 isl_space
*dim_result
;
6962 struct isl_map
*result
;
6968 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6969 isl_space_copy(map2
->dim
));
6971 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6974 for (i
= 0; i
< map1
->n
; ++i
)
6975 for (j
= 0; j
< map2
->n
; ++j
) {
6976 result
= isl_map_add_basic_map(result
,
6977 isl_basic_map_apply_range(
6978 isl_basic_map_copy(map1
->p
[i
]),
6979 isl_basic_map_copy(map2
->p
[j
])));
6985 if (result
&& result
->n
<= 1)
6986 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6994 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6995 __isl_take isl_map
*map2
)
6997 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7001 * returns range - domain
7003 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7005 isl_space
*dims
, *target_dim
;
7006 struct isl_basic_set
*bset
;
7013 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
7014 bmap
->dim
, isl_dim_out
),
7016 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7017 dim
= isl_basic_map_n_in(bmap
);
7018 nparam
= isl_basic_map_n_param(bmap
);
7019 bset
= isl_basic_set_from_basic_map(bmap
);
7020 bset
= isl_basic_set_cow(bset
);
7021 dims
= isl_basic_set_get_space(bset
);
7022 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7023 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7024 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7025 for (i
= 0; i
< dim
; ++i
) {
7026 int j
= isl_basic_map_alloc_equality(
7027 (struct isl_basic_map
*)bset
);
7029 bset
= isl_basic_set_free(bset
);
7032 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7033 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7034 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7035 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7037 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7038 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7041 isl_basic_map_free(bmap
);
7046 * returns range - domain
7048 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7052 struct isl_set
*result
;
7057 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
7058 map
->dim
, isl_dim_out
),
7060 dim
= isl_map_get_space(map
);
7061 dim
= isl_space_domain(dim
);
7062 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7065 for (i
= 0; i
< map
->n
; ++i
)
7066 result
= isl_set_add_basic_set(result
,
7067 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7076 * returns [domain -> range] -> range - domain
7078 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7079 __isl_take isl_basic_map
*bmap
)
7083 isl_basic_map
*domain
;
7087 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
7088 isl_die(bmap
->ctx
, isl_error_invalid
,
7089 "domain and range don't match", goto error
);
7091 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7092 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7094 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7095 domain
= isl_basic_map_universe(dim
);
7097 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7098 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7099 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7101 total
= isl_basic_map_total_dim(bmap
);
7103 for (i
= 0; i
< n
; ++i
) {
7104 k
= isl_basic_map_alloc_equality(bmap
);
7107 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7108 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7109 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7110 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7113 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7114 return isl_basic_map_finalize(bmap
);
7116 isl_basic_map_free(bmap
);
7121 * returns [domain -> range] -> range - domain
7123 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7126 isl_space
*domain_dim
;
7131 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
7132 isl_die(map
->ctx
, isl_error_invalid
,
7133 "domain and range don't match", goto error
);
7135 map
= isl_map_cow(map
);
7139 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7140 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7141 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7144 for (i
= 0; i
< map
->n
; ++i
) {
7145 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7149 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7156 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7158 struct isl_basic_map
*bmap
;
7166 nparam
= dims
->nparam
;
7168 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7172 for (i
= 0; i
< dim
; ++i
) {
7173 int j
= isl_basic_map_alloc_equality(bmap
);
7176 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7177 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7178 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7180 return isl_basic_map_finalize(bmap
);
7182 isl_basic_map_free(bmap
);
7186 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7190 if (dim
->n_in
!= dim
->n_out
)
7191 isl_die(dim
->ctx
, isl_error_invalid
,
7192 "number of input and output dimensions needs to be "
7193 "the same", goto error
);
7194 return basic_map_identity(dim
);
7196 isl_space_free(dim
);
7200 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7202 if (!model
|| !model
->dim
)
7204 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7207 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7209 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7212 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7214 if (!model
|| !model
->dim
)
7216 return isl_map_identity(isl_space_copy(model
->dim
));
7219 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7221 if (!model
|| !model
->dim
)
7223 return isl_map_identity(isl_space_copy(model
->dim
));
7226 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7228 isl_space
*dim
= isl_set_get_space(set
);
7230 id
= isl_map_identity(isl_space_map_from_set(dim
));
7231 return isl_map_intersect_range(id
, set
);
7234 /* Construct a basic set with all set dimensions having only non-negative
7237 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7238 __isl_take isl_space
*space
)
7243 struct isl_basic_set
*bset
;
7247 nparam
= space
->nparam
;
7249 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7252 for (i
= 0; i
< dim
; ++i
) {
7253 int k
= isl_basic_set_alloc_inequality(bset
);
7256 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7257 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7261 isl_basic_set_free(bset
);
7265 /* Construct the half-space x_pos >= 0.
7267 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7271 isl_basic_set
*nonneg
;
7273 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7274 k
= isl_basic_set_alloc_inequality(nonneg
);
7277 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7278 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7280 return isl_basic_set_finalize(nonneg
);
7282 isl_basic_set_free(nonneg
);
7286 /* Construct the half-space x_pos <= -1.
7288 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7293 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7294 k
= isl_basic_set_alloc_inequality(neg
);
7297 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7298 isl_int_set_si(neg
->ineq
[k
][0], -1);
7299 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7301 return isl_basic_set_finalize(neg
);
7303 isl_basic_set_free(neg
);
7307 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7308 enum isl_dim_type type
, unsigned first
, unsigned n
)
7311 isl_basic_set
*nonneg
;
7319 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7321 for (i
= 0; i
< n
; ++i
) {
7322 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7323 pos(set
->dim
, type
) + first
+ i
);
7324 neg
= neg_halfspace(isl_set_get_space(set
),
7325 pos(set
->dim
, type
) + first
+ i
);
7327 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7336 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7337 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7344 if (isl_set_plain_is_empty(set
)) {
7349 return fn(set
, signs
, user
);
7352 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7354 half
= isl_set_intersect(half
, isl_set_copy(set
));
7355 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7359 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7361 half
= isl_set_intersect(half
, set
);
7362 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7368 /* Call "fn" on the intersections of "set" with each of the orthants
7369 * (except for obviously empty intersections). The orthant is identified
7370 * by the signs array, with each entry having value 1 or -1 according
7371 * to the sign of the corresponding variable.
7373 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7374 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7384 if (isl_set_plain_is_empty(set
))
7387 nparam
= isl_set_dim(set
, isl_dim_param
);
7388 nvar
= isl_set_dim(set
, isl_dim_set
);
7390 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7392 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7400 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7402 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7405 int isl_basic_map_is_subset(
7406 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7409 struct isl_map
*map1
;
7410 struct isl_map
*map2
;
7412 if (!bmap1
|| !bmap2
)
7415 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7416 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7418 is_subset
= isl_map_is_subset(map1
, map2
);
7426 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7427 __isl_keep isl_basic_set
*bset2
)
7429 return isl_basic_map_is_subset(bset1
, bset2
);
7432 int isl_basic_map_is_equal(
7433 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7437 if (!bmap1
|| !bmap2
)
7439 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7442 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7446 int isl_basic_set_is_equal(
7447 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7449 return isl_basic_map_is_equal(
7450 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7453 int isl_map_is_empty(struct isl_map
*map
)
7460 for (i
= 0; i
< map
->n
; ++i
) {
7461 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7470 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7472 return map
? map
->n
== 0 : -1;
7475 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7477 return isl_map_plain_is_empty(map
);
7480 int isl_set_plain_is_empty(struct isl_set
*set
)
7482 return set
? set
->n
== 0 : -1;
7485 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7487 return isl_set_plain_is_empty(set
);
7490 int isl_set_is_empty(struct isl_set
*set
)
7492 return isl_map_is_empty((struct isl_map
*)set
);
7495 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7500 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7503 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7508 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7511 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7517 is_subset
= isl_map_is_subset(map1
, map2
);
7520 is_subset
= isl_map_is_subset(map2
, map1
);
7524 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7526 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7529 int isl_basic_map_is_strict_subset(
7530 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7534 if (!bmap1
|| !bmap2
)
7536 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7539 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7540 if (is_subset
== -1)
7545 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7551 is_subset
= isl_map_is_subset(map1
, map2
);
7554 is_subset
= isl_map_is_subset(map2
, map1
);
7555 if (is_subset
== -1)
7560 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7562 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7565 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7569 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7572 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7576 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7579 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7586 for (i
= 0; i
< map
->n
; ++i
) {
7587 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7595 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7597 return isl_map_plain_is_universe((isl_map
*) set
);
7600 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7602 return isl_set_plain_is_universe(set
);
7605 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7607 struct isl_basic_set
*bset
= NULL
;
7608 struct isl_vec
*sample
= NULL
;
7615 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7618 if (isl_basic_map_is_universe(bmap
))
7621 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7622 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7623 copy
= isl_basic_map_remove_redundancies(copy
);
7624 empty
= isl_basic_map_plain_is_empty(copy
);
7625 isl_basic_map_free(copy
);
7629 total
= 1 + isl_basic_map_total_dim(bmap
);
7630 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7631 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7637 isl_vec_free(bmap
->sample
);
7638 bmap
->sample
= NULL
;
7639 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7642 sample
= isl_basic_set_sample_vec(bset
);
7645 empty
= sample
->size
== 0;
7646 isl_vec_free(bmap
->sample
);
7647 bmap
->sample
= sample
;
7649 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7654 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7658 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7661 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7663 return isl_basic_map_plain_is_empty(bmap
);
7666 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7670 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7673 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7675 return isl_basic_set_plain_is_empty(bset
);
7678 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7680 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7683 struct isl_map
*isl_basic_map_union(
7684 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7686 struct isl_map
*map
;
7687 if (!bmap1
|| !bmap2
)
7690 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7692 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7695 map
= isl_map_add_basic_map(map
, bmap1
);
7696 map
= isl_map_add_basic_map(map
, bmap2
);
7699 isl_basic_map_free(bmap1
);
7700 isl_basic_map_free(bmap2
);
7704 struct isl_set
*isl_basic_set_union(
7705 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7707 return (struct isl_set
*)isl_basic_map_union(
7708 (struct isl_basic_map
*)bset1
,
7709 (struct isl_basic_map
*)bset2
);
7712 /* Order divs such that any div only depends on previous divs */
7713 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7721 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7723 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7725 if (isl_int_is_zero(bmap
->div
[i
][0]))
7727 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7731 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7737 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7739 return (struct isl_basic_set
*)
7740 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7743 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7750 for (i
= 0; i
< map
->n
; ++i
) {
7751 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7762 /* Apply the expansion computed by isl_merge_divs.
7763 * The expansion itself is given by "exp" while the resulting
7764 * list of divs is given by "div".
7766 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7767 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7772 bset
= isl_basic_set_cow(bset
);
7776 if (div
->n_row
< bset
->n_div
)
7777 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7778 "not an expansion", goto error
);
7780 n_div
= bset
->n_div
;
7781 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7782 div
->n_row
- n_div
, 0,
7783 2 * (div
->n_row
- n_div
));
7785 for (i
= n_div
; i
< div
->n_row
; ++i
)
7786 if (isl_basic_set_alloc_div(bset
) < 0)
7790 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7791 if (j
>= 0 && exp
[j
] == i
) {
7793 isl_basic_map_swap_div(bset
, i
, j
);
7796 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7797 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7805 isl_basic_set_free(bset
);
7810 /* Look for a div in dst that corresponds to the div "div" in src.
7811 * The divs before "div" in src and dst are assumed to be the same.
7813 * Returns -1 if no corresponding div was found and the position
7814 * of the corresponding div in dst otherwise.
7816 static int find_div(struct isl_basic_map
*dst
,
7817 struct isl_basic_map
*src
, unsigned div
)
7821 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7823 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7824 for (i
= div
; i
< dst
->n_div
; ++i
)
7825 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7826 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7827 dst
->n_div
- div
) == -1)
7832 struct isl_basic_map
*isl_basic_map_align_divs(
7833 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7841 if (src
->n_div
== 0)
7844 for (i
= 0; i
< src
->n_div
; ++i
)
7845 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7847 src
= isl_basic_map_order_divs(src
);
7848 dst
= isl_basic_map_cow(dst
);
7849 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7850 src
->n_div
, 0, 2 * src
->n_div
);
7853 total
= isl_space_dim(src
->dim
, isl_dim_all
);
7854 for (i
= 0; i
< src
->n_div
; ++i
) {
7855 int j
= find_div(dst
, src
, i
);
7857 j
= isl_basic_map_alloc_div(dst
);
7860 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7861 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7862 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7866 isl_basic_map_swap_div(dst
, i
, j
);
7870 isl_basic_map_free(dst
);
7874 struct isl_basic_set
*isl_basic_set_align_divs(
7875 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7877 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7878 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7881 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7889 map
= isl_map_compute_divs(map
);
7890 map
= isl_map_cow(map
);
7894 for (i
= 1; i
< map
->n
; ++i
)
7895 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7896 for (i
= 1; i
< map
->n
; ++i
)
7897 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7899 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7903 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7905 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7908 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7909 __isl_take isl_map
*map
)
7913 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7914 map
= isl_map_intersect_domain(map
, set
);
7915 set
= isl_map_range(map
);
7923 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7924 __isl_take isl_map
*map
)
7926 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7929 /* There is no need to cow as removing empty parts doesn't change
7930 * the meaning of the set.
7932 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7939 for (i
= map
->n
- 1; i
>= 0; --i
)
7940 remove_if_empty(map
, i
);
7945 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7947 return (struct isl_set
*)
7948 isl_map_remove_empty_parts((struct isl_map
*)set
);
7951 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7953 struct isl_basic_map
*bmap
;
7954 if (!map
|| map
->n
== 0)
7956 bmap
= map
->p
[map
->n
-1];
7957 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7958 return isl_basic_map_copy(bmap
);
7961 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7963 return (struct isl_basic_set
*)
7964 isl_map_copy_basic_map((struct isl_map
*)set
);
7967 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7968 __isl_keep isl_basic_map
*bmap
)
7974 for (i
= map
->n
-1; i
>= 0; --i
) {
7975 if (map
->p
[i
] != bmap
)
7977 map
= isl_map_cow(map
);
7980 isl_basic_map_free(map
->p
[i
]);
7981 if (i
!= map
->n
-1) {
7982 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7983 map
->p
[i
] = map
->p
[map
->n
-1];
7994 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7995 struct isl_basic_set
*bset
)
7997 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7998 (struct isl_basic_map
*)bset
);
8001 /* Given two basic sets bset1 and bset2, compute the maximal difference
8002 * between the values of dimension pos in bset1 and those in bset2
8003 * for any common value of the parameters and dimensions preceding pos.
8005 static enum isl_lp_result
basic_set_maximal_difference_at(
8006 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8007 int pos
, isl_int
*opt
)
8010 struct isl_basic_map
*bmap1
= NULL
;
8011 struct isl_basic_map
*bmap2
= NULL
;
8012 struct isl_ctx
*ctx
;
8013 struct isl_vec
*obj
;
8016 unsigned dim1
, dim2
;
8017 enum isl_lp_result res
;
8019 if (!bset1
|| !bset2
)
8020 return isl_lp_error
;
8022 nparam
= isl_basic_set_n_param(bset1
);
8023 dim1
= isl_basic_set_n_dim(bset1
);
8024 dim2
= isl_basic_set_n_dim(bset2
);
8025 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8026 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8027 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8028 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8029 if (!bmap1
|| !bmap2
)
8031 bmap1
= isl_basic_map_cow(bmap1
);
8032 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8033 pos
, (dim1
- pos
) + (dim2
- pos
),
8034 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8035 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8038 total
= isl_basic_map_total_dim(bmap1
);
8040 obj
= isl_vec_alloc(ctx
, 1 + total
);
8043 isl_seq_clr(obj
->block
.data
, 1 + total
);
8044 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8045 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8046 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8048 isl_basic_map_free(bmap1
);
8052 isl_basic_map_free(bmap2
);
8054 isl_basic_map_free(bmap1
);
8055 return isl_lp_error
;
8058 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8059 * for any common value of the parameters and dimensions preceding pos
8060 * in both basic sets, the values of dimension pos in bset1 are
8061 * smaller or larger than those in bset2.
8064 * 1 if bset1 follows bset2
8065 * -1 if bset1 precedes bset2
8066 * 0 if bset1 and bset2 are incomparable
8067 * -2 if some error occurred.
8069 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8070 struct isl_basic_set
*bset2
, int pos
)
8073 enum isl_lp_result res
;
8078 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8080 if (res
== isl_lp_empty
)
8082 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8083 res
== isl_lp_unbounded
)
8085 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8094 /* Given two basic sets bset1 and bset2, check whether
8095 * for any common value of the parameters and dimensions preceding pos
8096 * there is a value of dimension pos in bset1 that is larger
8097 * than a value of the same dimension in bset2.
8100 * 1 if there exists such a pair
8101 * 0 if there is no such pair, but there is a pair of equal values
8103 * -2 if some error occurred.
8105 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8106 __isl_keep isl_basic_set
*bset2
, int pos
)
8109 enum isl_lp_result res
;
8114 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8116 if (res
== isl_lp_empty
)
8118 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8119 res
== isl_lp_unbounded
)
8121 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8123 else if (res
== isl_lp_ok
)
8132 /* Given two sets set1 and set2, check whether
8133 * for any common value of the parameters and dimensions preceding pos
8134 * there is a value of dimension pos in set1 that is larger
8135 * than a value of the same dimension in set2.
8138 * 1 if there exists such a pair
8139 * 0 if there is no such pair, but there is a pair of equal values
8141 * -2 if some error occurred.
8143 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8144 __isl_keep isl_set
*set2
, int pos
)
8152 for (i
= 0; i
< set1
->n
; ++i
)
8153 for (j
= 0; j
< set2
->n
; ++j
) {
8155 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8156 if (f
== 1 || f
== -2)
8165 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8166 unsigned pos
, isl_int
*val
)
8174 total
= isl_basic_map_total_dim(bmap
);
8175 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8176 for (; d
+1 > pos
; --d
)
8177 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8181 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8183 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8185 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8188 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8194 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8195 unsigned pos
, isl_int
*val
)
8207 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8210 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8211 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8212 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8213 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8217 isl_int_set(*val
, v
);
8223 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8224 unsigned pos
, isl_int
*val
)
8226 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8230 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8233 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8236 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8237 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8239 if (pos
>= isl_basic_map_dim(bmap
, type
))
8241 return isl_basic_map_plain_has_fixed_var(bmap
,
8242 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8245 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8246 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8248 if (pos
>= isl_map_dim(map
, type
))
8250 return isl_map_plain_has_fixed_var(map
,
8251 map_offset(map
, type
) - 1 + pos
, val
);
8254 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8255 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8257 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8260 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8261 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8263 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8266 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8267 * then return this fixed value in *val.
8269 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8270 unsigned dim
, isl_int
*val
)
8272 return isl_basic_set_plain_has_fixed_var(bset
,
8273 isl_basic_set_n_param(bset
) + dim
, val
);
8276 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8277 * then return this fixed value in *val.
8279 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8280 unsigned dim
, isl_int
*val
)
8282 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8285 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8286 unsigned dim
, isl_int
*val
)
8288 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8291 /* Check if input variable in has fixed value and if so and if val is not NULL,
8292 * then return this fixed value in *val.
8294 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8295 unsigned in
, isl_int
*val
)
8297 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8300 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8301 * and if val is not NULL, then return this lower bound in *val.
8303 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8304 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8306 int i
, i_eq
= -1, i_ineq
= -1;
8313 total
= isl_basic_set_total_dim(bset
);
8314 nparam
= isl_basic_set_n_param(bset
);
8315 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8316 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8322 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8323 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8325 if (i_eq
!= -1 || i_ineq
!= -1)
8329 if (i_eq
== -1 && i_ineq
== -1)
8331 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8332 /* The coefficient should always be one due to normalization. */
8333 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8335 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8337 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8338 total
- nparam
- dim
- 1) != -1)
8341 isl_int_neg(*val
, c
[0]);
8345 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8346 unsigned dim
, isl_int
*val
)
8358 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8362 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8364 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8365 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8367 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8371 isl_int_set(*val
, v
);
8382 /* uset_gist depends on constraints without existentially quantified
8383 * variables sorting first.
8385 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8387 const struct constraint
*c1
= (const struct constraint
*)p1
;
8388 const struct constraint
*c2
= (const struct constraint
*)p2
;
8390 unsigned size
= isl_min(c1
->size
, c2
->size
);
8392 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8393 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8398 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8401 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8402 struct isl_basic_map
*bmap
)
8405 struct constraint
*c
;
8410 total
= isl_basic_map_total_dim(bmap
);
8411 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8414 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8416 c
[i
].c
= bmap
->ineq
[i
];
8418 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8419 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8420 bmap
->ineq
[i
] = c
[i
].c
;
8424 isl_basic_map_free(bmap
);
8428 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8429 __isl_take isl_basic_set
*bset
)
8431 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8432 (struct isl_basic_map
*)bset
);
8435 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8439 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8441 bmap
= isl_basic_map_remove_redundancies(bmap
);
8442 bmap
= isl_basic_map_sort_constraints(bmap
);
8444 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8448 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8450 return (struct isl_basic_set
*)isl_basic_map_normalize(
8451 (struct isl_basic_map
*)bset
);
8454 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8455 const __isl_keep isl_basic_map
*bmap2
)
8462 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8463 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8464 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8465 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8466 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8467 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8468 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8469 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8470 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8471 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8472 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8474 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8476 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8478 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8479 return bmap1
->n_eq
- bmap2
->n_eq
;
8480 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8481 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8482 if (bmap1
->n_div
!= bmap2
->n_div
)
8483 return bmap1
->n_div
- bmap2
->n_div
;
8484 total
= isl_basic_map_total_dim(bmap1
);
8485 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8486 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8490 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8491 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8495 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8496 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8503 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8504 const __isl_keep isl_basic_set
*bset2
)
8506 return isl_basic_map_plain_cmp(bset1
, bset2
);
8509 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8515 if (set1
->n
!= set2
->n
)
8516 return set1
->n
- set2
->n
;
8518 for (i
= 0; i
< set1
->n
; ++i
) {
8519 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8527 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8528 __isl_keep isl_basic_map
*bmap2
)
8530 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8533 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8534 __isl_keep isl_basic_set
*bset2
)
8536 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8537 (isl_basic_map
*)bset2
);
8540 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8542 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8543 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8545 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8548 /* We normalize in place, but if anything goes wrong we need
8549 * to return NULL, so we need to make sure we don't change the
8550 * meaning of any possible other copies of map.
8552 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8555 struct isl_basic_map
*bmap
;
8559 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8561 for (i
= 0; i
< map
->n
; ++i
) {
8562 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8565 isl_basic_map_free(map
->p
[i
]);
8568 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8569 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8570 map
= isl_map_remove_empty_parts(map
);
8573 for (i
= map
->n
- 1; i
>= 1; --i
) {
8574 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8576 isl_basic_map_free(map
->p
[i
-1]);
8577 for (j
= i
; j
< map
->n
; ++j
)
8578 map
->p
[j
-1] = map
->p
[j
];
8588 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8590 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8593 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8603 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8606 map1
= isl_map_copy(map1
);
8607 map2
= isl_map_copy(map2
);
8608 map1
= isl_map_normalize(map1
);
8609 map2
= isl_map_normalize(map2
);
8612 equal
= map1
->n
== map2
->n
;
8613 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8614 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8627 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8629 return isl_map_plain_is_equal(map1
, map2
);
8632 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8634 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8635 (struct isl_map
*)set2
);
8638 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8640 return isl_set_plain_is_equal(set1
, set2
);
8643 /* Return an interval that ranges from min to max (inclusive)
8645 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8646 isl_int min
, isl_int max
)
8649 struct isl_basic_set
*bset
= NULL
;
8651 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8655 k
= isl_basic_set_alloc_inequality(bset
);
8658 isl_int_set_si(bset
->ineq
[k
][1], 1);
8659 isl_int_neg(bset
->ineq
[k
][0], min
);
8661 k
= isl_basic_set_alloc_inequality(bset
);
8664 isl_int_set_si(bset
->ineq
[k
][1], -1);
8665 isl_int_set(bset
->ineq
[k
][0], max
);
8669 isl_basic_set_free(bset
);
8673 /* Return the Cartesian product of the basic sets in list (in the given order).
8675 __isl_give isl_basic_set
*isl_basic_set_list_product(
8676 __isl_take
struct isl_basic_set_list
*list
)
8684 struct isl_basic_set
*product
= NULL
;
8688 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8689 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8690 nparam
= isl_basic_set_n_param(list
->p
[0]);
8691 dim
= isl_basic_set_n_dim(list
->p
[0]);
8692 extra
= list
->p
[0]->n_div
;
8693 n_eq
= list
->p
[0]->n_eq
;
8694 n_ineq
= list
->p
[0]->n_ineq
;
8695 for (i
= 1; i
< list
->n
; ++i
) {
8696 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8697 isl_assert(list
->ctx
,
8698 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8699 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8700 extra
+= list
->p
[i
]->n_div
;
8701 n_eq
+= list
->p
[i
]->n_eq
;
8702 n_ineq
+= list
->p
[i
]->n_ineq
;
8704 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8709 for (i
= 0; i
< list
->n
; ++i
) {
8710 isl_basic_set_add_constraints(product
,
8711 isl_basic_set_copy(list
->p
[i
]), dim
);
8712 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8714 isl_basic_set_list_free(list
);
8717 isl_basic_set_free(product
);
8718 isl_basic_set_list_free(list
);
8722 struct isl_basic_map
*isl_basic_map_product(
8723 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8725 isl_space
*dim_result
= NULL
;
8726 struct isl_basic_map
*bmap
;
8727 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8728 struct isl_dim_map
*dim_map1
, *dim_map2
;
8730 if (!bmap1
|| !bmap2
)
8733 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8734 bmap2
->dim
, isl_dim_param
), goto error
);
8735 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8736 isl_space_copy(bmap2
->dim
));
8738 in1
= isl_basic_map_n_in(bmap1
);
8739 in2
= isl_basic_map_n_in(bmap2
);
8740 out1
= isl_basic_map_n_out(bmap1
);
8741 out2
= isl_basic_map_n_out(bmap2
);
8742 nparam
= isl_basic_map_n_param(bmap1
);
8744 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8745 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8746 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8747 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8748 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8749 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8750 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8751 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8752 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8753 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8754 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8756 bmap
= isl_basic_map_alloc_space(dim_result
,
8757 bmap1
->n_div
+ bmap2
->n_div
,
8758 bmap1
->n_eq
+ bmap2
->n_eq
,
8759 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8760 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8761 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8762 bmap
= isl_basic_map_simplify(bmap
);
8763 return isl_basic_map_finalize(bmap
);
8765 isl_basic_map_free(bmap1
);
8766 isl_basic_map_free(bmap2
);
8770 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8771 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8773 isl_basic_map
*prod
;
8775 prod
= isl_basic_map_product(bmap1
, bmap2
);
8776 prod
= isl_basic_map_flatten(prod
);
8780 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8781 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8783 return isl_basic_map_flat_range_product(bset1
, bset2
);
8786 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8787 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8789 isl_space
*space_result
= NULL
;
8790 isl_basic_map
*bmap
;
8791 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8792 struct isl_dim_map
*dim_map1
, *dim_map2
;
8794 if (!bmap1
|| !bmap2
)
8797 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8798 isl_space_copy(bmap2
->dim
));
8800 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8801 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8802 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8803 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8805 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8806 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8807 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8808 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8809 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8810 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8811 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8812 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8813 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8814 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8815 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8817 bmap
= isl_basic_map_alloc_space(space_result
,
8818 bmap1
->n_div
+ bmap2
->n_div
,
8819 bmap1
->n_eq
+ bmap2
->n_eq
,
8820 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8821 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8822 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8823 bmap
= isl_basic_map_simplify(bmap
);
8824 return isl_basic_map_finalize(bmap
);
8826 isl_basic_map_free(bmap1
);
8827 isl_basic_map_free(bmap2
);
8831 __isl_give isl_basic_map
*isl_basic_map_range_product(
8832 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8834 isl_space
*dim_result
= NULL
;
8835 isl_basic_map
*bmap
;
8836 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8837 struct isl_dim_map
*dim_map1
, *dim_map2
;
8839 if (!bmap1
|| !bmap2
)
8842 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8843 bmap2
->dim
, isl_dim_param
))
8844 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8845 "parameters don't match", goto error
);
8847 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8848 isl_space_copy(bmap2
->dim
));
8850 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8851 out1
= isl_basic_map_n_out(bmap1
);
8852 out2
= isl_basic_map_n_out(bmap2
);
8853 nparam
= isl_basic_map_n_param(bmap1
);
8855 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8856 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8857 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8858 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8859 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8860 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8861 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8862 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8863 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8864 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8865 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8867 bmap
= isl_basic_map_alloc_space(dim_result
,
8868 bmap1
->n_div
+ bmap2
->n_div
,
8869 bmap1
->n_eq
+ bmap2
->n_eq
,
8870 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8871 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8872 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8873 bmap
= isl_basic_map_simplify(bmap
);
8874 return isl_basic_map_finalize(bmap
);
8876 isl_basic_map_free(bmap1
);
8877 isl_basic_map_free(bmap2
);
8881 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8882 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8884 isl_basic_map
*prod
;
8886 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8887 prod
= isl_basic_map_flatten_range(prod
);
8891 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8892 __isl_take isl_map
*map2
,
8893 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8894 __isl_take isl_space
*right
),
8895 __isl_give isl_basic_map
*(*basic_map_product
)(
8896 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8899 struct isl_map
*result
;
8905 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8906 map2
->dim
, isl_dim_param
), goto error
);
8908 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8909 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8910 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8912 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8913 isl_space_copy(map2
->dim
)),
8914 map1
->n
* map2
->n
, flags
);
8917 for (i
= 0; i
< map1
->n
; ++i
)
8918 for (j
= 0; j
< map2
->n
; ++j
) {
8919 struct isl_basic_map
*part
;
8920 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8921 isl_basic_map_copy(map2
->p
[j
]));
8922 if (isl_basic_map_is_empty(part
))
8923 isl_basic_map_free(part
);
8925 result
= isl_map_add_basic_map(result
, part
);
8938 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8940 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8941 __isl_take isl_map
*map2
)
8943 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8946 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8947 __isl_take isl_map
*map2
)
8949 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8952 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8954 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8955 __isl_take isl_map
*map2
)
8959 prod
= isl_map_product(map1
, map2
);
8960 prod
= isl_map_flatten(prod
);
8964 /* Given two set A and B, construct its Cartesian product A x B.
8966 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8968 return isl_map_range_product(set1
, set2
);
8971 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8972 __isl_take isl_set
*set2
)
8974 return isl_map_flat_range_product(set1
, set2
);
8977 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8979 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8980 __isl_take isl_map
*map2
)
8982 return map_product(map1
, map2
, &isl_space_domain_product
,
8983 &isl_basic_map_domain_product
);
8986 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8988 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8989 __isl_take isl_map
*map2
)
8991 return map_product(map1
, map2
, &isl_space_range_product
,
8992 &isl_basic_map_range_product
);
8995 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8996 __isl_take isl_map
*map2
)
8998 return isl_map_align_params_map_map_and(map1
, map2
,
8999 &map_domain_product_aligned
);
9002 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9003 __isl_take isl_map
*map2
)
9005 return isl_map_align_params_map_map_and(map1
, map2
,
9006 &map_range_product_aligned
);
9009 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9011 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9012 __isl_take isl_map
*map2
)
9016 prod
= isl_map_domain_product(map1
, map2
);
9017 prod
= isl_map_flatten_domain(prod
);
9021 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9023 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9024 __isl_take isl_map
*map2
)
9028 prod
= isl_map_range_product(map1
, map2
);
9029 prod
= isl_map_flatten_range(prod
);
9033 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9036 uint32_t hash
= isl_hash_init();
9041 bmap
= isl_basic_map_copy(bmap
);
9042 bmap
= isl_basic_map_normalize(bmap
);
9045 total
= isl_basic_map_total_dim(bmap
);
9046 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9047 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9049 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9050 isl_hash_hash(hash
, c_hash
);
9052 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9053 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9055 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9056 isl_hash_hash(hash
, c_hash
);
9058 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9059 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9061 if (isl_int_is_zero(bmap
->div
[i
][0]))
9063 isl_hash_byte(hash
, i
& 0xFF);
9064 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9065 isl_hash_hash(hash
, c_hash
);
9067 isl_basic_map_free(bmap
);
9071 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9073 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9076 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9083 map
= isl_map_copy(map
);
9084 map
= isl_map_normalize(map
);
9088 hash
= isl_hash_init();
9089 for (i
= 0; i
< map
->n
; ++i
) {
9091 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9092 isl_hash_hash(hash
, bmap_hash
);
9100 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9102 return isl_map_get_hash((isl_map
*)set
);
9105 /* Check if the value for dimension dim is completely determined
9106 * by the values of the other parameters and variables.
9107 * That is, check if dimension dim is involved in an equality.
9109 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9116 nparam
= isl_basic_set_n_param(bset
);
9117 for (i
= 0; i
< bset
->n_eq
; ++i
)
9118 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9123 /* Check if the value for dimension dim is completely determined
9124 * by the values of the other parameters and variables.
9125 * That is, check if dimension dim is involved in an equality
9126 * for each of the subsets.
9128 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
9134 for (i
= 0; i
< set
->n
; ++i
) {
9136 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
9143 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9145 return set
? set
->n
: 0;
9148 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9149 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9156 for (i
= 0; i
< map
->n
; ++i
)
9157 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9163 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9164 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9171 for (i
= 0; i
< set
->n
; ++i
)
9172 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9178 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9185 bset
= isl_basic_set_cow(bset
);
9189 dim
= isl_basic_set_get_space(bset
);
9190 dim
= isl_space_lift(dim
, bset
->n_div
);
9193 isl_space_free(bset
->dim
);
9195 bset
->extra
-= bset
->n_div
;
9198 bset
= isl_basic_set_finalize(bset
);
9202 isl_basic_set_free(bset
);
9206 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9212 set
= isl_set_align_divs(set
);
9217 set
= isl_set_cow(set
);
9221 n_div
= set
->p
[0]->n_div
;
9222 dim
= isl_set_get_space(set
);
9223 dim
= isl_space_lift(dim
, n_div
);
9226 isl_space_free(set
->dim
);
9229 for (i
= 0; i
< set
->n
; ++i
) {
9230 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9241 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9244 struct isl_basic_map
*bmap
;
9251 set
= isl_set_align_divs(set
);
9256 dim
= isl_set_get_space(set
);
9257 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9259 return isl_map_identity(isl_space_map_from_set(dim
));
9262 n_div
= set
->p
[0]->n_div
;
9263 dim
= isl_space_map_from_set(dim
);
9264 n_param
= isl_space_dim(dim
, isl_dim_param
);
9265 n_set
= isl_space_dim(dim
, isl_dim_in
);
9266 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9267 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9268 for (i
= 0; i
< n_set
; ++i
)
9269 bmap
= var_equal(bmap
, i
);
9271 total
= n_param
+ n_set
+ n_set
+ n_div
;
9272 for (i
= 0; i
< n_div
; ++i
) {
9273 k
= isl_basic_map_alloc_inequality(bmap
);
9276 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9277 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9278 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9279 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9280 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9281 set
->p
[0]->div
[i
][0]);
9283 l
= isl_basic_map_alloc_inequality(bmap
);
9286 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9287 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9288 set
->p
[0]->div
[i
][0]);
9289 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9293 bmap
= isl_basic_map_simplify(bmap
);
9294 bmap
= isl_basic_map_finalize(bmap
);
9295 return isl_map_from_basic_map(bmap
);
9298 isl_basic_map_free(bmap
);
9302 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9310 dim
= isl_basic_set_total_dim(bset
);
9311 size
+= bset
->n_eq
* (1 + dim
);
9312 size
+= bset
->n_ineq
* (1 + dim
);
9313 size
+= bset
->n_div
* (2 + dim
);
9318 int isl_set_size(__isl_keep isl_set
*set
)
9326 for (i
= 0; i
< set
->n
; ++i
)
9327 size
+= isl_basic_set_size(set
->p
[i
]);
9332 /* Check if there is any lower bound (if lower == 0) and/or upper
9333 * bound (if upper == 0) on the specified dim.
9335 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9336 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9343 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9345 pos
+= isl_basic_map_offset(bmap
, type
);
9347 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9348 if (isl_int_is_zero(bmap
->div
[i
][0]))
9350 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9354 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9355 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9358 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9359 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9366 return lower
&& upper
;
9369 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9370 enum isl_dim_type type
, unsigned pos
)
9372 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9375 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9376 enum isl_dim_type type
, unsigned pos
)
9378 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9381 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9382 enum isl_dim_type type
, unsigned pos
)
9384 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9387 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9388 enum isl_dim_type type
, unsigned pos
)
9395 for (i
= 0; i
< map
->n
; ++i
) {
9397 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9398 if (bounded
< 0 || !bounded
)
9405 /* Return 1 if the specified dim is involved in both an upper bound
9406 * and a lower bound.
9408 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9409 enum isl_dim_type type
, unsigned pos
)
9411 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9414 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9416 static int has_any_bound(__isl_keep isl_map
*map
,
9417 enum isl_dim_type type
, unsigned pos
,
9418 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9419 enum isl_dim_type type
, unsigned pos
))
9426 for (i
= 0; i
< map
->n
; ++i
) {
9428 bounded
= fn(map
->p
[i
], type
, pos
);
9429 if (bounded
< 0 || bounded
)
9436 /* Return 1 if the specified dim is involved in any lower bound.
9438 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9439 enum isl_dim_type type
, unsigned pos
)
9441 return has_any_bound(set
, type
, pos
,
9442 &isl_basic_map_dim_has_lower_bound
);
9445 /* Return 1 if the specified dim is involved in any upper bound.
9447 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9448 enum isl_dim_type type
, unsigned pos
)
9450 return has_any_bound(set
, type
, pos
,
9451 &isl_basic_map_dim_has_upper_bound
);
9454 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9456 static int has_bound(__isl_keep isl_map
*map
,
9457 enum isl_dim_type type
, unsigned pos
,
9458 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9459 enum isl_dim_type type
, unsigned pos
))
9466 for (i
= 0; i
< map
->n
; ++i
) {
9468 bounded
= fn(map
->p
[i
], type
, pos
);
9469 if (bounded
< 0 || !bounded
)
9476 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9478 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9479 enum isl_dim_type type
, unsigned pos
)
9481 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9484 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9486 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9487 enum isl_dim_type type
, unsigned pos
)
9489 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9492 /* For each of the "n" variables starting at "first", determine
9493 * the sign of the variable and put the results in the first "n"
9494 * elements of the array "signs".
9496 * 1 means that the variable is non-negative
9497 * -1 means that the variable is non-positive
9498 * 0 means the variable attains both positive and negative values.
9500 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9501 unsigned first
, unsigned n
, int *signs
)
9503 isl_vec
*bound
= NULL
;
9504 struct isl_tab
*tab
= NULL
;
9505 struct isl_tab_undo
*snap
;
9508 if (!bset
|| !signs
)
9511 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9512 tab
= isl_tab_from_basic_set(bset
, 0);
9516 isl_seq_clr(bound
->el
, bound
->size
);
9517 isl_int_set_si(bound
->el
[0], -1);
9519 snap
= isl_tab_snap(tab
);
9520 for (i
= 0; i
< n
; ++i
) {
9523 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9524 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9527 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9528 if (isl_tab_rollback(tab
, snap
) < 0)
9536 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9537 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9540 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9541 if (isl_tab_rollback(tab
, snap
) < 0)
9544 signs
[i
] = empty
? -1 : 0;
9548 isl_vec_free(bound
);
9552 isl_vec_free(bound
);
9556 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9557 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9559 if (!bset
|| !signs
)
9561 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9564 first
+= pos(bset
->dim
, type
) - 1;
9565 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9568 /* Check if the given basic map is obviously single-valued.
9569 * In particular, for each output dimension, check that there is
9570 * an equality that defines the output dimension in terms of
9571 * earlier dimensions.
9573 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9583 total
= 1 + isl_basic_map_total_dim(bmap
);
9584 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9585 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9587 for (i
= 0; i
< n_out
; ++i
) {
9588 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9589 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9591 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9592 total
- (o_out
+ i
+ 1)) == -1)
9595 if (j
>= bmap
->n_eq
)
9602 /* Check if the given basic map is single-valued.
9607 * and check if the result is a subset of the identity mapping.
9609 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9612 isl_basic_map
*test
;
9616 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9620 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9621 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9623 space
= isl_basic_map_get_space(bmap
);
9624 space
= isl_space_map_from_set(isl_space_range(space
));
9625 id
= isl_basic_map_identity(space
);
9627 sv
= isl_basic_map_is_subset(test
, id
);
9629 isl_basic_map_free(test
);
9630 isl_basic_map_free(id
);
9635 /* Check if the given map is obviously single-valued.
9637 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9646 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9649 /* Check if the given map is single-valued.
9654 * and check if the result is a subset of the identity mapping.
9656 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9663 sv
= isl_map_plain_is_single_valued(map
);
9667 test
= isl_map_reverse(isl_map_copy(map
));
9668 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9670 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9671 id
= isl_map_identity(dim
);
9673 sv
= isl_map_is_subset(test
, id
);
9681 int isl_map_is_injective(__isl_keep isl_map
*map
)
9685 map
= isl_map_copy(map
);
9686 map
= isl_map_reverse(map
);
9687 in
= isl_map_is_single_valued(map
);
9693 /* Check if the given map is obviously injective.
9695 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9699 map
= isl_map_copy(map
);
9700 map
= isl_map_reverse(map
);
9701 in
= isl_map_plain_is_single_valued(map
);
9707 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9711 sv
= isl_map_is_single_valued(map
);
9715 return isl_map_is_injective(map
);
9718 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9720 return isl_map_is_single_valued((isl_map
*)set
);
9723 int isl_map_is_translation(__isl_keep isl_map
*map
)
9728 delta
= isl_map_deltas(isl_map_copy(map
));
9729 ok
= isl_set_is_singleton(delta
);
9730 isl_set_free(delta
);
9735 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9737 if (isl_seq_first_non_zero(p
, pos
) != -1)
9739 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9744 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9753 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9756 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9757 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9758 for (j
= 0; j
< nvar
; ++j
) {
9759 int lower
= 0, upper
= 0;
9760 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9761 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9763 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9769 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9770 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9772 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9774 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9779 if (!lower
|| !upper
)
9786 int isl_set_is_box(__isl_keep isl_set
*set
)
9793 return isl_basic_set_is_box(set
->p
[0]);
9796 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9801 return isl_space_is_wrapping(bset
->dim
);
9804 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9809 return isl_space_is_wrapping(set
->dim
);
9812 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9814 bmap
= isl_basic_map_cow(bmap
);
9818 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9822 bmap
= isl_basic_map_finalize(bmap
);
9824 return (isl_basic_set
*)bmap
;
9826 isl_basic_map_free(bmap
);
9830 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9834 map
= isl_map_cow(map
);
9838 for (i
= 0; i
< map
->n
; ++i
) {
9839 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9843 map
->dim
= isl_space_wrap(map
->dim
);
9847 return (isl_set
*)map
;
9853 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9855 bset
= isl_basic_set_cow(bset
);
9859 bset
->dim
= isl_space_unwrap(bset
->dim
);
9863 bset
= isl_basic_set_finalize(bset
);
9865 return (isl_basic_map
*)bset
;
9867 isl_basic_set_free(bset
);
9871 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9878 if (!isl_set_is_wrapping(set
))
9879 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9882 set
= isl_set_cow(set
);
9886 for (i
= 0; i
< set
->n
; ++i
) {
9887 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9892 set
->dim
= isl_space_unwrap(set
->dim
);
9896 return (isl_map
*)set
;
9902 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9903 enum isl_dim_type type
)
9908 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9911 bmap
= isl_basic_map_cow(bmap
);
9915 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9919 bmap
= isl_basic_map_finalize(bmap
);
9923 isl_basic_map_free(bmap
);
9927 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9928 enum isl_dim_type type
)
9935 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9938 map
= isl_map_cow(map
);
9942 for (i
= 0; i
< map
->n
; ++i
) {
9943 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9947 map
->dim
= isl_space_reset(map
->dim
, type
);
9957 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9962 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9965 bmap
= isl_basic_map_cow(bmap
);
9969 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9973 bmap
= isl_basic_map_finalize(bmap
);
9977 isl_basic_map_free(bmap
);
9981 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9983 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9986 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9987 __isl_take isl_basic_map
*bmap
)
9992 if (!bmap
->dim
->nested
[0])
9995 bmap
= isl_basic_map_cow(bmap
);
9999 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10003 bmap
= isl_basic_map_finalize(bmap
);
10007 isl_basic_map_free(bmap
);
10011 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10012 __isl_take isl_basic_map
*bmap
)
10017 if (!bmap
->dim
->nested
[1])
10020 bmap
= isl_basic_map_cow(bmap
);
10024 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
10028 bmap
= isl_basic_map_finalize(bmap
);
10032 isl_basic_map_free(bmap
);
10036 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
10043 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
10046 map
= isl_map_cow(map
);
10050 for (i
= 0; i
< map
->n
; ++i
) {
10051 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
10055 map
->dim
= isl_space_flatten(map
->dim
);
10065 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
10067 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
10070 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
10072 isl_space
*dim
, *flat_dim
;
10075 dim
= isl_set_get_space(set
);
10076 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
10077 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
10078 map
= isl_map_intersect_domain(map
, set
);
10083 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
10090 if (!map
->dim
->nested
[0])
10093 map
= isl_map_cow(map
);
10097 for (i
= 0; i
< map
->n
; ++i
) {
10098 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
10102 map
->dim
= isl_space_flatten_domain(map
->dim
);
10112 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
10119 if (!map
->dim
->nested
[1])
10122 map
= isl_map_cow(map
);
10126 for (i
= 0; i
< map
->n
; ++i
) {
10127 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
10131 map
->dim
= isl_space_flatten_range(map
->dim
);
10141 /* Reorder the dimensions of "bmap" according to the given dim_map
10142 * and set the dimension specification to "dim".
10144 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
10145 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
10147 isl_basic_map
*res
;
10150 bmap
= isl_basic_map_cow(bmap
);
10151 if (!bmap
|| !dim
|| !dim_map
)
10154 flags
= bmap
->flags
;
10155 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
10156 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
10157 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
10158 res
= isl_basic_map_alloc_space(dim
,
10159 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
10160 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
10162 res
->flags
= flags
;
10163 res
= isl_basic_map_finalize(res
);
10167 isl_basic_map_free(bmap
);
10168 isl_space_free(dim
);
10172 /* Reorder the dimensions of "map" according to given reordering.
10174 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
10175 __isl_take isl_reordering
*r
)
10178 struct isl_dim_map
*dim_map
;
10180 map
= isl_map_cow(map
);
10181 dim_map
= isl_dim_map_from_reordering(r
);
10182 if (!map
|| !r
|| !dim_map
)
10185 for (i
= 0; i
< map
->n
; ++i
) {
10186 struct isl_dim_map
*dim_map_i
;
10188 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10190 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10191 isl_space_copy(r
->dim
), dim_map_i
);
10197 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10199 isl_reordering_free(r
);
10205 isl_reordering_free(r
);
10209 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10210 __isl_take isl_reordering
*r
)
10212 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10215 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10216 __isl_take isl_space
*model
)
10220 if (!map
|| !model
)
10223 ctx
= isl_space_get_ctx(model
);
10224 if (!isl_space_has_named_params(model
))
10225 isl_die(ctx
, isl_error_invalid
,
10226 "model has unnamed parameters", goto error
);
10227 if (!isl_space_has_named_params(map
->dim
))
10228 isl_die(ctx
, isl_error_invalid
,
10229 "relation has unnamed parameters", goto error
);
10230 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10231 isl_reordering
*exp
;
10233 model
= isl_space_drop_dims(model
, isl_dim_in
,
10234 0, isl_space_dim(model
, isl_dim_in
));
10235 model
= isl_space_drop_dims(model
, isl_dim_out
,
10236 0, isl_space_dim(model
, isl_dim_out
));
10237 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10238 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10239 map
= isl_map_realign(map
, exp
);
10242 isl_space_free(model
);
10245 isl_space_free(model
);
10250 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10251 __isl_take isl_space
*model
)
10253 return isl_map_align_params(set
, model
);
10256 /* Align the parameters of "bmap" to those of "model", introducing
10257 * additional parameters if needed.
10259 __isl_give isl_basic_map
*isl_basic_map_align_params(
10260 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10264 if (!bmap
|| !model
)
10267 ctx
= isl_space_get_ctx(model
);
10268 if (!isl_space_has_named_params(model
))
10269 isl_die(ctx
, isl_error_invalid
,
10270 "model has unnamed parameters", goto error
);
10271 if (!isl_space_has_named_params(bmap
->dim
))
10272 isl_die(ctx
, isl_error_invalid
,
10273 "relation has unnamed parameters", goto error
);
10274 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10275 isl_reordering
*exp
;
10276 struct isl_dim_map
*dim_map
;
10278 model
= isl_space_drop_dims(model
, isl_dim_in
,
10279 0, isl_space_dim(model
, isl_dim_in
));
10280 model
= isl_space_drop_dims(model
, isl_dim_out
,
10281 0, isl_space_dim(model
, isl_dim_out
));
10282 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10283 exp
= isl_reordering_extend_space(exp
,
10284 isl_basic_map_get_space(bmap
));
10285 dim_map
= isl_dim_map_from_reordering(exp
);
10286 bmap
= isl_basic_map_realign(bmap
,
10287 exp
? isl_space_copy(exp
->dim
) : NULL
,
10288 isl_dim_map_extend(dim_map
, bmap
));
10289 isl_reordering_free(exp
);
10293 isl_space_free(model
);
10296 isl_space_free(model
);
10297 isl_basic_map_free(bmap
);
10301 /* Align the parameters of "bset" to those of "model", introducing
10302 * additional parameters if needed.
10304 __isl_give isl_basic_set
*isl_basic_set_align_params(
10305 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10307 return isl_basic_map_align_params(bset
, model
);
10310 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10311 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10312 enum isl_dim_type c2
, enum isl_dim_type c3
,
10313 enum isl_dim_type c4
, enum isl_dim_type c5
)
10315 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10316 struct isl_mat
*mat
;
10322 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10323 isl_basic_map_total_dim(bmap
) + 1);
10326 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10327 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10328 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10329 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10330 isl_int_set(mat
->row
[i
][pos
],
10331 bmap
->eq
[i
][off
+ k
]);
10339 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10340 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10341 enum isl_dim_type c2
, enum isl_dim_type c3
,
10342 enum isl_dim_type c4
, enum isl_dim_type c5
)
10344 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10345 struct isl_mat
*mat
;
10351 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10352 isl_basic_map_total_dim(bmap
) + 1);
10355 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10356 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10357 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10358 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10359 isl_int_set(mat
->row
[i
][pos
],
10360 bmap
->ineq
[i
][off
+ k
]);
10368 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10369 __isl_take isl_space
*dim
,
10370 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10371 enum isl_dim_type c2
, enum isl_dim_type c3
,
10372 enum isl_dim_type c4
, enum isl_dim_type c5
)
10374 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10375 isl_basic_map
*bmap
;
10381 if (!dim
|| !eq
|| !ineq
)
10384 if (eq
->n_col
!= ineq
->n_col
)
10385 isl_die(dim
->ctx
, isl_error_invalid
,
10386 "equalities and inequalities matrices should have "
10387 "same number of columns", goto error
);
10389 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10391 if (eq
->n_col
< total
)
10392 isl_die(dim
->ctx
, isl_error_invalid
,
10393 "number of columns too small", goto error
);
10395 extra
= eq
->n_col
- total
;
10397 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10398 eq
->n_row
, ineq
->n_row
);
10401 for (i
= 0; i
< extra
; ++i
) {
10402 k
= isl_basic_map_alloc_div(bmap
);
10405 isl_int_set_si(bmap
->div
[k
][0], 0);
10407 for (i
= 0; i
< eq
->n_row
; ++i
) {
10408 l
= isl_basic_map_alloc_equality(bmap
);
10411 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10412 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10413 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10414 isl_int_set(bmap
->eq
[l
][off
+ k
],
10420 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10421 l
= isl_basic_map_alloc_inequality(bmap
);
10424 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10425 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10426 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10427 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10428 ineq
->row
[i
][pos
]);
10434 isl_space_free(dim
);
10436 isl_mat_free(ineq
);
10438 bmap
= isl_basic_map_simplify(bmap
);
10439 return isl_basic_map_finalize(bmap
);
10441 isl_space_free(dim
);
10443 isl_mat_free(ineq
);
10447 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10448 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10449 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10451 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10452 c1
, c2
, c3
, c4
, isl_dim_in
);
10455 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10456 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10457 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10459 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10460 c1
, c2
, c3
, c4
, isl_dim_in
);
10463 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10464 __isl_take isl_space
*dim
,
10465 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10466 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10468 return (isl_basic_set
*)
10469 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10470 c1
, c2
, c3
, c4
, isl_dim_in
);
10473 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10478 return isl_space_can_zip(bmap
->dim
);
10481 int isl_map_can_zip(__isl_keep isl_map
*map
)
10486 return isl_space_can_zip(map
->dim
);
10489 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10490 * (A -> C) -> (B -> D).
10492 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10501 if (!isl_basic_map_can_zip(bmap
))
10502 isl_die(bmap
->ctx
, isl_error_invalid
,
10503 "basic map cannot be zipped", goto error
);
10504 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10505 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10506 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10507 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10508 bmap
= isl_basic_map_cow(bmap
);
10509 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10512 bmap
->dim
= isl_space_zip(bmap
->dim
);
10517 isl_basic_map_free(bmap
);
10521 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10522 * (A -> C) -> (B -> D).
10524 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10531 if (!isl_map_can_zip(map
))
10532 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10535 map
= isl_map_cow(map
);
10539 for (i
= 0; i
< map
->n
; ++i
) {
10540 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10545 map
->dim
= isl_space_zip(map
->dim
);
10555 /* Can we apply isl_basic_map_curry to "bmap"?
10556 * That is, does it have a nested relation in its domain?
10558 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10563 return isl_space_can_curry(bmap
->dim
);
10566 /* Can we apply isl_map_curry to "map"?
10567 * That is, does it have a nested relation in its domain?
10569 int isl_map_can_curry(__isl_keep isl_map
*map
)
10574 return isl_space_can_curry(map
->dim
);
10577 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10580 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10586 if (!isl_basic_map_can_curry(bmap
))
10587 isl_die(bmap
->ctx
, isl_error_invalid
,
10588 "basic map cannot be curried", goto error
);
10589 bmap
= isl_basic_map_cow(bmap
);
10592 bmap
->dim
= isl_space_curry(bmap
->dim
);
10597 isl_basic_map_free(bmap
);
10601 /* Given a map (A -> B) -> C, return the corresponding map
10604 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10611 if (!isl_map_can_curry(map
))
10612 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10615 map
= isl_map_cow(map
);
10619 for (i
= 0; i
< map
->n
; ++i
) {
10620 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10625 map
->dim
= isl_space_curry(map
->dim
);
10635 /* Can we apply isl_basic_map_uncurry to "bmap"?
10636 * That is, does it have a nested relation in its domain?
10638 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10643 return isl_space_can_uncurry(bmap
->dim
);
10646 /* Can we apply isl_map_uncurry to "map"?
10647 * That is, does it have a nested relation in its domain?
10649 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10654 return isl_space_can_uncurry(map
->dim
);
10657 /* Given a basic map A -> (B -> C), return the corresponding basic map
10660 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10666 if (!isl_basic_map_can_uncurry(bmap
))
10667 isl_die(bmap
->ctx
, isl_error_invalid
,
10668 "basic map cannot be uncurried",
10669 return isl_basic_map_free(bmap
));
10670 bmap
= isl_basic_map_cow(bmap
);
10673 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10675 return isl_basic_map_free(bmap
);
10679 /* Given a map A -> (B -> C), return the corresponding map
10682 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10689 if (!isl_map_can_uncurry(map
))
10690 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10691 return isl_map_free(map
));
10693 map
= isl_map_cow(map
);
10697 for (i
= 0; i
< map
->n
; ++i
) {
10698 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10700 return isl_map_free(map
);
10703 map
->dim
= isl_space_uncurry(map
->dim
);
10705 return isl_map_free(map
);
10710 /* Construct a basic map mapping the domain of the affine expression
10711 * to a one-dimensional range prescribed by the affine expression.
10713 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10717 isl_local_space
*ls
;
10718 isl_basic_map
*bmap
;
10723 ls
= isl_aff_get_local_space(aff
);
10724 bmap
= isl_basic_map_from_local_space(ls
);
10725 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10726 k
= isl_basic_map_alloc_equality(bmap
);
10730 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10731 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10732 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10733 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10734 aff
->v
->size
- (pos
+ 1));
10737 bmap
= isl_basic_map_finalize(bmap
);
10741 isl_basic_map_free(bmap
);
10745 /* Construct a map mapping the domain of the affine expression
10746 * to a one-dimensional range prescribed by the affine expression.
10748 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10750 isl_basic_map
*bmap
;
10752 bmap
= isl_basic_map_from_aff(aff
);
10753 return isl_map_from_basic_map(bmap
);
10756 /* Construct a basic map mapping the domain the multi-affine expression
10757 * to its range, with each dimension in the range equated to the
10758 * corresponding affine expression.
10760 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10761 __isl_take isl_multi_aff
*maff
)
10765 isl_basic_map
*bmap
;
10770 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10771 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10772 "invalid space", return isl_multi_aff_free(maff
));
10774 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10775 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10777 for (i
= 0; i
< maff
->n
; ++i
) {
10779 isl_basic_map
*bmap_i
;
10781 aff
= isl_aff_copy(maff
->p
[i
]);
10782 bmap_i
= isl_basic_map_from_aff(aff
);
10784 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10787 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10789 isl_multi_aff_free(maff
);
10793 /* Construct a map mapping the domain the multi-affine expression
10794 * to its range, with each dimension in the range equated to the
10795 * corresponding affine expression.
10797 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10799 isl_basic_map
*bmap
;
10801 bmap
= isl_basic_map_from_multi_aff(maff
);
10802 return isl_map_from_basic_map(bmap
);
10805 /* Construct a basic map mapping a domain in the given space to
10806 * to an n-dimensional range, with n the number of elements in the list,
10807 * where each coordinate in the range is prescribed by the
10808 * corresponding affine expression.
10809 * The domains of all affine expressions in the list are assumed to match
10812 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10813 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10817 isl_basic_map
*bmap
;
10822 dim
= isl_space_from_domain(domain_dim
);
10823 bmap
= isl_basic_map_universe(dim
);
10825 for (i
= 0; i
< list
->n
; ++i
) {
10827 isl_basic_map
*bmap_i
;
10829 aff
= isl_aff_copy(list
->p
[i
]);
10830 bmap_i
= isl_basic_map_from_aff(aff
);
10832 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10835 isl_aff_list_free(list
);
10839 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10840 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10842 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10845 /* Construct a basic map where the given dimensions are equal to each other.
10847 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10848 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10850 isl_basic_map
*bmap
= NULL
;
10856 if (pos1
>= isl_space_dim(space
, type1
))
10857 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10858 "index out of bounds", goto error
);
10859 if (pos2
>= isl_space_dim(space
, type2
))
10860 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10861 "index out of bounds", goto error
);
10863 if (type1
== type2
&& pos1
== pos2
)
10864 return isl_basic_map_universe(space
);
10866 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10867 i
= isl_basic_map_alloc_equality(bmap
);
10870 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10871 pos1
+= isl_basic_map_offset(bmap
, type1
);
10872 pos2
+= isl_basic_map_offset(bmap
, type2
);
10873 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10874 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10875 bmap
= isl_basic_map_finalize(bmap
);
10876 isl_space_free(space
);
10879 isl_space_free(space
);
10880 isl_basic_map_free(bmap
);
10884 /* Add a constraint imposing that the given two dimensions are equal.
10886 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10887 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10891 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10893 bmap
= isl_basic_map_intersect(bmap
, eq
);
10898 /* Add a constraint imposing that the given two dimensions are equal.
10900 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10901 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10903 isl_basic_map
*bmap
;
10905 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10907 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10912 /* Add a constraint imposing that the given two dimensions have opposite values.
10914 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10915 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10917 isl_basic_map
*bmap
= NULL
;
10923 if (pos1
>= isl_map_dim(map
, type1
))
10924 isl_die(map
->ctx
, isl_error_invalid
,
10925 "index out of bounds", goto error
);
10926 if (pos2
>= isl_map_dim(map
, type2
))
10927 isl_die(map
->ctx
, isl_error_invalid
,
10928 "index out of bounds", goto error
);
10930 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10931 i
= isl_basic_map_alloc_equality(bmap
);
10934 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10935 pos1
+= isl_basic_map_offset(bmap
, type1
);
10936 pos2
+= isl_basic_map_offset(bmap
, type2
);
10937 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10938 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10939 bmap
= isl_basic_map_finalize(bmap
);
10941 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10945 isl_basic_map_free(bmap
);
10950 /* Add a constraint imposing that the value of the first dimension is
10951 * greater than or equal to that of the second.
10953 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10954 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10957 isl_local_space
*ls
;
10962 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10963 isl_die(bmap
->ctx
, isl_error_invalid
,
10964 "index out of bounds", return isl_basic_map_free(bmap
));
10965 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10966 isl_die(bmap
->ctx
, isl_error_invalid
,
10967 "index out of bounds", return isl_basic_map_free(bmap
));
10969 if (type1
== type2
&& pos1
== pos2
)
10972 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10973 c
= isl_inequality_alloc(ls
);
10974 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10975 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10976 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10981 /* Add a constraint imposing that the value of the first dimension is
10982 * greater than that of the second.
10984 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10985 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10987 isl_basic_map
*bmap
= NULL
;
10993 if (pos1
>= isl_map_dim(map
, type1
))
10994 isl_die(map
->ctx
, isl_error_invalid
,
10995 "index out of bounds", goto error
);
10996 if (pos2
>= isl_map_dim(map
, type2
))
10997 isl_die(map
->ctx
, isl_error_invalid
,
10998 "index out of bounds", goto error
);
11000 if (type1
== type2
&& pos1
== pos2
) {
11001 isl_space
*space
= isl_map_get_space(map
);
11003 return isl_map_empty(space
);
11006 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
11007 i
= isl_basic_map_alloc_inequality(bmap
);
11010 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11011 pos1
+= isl_basic_map_offset(bmap
, type1
);
11012 pos2
+= isl_basic_map_offset(bmap
, type2
);
11013 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
11014 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
11015 isl_int_set_si(bmap
->ineq
[i
][0], -1);
11016 bmap
= isl_basic_map_finalize(bmap
);
11018 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11022 isl_basic_map_free(bmap
);
11027 /* Add a constraint imposing that the value of the first dimension is
11028 * smaller than that of the second.
11030 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
11031 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11033 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
11036 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
11040 isl_local_space
*ls
;
11045 if (!isl_basic_map_divs_known(bmap
))
11046 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11047 "some divs are unknown", return NULL
);
11049 ls
= isl_basic_map_get_local_space(bmap
);
11050 div
= isl_local_space_get_div(ls
, pos
);
11051 isl_local_space_free(ls
);
11056 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
11059 return isl_basic_map_get_div(bset
, pos
);
11062 /* Plug in "subs" for dimension "type", "pos" of "bset".
11064 * Let i be the dimension to replace and let "subs" be of the form
11068 * Any integer division with a non-zero coefficient for i,
11070 * floor((a i + g)/m)
11074 * floor((a f + d g)/(m d))
11076 * Constraints of the form
11084 * We currently require that "subs" is an integral expression.
11085 * Handling rational expressions may require us to add stride constraints
11086 * as we do in isl_basic_set_preimage_multi_aff.
11088 __isl_give isl_basic_set
*isl_basic_set_substitute(
11089 __isl_take isl_basic_set
*bset
,
11090 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11096 if (bset
&& isl_basic_set_plain_is_empty(bset
))
11099 bset
= isl_basic_set_cow(bset
);
11100 if (!bset
|| !subs
)
11103 ctx
= isl_basic_set_get_ctx(bset
);
11104 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
11105 isl_die(ctx
, isl_error_invalid
,
11106 "spaces don't match", goto error
);
11107 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
11108 isl_die(ctx
, isl_error_unsupported
,
11109 "cannot handle divs yet", goto error
);
11110 if (!isl_int_is_one(subs
->v
->el
[0]))
11111 isl_die(ctx
, isl_error_invalid
,
11112 "can only substitute integer expressions", goto error
);
11114 pos
+= isl_basic_set_offset(bset
, type
);
11118 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11119 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
11121 isl_int_set(v
, bset
->eq
[i
][pos
]);
11122 isl_int_set_si(bset
->eq
[i
][pos
], 0);
11123 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
11124 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11127 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11128 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
11130 isl_int_set(v
, bset
->ineq
[i
][pos
]);
11131 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
11132 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
11133 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11136 for (i
= 0; i
< bset
->n_div
; ++i
) {
11137 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
11139 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
11140 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
11141 isl_seq_combine(bset
->div
[i
] + 1,
11142 subs
->v
->el
[0], bset
->div
[i
] + 1,
11143 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11144 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
11149 bset
= isl_basic_set_simplify(bset
);
11150 return isl_basic_set_finalize(bset
);
11152 isl_basic_set_free(bset
);
11156 /* Plug in "subs" for dimension "type", "pos" of "set".
11158 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
11159 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11163 if (set
&& isl_set_plain_is_empty(set
))
11166 set
= isl_set_cow(set
);
11170 for (i
= set
->n
- 1; i
>= 0; --i
) {
11171 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
11172 if (remove_if_empty(set
, i
) < 0)
11182 /* Check if the range of "ma" is compatible with "space".
11183 * Return -1 if anything is wrong.
11185 static int check_space_compatible_range_multi_aff(
11186 __isl_keep isl_space
*space
, __isl_keep isl_multi_aff
*ma
)
11189 isl_space
*ma_space
;
11191 ma_space
= isl_multi_aff_get_space(ma
);
11192 m
= isl_space_is_range_internal(space
, ma_space
);
11193 isl_space_free(ma_space
);
11195 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11196 "spaces don't match", return -1);
11200 /* Check if the range of "ma" is compatible with "bset".
11201 * Return -1 if anything is wrong.
11203 static int check_basic_set_compatible_range_multi_aff(
11204 __isl_keep isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11206 return check_space_compatible_range_multi_aff(bset
->dim
, ma
);
11209 /* Copy the divs from "ma" to "bset", adding zeros for the coefficients
11210 * of the other divs in "bset".
11212 static int set_ma_divs(__isl_keep isl_basic_set
*bset
,
11213 __isl_keep isl_multi_aff
*ma
, int n_div
)
11216 isl_local_space
*ls
;
11221 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11225 for (i
= 0; i
< n_div
; ++i
) {
11226 isl_seq_cpy(bset
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
11227 isl_seq_clr(bset
->div
[i
] + ls
->div
->n_col
, bset
->n_div
- n_div
);
11228 if (isl_basic_set_add_div_constraints(bset
, i
) < 0)
11232 isl_local_space_free(ls
);
11235 isl_local_space_free(ls
);
11239 /* How many stride constraints does "ma" enforce?
11240 * That is, how many of the affine expressions have a denominator
11241 * different from one?
11243 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11248 for (i
= 0; i
< ma
->n
; ++i
)
11249 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11255 /* For each affine expression in ma of the form
11257 * x_i = (f_i y + h_i)/m_i
11259 * with m_i different from one, add a constraint to "bset"
11262 * f_i y + h_i = m_i alpha_i
11264 * with alpha_i an additional existentially quantified variable.
11266 static __isl_give isl_basic_set
*add_ma_strides(
11267 __isl_take isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11273 total
= isl_basic_set_total_dim(bset
);
11274 for (i
= 0; i
< ma
->n
; ++i
) {
11277 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11279 div
= isl_basic_set_alloc_div(bset
);
11280 k
= isl_basic_set_alloc_equality(bset
);
11281 if (div
< 0 || k
< 0)
11283 isl_int_set_si(bset
->div
[div
][0], 0);
11284 len
= ma
->p
[i
]->v
->size
;
11285 isl_seq_cpy(bset
->eq
[k
], ma
->p
[i
]->v
->el
+ 1, len
- 1);
11286 isl_seq_clr(bset
->eq
[k
] + len
- 1, 1 + total
- (len
- 1));
11287 isl_int_neg(bset
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11293 isl_basic_set_free(bset
);
11297 /* Compute the preimage of "bset" under the function represented by "ma".
11298 * In other words, plug in "ma" in "bset". The result is a basic set
11299 * that lives in the domain space of "ma".
11301 * If bset is represented by
11303 * A(p) + B x + C(divs) >= 0
11305 * and ma is represented by
11307 * x = D(p) + F(y) + G(divs')
11309 * then the result is
11311 * A(p) + B D(p) + B F(y) + B G(divs') + C(divs) >= 0
11313 * The divs in the input set are similarly adjusted.
11316 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
11320 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
11322 * If bset is not a rational set and if F(y) involves any denominators
11324 * x_i = (f_i y + h_i)/m_i
11326 * the additional constraints are added to ensure that we only
11327 * map back integer points. That is we enforce
11329 * f_i y + h_i = m_i alpha_i
11331 * with alpha_i an additional existentially quantified variable.
11333 * We first copy over the divs from "ma".
11334 * Then we add the modified constraints and divs from "bset".
11335 * Finally, we add the stride constraints, if needed.
11337 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11338 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11342 isl_basic_set
*res
= NULL
;
11343 int n_div_bset
, n_div_ma
;
11344 isl_int f
, c1
, c2
, g
;
11345 int rational
, strides
;
11352 ma
= isl_multi_aff_align_divs(ma
);
11355 if (check_basic_set_compatible_range_multi_aff(bset
, ma
) < 0)
11358 n_div_bset
= isl_basic_set_dim(bset
, isl_dim_div
);
11359 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11361 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
11362 rational
= isl_basic_set_is_rational(bset
);
11363 strides
= rational
? 0 : multi_aff_strides(ma
);
11364 res
= isl_basic_set_alloc_space(space
, n_div_ma
+ n_div_bset
+ strides
,
11365 bset
->n_eq
+ strides
, bset
->n_ineq
+ 2 * n_div_ma
);
11367 res
= isl_basic_set_set_rational(res
);
11369 for (i
= 0; i
< n_div_ma
+ n_div_bset
; ++i
)
11370 if (isl_basic_set_alloc_div(res
) < 0)
11373 if (set_ma_divs(res
, ma
, n_div_ma
) < 0)
11376 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11377 k
= isl_basic_set_alloc_equality(res
);
11380 isl_seq_preimage(res
->eq
[k
], bset
->eq
[i
], ma
, n_div_ma
,
11381 n_div_bset
, f
, c1
, c2
, g
, 0);
11384 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11385 k
= isl_basic_set_alloc_inequality(res
);
11388 isl_seq_preimage(res
->ineq
[k
], bset
->ineq
[i
], ma
, n_div_ma
,
11389 n_div_bset
, f
, c1
, c2
, g
, 0);
11392 for (i
= 0; i
< bset
->n_div
; ++i
) {
11393 if (isl_int_is_zero(bset
->div
[i
][0])) {
11394 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11397 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bset
->div
[i
],
11398 ma
, n_div_ma
, n_div_bset
, f
, c1
, c2
, g
, 1);
11402 res
= add_ma_strides(res
, ma
);
11408 isl_basic_set_free(bset
);
11409 isl_multi_aff_free(ma
);
11410 res
= isl_basic_set_simplify(res
);
11411 return isl_basic_set_finalize(res
);
11417 isl_basic_set_free(bset
);
11418 isl_multi_aff_free(ma
);
11419 isl_basic_set_free(res
);
11423 /* Check if the range of "ma" is compatible with "set".
11424 * Return -1 if anything is wrong.
11426 static int check_set_compatible_range_multi_aff(
11427 __isl_keep isl_set
*set
, __isl_keep isl_multi_aff
*ma
)
11429 return check_space_compatible_range_multi_aff(set
->dim
, ma
);
11432 /* Compute the preimage of "set" under the function represented by "ma".
11433 * In other words, plug in "ma" in "set. The result is a set
11434 * that lives in the domain space of "ma".
11436 static __isl_give isl_set
*set_preimage_multi_aff(__isl_take isl_set
*set
,
11437 __isl_take isl_multi_aff
*ma
)
11441 set
= isl_set_cow(set
);
11442 ma
= isl_multi_aff_align_divs(ma
);
11445 if (check_set_compatible_range_multi_aff(set
, ma
) < 0)
11448 for (i
= 0; i
< set
->n
; ++i
) {
11449 set
->p
[i
] = isl_basic_set_preimage_multi_aff(set
->p
[i
],
11450 isl_multi_aff_copy(ma
));
11455 isl_space_free(set
->dim
);
11456 set
->dim
= isl_multi_aff_get_domain_space(ma
);
11460 isl_multi_aff_free(ma
);
11462 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
11463 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
11466 isl_multi_aff_free(ma
);
11471 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11472 __isl_take isl_multi_aff
*ma
)
11477 if (isl_space_match(set
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11478 return set_preimage_multi_aff(set
, ma
);
11480 if (!isl_space_has_named_params(set
->dim
) ||
11481 !isl_space_has_named_params(ma
->space
))
11482 isl_die(set
->ctx
, isl_error_invalid
,
11483 "unaligned unnamed parameters", goto error
);
11484 set
= isl_set_align_params(set
, isl_multi_aff_get_space(ma
));
11485 ma
= isl_multi_aff_align_params(ma
, isl_set_get_space(set
));
11487 return set_preimage_multi_aff(set
, ma
);
11489 isl_multi_aff_free(ma
);
11490 return isl_set_free(set
);
11493 /* Compute the preimage of "set" under the function represented by "pma".
11494 * In other words, plug in "pma" in "set. The result is a set
11495 * that lives in the domain space of "pma".
11497 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11498 __isl_take isl_pw_multi_aff
*pma
)
11507 isl_pw_multi_aff_free(pma
);
11508 res
= isl_set_empty(isl_set_get_space(set
));
11513 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11514 isl_multi_aff_copy(pma
->p
[0].maff
));
11515 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11517 for (i
= 1; i
< pma
->n
; ++i
) {
11520 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11521 isl_multi_aff_copy(pma
->p
[i
].maff
));
11522 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11523 res
= isl_set_union(res
, res_i
);
11526 isl_pw_multi_aff_free(pma
);
11530 isl_pw_multi_aff_free(pma
);
11535 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11536 __isl_take isl_pw_multi_aff
*pma
)
11541 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11542 return set_preimage_pw_multi_aff(set
, pma
);
11544 if (!isl_space_has_named_params(set
->dim
) ||
11545 !isl_space_has_named_params(pma
->dim
))
11546 isl_die(set
->ctx
, isl_error_invalid
,
11547 "unaligned unnamed parameters", goto error
);
11548 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11549 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11551 return set_preimage_pw_multi_aff(set
, pma
);
11553 isl_pw_multi_aff_free(pma
);
11554 return isl_set_free(set
);