2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012 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 void isl_basic_map_inequality_to_equality(
1149 struct isl_basic_map
*bmap
, unsigned pos
)
1153 t
= bmap
->ineq
[pos
];
1154 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1155 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1160 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1161 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1162 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1163 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1166 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1168 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1171 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1173 struct isl_ctx
*ctx
;
1177 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1178 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1179 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1180 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1181 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1182 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1183 1 + isl_basic_map_total_dim(bmap
),
1184 bmap
->extra
- bmap
->n_div
);
1185 return bmap
->n_ineq
++;
1188 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1190 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1193 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1197 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1202 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1204 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1207 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1212 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1214 if (pos
!= bmap
->n_ineq
- 1) {
1215 t
= bmap
->ineq
[pos
];
1216 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1217 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1218 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1224 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1226 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1229 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1234 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1237 k
= isl_basic_map_alloc_equality(bmap
);
1240 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1243 isl_basic_map_free(bmap
);
1247 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1250 return (isl_basic_set
*)
1251 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1254 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1259 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1262 k
= isl_basic_map_alloc_inequality(bmap
);
1265 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1268 isl_basic_map_free(bmap
);
1272 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1275 return (isl_basic_set
*)
1276 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1279 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1283 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1284 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1285 1 + 1 + isl_basic_map_total_dim(bmap
),
1286 bmap
->extra
- bmap
->n_div
);
1287 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1288 return bmap
->n_div
++;
1291 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1293 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1296 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1300 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1305 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1307 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1310 /* Copy constraint from src to dst, putting the vars of src at offset
1311 * dim_off in dst and the divs of src at offset div_off in dst.
1312 * If both sets are actually map, then dim_off applies to the input
1315 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1316 struct isl_basic_map
*src_map
, isl_int
*src
,
1317 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1319 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1320 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1321 unsigned src_in
= isl_basic_map_n_in(src_map
);
1322 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1323 unsigned src_out
= isl_basic_map_n_out(src_map
);
1324 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1325 isl_int_set(dst
[0], src
[0]);
1326 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1327 if (dst_nparam
> src_nparam
)
1328 isl_seq_clr(dst
+1+src_nparam
,
1329 dst_nparam
- src_nparam
);
1330 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1331 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1333 isl_min(dst_in
-in_off
, src_in
));
1334 if (dst_in
-in_off
> src_in
)
1335 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1336 dst_in
- in_off
- src_in
);
1337 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1338 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1339 src
+1+src_nparam
+src_in
,
1340 isl_min(dst_out
-out_off
, src_out
));
1341 if (dst_out
-out_off
> src_out
)
1342 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1343 dst_out
- out_off
- src_out
);
1344 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1345 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1346 src
+1+src_nparam
+src_in
+src_out
,
1347 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1348 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1349 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1350 div_off
+src_map
->n_div
,
1351 dst_map
->n_div
- div_off
- src_map
->n_div
);
1354 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1355 struct isl_basic_map
*src_map
, isl_int
*src
,
1356 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1358 isl_int_set(dst
[0], src
[0]);
1359 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1362 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1363 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1368 if (!bmap1
|| !bmap2
)
1371 div_off
= bmap1
->n_div
;
1373 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1374 int i1
= isl_basic_map_alloc_equality(bmap1
);
1377 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1378 i_pos
, o_pos
, div_off
);
1381 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1382 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1385 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1386 i_pos
, o_pos
, div_off
);
1389 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1390 int i1
= isl_basic_map_alloc_div(bmap1
);
1393 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1394 i_pos
, o_pos
, div_off
);
1397 isl_basic_map_free(bmap2
);
1402 isl_basic_map_free(bmap1
);
1403 isl_basic_map_free(bmap2
);
1407 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1408 struct isl_basic_set
*bset2
, unsigned pos
)
1410 return (struct isl_basic_set
*)
1411 add_constraints((struct isl_basic_map
*)bset1
,
1412 (struct isl_basic_map
*)bset2
, 0, pos
);
1415 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1416 __isl_take isl_space
*dim
, unsigned extra
,
1417 unsigned n_eq
, unsigned n_ineq
)
1419 struct isl_basic_map
*ext
;
1429 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1430 base
->extra
>= base
->n_div
+ extra
;
1432 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1433 room_for_ineq(base
, n_ineq
)) {
1434 isl_space_free(dim
);
1438 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1439 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1440 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1441 extra
+= base
->extra
;
1443 n_ineq
+= base
->n_ineq
;
1445 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1451 ext
->sample
= isl_vec_copy(base
->sample
);
1452 flags
= base
->flags
;
1453 ext
= add_constraints(ext
, base
, 0, 0);
1456 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1462 isl_space_free(dim
);
1463 isl_basic_map_free(base
);
1467 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1468 __isl_take isl_space
*dim
, unsigned extra
,
1469 unsigned n_eq
, unsigned n_ineq
)
1471 return (struct isl_basic_set
*)
1472 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1473 extra
, n_eq
, n_ineq
);
1476 struct isl_basic_map
*isl_basic_map_extend_constraints(
1477 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1481 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1485 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1486 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1487 unsigned n_eq
, unsigned n_ineq
)
1489 struct isl_basic_map
*bmap
;
1494 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1498 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1501 isl_basic_map_free(base
);
1505 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1506 unsigned nparam
, unsigned dim
, unsigned extra
,
1507 unsigned n_eq
, unsigned n_ineq
)
1509 return (struct isl_basic_set
*)
1510 isl_basic_map_extend((struct isl_basic_map
*)base
,
1511 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1514 struct isl_basic_set
*isl_basic_set_extend_constraints(
1515 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1517 return (struct isl_basic_set
*)
1518 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1522 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1524 return (struct isl_basic_set
*)
1525 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1528 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1533 if (bmap
->ref
> 1) {
1535 bmap
= isl_basic_map_dup(bmap
);
1538 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1542 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1550 return isl_set_dup(set
);
1553 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1561 return isl_map_dup(map
);
1564 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1565 unsigned a_len
, unsigned b_len
)
1567 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1568 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1569 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1572 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1573 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1581 isl_assert(bmap
->ctx
,
1582 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1584 if (n1
== 0 || n2
== 0)
1587 bmap
= isl_basic_map_cow(bmap
);
1591 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1592 if (isl_blk_is_error(blk
))
1595 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1597 bmap
->eq
[i
] + pos
, n1
, n2
);
1599 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1601 bmap
->ineq
[i
] + pos
, n1
, n2
);
1603 for (i
= 0; i
< bmap
->n_div
; ++i
)
1605 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1607 isl_blk_free(bmap
->ctx
, blk
);
1609 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1610 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1611 return isl_basic_map_finalize(bmap
);
1613 isl_basic_map_free(bmap
);
1617 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1618 __isl_take isl_basic_set
*bset
, unsigned n
)
1623 nparam
= isl_basic_set_n_param(bset
);
1624 dim
= isl_basic_set_n_dim(bset
);
1625 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1627 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1629 isl_basic_set_free(bset
);
1633 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1639 total
= isl_basic_map_total_dim(bmap
);
1640 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1641 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1643 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1645 i
= isl_basic_map_alloc_equality(bmap
);
1649 isl_int_set_si(bmap
->eq
[i
][0], 1);
1650 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1651 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1652 isl_vec_free(bmap
->sample
);
1653 bmap
->sample
= NULL
;
1654 return isl_basic_map_finalize(bmap
);
1656 isl_basic_map_free(bmap
);
1660 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1662 return (struct isl_basic_set
*)
1663 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1666 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1669 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1670 isl_int
*t
= bmap
->div
[a
];
1671 bmap
->div
[a
] = bmap
->div
[b
];
1674 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1675 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1677 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1678 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1680 for (i
= 0; i
< bmap
->n_div
; ++i
)
1681 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1682 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1685 /* Eliminate the specified n dimensions starting at first from the
1686 * constraints, without removing the dimensions from the space.
1687 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1689 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1690 enum isl_dim_type type
, unsigned first
, unsigned n
)
1699 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1700 isl_die(map
->ctx
, isl_error_invalid
,
1701 "index out of bounds", goto error
);
1703 map
= isl_map_cow(map
);
1707 for (i
= 0; i
< map
->n
; ++i
) {
1708 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1718 /* Eliminate the specified n dimensions starting at first from the
1719 * constraints, without removing the dimensions from the space.
1720 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1722 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1723 enum isl_dim_type type
, unsigned first
, unsigned n
)
1725 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1728 /* Eliminate the specified n dimensions starting at first from the
1729 * constraints, without removing the dimensions from the space.
1730 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1732 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1733 unsigned first
, unsigned n
)
1735 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1738 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1739 __isl_take isl_basic_map
*bmap
)
1743 bmap
= isl_basic_map_eliminate_vars(bmap
,
1744 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1748 return isl_basic_map_finalize(bmap
);
1751 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1752 __isl_take isl_basic_set
*bset
)
1754 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1755 (struct isl_basic_map
*)bset
);
1758 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1767 map
= isl_map_cow(map
);
1771 for (i
= 0; i
< map
->n
; ++i
) {
1772 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1782 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1784 return isl_map_remove_divs(set
);
1787 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1788 enum isl_dim_type type
, unsigned first
, unsigned n
)
1792 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1794 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1796 bmap
= isl_basic_map_eliminate_vars(bmap
,
1797 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1800 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1802 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1805 isl_basic_map_free(bmap
);
1809 /* Return true if the definition of the given div (recursively) involves
1810 * any of the given variables.
1812 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1813 unsigned first
, unsigned n
)
1816 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1818 if (isl_int_is_zero(bmap
->div
[div
][0]))
1820 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1823 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1824 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1826 if (div_involves_vars(bmap
, i
, first
, n
))
1833 /* Try and add a lower and/or upper bound on "div" to "bmap"
1834 * based on inequality "i".
1835 * "total" is the total number of variables (excluding the divs).
1836 * "v" is a temporary object that can be used during the calculations.
1837 * If "lb" is set, then a lower bound should be constructed.
1838 * If "ub" is set, then an upper bound should be constructed.
1840 * The calling function has already checked that the inequality does not
1841 * reference "div", but we still need to check that the inequality is
1842 * of the right form. We'll consider the case where we want to construct
1843 * a lower bound. The construction of upper bounds is similar.
1845 * Let "div" be of the form
1847 * q = floor((a + f(x))/d)
1849 * We essentially check if constraint "i" is of the form
1853 * so that we can use it to derive a lower bound on "div".
1854 * However, we allow a slightly more general form
1858 * with the condition that the coefficients of g(x) - f(x) are all
1860 * Rewriting this constraint as
1864 * adding a + f(x) to both sides and dividing by d, we obtain
1866 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1868 * Taking the floor on both sides, we obtain
1870 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1874 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1876 * In the case of an upper bound, we construct the constraint
1878 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1881 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1882 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1883 unsigned total
, isl_int v
, int lb
, int ub
)
1887 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1889 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1890 bmap
->div
[div
][1 + 1 + j
]);
1891 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1894 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1895 bmap
->div
[div
][1 + 1 + j
]);
1896 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1902 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1904 int k
= isl_basic_map_alloc_inequality(bmap
);
1907 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1908 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1909 bmap
->div
[div
][1 + j
]);
1910 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1911 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1913 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1916 int k
= isl_basic_map_alloc_inequality(bmap
);
1919 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1920 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1921 bmap
->div
[div
][1 + j
]);
1922 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1923 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1925 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1930 isl_basic_map_free(bmap
);
1934 /* This function is called right before "div" is eliminated from "bmap"
1935 * using Fourier-Motzkin.
1936 * Look through the constraints of "bmap" for constraints on the argument
1937 * of the integer division and use them to construct constraints on the
1938 * integer division itself. These constraints can then be combined
1939 * during the Fourier-Motzkin elimination.
1940 * Note that it is only useful to introduce lower bounds on "div"
1941 * if "bmap" already contains upper bounds on "div" as the newly
1942 * introduce lower bounds can then be combined with the pre-existing
1943 * upper bounds. Similarly for upper bounds.
1944 * We therefore first check if "bmap" contains any lower and/or upper bounds
1947 * It is interesting to note that the introduction of these constraints
1948 * can indeed lead to more accurate results, even when compared to
1949 * deriving constraints on the argument of "div" from constraints on "div".
1950 * Consider, for example, the set
1952 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1954 * The second constraint can be rewritten as
1956 * 2 * [(-i-2j+3)/4] + k >= 0
1958 * from which we can derive
1960 * -i - 2j + 3 >= -2k
1966 * Combined with the first constraint, we obtain
1968 * -3 <= 3 + 2k or k >= -3
1970 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1971 * the first constraint, we obtain
1973 * [(i + 2j)/4] >= [-3/4] = -1
1975 * Combining this constraint with the second constraint, we obtain
1979 static __isl_give isl_basic_map
*insert_bounds_on_div(
1980 __isl_take isl_basic_map
*bmap
, int div
)
1983 int check_lb
, check_ub
;
1990 if (isl_int_is_zero(bmap
->div
[div
][0]))
1993 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1997 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
1998 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2005 if (!check_lb
&& !check_ub
)
2010 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2011 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2014 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2015 check_lb
, check_ub
);
2023 /* Remove all divs (recursively) involving any of the given dimensions
2024 * in their definitions.
2026 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2027 __isl_take isl_basic_map
*bmap
,
2028 enum isl_dim_type type
, unsigned first
, unsigned n
)
2034 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2036 first
+= isl_basic_map_offset(bmap
, type
);
2038 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2039 if (!div_involves_vars(bmap
, i
, first
, n
))
2041 bmap
= insert_bounds_on_div(bmap
, i
);
2042 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2050 isl_basic_map_free(bmap
);
2054 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2055 __isl_take isl_basic_set
*bset
,
2056 enum isl_dim_type type
, unsigned first
, unsigned n
)
2058 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2061 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2062 enum isl_dim_type type
, unsigned first
, unsigned n
)
2071 map
= isl_map_cow(map
);
2075 for (i
= 0; i
< map
->n
; ++i
) {
2076 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2087 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2088 enum isl_dim_type type
, unsigned first
, unsigned n
)
2090 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2094 /* Does the desciption of "bmap" depend on the specified dimensions?
2095 * We also check whether the dimensions appear in any of the div definitions.
2096 * In principle there is no need for this check. If the dimensions appear
2097 * in a div definition, they also appear in the defining constraints of that
2100 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2101 enum isl_dim_type type
, unsigned first
, unsigned n
)
2108 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2109 isl_die(bmap
->ctx
, isl_error_invalid
,
2110 "index out of bounds", return -1);
2112 first
+= isl_basic_map_offset(bmap
, type
);
2113 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2114 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2116 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2117 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2119 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2120 if (isl_int_is_zero(bmap
->div
[i
][0]))
2122 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2129 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2130 enum isl_dim_type type
, unsigned first
, unsigned n
)
2137 if (first
+ n
> isl_map_dim(map
, type
))
2138 isl_die(map
->ctx
, isl_error_invalid
,
2139 "index out of bounds", return -1);
2141 for (i
= 0; i
< map
->n
; ++i
) {
2142 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2144 if (involves
< 0 || involves
)
2151 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2152 enum isl_dim_type type
, unsigned first
, unsigned n
)
2154 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2157 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2158 enum isl_dim_type type
, unsigned first
, unsigned n
)
2160 return isl_map_involves_dims(set
, type
, first
, n
);
2163 /* Return true if the definition of the given div is unknown or depends
2166 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2169 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2171 if (isl_int_is_zero(bmap
->div
[div
][0]))
2174 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2175 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2177 if (div_is_unknown(bmap
, i
))
2184 /* Remove all divs that are unknown or defined in terms of unknown divs.
2186 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2187 __isl_take isl_basic_map
*bmap
)
2194 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2195 if (!div_is_unknown(bmap
, i
))
2197 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2206 /* Remove all divs that are unknown or defined in terms of unknown divs.
2208 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2209 __isl_take isl_basic_set
*bset
)
2211 return isl_basic_map_remove_unknown_divs(bset
);
2214 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2223 map
= isl_map_cow(map
);
2227 for (i
= 0; i
< map
->n
; ++i
) {
2228 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2238 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2240 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2243 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2244 __isl_take isl_basic_set
*bset
,
2245 enum isl_dim_type type
, unsigned first
, unsigned n
)
2247 return (isl_basic_set
*)
2248 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2251 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2252 enum isl_dim_type type
, unsigned first
, unsigned n
)
2259 map
= isl_map_cow(map
);
2262 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2264 for (i
= 0; i
< map
->n
; ++i
) {
2265 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2266 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2270 map
= isl_map_drop(map
, type
, first
, n
);
2277 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2278 enum isl_dim_type type
, unsigned first
, unsigned n
)
2280 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2283 /* Project out n inputs starting at first using Fourier-Motzkin */
2284 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2285 unsigned first
, unsigned n
)
2287 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2290 static void dump_term(struct isl_basic_map
*bmap
,
2291 isl_int c
, int pos
, FILE *out
)
2294 unsigned in
= isl_basic_map_n_in(bmap
);
2295 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2296 unsigned nparam
= isl_basic_map_n_param(bmap
);
2298 isl_int_print(out
, c
, 0);
2300 if (!isl_int_is_one(c
))
2301 isl_int_print(out
, c
, 0);
2302 if (pos
< 1 + nparam
) {
2303 name
= isl_space_get_dim_name(bmap
->dim
,
2304 isl_dim_param
, pos
- 1);
2306 fprintf(out
, "%s", name
);
2308 fprintf(out
, "p%d", pos
- 1);
2309 } else if (pos
< 1 + nparam
+ in
)
2310 fprintf(out
, "i%d", pos
- 1 - nparam
);
2311 else if (pos
< 1 + nparam
+ dim
)
2312 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2314 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2318 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2319 int sign
, FILE *out
)
2323 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2327 for (i
= 0, first
= 1; i
< len
; ++i
) {
2328 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2331 fprintf(out
, " + ");
2333 isl_int_abs(v
, c
[i
]);
2334 dump_term(bmap
, v
, i
, out
);
2341 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2342 const char *op
, FILE *out
, int indent
)
2346 fprintf(out
, "%*s", indent
, "");
2348 dump_constraint_sign(bmap
, c
, 1, out
);
2349 fprintf(out
, " %s ", op
);
2350 dump_constraint_sign(bmap
, c
, -1, out
);
2354 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2355 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2357 fprintf(out
, "%*s", indent
, "");
2358 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2363 static void dump_constraints(struct isl_basic_map
*bmap
,
2364 isl_int
**c
, unsigned n
,
2365 const char *op
, FILE *out
, int indent
)
2369 for (i
= 0; i
< n
; ++i
)
2370 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2373 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2377 unsigned total
= isl_basic_map_total_dim(bmap
);
2379 for (j
= 0; j
< 1 + total
; ++j
) {
2380 if (isl_int_is_zero(exp
[j
]))
2382 if (!first
&& isl_int_is_pos(exp
[j
]))
2384 dump_term(bmap
, exp
[j
], j
, out
);
2389 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2393 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2394 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2396 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2397 fprintf(out
, "%*s", indent
, "");
2398 fprintf(out
, "e%d = [(", i
);
2399 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2401 isl_int_print(out
, bmap
->div
[i
][0], 0);
2402 fprintf(out
, "]\n");
2406 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2407 FILE *out
, int indent
)
2410 fprintf(out
, "null basic set\n");
2414 fprintf(out
, "%*s", indent
, "");
2415 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2416 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2417 bset
->extra
, bset
->flags
);
2418 dump((struct isl_basic_map
*)bset
, out
, indent
);
2421 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2422 FILE *out
, int indent
)
2425 fprintf(out
, "null basic map\n");
2429 fprintf(out
, "%*s", indent
, "");
2430 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2431 "flags: %x, n_name: %d\n",
2433 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2434 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2435 dump(bmap
, out
, indent
);
2438 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2443 total
= isl_basic_map_total_dim(bmap
);
2444 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2445 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2446 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2447 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2451 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2454 struct isl_set
*set
;
2458 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2459 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2460 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2461 sizeof(struct isl_set
) +
2462 (n
- 1) * sizeof(struct isl_basic_set
*));
2466 set
->ctx
= dim
->ctx
;
2467 isl_ctx_ref(set
->ctx
);
2475 isl_space_free(dim
);
2479 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2480 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2482 struct isl_set
*set
;
2485 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2489 set
= isl_set_alloc_space(dims
, n
, flags
);
2493 /* Make sure "map" has room for at least "n" more basic maps.
2495 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2498 struct isl_map
*grown
= NULL
;
2502 isl_assert(map
->ctx
, n
>= 0, goto error
);
2503 if (map
->n
+ n
<= map
->size
)
2505 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2508 for (i
= 0; i
< map
->n
; ++i
) {
2509 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2517 isl_map_free(grown
);
2522 /* Make sure "set" has room for at least "n" more basic sets.
2524 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2526 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2529 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2532 struct isl_set
*dup
;
2537 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2540 for (i
= 0; i
< set
->n
; ++i
)
2541 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2545 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2547 return isl_map_from_basic_map(bset
);
2550 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2552 struct isl_map
*map
;
2557 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2558 return isl_map_add_basic_map(map
, bmap
);
2561 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2562 __isl_take isl_basic_set
*bset
)
2564 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2565 (struct isl_basic_map
*)bset
);
2568 void *isl_set_free(__isl_take isl_set
*set
)
2578 isl_ctx_deref(set
->ctx
);
2579 for (i
= 0; i
< set
->n
; ++i
)
2580 isl_basic_set_free(set
->p
[i
]);
2581 isl_space_free(set
->dim
);
2587 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2592 fprintf(out
, "null set\n");
2596 fprintf(out
, "%*s", indent
, "");
2597 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2598 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2600 for (i
= 0; i
< set
->n
; ++i
) {
2601 fprintf(out
, "%*s", indent
, "");
2602 fprintf(out
, "basic set %d:\n", i
);
2603 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2607 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2612 fprintf(out
, "null map\n");
2616 fprintf(out
, "%*s", indent
, "");
2617 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2618 "flags: %x, n_name: %d\n",
2619 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2620 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2621 for (i
= 0; i
< map
->n
; ++i
) {
2622 fprintf(out
, "%*s", indent
, "");
2623 fprintf(out
, "basic map %d:\n", i
);
2624 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2628 struct isl_basic_map
*isl_basic_map_intersect_domain(
2629 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2631 struct isl_basic_map
*bmap_domain
;
2636 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2637 bset
->dim
, isl_dim_param
), goto error
);
2639 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2640 isl_assert(bset
->ctx
,
2641 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2643 bmap
= isl_basic_map_cow(bmap
);
2646 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2647 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2648 bmap_domain
= isl_basic_map_from_domain(bset
);
2649 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2651 bmap
= isl_basic_map_simplify(bmap
);
2652 return isl_basic_map_finalize(bmap
);
2654 isl_basic_map_free(bmap
);
2655 isl_basic_set_free(bset
);
2659 struct isl_basic_map
*isl_basic_map_intersect_range(
2660 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2662 struct isl_basic_map
*bmap_range
;
2667 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2668 bset
->dim
, isl_dim_param
), goto error
);
2670 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2671 isl_assert(bset
->ctx
,
2672 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2674 if (isl_basic_set_is_universe(bset
)) {
2675 isl_basic_set_free(bset
);
2679 bmap
= isl_basic_map_cow(bmap
);
2682 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2683 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2684 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2685 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2687 bmap
= isl_basic_map_simplify(bmap
);
2688 return isl_basic_map_finalize(bmap
);
2690 isl_basic_map_free(bmap
);
2691 isl_basic_set_free(bset
);
2695 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2701 total
= 1 + isl_basic_map_total_dim(bmap
);
2702 if (total
!= vec
->size
)
2707 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2708 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2709 if (!isl_int_is_zero(s
)) {
2715 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2716 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2717 if (isl_int_is_neg(s
)) {
2728 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2730 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2733 struct isl_basic_map
*isl_basic_map_intersect(
2734 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2736 struct isl_vec
*sample
= NULL
;
2738 if (!bmap1
|| !bmap2
)
2741 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2742 bmap2
->dim
, isl_dim_param
), goto error
);
2743 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2744 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2745 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2746 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2747 return isl_basic_map_intersect(bmap2
, bmap1
);
2749 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2750 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2751 isl_assert(bmap1
->ctx
,
2752 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2754 if (bmap1
->sample
&&
2755 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2756 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2757 sample
= isl_vec_copy(bmap1
->sample
);
2758 else if (bmap2
->sample
&&
2759 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2760 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2761 sample
= isl_vec_copy(bmap2
->sample
);
2763 bmap1
= isl_basic_map_cow(bmap1
);
2766 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2767 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2768 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2771 isl_vec_free(sample
);
2773 isl_vec_free(bmap1
->sample
);
2774 bmap1
->sample
= sample
;
2777 bmap1
= isl_basic_map_simplify(bmap1
);
2778 return isl_basic_map_finalize(bmap1
);
2781 isl_vec_free(sample
);
2782 isl_basic_map_free(bmap1
);
2783 isl_basic_map_free(bmap2
);
2787 struct isl_basic_set
*isl_basic_set_intersect(
2788 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2790 return (struct isl_basic_set
*)
2791 isl_basic_map_intersect(
2792 (struct isl_basic_map
*)bset1
,
2793 (struct isl_basic_map
*)bset2
);
2796 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2797 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2799 return isl_basic_set_intersect(bset1
, bset2
);
2802 /* Special case of isl_map_intersect, where both map1 and map2
2803 * are convex, without any divs and such that either map1 or map2
2804 * contains a single constraint. This constraint is then simply
2805 * added to the other map.
2807 static __isl_give isl_map
*map_intersect_add_constraint(
2808 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2810 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2811 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2812 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2813 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2815 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2816 return isl_map_intersect(map2
, map1
);
2818 isl_assert(map2
->ctx
,
2819 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2821 map1
= isl_map_cow(map1
);
2824 if (isl_map_plain_is_empty(map1
)) {
2828 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2829 if (map2
->p
[0]->n_eq
== 1)
2830 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2832 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2833 map2
->p
[0]->ineq
[0]);
2835 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2836 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2840 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2841 isl_basic_map_free(map1
->p
[0]);
2854 /* map2 may be either a parameter domain or a map living in the same
2857 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2858 __isl_take isl_map
*map2
)
2867 if ((isl_map_plain_is_empty(map1
) ||
2868 isl_map_plain_is_universe(map2
)) &&
2869 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2873 if ((isl_map_plain_is_empty(map2
) ||
2874 isl_map_plain_is_universe(map1
)) &&
2875 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2880 if (map1
->n
== 1 && map2
->n
== 1 &&
2881 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2882 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2883 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2884 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2885 return map_intersect_add_constraint(map1
, map2
);
2887 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2888 isl_space_dim(map2
->dim
, isl_dim_param
))
2889 isl_assert(map1
->ctx
,
2890 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2892 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2893 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2894 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2896 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2897 map1
->n
* map2
->n
, flags
);
2900 for (i
= 0; i
< map1
->n
; ++i
)
2901 for (j
= 0; j
< map2
->n
; ++j
) {
2902 struct isl_basic_map
*part
;
2903 part
= isl_basic_map_intersect(
2904 isl_basic_map_copy(map1
->p
[i
]),
2905 isl_basic_map_copy(map2
->p
[j
]));
2906 if (isl_basic_map_is_empty(part
) < 0)
2907 part
= isl_basic_map_free(part
);
2908 result
= isl_map_add_basic_map(result
, part
);
2921 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2922 __isl_take isl_map
*map2
)
2926 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2927 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2928 "spaces don't match", goto error
);
2929 return map_intersect_internal(map1
, map2
);
2936 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2937 __isl_take isl_map
*map2
)
2939 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2942 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2944 return (struct isl_set
*)
2945 isl_map_intersect((struct isl_map
*)set1
,
2946 (struct isl_map
*)set2
);
2949 /* map_intersect_internal accepts intersections
2950 * with parameter domains, so we can just call that function.
2952 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2953 __isl_take isl_set
*params
)
2955 return map_intersect_internal(map
, params
);
2958 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2959 __isl_take isl_map
*map2
)
2961 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2964 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2965 __isl_take isl_set
*params
)
2967 return isl_map_intersect_params(set
, params
);
2970 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2973 struct isl_basic_set
*bset
;
2978 bmap
= isl_basic_map_cow(bmap
);
2981 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2982 in
= isl_basic_map_n_in(bmap
);
2983 bset
= isl_basic_set_from_basic_map(bmap
);
2984 bset
= isl_basic_set_swap_vars(bset
, in
);
2985 return isl_basic_map_from_basic_set(bset
, dim
);
2988 static __isl_give isl_basic_map
*basic_map_space_reset(
2989 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2993 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
2996 space
= isl_basic_map_get_space(bmap
);
2997 space
= isl_space_reset(space
, type
);
2998 bmap
= isl_basic_map_reset_space(bmap
, space
);
3002 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3003 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3004 unsigned pos
, unsigned n
)
3007 struct isl_basic_map
*res
;
3008 struct isl_dim_map
*dim_map
;
3009 unsigned total
, off
;
3010 enum isl_dim_type t
;
3013 return basic_map_space_reset(bmap
, type
);
3018 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3020 total
= isl_basic_map_total_dim(bmap
) + n
;
3021 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3023 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3025 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3027 unsigned size
= isl_basic_map_dim(bmap
, t
);
3028 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3030 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3031 pos
, size
- pos
, off
+ pos
+ n
);
3033 off
+= isl_space_dim(res_dim
, t
);
3035 isl_dim_map_div(dim_map
, bmap
, off
);
3037 res
= isl_basic_map_alloc_space(res_dim
,
3038 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3039 if (isl_basic_map_is_rational(bmap
))
3040 res
= isl_basic_map_set_rational(res
);
3041 if (isl_basic_map_plain_is_empty(bmap
)) {
3042 isl_basic_map_free(bmap
);
3043 return isl_basic_map_set_to_empty(res
);
3045 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3046 return isl_basic_map_finalize(res
);
3049 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3050 __isl_take isl_basic_set
*bset
,
3051 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3053 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3056 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3057 enum isl_dim_type type
, unsigned n
)
3061 return isl_basic_map_insert_dims(bmap
, type
,
3062 isl_basic_map_dim(bmap
, type
), n
);
3065 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3066 enum isl_dim_type type
, unsigned n
)
3070 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3071 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3073 isl_basic_set_free(bset
);
3077 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3078 enum isl_dim_type type
)
3082 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3085 space
= isl_map_get_space(map
);
3086 space
= isl_space_reset(space
, type
);
3087 map
= isl_map_reset_space(map
, space
);
3091 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3092 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3097 return map_space_reset(map
, type
);
3099 map
= isl_map_cow(map
);
3103 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3107 for (i
= 0; i
< map
->n
; ++i
) {
3108 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3119 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3120 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3122 return isl_map_insert_dims(set
, type
, pos
, n
);
3125 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3126 enum isl_dim_type type
, unsigned n
)
3130 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3133 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3134 enum isl_dim_type type
, unsigned n
)
3138 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3139 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3145 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3146 __isl_take isl_basic_map
*bmap
,
3147 enum isl_dim_type dst_type
, unsigned dst_pos
,
3148 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3150 struct isl_dim_map
*dim_map
;
3151 struct isl_basic_map
*res
;
3152 enum isl_dim_type t
;
3153 unsigned total
, off
;
3160 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3163 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3166 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3168 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3169 pos(bmap
->dim
, src_type
) + src_pos
+
3170 ((src_type
< dst_type
) ? n
: 0)) {
3171 bmap
= isl_basic_map_cow(bmap
);
3175 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3176 src_type
, src_pos
, n
);
3180 bmap
= isl_basic_map_finalize(bmap
);
3185 total
= isl_basic_map_total_dim(bmap
);
3186 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3189 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3190 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3191 if (t
== dst_type
) {
3192 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3195 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3198 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3199 dst_pos
, size
- dst_pos
, off
);
3200 off
+= size
- dst_pos
;
3201 } else if (t
== src_type
) {
3202 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3205 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3206 src_pos
+ n
, size
- src_pos
- n
, off
);
3207 off
+= size
- src_pos
- n
;
3209 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3213 isl_dim_map_div(dim_map
, bmap
, off
);
3215 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3216 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3217 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3219 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3220 src_type
, src_pos
, n
);
3224 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3225 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3226 bmap
= isl_basic_map_finalize(bmap
);
3230 isl_basic_map_free(bmap
);
3234 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3235 enum isl_dim_type dst_type
, unsigned dst_pos
,
3236 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3238 return (isl_basic_set
*)isl_basic_map_move_dims(
3239 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3242 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3243 enum isl_dim_type dst_type
, unsigned dst_pos
,
3244 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3248 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3249 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3250 src_type
, src_pos
, n
);
3256 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3257 enum isl_dim_type dst_type
, unsigned dst_pos
,
3258 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3267 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3270 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3273 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3275 map
= isl_map_cow(map
);
3279 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3283 for (i
= 0; i
< map
->n
; ++i
) {
3284 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3286 src_type
, src_pos
, n
);
3297 /* Move the specified dimensions to the last columns right before
3298 * the divs. Don't change the dimension specification of bmap.
3299 * That's the responsibility of the caller.
3301 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3302 enum isl_dim_type type
, unsigned first
, unsigned n
)
3304 struct isl_dim_map
*dim_map
;
3305 struct isl_basic_map
*res
;
3306 enum isl_dim_type t
;
3307 unsigned total
, off
;
3311 if (pos(bmap
->dim
, type
) + first
+ n
==
3312 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3315 total
= isl_basic_map_total_dim(bmap
);
3316 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3319 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3320 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3322 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3325 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3326 first
, n
, total
- bmap
->n_div
- n
);
3327 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3328 first
+ n
, size
- (first
+ n
), off
);
3329 off
+= size
- (first
+ n
);
3331 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3335 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3337 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3338 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3339 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3343 /* Turn the n dimensions of type type, starting at first
3344 * into existentially quantified variables.
3346 __isl_give isl_basic_map
*isl_basic_map_project_out(
3347 __isl_take isl_basic_map
*bmap
,
3348 enum isl_dim_type type
, unsigned first
, unsigned n
)
3356 return basic_map_space_reset(bmap
, type
);
3361 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3362 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3364 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3367 bmap
= move_last(bmap
, type
, first
, n
);
3368 bmap
= isl_basic_map_cow(bmap
);
3372 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3373 old
= bmap
->block2
.data
;
3374 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3375 (bmap
->extra
+ n
) * (1 + row_size
));
3376 if (!bmap
->block2
.data
)
3378 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3381 for (i
= 0; i
< n
; ++i
) {
3382 new_div
[i
] = bmap
->block2
.data
+
3383 (bmap
->extra
+ i
) * (1 + row_size
);
3384 isl_seq_clr(new_div
[i
], 1 + row_size
);
3386 for (i
= 0; i
< bmap
->extra
; ++i
)
3387 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3389 bmap
->div
= new_div
;
3393 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3396 bmap
= isl_basic_map_simplify(bmap
);
3397 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3398 return isl_basic_map_finalize(bmap
);
3400 isl_basic_map_free(bmap
);
3404 /* Turn the n dimensions of type type, starting at first
3405 * into existentially quantified variables.
3407 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3408 enum isl_dim_type type
, unsigned first
, unsigned n
)
3410 return (isl_basic_set
*)isl_basic_map_project_out(
3411 (isl_basic_map
*)bset
, type
, first
, n
);
3414 /* Turn the n dimensions of type type, starting at first
3415 * into existentially quantified variables.
3417 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3418 enum isl_dim_type type
, unsigned first
, unsigned n
)
3426 return map_space_reset(map
, type
);
3428 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3430 map
= isl_map_cow(map
);
3434 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3438 for (i
= 0; i
< map
->n
; ++i
) {
3439 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3450 /* Turn the n dimensions of type type, starting at first
3451 * into existentially quantified variables.
3453 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3454 enum isl_dim_type type
, unsigned first
, unsigned n
)
3456 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3459 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3463 for (i
= 0; i
< n
; ++i
) {
3464 j
= isl_basic_map_alloc_div(bmap
);
3467 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3471 isl_basic_map_free(bmap
);
3475 struct isl_basic_map
*isl_basic_map_apply_range(
3476 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3478 isl_space
*dim_result
= NULL
;
3479 struct isl_basic_map
*bmap
;
3480 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3481 struct isl_dim_map
*dim_map1
, *dim_map2
;
3483 if (!bmap1
|| !bmap2
)
3486 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3487 isl_space_copy(bmap2
->dim
));
3489 n_in
= isl_basic_map_n_in(bmap1
);
3490 n_out
= isl_basic_map_n_out(bmap2
);
3491 n
= isl_basic_map_n_out(bmap1
);
3492 nparam
= isl_basic_map_n_param(bmap1
);
3494 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3495 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3496 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3497 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3498 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3499 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3500 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3501 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3502 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3503 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3504 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3506 bmap
= isl_basic_map_alloc_space(dim_result
,
3507 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3508 bmap1
->n_eq
+ bmap2
->n_eq
,
3509 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3510 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3511 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3512 bmap
= add_divs(bmap
, n
);
3513 bmap
= isl_basic_map_simplify(bmap
);
3514 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3515 return isl_basic_map_finalize(bmap
);
3517 isl_basic_map_free(bmap1
);
3518 isl_basic_map_free(bmap2
);
3522 struct isl_basic_set
*isl_basic_set_apply(
3523 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3528 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3531 return (struct isl_basic_set
*)
3532 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3534 isl_basic_set_free(bset
);
3535 isl_basic_map_free(bmap
);
3539 struct isl_basic_map
*isl_basic_map_apply_domain(
3540 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3542 if (!bmap1
|| !bmap2
)
3545 isl_assert(bmap1
->ctx
,
3546 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3547 isl_assert(bmap1
->ctx
,
3548 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3551 bmap1
= isl_basic_map_reverse(bmap1
);
3552 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3553 return isl_basic_map_reverse(bmap1
);
3555 isl_basic_map_free(bmap1
);
3556 isl_basic_map_free(bmap2
);
3560 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3561 * A \cap B -> f(A) + f(B)
3563 struct isl_basic_map
*isl_basic_map_sum(
3564 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3566 unsigned n_in
, n_out
, nparam
, total
, pos
;
3567 struct isl_basic_map
*bmap
= NULL
;
3568 struct isl_dim_map
*dim_map1
, *dim_map2
;
3571 if (!bmap1
|| !bmap2
)
3574 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3577 nparam
= isl_basic_map_n_param(bmap1
);
3578 n_in
= isl_basic_map_n_in(bmap1
);
3579 n_out
= isl_basic_map_n_out(bmap1
);
3581 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3582 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3583 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3584 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3585 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3586 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3587 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3588 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3589 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3590 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3591 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3593 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3594 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3595 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3596 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3597 for (i
= 0; i
< n_out
; ++i
) {
3598 int j
= isl_basic_map_alloc_equality(bmap
);
3601 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3602 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3603 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3604 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3606 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3607 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3608 bmap
= add_divs(bmap
, 2 * n_out
);
3610 bmap
= isl_basic_map_simplify(bmap
);
3611 return isl_basic_map_finalize(bmap
);
3613 isl_basic_map_free(bmap
);
3614 isl_basic_map_free(bmap1
);
3615 isl_basic_map_free(bmap2
);
3619 /* Given two maps A -> f(A) and B -> g(B), construct a map
3620 * A \cap B -> f(A) + f(B)
3622 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3624 struct isl_map
*result
;
3630 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3632 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3633 map1
->n
* map2
->n
, 0);
3636 for (i
= 0; i
< map1
->n
; ++i
)
3637 for (j
= 0; j
< map2
->n
; ++j
) {
3638 struct isl_basic_map
*part
;
3639 part
= isl_basic_map_sum(
3640 isl_basic_map_copy(map1
->p
[i
]),
3641 isl_basic_map_copy(map2
->p
[j
]));
3642 if (isl_basic_map_is_empty(part
))
3643 isl_basic_map_free(part
);
3645 result
= isl_map_add_basic_map(result
, part
);
3658 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3659 __isl_take isl_set
*set2
)
3661 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3664 /* Given a basic map A -> f(A), construct A -> -f(A).
3666 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3671 bmap
= isl_basic_map_cow(bmap
);
3675 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3676 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3677 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3678 for (j
= 0; j
< n
; ++j
)
3679 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3680 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3681 for (j
= 0; j
< n
; ++j
)
3682 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3683 for (i
= 0; i
< bmap
->n_div
; ++i
)
3684 for (j
= 0; j
< n
; ++j
)
3685 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3686 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3687 return isl_basic_map_finalize(bmap
);
3690 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3692 return isl_basic_map_neg(bset
);
3695 /* Given a map A -> f(A), construct A -> -f(A).
3697 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3701 map
= isl_map_cow(map
);
3705 for (i
= 0; i
< map
->n
; ++i
) {
3706 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3717 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3719 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3722 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3723 * A -> floor(f(A)/d).
3725 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3728 unsigned n_in
, n_out
, nparam
, total
, pos
;
3729 struct isl_basic_map
*result
= NULL
;
3730 struct isl_dim_map
*dim_map
;
3736 nparam
= isl_basic_map_n_param(bmap
);
3737 n_in
= isl_basic_map_n_in(bmap
);
3738 n_out
= isl_basic_map_n_out(bmap
);
3740 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3741 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3742 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3743 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3744 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3745 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3747 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3748 bmap
->n_div
+ n_out
,
3749 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3750 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3751 result
= add_divs(result
, n_out
);
3752 for (i
= 0; i
< n_out
; ++i
) {
3754 j
= isl_basic_map_alloc_inequality(result
);
3757 isl_seq_clr(result
->ineq
[j
], 1+total
);
3758 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3759 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3760 j
= isl_basic_map_alloc_inequality(result
);
3763 isl_seq_clr(result
->ineq
[j
], 1+total
);
3764 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3765 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3766 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3769 result
= isl_basic_map_simplify(result
);
3770 return isl_basic_map_finalize(result
);
3772 isl_basic_map_free(result
);
3776 /* Given a map A -> f(A) and an integer d, construct a map
3777 * A -> floor(f(A)/d).
3779 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3783 map
= isl_map_cow(map
);
3787 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3788 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3789 for (i
= 0; i
< map
->n
; ++i
) {
3790 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3801 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3807 i
= isl_basic_map_alloc_equality(bmap
);
3810 nparam
= isl_basic_map_n_param(bmap
);
3811 n_in
= isl_basic_map_n_in(bmap
);
3812 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3813 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3814 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3815 return isl_basic_map_finalize(bmap
);
3817 isl_basic_map_free(bmap
);
3821 /* Add a constraints to "bmap" expressing i_pos < o_pos
3823 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3829 i
= isl_basic_map_alloc_inequality(bmap
);
3832 nparam
= isl_basic_map_n_param(bmap
);
3833 n_in
= isl_basic_map_n_in(bmap
);
3834 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3835 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3836 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3837 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3838 return isl_basic_map_finalize(bmap
);
3840 isl_basic_map_free(bmap
);
3844 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3846 static __isl_give isl_basic_map
*var_less_or_equal(
3847 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3853 i
= isl_basic_map_alloc_inequality(bmap
);
3856 nparam
= isl_basic_map_n_param(bmap
);
3857 n_in
= isl_basic_map_n_in(bmap
);
3858 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3859 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3860 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3861 return isl_basic_map_finalize(bmap
);
3863 isl_basic_map_free(bmap
);
3867 /* Add a constraints to "bmap" expressing i_pos > o_pos
3869 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3875 i
= isl_basic_map_alloc_inequality(bmap
);
3878 nparam
= isl_basic_map_n_param(bmap
);
3879 n_in
= isl_basic_map_n_in(bmap
);
3880 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3881 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3882 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3883 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3884 return isl_basic_map_finalize(bmap
);
3886 isl_basic_map_free(bmap
);
3890 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3892 static __isl_give isl_basic_map
*var_more_or_equal(
3893 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3899 i
= isl_basic_map_alloc_inequality(bmap
);
3902 nparam
= isl_basic_map_n_param(bmap
);
3903 n_in
= isl_basic_map_n_in(bmap
);
3904 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3905 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3906 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3907 return isl_basic_map_finalize(bmap
);
3909 isl_basic_map_free(bmap
);
3913 __isl_give isl_basic_map
*isl_basic_map_equal(
3914 __isl_take isl_space
*dim
, unsigned n_equal
)
3917 struct isl_basic_map
*bmap
;
3918 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3921 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3922 bmap
= var_equal(bmap
, i
);
3923 return isl_basic_map_finalize(bmap
);
3926 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3928 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3932 struct isl_basic_map
*bmap
;
3933 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3936 for (i
= 0; i
< pos
&& bmap
; ++i
)
3937 bmap
= var_equal(bmap
, i
);
3939 bmap
= var_less(bmap
, pos
);
3940 return isl_basic_map_finalize(bmap
);
3943 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3945 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3946 __isl_take isl_space
*dim
, unsigned pos
)
3949 isl_basic_map
*bmap
;
3951 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3952 for (i
= 0; i
< pos
; ++i
)
3953 bmap
= var_equal(bmap
, i
);
3954 bmap
= var_less_or_equal(bmap
, pos
);
3955 return isl_basic_map_finalize(bmap
);
3958 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3960 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3964 struct isl_basic_map
*bmap
;
3965 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3968 for (i
= 0; i
< pos
&& bmap
; ++i
)
3969 bmap
= var_equal(bmap
, i
);
3971 bmap
= var_more(bmap
, pos
);
3972 return isl_basic_map_finalize(bmap
);
3975 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3977 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3978 __isl_take isl_space
*dim
, unsigned pos
)
3981 isl_basic_map
*bmap
;
3983 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3984 for (i
= 0; i
< pos
; ++i
)
3985 bmap
= var_equal(bmap
, i
);
3986 bmap
= var_more_or_equal(bmap
, pos
);
3987 return isl_basic_map_finalize(bmap
);
3990 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3991 unsigned n
, int equal
)
3993 struct isl_map
*map
;
3996 if (n
== 0 && equal
)
3997 return isl_map_universe(dims
);
3999 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4001 for (i
= 0; i
+ 1 < n
; ++i
)
4002 map
= isl_map_add_basic_map(map
,
4003 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4006 map
= isl_map_add_basic_map(map
,
4007 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4009 map
= isl_map_add_basic_map(map
,
4010 isl_basic_map_less_at(dims
, n
- 1));
4012 isl_space_free(dims
);
4017 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4021 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4024 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4026 return map_lex_lte_first(dim
, n
, 0);
4029 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4031 return map_lex_lte_first(dim
, n
, 1);
4034 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4036 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4039 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4041 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4044 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4045 unsigned n
, int equal
)
4047 struct isl_map
*map
;
4050 if (n
== 0 && equal
)
4051 return isl_map_universe(dims
);
4053 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4055 for (i
= 0; i
+ 1 < n
; ++i
)
4056 map
= isl_map_add_basic_map(map
,
4057 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4060 map
= isl_map_add_basic_map(map
,
4061 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4063 map
= isl_map_add_basic_map(map
,
4064 isl_basic_map_more_at(dims
, n
- 1));
4066 isl_space_free(dims
);
4071 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4075 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4078 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4080 return map_lex_gte_first(dim
, n
, 0);
4083 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4085 return map_lex_gte_first(dim
, n
, 1);
4088 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4090 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4093 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4095 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4098 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4099 __isl_take isl_set
*set2
)
4102 map
= isl_map_lex_le(isl_set_get_space(set1
));
4103 map
= isl_map_intersect_domain(map
, set1
);
4104 map
= isl_map_intersect_range(map
, set2
);
4108 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4109 __isl_take isl_set
*set2
)
4112 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4113 map
= isl_map_intersect_domain(map
, set1
);
4114 map
= isl_map_intersect_range(map
, set2
);
4118 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4119 __isl_take isl_set
*set2
)
4122 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4123 map
= isl_map_intersect_domain(map
, set1
);
4124 map
= isl_map_intersect_range(map
, set2
);
4128 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4129 __isl_take isl_set
*set2
)
4132 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4133 map
= isl_map_intersect_domain(map
, set1
);
4134 map
= isl_map_intersect_range(map
, set2
);
4138 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4139 __isl_take isl_map
*map2
)
4142 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4143 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4144 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4148 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4149 __isl_take isl_map
*map2
)
4152 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4153 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4154 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4158 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4159 __isl_take isl_map
*map2
)
4162 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4163 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4164 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4168 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4169 __isl_take isl_map
*map2
)
4172 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4173 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4174 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4178 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4179 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4181 struct isl_basic_map
*bmap
;
4183 bset
= isl_basic_set_cow(bset
);
4187 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4188 isl_space_free(bset
->dim
);
4189 bmap
= (struct isl_basic_map
*) bset
;
4191 return isl_basic_map_finalize(bmap
);
4193 isl_basic_set_free(bset
);
4194 isl_space_free(dim
);
4198 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4202 if (bmap
->dim
->n_in
== 0)
4203 return (struct isl_basic_set
*)bmap
;
4204 bmap
= isl_basic_map_cow(bmap
);
4207 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4210 bmap
= isl_basic_map_finalize(bmap
);
4211 return (struct isl_basic_set
*)bmap
;
4213 isl_basic_map_free(bmap
);
4217 /* For a div d = floor(f/m), add the constraints
4220 * -(f-(n-1)) + m d >= 0
4222 * Note that the second constraint is the negation of
4226 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4227 unsigned pos
, isl_int
*div
)
4230 unsigned total
= isl_basic_map_total_dim(bmap
);
4232 i
= isl_basic_map_alloc_inequality(bmap
);
4235 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4236 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4238 j
= isl_basic_map_alloc_inequality(bmap
);
4241 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4242 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4243 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4247 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4248 unsigned pos
, isl_int
*div
)
4250 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4254 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4256 unsigned total
= isl_basic_map_total_dim(bmap
);
4257 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4259 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4263 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4265 return isl_basic_map_add_div_constraints(bset
, div
);
4268 struct isl_basic_set
*isl_basic_map_underlying_set(
4269 struct isl_basic_map
*bmap
)
4273 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4275 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4276 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4277 return (struct isl_basic_set
*)bmap
;
4278 bmap
= isl_basic_map_cow(bmap
);
4281 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4284 bmap
->extra
-= bmap
->n_div
;
4286 bmap
= isl_basic_map_finalize(bmap
);
4287 return (struct isl_basic_set
*)bmap
;
4289 isl_basic_map_free(bmap
);
4293 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4294 __isl_take isl_basic_set
*bset
)
4296 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4299 struct isl_basic_map
*isl_basic_map_overlying_set(
4300 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4302 struct isl_basic_map
*bmap
;
4303 struct isl_ctx
*ctx
;
4310 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4311 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4312 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4314 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4315 isl_basic_map_free(like
);
4316 return (struct isl_basic_map
*)bset
;
4318 bset
= isl_basic_set_cow(bset
);
4321 total
= bset
->dim
->n_out
+ bset
->extra
;
4322 bmap
= (struct isl_basic_map
*)bset
;
4323 isl_space_free(bmap
->dim
);
4324 bmap
->dim
= isl_space_copy(like
->dim
);
4327 bmap
->n_div
= like
->n_div
;
4328 bmap
->extra
+= like
->n_div
;
4332 ltotal
= total
- bmap
->extra
+ like
->extra
;
4335 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4336 bmap
->extra
* (1 + 1 + total
));
4337 if (isl_blk_is_error(bmap
->block2
))
4339 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4343 for (i
= 0; i
< bmap
->extra
; ++i
)
4344 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4345 for (i
= 0; i
< like
->n_div
; ++i
) {
4346 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4347 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4349 bmap
= isl_basic_map_extend_constraints(bmap
,
4350 0, 2 * like
->n_div
);
4351 for (i
= 0; i
< like
->n_div
; ++i
) {
4352 if (isl_int_is_zero(bmap
->div
[i
][0]))
4354 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4358 isl_basic_map_free(like
);
4359 bmap
= isl_basic_map_simplify(bmap
);
4360 bmap
= isl_basic_map_finalize(bmap
);
4363 isl_basic_map_free(like
);
4364 isl_basic_set_free(bset
);
4368 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4369 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4371 return (struct isl_basic_set
*)
4372 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4375 struct isl_set
*isl_set_from_underlying_set(
4376 struct isl_set
*set
, struct isl_basic_set
*like
)
4382 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4384 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4385 isl_basic_set_free(like
);
4388 set
= isl_set_cow(set
);
4391 for (i
= 0; i
< set
->n
; ++i
) {
4392 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4393 isl_basic_set_copy(like
));
4397 isl_space_free(set
->dim
);
4398 set
->dim
= isl_space_copy(like
->dim
);
4401 isl_basic_set_free(like
);
4404 isl_basic_set_free(like
);
4409 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4413 map
= isl_map_cow(map
);
4416 map
->dim
= isl_space_cow(map
->dim
);
4420 for (i
= 1; i
< map
->n
; ++i
)
4421 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4423 for (i
= 0; i
< map
->n
; ++i
) {
4424 map
->p
[i
] = (struct isl_basic_map
*)
4425 isl_basic_map_underlying_set(map
->p
[i
]);
4430 map
->dim
= isl_space_underlying(map
->dim
, 0);
4432 isl_space_free(map
->dim
);
4433 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4437 return (struct isl_set
*)map
;
4443 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4445 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4448 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4449 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4451 bmap
= isl_basic_map_cow(bmap
);
4455 isl_space_free(bmap
->dim
);
4458 bmap
= isl_basic_map_finalize(bmap
);
4462 isl_basic_map_free(bmap
);
4463 isl_space_free(dim
);
4467 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4468 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4470 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4474 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4475 __isl_take isl_space
*dim
)
4479 map
= isl_map_cow(map
);
4483 for (i
= 0; i
< map
->n
; ++i
) {
4484 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4485 isl_space_copy(dim
));
4489 isl_space_free(map
->dim
);
4495 isl_space_free(dim
);
4499 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4500 __isl_take isl_space
*dim
)
4502 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4505 /* Compute the parameter domain of the given basic set.
4507 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4512 if (isl_basic_set_is_params(bset
))
4515 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4516 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4517 space
= isl_basic_set_get_space(bset
);
4518 space
= isl_space_params(space
);
4519 bset
= isl_basic_set_reset_space(bset
, space
);
4523 /* Construct a zero-dimensional basic set with the given parameter domain.
4525 __isl_give isl_basic_set
*isl_basic_set_from_params(
4526 __isl_take isl_basic_set
*bset
)
4529 space
= isl_basic_set_get_space(bset
);
4530 space
= isl_space_set_from_params(space
);
4531 bset
= isl_basic_set_reset_space(bset
, space
);
4535 /* Compute the parameter domain of the given set.
4537 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4542 if (isl_set_is_params(set
))
4545 n
= isl_set_dim(set
, isl_dim_set
);
4546 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4547 space
= isl_set_get_space(set
);
4548 space
= isl_space_params(space
);
4549 set
= isl_set_reset_space(set
, space
);
4553 /* Construct a zero-dimensional set with the given parameter domain.
4555 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4558 space
= isl_set_get_space(set
);
4559 space
= isl_space_set_from_params(space
);
4560 set
= isl_set_reset_space(set
, space
);
4564 /* Compute the parameter domain of the given map.
4566 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4571 n
= isl_map_dim(map
, isl_dim_in
);
4572 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4573 n
= isl_map_dim(map
, isl_dim_out
);
4574 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4575 space
= isl_map_get_space(map
);
4576 space
= isl_space_params(space
);
4577 map
= isl_map_reset_space(map
, space
);
4581 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4584 struct isl_basic_set
*domain
;
4590 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4592 n_in
= isl_basic_map_n_in(bmap
);
4593 n_out
= isl_basic_map_n_out(bmap
);
4594 domain
= isl_basic_set_from_basic_map(bmap
);
4595 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4597 domain
= isl_basic_set_reset_space(domain
, dim
);
4602 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4606 return isl_space_may_be_set(bmap
->dim
);
4609 /* Is this basic map actually a set?
4610 * Users should never call this function. Outside of isl,
4611 * the type should indicate whether something is a set or a map.
4613 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4617 return isl_space_is_set(bmap
->dim
);
4620 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4624 if (isl_basic_map_is_set(bmap
))
4626 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4629 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4630 __isl_take isl_basic_map
*bmap
)
4634 isl_basic_map
*domain
;
4635 int nparam
, n_in
, n_out
;
4638 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4639 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4640 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4642 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4643 domain
= isl_basic_map_universe(dim
);
4645 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4646 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4647 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4649 total
= isl_basic_map_total_dim(bmap
);
4651 for (i
= 0; i
< n_in
; ++i
) {
4652 k
= isl_basic_map_alloc_equality(bmap
);
4655 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4656 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4657 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4660 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4661 return isl_basic_map_finalize(bmap
);
4663 isl_basic_map_free(bmap
);
4667 __isl_give isl_basic_map
*isl_basic_map_range_map(
4668 __isl_take isl_basic_map
*bmap
)
4672 isl_basic_map
*range
;
4673 int nparam
, n_in
, n_out
;
4676 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4677 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4678 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4680 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4681 range
= isl_basic_map_universe(dim
);
4683 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4684 bmap
= isl_basic_map_apply_range(bmap
, range
);
4685 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4687 total
= isl_basic_map_total_dim(bmap
);
4689 for (i
= 0; i
< n_out
; ++i
) {
4690 k
= isl_basic_map_alloc_equality(bmap
);
4693 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4694 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4695 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4698 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4699 return isl_basic_map_finalize(bmap
);
4701 isl_basic_map_free(bmap
);
4705 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4709 return isl_space_may_be_set(map
->dim
);
4712 /* Is this map actually a set?
4713 * Users should never call this function. Outside of isl,
4714 * the type should indicate whether something is a set or a map.
4716 int isl_map_is_set(__isl_keep isl_map
*map
)
4720 return isl_space_is_set(map
->dim
);
4723 struct isl_set
*isl_map_range(struct isl_map
*map
)
4726 struct isl_set
*set
;
4730 if (isl_map_is_set(map
))
4731 return (isl_set
*)map
;
4733 map
= isl_map_cow(map
);
4737 set
= (struct isl_set
*) map
;
4738 set
->dim
= isl_space_range(set
->dim
);
4741 for (i
= 0; i
< map
->n
; ++i
) {
4742 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4746 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4747 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4754 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4757 isl_space
*domain_dim
;
4759 map
= isl_map_cow(map
);
4763 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4764 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4765 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4768 for (i
= 0; i
< map
->n
; ++i
) {
4769 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4773 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4774 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4781 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4784 isl_space
*range_dim
;
4786 map
= isl_map_cow(map
);
4790 range_dim
= isl_space_range(isl_map_get_space(map
));
4791 range_dim
= isl_space_from_range(range_dim
);
4792 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4793 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4796 for (i
= 0; i
< map
->n
; ++i
) {
4797 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4801 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4802 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4809 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4810 __isl_take isl_space
*dim
)
4813 struct isl_map
*map
= NULL
;
4815 set
= isl_set_cow(set
);
4818 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4819 map
= (struct isl_map
*)set
;
4820 for (i
= 0; i
< set
->n
; ++i
) {
4821 map
->p
[i
] = isl_basic_map_from_basic_set(
4822 set
->p
[i
], isl_space_copy(dim
));
4826 isl_space_free(map
->dim
);
4830 isl_space_free(dim
);
4835 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4836 __isl_take isl_basic_set
*bset
)
4838 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4841 __isl_give isl_basic_map
*isl_basic_map_from_range(
4842 __isl_take isl_basic_set
*bset
)
4845 space
= isl_basic_set_get_space(bset
);
4846 space
= isl_space_from_range(space
);
4847 bset
= isl_basic_set_reset_space(bset
, space
);
4848 return (isl_basic_map
*)bset
;
4851 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4854 space
= isl_set_get_space(set
);
4855 space
= isl_space_from_range(space
);
4856 set
= isl_set_reset_space(set
, space
);
4857 return (struct isl_map
*)set
;
4860 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4862 return isl_map_reverse(isl_map_from_range(set
));
4865 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4866 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4868 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4871 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4872 __isl_take isl_set
*range
)
4874 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4877 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4880 struct isl_set
*set
= NULL
;
4884 map
= isl_map_cow(map
);
4887 map
->dim
= isl_space_as_set_space(map
->dim
);
4890 set
= (struct isl_set
*)map
;
4891 for (i
= 0; i
< map
->n
; ++i
) {
4892 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4902 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4905 struct isl_map
*map
;
4910 isl_die(dim
->ctx
, isl_error_internal
,
4911 "negative number of basic maps", goto error
);
4912 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4913 sizeof(struct isl_map
) +
4914 (n
- 1) * sizeof(struct isl_basic_map
*));
4918 map
->ctx
= dim
->ctx
;
4919 isl_ctx_ref(map
->ctx
);
4927 isl_space_free(dim
);
4931 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4932 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4935 struct isl_map
*map
;
4938 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4942 map
= isl_map_alloc_space(dims
, n
, flags
);
4946 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4948 struct isl_basic_map
*bmap
;
4949 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4950 bmap
= isl_basic_map_set_to_empty(bmap
);
4954 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4956 struct isl_basic_set
*bset
;
4957 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4958 bset
= isl_basic_set_set_to_empty(bset
);
4962 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4964 struct isl_basic_map
*bmap
;
4967 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4968 bmap
= isl_basic_map_set_to_empty(bmap
);
4972 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4974 struct isl_basic_map
*bmap
;
4977 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4978 bmap
= isl_basic_map_set_to_empty(bmap
);
4982 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4984 struct isl_basic_set
*bset
;
4987 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4988 bset
= isl_basic_set_set_to_empty(bset
);
4992 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
4994 struct isl_basic_map
*bmap
;
4995 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
4996 bmap
= isl_basic_map_finalize(bmap
);
5000 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5002 struct isl_basic_set
*bset
;
5003 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5004 bset
= isl_basic_set_finalize(bset
);
5008 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5011 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5012 isl_basic_map
*bmap
;
5014 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5015 for (i
= 0; i
< total
; ++i
) {
5016 int k
= isl_basic_map_alloc_inequality(bmap
);
5019 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5020 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5024 isl_basic_map_free(bmap
);
5028 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5030 return isl_basic_map_nat_universe(dim
);
5033 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5035 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5038 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5040 return isl_map_nat_universe(dim
);
5043 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5044 __isl_keep isl_basic_map
*model
)
5048 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5051 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5055 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5058 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5059 __isl_keep isl_set
*model
)
5063 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5066 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5068 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5071 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5075 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5078 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5082 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5085 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5087 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5090 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5094 return isl_set_empty(isl_space_copy(model
->dim
));
5097 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5099 struct isl_map
*map
;
5102 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5103 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5107 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5109 struct isl_set
*set
;
5112 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5113 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5117 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5121 return isl_set_universe(isl_space_copy(model
->dim
));
5124 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5127 struct isl_map
*dup
;
5131 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5132 for (i
= 0; i
< map
->n
; ++i
)
5133 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5137 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5138 __isl_take isl_basic_map
*bmap
)
5142 if (isl_basic_map_plain_is_empty(bmap
)) {
5143 isl_basic_map_free(bmap
);
5146 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5147 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5148 map
->p
[map
->n
] = bmap
;
5150 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5156 isl_basic_map_free(bmap
);
5160 void *isl_map_free(struct isl_map
*map
)
5170 isl_ctx_deref(map
->ctx
);
5171 for (i
= 0; i
< map
->n
; ++i
)
5172 isl_basic_map_free(map
->p
[i
]);
5173 isl_space_free(map
->dim
);
5179 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5180 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5184 base
= isl_map_cow(base
);
5188 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5191 for (i
= 0; i
< base
->n
; ++i
) {
5192 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5193 isl_space_copy(base
->dim
), 0, 0, 0);
5203 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5204 unsigned nparam
, unsigned dim
)
5206 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5210 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5211 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5215 bmap
= isl_basic_map_cow(bmap
);
5216 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5217 j
= isl_basic_map_alloc_equality(bmap
);
5220 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5221 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5222 isl_int_set_si(bmap
->eq
[j
][0], value
);
5223 bmap
= isl_basic_map_simplify(bmap
);
5224 return isl_basic_map_finalize(bmap
);
5226 isl_basic_map_free(bmap
);
5230 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5231 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5235 bmap
= isl_basic_map_cow(bmap
);
5236 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5237 j
= isl_basic_map_alloc_equality(bmap
);
5240 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5241 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5242 isl_int_set(bmap
->eq
[j
][0], value
);
5243 bmap
= isl_basic_map_simplify(bmap
);
5244 return isl_basic_map_finalize(bmap
);
5246 isl_basic_map_free(bmap
);
5250 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5251 enum isl_dim_type type
, unsigned pos
, int value
)
5255 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5256 return isl_basic_map_fix_pos_si(bmap
,
5257 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5259 isl_basic_map_free(bmap
);
5263 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5264 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5268 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5269 return isl_basic_map_fix_pos(bmap
,
5270 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5272 isl_basic_map_free(bmap
);
5276 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5277 enum isl_dim_type type
, unsigned pos
, int value
)
5279 return (struct isl_basic_set
*)
5280 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5284 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5285 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5287 return (struct isl_basic_set
*)
5288 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5292 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5293 unsigned input
, int value
)
5295 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5298 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5299 unsigned dim
, int value
)
5301 return (struct isl_basic_set
*)
5302 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5303 isl_dim_set
, dim
, value
);
5306 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5308 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5315 isl_basic_map_free(map
->p
[i
]);
5316 if (i
!= map
->n
- 1) {
5317 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5318 map
->p
[i
] = map
->p
[map
->n
- 1];
5325 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5326 enum isl_dim_type type
, unsigned pos
, int value
)
5330 map
= isl_map_cow(map
);
5334 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5335 for (i
= map
->n
- 1; i
>= 0; --i
) {
5336 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5337 if (remove_if_empty(map
, i
) < 0)
5340 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5347 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5348 enum isl_dim_type type
, unsigned pos
, int value
)
5350 return (struct isl_set
*)
5351 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5354 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5355 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5359 map
= isl_map_cow(map
);
5363 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5364 for (i
= 0; i
< map
->n
; ++i
) {
5365 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5369 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5376 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5377 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5379 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5382 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5383 unsigned input
, int value
)
5385 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5388 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5390 return (struct isl_set
*)
5391 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5394 static __isl_give isl_basic_map
*basic_map_bound_si(
5395 __isl_take isl_basic_map
*bmap
,
5396 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5402 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5403 pos
+= isl_basic_map_offset(bmap
, type
);
5404 bmap
= isl_basic_map_cow(bmap
);
5405 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5406 j
= isl_basic_map_alloc_inequality(bmap
);
5409 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5411 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5412 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5414 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5415 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5417 bmap
= isl_basic_map_simplify(bmap
);
5418 return isl_basic_map_finalize(bmap
);
5420 isl_basic_map_free(bmap
);
5424 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5425 __isl_take isl_basic_map
*bmap
,
5426 enum isl_dim_type type
, unsigned pos
, int value
)
5428 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5431 /* Constrain the values of the given dimension to be no greater than "value".
5433 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5434 __isl_take isl_basic_map
*bmap
,
5435 enum isl_dim_type type
, unsigned pos
, int value
)
5437 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5440 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5441 unsigned dim
, isl_int value
)
5445 bset
= isl_basic_set_cow(bset
);
5446 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5447 j
= isl_basic_set_alloc_inequality(bset
);
5450 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5451 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5452 isl_int_neg(bset
->ineq
[j
][0], value
);
5453 bset
= isl_basic_set_simplify(bset
);
5454 return isl_basic_set_finalize(bset
);
5456 isl_basic_set_free(bset
);
5460 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5461 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5465 map
= isl_map_cow(map
);
5469 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5470 for (i
= 0; i
< map
->n
; ++i
) {
5471 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5472 type
, pos
, value
, upper
);
5476 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5483 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5484 enum isl_dim_type type
, unsigned pos
, int value
)
5486 return map_bound_si(map
, type
, pos
, value
, 0);
5489 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5490 enum isl_dim_type type
, unsigned pos
, int value
)
5492 return map_bound_si(map
, type
, pos
, value
, 1);
5495 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5496 enum isl_dim_type type
, unsigned pos
, int value
)
5498 return (struct isl_set
*)
5499 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5502 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5503 enum isl_dim_type type
, unsigned pos
, int value
)
5505 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5508 /* Bound the given variable of "bmap" from below (or above is "upper"
5509 * is set) to "value".
5511 static __isl_give isl_basic_map
*basic_map_bound(
5512 __isl_take isl_basic_map
*bmap
,
5513 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5519 if (pos
>= isl_basic_map_dim(bmap
, type
))
5520 isl_die(bmap
->ctx
, isl_error_invalid
,
5521 "index out of bounds", goto error
);
5522 pos
+= isl_basic_map_offset(bmap
, type
);
5523 bmap
= isl_basic_map_cow(bmap
);
5524 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5525 j
= isl_basic_map_alloc_inequality(bmap
);
5528 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5530 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5531 isl_int_set(bmap
->ineq
[j
][0], value
);
5533 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5534 isl_int_neg(bmap
->ineq
[j
][0], value
);
5536 bmap
= isl_basic_map_simplify(bmap
);
5537 return isl_basic_map_finalize(bmap
);
5539 isl_basic_map_free(bmap
);
5543 /* Bound the given variable of "map" from below (or above is "upper"
5544 * is set) to "value".
5546 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5547 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5551 map
= isl_map_cow(map
);
5555 if (pos
>= isl_map_dim(map
, type
))
5556 isl_die(map
->ctx
, isl_error_invalid
,
5557 "index out of bounds", goto error
);
5558 for (i
= map
->n
- 1; i
>= 0; --i
) {
5559 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5560 if (remove_if_empty(map
, i
) < 0)
5563 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5570 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5571 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5573 return map_bound(map
, type
, pos
, value
, 0);
5576 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5577 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5579 return map_bound(map
, type
, pos
, value
, 1);
5582 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5583 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5585 return isl_map_lower_bound(set
, type
, pos
, value
);
5588 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5589 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5591 return isl_map_upper_bound(set
, type
, pos
, value
);
5594 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5599 set
= isl_set_cow(set
);
5603 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5604 for (i
= 0; i
< set
->n
; ++i
) {
5605 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5615 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5619 map
= isl_map_cow(map
);
5623 map
->dim
= isl_space_reverse(map
->dim
);
5626 for (i
= 0; i
< map
->n
; ++i
) {
5627 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5631 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5638 static struct isl_map
*isl_basic_map_partial_lexopt(
5639 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5640 struct isl_set
**empty
, int max
)
5644 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5645 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5647 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5649 isl_basic_map_free(bmap
);
5650 isl_basic_set_free(dom
);
5656 struct isl_map
*isl_basic_map_partial_lexmax(
5657 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5658 struct isl_set
**empty
)
5660 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5663 struct isl_map
*isl_basic_map_partial_lexmin(
5664 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5665 struct isl_set
**empty
)
5667 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5670 struct isl_set
*isl_basic_set_partial_lexmin(
5671 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5672 struct isl_set
**empty
)
5674 return (struct isl_set
*)
5675 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5679 struct isl_set
*isl_basic_set_partial_lexmax(
5680 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5681 struct isl_set
**empty
)
5683 return (struct isl_set
*)
5684 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5688 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5689 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5690 __isl_give isl_set
**empty
)
5692 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5695 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5696 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5697 __isl_give isl_set
**empty
)
5699 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5702 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5703 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5704 __isl_give isl_set
**empty
)
5706 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5709 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5710 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5711 __isl_give isl_set
**empty
)
5713 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5716 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5717 __isl_take isl_basic_map
*bmap
, int max
)
5719 isl_basic_set
*dom
= NULL
;
5720 isl_space
*dom_space
;
5724 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5725 dom
= isl_basic_set_universe(dom_space
);
5726 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5728 isl_basic_map_free(bmap
);
5732 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5733 __isl_take isl_basic_map
*bmap
)
5735 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5739 #define TYPE isl_pw_multi_aff
5741 #define SUFFIX _pw_multi_aff
5743 #define EMPTY isl_pw_multi_aff_empty
5745 #define ADD isl_pw_multi_aff_union_add
5746 #include "isl_map_lexopt_templ.c"
5748 /* Given a map "map", compute the lexicographically minimal
5749 * (or maximal) image element for each domain element in dom,
5750 * in the form of an isl_pw_multi_aff.
5751 * Set *empty to those elements in dom that do not have an image element.
5753 * We first compute the lexicographically minimal or maximal element
5754 * in the first basic map. This results in a partial solution "res"
5755 * and a subset "todo" of dom that still need to be handled.
5756 * We then consider each of the remaining maps in "map" and successively
5757 * update both "res" and "todo".
5759 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5760 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5761 __isl_give isl_set
**empty
, int max
)
5764 isl_pw_multi_aff
*res
;
5770 if (isl_map_plain_is_empty(map
)) {
5775 return isl_pw_multi_aff_from_map(map
);
5778 res
= basic_map_partial_lexopt_pw_multi_aff(
5779 isl_basic_map_copy(map
->p
[0]),
5780 isl_set_copy(dom
), &todo
, max
);
5782 for (i
= 1; i
< map
->n
; ++i
) {
5783 isl_pw_multi_aff
*res_i
;
5786 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5787 isl_basic_map_copy(map
->p
[i
]),
5788 isl_set_copy(dom
), &todo_i
, max
);
5791 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5793 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5795 todo
= isl_set_intersect(todo
, todo_i
);
5816 #define TYPE isl_map
5820 #define EMPTY isl_map_empty
5822 #define ADD isl_map_union_disjoint
5823 #include "isl_map_lexopt_templ.c"
5825 /* Given a map "map", compute the lexicographically minimal
5826 * (or maximal) image element for each domain element in dom.
5827 * Set *empty to those elements in dom that do not have an image element.
5829 * We first compute the lexicographically minimal or maximal element
5830 * in the first basic map. This results in a partial solution "res"
5831 * and a subset "todo" of dom that still need to be handled.
5832 * We then consider each of the remaining maps in "map" and successively
5833 * update both "res" and "todo".
5835 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5836 * Assume we are computing the lexicographical maximum.
5837 * We first compute the lexicographically maximal element in basic map i.
5838 * This results in a partial solution res_i and a subset todo_i.
5839 * Then we combine these results with those obtain for the first k basic maps
5840 * to obtain a result that is valid for the first k+1 basic maps.
5841 * In particular, the set where there is no solution is the set where
5842 * there is no solution for the first k basic maps and also no solution
5843 * for the ith basic map, i.e.,
5845 * todo^i = todo^k * todo_i
5847 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5848 * solutions, arbitrarily breaking ties in favor of res^k.
5849 * That is, when res^k(a) >= res_i(a), we pick res^k and
5850 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5851 * the lexicographic order.)
5852 * In practice, we compute
5854 * res^k * (res_i . "<=")
5858 * res_i * (res^k . "<")
5860 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5861 * where only one of res^k and res_i provides a solution and we simply pick
5868 * Note that we only compute these intersections when dom(res^k) intersects
5869 * dom(res_i). Otherwise, the only effect of these intersections is to
5870 * potentially break up res^k and res_i into smaller pieces.
5871 * We want to avoid such splintering as much as possible.
5872 * In fact, an earlier implementation of this function would look for
5873 * better results in the domain of res^k and for extra results in todo^k,
5874 * but this would always result in a splintering according to todo^k,
5875 * even when the domain of basic map i is disjoint from the domains of
5876 * the previous basic maps.
5878 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5879 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5880 __isl_give isl_set
**empty
, int max
)
5883 struct isl_map
*res
;
5884 struct isl_set
*todo
;
5889 if (isl_map_plain_is_empty(map
)) {
5897 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5898 isl_set_copy(dom
), &todo
, max
);
5900 for (i
= 1; i
< map
->n
; ++i
) {
5904 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5906 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5907 isl_set_copy(dom
), &todo_i
, max
);
5910 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5911 le
= isl_map_lex_le(dim
);
5913 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5914 le
= isl_map_lex_ge(dim
);
5916 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5917 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5918 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5919 le
= isl_map_intersect(le
, isl_map_copy(res
));
5921 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5922 res
= isl_map_intersect_domain(res
,
5923 isl_set_copy(todo_i
));
5924 res_i
= isl_map_intersect_domain(res_i
,
5925 isl_set_copy(todo
));
5928 res
= isl_map_union_disjoint(res
, res_i
);
5929 res
= isl_map_union_disjoint(res
, lt
);
5930 res
= isl_map_union_disjoint(res
, le
);
5932 todo
= isl_set_intersect(todo
, todo_i
);
5952 __isl_give isl_map
*isl_map_partial_lexmax(
5953 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5954 __isl_give isl_set
**empty
)
5956 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5959 __isl_give isl_map
*isl_map_partial_lexmin(
5960 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5961 __isl_give isl_set
**empty
)
5963 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5966 __isl_give isl_set
*isl_set_partial_lexmin(
5967 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5968 __isl_give isl_set
**empty
)
5970 return (struct isl_set
*)
5971 isl_map_partial_lexmin((struct isl_map
*)set
,
5975 __isl_give isl_set
*isl_set_partial_lexmax(
5976 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5977 __isl_give isl_set
**empty
)
5979 return (struct isl_set
*)
5980 isl_map_partial_lexmax((struct isl_map
*)set
,
5984 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5986 struct isl_basic_set
*dom
= NULL
;
5991 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
5992 dom
= isl_basic_set_universe(dom_dim
);
5993 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5995 isl_basic_map_free(bmap
);
5999 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6001 return isl_basic_map_lexopt(bmap
, 0);
6004 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6006 return isl_basic_map_lexopt(bmap
, 1);
6009 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6011 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6014 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6016 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6019 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
6021 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
6024 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
6026 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
6029 /* Extract the first and only affine expression from list
6030 * and then add it to *pwaff with the given dom.
6031 * This domain is known to be disjoint from other domains
6032 * because of the way isl_basic_map_foreach_lexmax works.
6034 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6035 __isl_take isl_aff_list
*list
, void *user
)
6037 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6039 isl_pw_aff
**pwaff
= user
;
6040 isl_pw_aff
*pwaff_i
;
6044 if (isl_aff_list_n_aff(list
) != 1)
6045 isl_die(ctx
, isl_error_internal
,
6046 "expecting single element list", goto error
);
6048 aff
= isl_aff_list_get_aff(list
, 0);
6049 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6051 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6053 isl_aff_list_free(list
);
6057 isl_basic_set_free(dom
);
6058 isl_aff_list_free(list
);
6062 /* Given a basic map with one output dimension, compute the minimum or
6063 * maximum of that dimension as an isl_pw_aff.
6065 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6066 * call update_dim_opt on each leaf of the result.
6068 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6071 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6075 dim
= isl_space_from_domain(isl_space_domain(dim
));
6076 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6077 pwaff
= isl_pw_aff_empty(dim
);
6079 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6081 return isl_pw_aff_free(pwaff
);
6086 /* Compute the minimum or maximum of the given output dimension
6087 * as a function of the parameters and the input dimensions,
6088 * but independently of the other output dimensions.
6090 * We first project out the other output dimension and then compute
6091 * the "lexicographic" maximum in each basic map, combining the results
6092 * using isl_pw_aff_union_max.
6094 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6101 n_out
= isl_map_dim(map
, isl_dim_out
);
6102 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6103 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6108 isl_space
*dim
= isl_map_get_space(map
);
6109 dim
= isl_space_domain(isl_space_from_range(dim
));
6111 return isl_pw_aff_empty(dim
);
6114 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6115 for (i
= 1; i
< map
->n
; ++i
) {
6116 isl_pw_aff
*pwaff_i
;
6118 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6119 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6127 /* Compute the maximum of the given output dimension as a function of the
6128 * parameters and input dimensions, but independently of
6129 * the other output dimensions.
6131 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6133 return map_dim_opt(map
, pos
, 1);
6136 /* Compute the minimum or maximum of the given set dimension
6137 * as a function of the parameters,
6138 * but independently of the other set dimensions.
6140 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6143 return map_dim_opt(set
, pos
, max
);
6146 /* Compute the maximum of the given set dimension as a function of the
6147 * parameters, but independently of the other set dimensions.
6149 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6151 return set_dim_opt(set
, pos
, 1);
6154 /* Compute the minimum of the given set dimension as a function of the
6155 * parameters, but independently of the other set dimensions.
6157 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6159 return set_dim_opt(set
, pos
, 0);
6162 /* Apply a preimage specified by "mat" on the parameters of "bset".
6163 * bset is assumed to have only parameters and divs.
6165 static struct isl_basic_set
*basic_set_parameter_preimage(
6166 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6173 bset
->dim
= isl_space_cow(bset
->dim
);
6177 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6179 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6181 bset
->dim
->nparam
= 0;
6182 bset
->dim
->n_out
= nparam
;
6183 bset
= isl_basic_set_preimage(bset
, mat
);
6185 bset
->dim
->nparam
= bset
->dim
->n_out
;
6186 bset
->dim
->n_out
= 0;
6191 isl_basic_set_free(bset
);
6195 /* Apply a preimage specified by "mat" on the parameters of "set".
6196 * set is assumed to have only parameters and divs.
6198 static struct isl_set
*set_parameter_preimage(
6199 struct isl_set
*set
, struct isl_mat
*mat
)
6201 isl_space
*dim
= NULL
;
6207 dim
= isl_space_copy(set
->dim
);
6208 dim
= isl_space_cow(dim
);
6212 nparam
= isl_set_dim(set
, isl_dim_param
);
6214 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6217 dim
->n_out
= nparam
;
6218 isl_set_reset_space(set
, dim
);
6219 set
= isl_set_preimage(set
, mat
);
6222 dim
= isl_space_copy(set
->dim
);
6223 dim
= isl_space_cow(dim
);
6226 dim
->nparam
= dim
->n_out
;
6228 isl_set_reset_space(set
, dim
);
6231 isl_space_free(dim
);
6238 /* Intersect the basic set "bset" with the affine space specified by the
6239 * equalities in "eq".
6241 static struct isl_basic_set
*basic_set_append_equalities(
6242 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6250 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6255 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6256 for (i
= 0; i
< eq
->n_row
; ++i
) {
6257 k
= isl_basic_set_alloc_equality(bset
);
6260 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6261 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6265 bset
= isl_basic_set_gauss(bset
, NULL
);
6266 bset
= isl_basic_set_finalize(bset
);
6271 isl_basic_set_free(bset
);
6275 /* Intersect the set "set" with the affine space specified by the
6276 * equalities in "eq".
6278 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6286 for (i
= 0; i
< set
->n
; ++i
) {
6287 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6300 /* Project the given basic set onto its parameter domain, possibly introducing
6301 * new, explicit, existential variables in the constraints.
6302 * The input has parameters and (possibly implicit) existential variables.
6303 * The output has the same parameters, but only
6304 * explicit existentially quantified variables.
6306 * The actual projection is performed by pip, but pip doesn't seem
6307 * to like equalities very much, so we first remove the equalities
6308 * among the parameters by performing a variable compression on
6309 * the parameters. Afterward, an inverse transformation is performed
6310 * and the equalities among the parameters are inserted back in.
6312 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6316 struct isl_mat
*T
, *T2
;
6317 struct isl_set
*set
;
6318 unsigned nparam
, n_div
;
6320 bset
= isl_basic_set_cow(bset
);
6324 if (bset
->n_eq
== 0)
6325 return isl_basic_set_lexmin(bset
);
6327 isl_basic_set_gauss(bset
, NULL
);
6329 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6330 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6332 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6333 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6336 if (i
== bset
->n_eq
)
6337 return isl_basic_set_lexmin(bset
);
6339 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6341 eq
= isl_mat_cow(eq
);
6342 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6343 if (T
&& T
->n_col
== 0) {
6347 bset
= isl_basic_set_set_to_empty(bset
);
6348 return isl_set_from_basic_set(bset
);
6350 bset
= basic_set_parameter_preimage(bset
, T
);
6352 set
= isl_basic_set_lexmin(bset
);
6353 set
= set_parameter_preimage(set
, T2
);
6354 set
= set_append_equalities(set
, eq
);
6358 /* Compute an explicit representation for all the existentially
6359 * quantified variables.
6360 * The input and output dimensions are first turned into parameters.
6361 * compute_divs then returns a map with the same parameters and
6362 * no input or output dimensions and the dimension specification
6363 * is reset to that of the input.
6365 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6367 struct isl_basic_set
*bset
;
6368 struct isl_set
*set
;
6369 struct isl_map
*map
;
6370 isl_space
*dim
, *orig_dim
= NULL
;
6375 bmap
= isl_basic_map_cow(bmap
);
6379 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6380 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6381 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6382 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6386 orig_dim
= bmap
->dim
;
6388 bset
= (struct isl_basic_set
*)bmap
;
6390 set
= parameter_compute_divs(bset
);
6391 map
= (struct isl_map
*)set
;
6392 map
= isl_map_reset_space(map
, orig_dim
);
6396 isl_basic_map_free(bmap
);
6400 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6408 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6409 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6410 if (isl_int_is_zero(bmap
->div
[i
][0]))
6412 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6418 static int map_divs_known(__isl_keep isl_map
*map
)
6425 for (i
= 0; i
< map
->n
; ++i
) {
6426 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6434 /* If bmap contains any unknown divs, then compute explicit
6435 * expressions for them. However, this computation may be
6436 * quite expensive, so first try to remove divs that aren't
6439 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6442 struct isl_map
*map
;
6444 known
= isl_basic_map_divs_known(bmap
);
6448 return isl_map_from_basic_map(bmap
);
6450 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6452 known
= isl_basic_map_divs_known(bmap
);
6456 return isl_map_from_basic_map(bmap
);
6458 map
= compute_divs(bmap
);
6461 isl_basic_map_free(bmap
);
6465 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6469 struct isl_map
*res
;
6476 known
= map_divs_known(map
);
6484 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6485 for (i
= 1 ; i
< map
->n
; ++i
) {
6487 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6488 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6489 res
= isl_map_union_disjoint(res
, r2
);
6491 res
= isl_map_union(res
, r2
);
6498 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6500 return (struct isl_set
*)
6501 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6504 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6506 return (struct isl_set
*)
6507 isl_map_compute_divs((struct isl_map
*)set
);
6510 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6513 struct isl_set
*set
;
6518 map
= isl_map_cow(map
);
6522 set
= (struct isl_set
*)map
;
6523 set
->dim
= isl_space_domain(set
->dim
);
6526 for (i
= 0; i
< map
->n
; ++i
) {
6527 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6531 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6532 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6539 /* Return the union of "map1" and "map2", where we assume for now that
6540 * "map1" and "map2" are disjoint. Note that the basic maps inside
6541 * "map1" or "map2" may not be disjoint from each other.
6542 * Also note that this function is also called from isl_map_union,
6543 * which takes care of handling the situation where "map1" and "map2"
6544 * may not be disjoint.
6546 * If one of the inputs is empty, we can simply return the other input.
6547 * Similarly, if one of the inputs is universal, then it is equal to the union.
6549 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6550 __isl_take isl_map
*map2
)
6554 struct isl_map
*map
= NULL
;
6569 is_universe
= isl_map_plain_is_universe(map1
);
6570 if (is_universe
< 0)
6577 is_universe
= isl_map_plain_is_universe(map2
);
6578 if (is_universe
< 0)
6585 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6587 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6588 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6589 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6591 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6592 map1
->n
+ map2
->n
, flags
);
6595 for (i
= 0; i
< map1
->n
; ++i
) {
6596 map
= isl_map_add_basic_map(map
,
6597 isl_basic_map_copy(map1
->p
[i
]));
6601 for (i
= 0; i
< map2
->n
; ++i
) {
6602 map
= isl_map_add_basic_map(map
,
6603 isl_basic_map_copy(map2
->p
[i
]));
6617 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6618 __isl_take isl_map
*map2
)
6620 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6623 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6625 map1
= isl_map_union_disjoint(map1
, map2
);
6629 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6633 struct isl_set
*isl_set_union_disjoint(
6634 struct isl_set
*set1
, struct isl_set
*set2
)
6636 return (struct isl_set
*)
6637 isl_map_union_disjoint(
6638 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6641 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6643 return (struct isl_set
*)
6644 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6647 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6650 * "map" and "set" are assumed to be compatible and non-NULL.
6652 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6653 __isl_take isl_set
*set
,
6654 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6655 __isl_take isl_basic_set
*bset
))
6658 struct isl_map
*result
;
6661 if (isl_set_plain_is_universe(set
)) {
6666 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6667 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6668 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6670 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6671 map
->n
* set
->n
, flags
);
6672 for (i
= 0; result
&& i
< map
->n
; ++i
)
6673 for (j
= 0; j
< set
->n
; ++j
) {
6674 result
= isl_map_add_basic_map(result
,
6675 fn(isl_basic_map_copy(map
->p
[i
]),
6676 isl_basic_set_copy(set
->p
[j
])));
6686 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6687 __isl_take isl_set
*set
)
6692 if (!isl_map_compatible_range(map
, set
))
6693 isl_die(set
->ctx
, isl_error_invalid
,
6694 "incompatible spaces", goto error
);
6696 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6703 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6704 __isl_take isl_set
*set
)
6706 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6709 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
6710 __isl_take isl_set
*set
)
6715 if (!isl_map_compatible_domain(map
, set
))
6716 isl_die(set
->ctx
, isl_error_invalid
,
6717 "incompatible spaces", goto error
);
6719 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
6726 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
6727 __isl_take isl_set
*set
)
6729 return isl_map_align_params_map_map_and(map
, set
,
6730 &map_intersect_domain
);
6733 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6734 __isl_take isl_map
*map2
)
6738 map1
= isl_map_reverse(map1
);
6739 map1
= isl_map_apply_range(map1
, map2
);
6740 return isl_map_reverse(map1
);
6747 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6748 __isl_take isl_map
*map2
)
6750 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6753 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6754 __isl_take isl_map
*map2
)
6756 isl_space
*dim_result
;
6757 struct isl_map
*result
;
6763 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6764 isl_space_copy(map2
->dim
));
6766 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6769 for (i
= 0; i
< map1
->n
; ++i
)
6770 for (j
= 0; j
< map2
->n
; ++j
) {
6771 result
= isl_map_add_basic_map(result
,
6772 isl_basic_map_apply_range(
6773 isl_basic_map_copy(map1
->p
[i
]),
6774 isl_basic_map_copy(map2
->p
[j
])));
6780 if (result
&& result
->n
<= 1)
6781 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6789 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6790 __isl_take isl_map
*map2
)
6792 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6796 * returns range - domain
6798 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6800 isl_space
*dims
, *target_dim
;
6801 struct isl_basic_set
*bset
;
6808 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6809 bmap
->dim
, isl_dim_out
),
6811 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6812 dim
= isl_basic_map_n_in(bmap
);
6813 nparam
= isl_basic_map_n_param(bmap
);
6814 bset
= isl_basic_set_from_basic_map(bmap
);
6815 bset
= isl_basic_set_cow(bset
);
6816 dims
= isl_basic_set_get_space(bset
);
6817 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6818 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6819 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6820 for (i
= 0; i
< dim
; ++i
) {
6821 int j
= isl_basic_map_alloc_equality(
6822 (struct isl_basic_map
*)bset
);
6825 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6826 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6827 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6828 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6830 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6831 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6834 isl_basic_map_free(bmap
);
6839 * returns range - domain
6841 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6845 struct isl_set
*result
;
6850 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6851 map
->dim
, isl_dim_out
),
6853 dim
= isl_map_get_space(map
);
6854 dim
= isl_space_domain(dim
);
6855 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6858 for (i
= 0; i
< map
->n
; ++i
)
6859 result
= isl_set_add_basic_set(result
,
6860 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6869 * returns [domain -> range] -> range - domain
6871 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6872 __isl_take isl_basic_map
*bmap
)
6876 isl_basic_map
*domain
;
6880 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6881 isl_die(bmap
->ctx
, isl_error_invalid
,
6882 "domain and range don't match", goto error
);
6884 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6885 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6887 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6888 domain
= isl_basic_map_universe(dim
);
6890 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6891 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6892 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6894 total
= isl_basic_map_total_dim(bmap
);
6896 for (i
= 0; i
< n
; ++i
) {
6897 k
= isl_basic_map_alloc_equality(bmap
);
6900 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6901 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6902 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6903 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6906 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6907 return isl_basic_map_finalize(bmap
);
6909 isl_basic_map_free(bmap
);
6914 * returns [domain -> range] -> range - domain
6916 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6919 isl_space
*domain_dim
;
6924 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6925 isl_die(map
->ctx
, isl_error_invalid
,
6926 "domain and range don't match", goto error
);
6928 map
= isl_map_cow(map
);
6932 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6933 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6934 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6937 for (i
= 0; i
< map
->n
; ++i
) {
6938 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6942 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6949 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6951 struct isl_basic_map
*bmap
;
6959 nparam
= dims
->nparam
;
6961 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6965 for (i
= 0; i
< dim
; ++i
) {
6966 int j
= isl_basic_map_alloc_equality(bmap
);
6969 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6970 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6971 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6973 return isl_basic_map_finalize(bmap
);
6975 isl_basic_map_free(bmap
);
6979 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6983 if (dim
->n_in
!= dim
->n_out
)
6984 isl_die(dim
->ctx
, isl_error_invalid
,
6985 "number of input and output dimensions needs to be "
6986 "the same", goto error
);
6987 return basic_map_identity(dim
);
6989 isl_space_free(dim
);
6993 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6995 if (!model
|| !model
->dim
)
6997 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7000 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7002 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7005 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7007 if (!model
|| !model
->dim
)
7009 return isl_map_identity(isl_space_copy(model
->dim
));
7012 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7014 if (!model
|| !model
->dim
)
7016 return isl_map_identity(isl_space_copy(model
->dim
));
7019 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7021 isl_space
*dim
= isl_set_get_space(set
);
7023 id
= isl_map_identity(isl_space_map_from_set(dim
));
7024 return isl_map_intersect_range(id
, set
);
7027 /* Construct a basic set with all set dimensions having only non-negative
7030 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7031 __isl_take isl_space
*space
)
7036 struct isl_basic_set
*bset
;
7040 nparam
= space
->nparam
;
7042 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7045 for (i
= 0; i
< dim
; ++i
) {
7046 int k
= isl_basic_set_alloc_inequality(bset
);
7049 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7050 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7054 isl_basic_set_free(bset
);
7058 /* Construct the half-space x_pos >= 0.
7060 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7064 isl_basic_set
*nonneg
;
7066 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7067 k
= isl_basic_set_alloc_inequality(nonneg
);
7070 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7071 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7073 return isl_basic_set_finalize(nonneg
);
7075 isl_basic_set_free(nonneg
);
7079 /* Construct the half-space x_pos <= -1.
7081 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7086 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7087 k
= isl_basic_set_alloc_inequality(neg
);
7090 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7091 isl_int_set_si(neg
->ineq
[k
][0], -1);
7092 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7094 return isl_basic_set_finalize(neg
);
7096 isl_basic_set_free(neg
);
7100 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7101 enum isl_dim_type type
, unsigned first
, unsigned n
)
7104 isl_basic_set
*nonneg
;
7112 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7114 for (i
= 0; i
< n
; ++i
) {
7115 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7116 pos(set
->dim
, type
) + first
+ i
);
7117 neg
= neg_halfspace(isl_set_get_space(set
),
7118 pos(set
->dim
, type
) + first
+ i
);
7120 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7129 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7130 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7137 if (isl_set_plain_is_empty(set
)) {
7142 return fn(set
, signs
, user
);
7145 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7147 half
= isl_set_intersect(half
, isl_set_copy(set
));
7148 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7152 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7154 half
= isl_set_intersect(half
, set
);
7155 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7161 /* Call "fn" on the intersections of "set" with each of the orthants
7162 * (except for obviously empty intersections). The orthant is identified
7163 * by the signs array, with each entry having value 1 or -1 according
7164 * to the sign of the corresponding variable.
7166 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7167 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7177 if (isl_set_plain_is_empty(set
))
7180 nparam
= isl_set_dim(set
, isl_dim_param
);
7181 nvar
= isl_set_dim(set
, isl_dim_set
);
7183 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7185 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7193 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7195 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7198 int isl_basic_map_is_subset(
7199 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7202 struct isl_map
*map1
;
7203 struct isl_map
*map2
;
7205 if (!bmap1
|| !bmap2
)
7208 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7209 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7211 is_subset
= isl_map_is_subset(map1
, map2
);
7219 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7220 __isl_keep isl_basic_set
*bset2
)
7222 return isl_basic_map_is_subset(bset1
, bset2
);
7225 int isl_basic_map_is_equal(
7226 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7230 if (!bmap1
|| !bmap2
)
7232 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7235 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7239 int isl_basic_set_is_equal(
7240 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7242 return isl_basic_map_is_equal(
7243 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7246 int isl_map_is_empty(struct isl_map
*map
)
7253 for (i
= 0; i
< map
->n
; ++i
) {
7254 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7263 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7265 return map
? map
->n
== 0 : -1;
7268 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7270 return isl_map_plain_is_empty(map
);
7273 int isl_set_plain_is_empty(struct isl_set
*set
)
7275 return set
? set
->n
== 0 : -1;
7278 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7280 return isl_set_plain_is_empty(set
);
7283 int isl_set_is_empty(struct isl_set
*set
)
7285 return isl_map_is_empty((struct isl_map
*)set
);
7288 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7293 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7296 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7301 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7304 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7310 is_subset
= isl_map_is_subset(map1
, map2
);
7313 is_subset
= isl_map_is_subset(map2
, map1
);
7317 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7319 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7322 int isl_basic_map_is_strict_subset(
7323 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7327 if (!bmap1
|| !bmap2
)
7329 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7332 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7333 if (is_subset
== -1)
7338 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7344 is_subset
= isl_map_is_subset(map1
, map2
);
7347 is_subset
= isl_map_is_subset(map2
, map1
);
7348 if (is_subset
== -1)
7353 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7355 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7358 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7362 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7365 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7369 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7372 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7379 for (i
= 0; i
< map
->n
; ++i
) {
7380 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7388 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7390 return isl_map_plain_is_universe((isl_map
*) set
);
7393 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7395 return isl_set_plain_is_universe(set
);
7398 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7400 struct isl_basic_set
*bset
= NULL
;
7401 struct isl_vec
*sample
= NULL
;
7408 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7411 if (isl_basic_map_is_universe(bmap
))
7414 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7415 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7416 copy
= isl_basic_map_remove_redundancies(copy
);
7417 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
7418 isl_basic_map_free(copy
);
7422 total
= 1 + isl_basic_map_total_dim(bmap
);
7423 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7424 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7430 isl_vec_free(bmap
->sample
);
7431 bmap
->sample
= NULL
;
7432 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7435 sample
= isl_basic_set_sample_vec(bset
);
7438 empty
= sample
->size
== 0;
7439 isl_vec_free(bmap
->sample
);
7440 bmap
->sample
= sample
;
7442 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7447 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7451 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7454 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7456 return isl_basic_map_plain_is_empty(bmap
);
7459 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7463 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7466 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7468 return isl_basic_set_plain_is_empty(bset
);
7471 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7473 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7476 struct isl_map
*isl_basic_map_union(
7477 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7479 struct isl_map
*map
;
7480 if (!bmap1
|| !bmap2
)
7483 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7485 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7488 map
= isl_map_add_basic_map(map
, bmap1
);
7489 map
= isl_map_add_basic_map(map
, bmap2
);
7492 isl_basic_map_free(bmap1
);
7493 isl_basic_map_free(bmap2
);
7497 struct isl_set
*isl_basic_set_union(
7498 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7500 return (struct isl_set
*)isl_basic_map_union(
7501 (struct isl_basic_map
*)bset1
,
7502 (struct isl_basic_map
*)bset2
);
7505 /* Order divs such that any div only depends on previous divs */
7506 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7514 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7516 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7518 if (isl_int_is_zero(bmap
->div
[i
][0]))
7520 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7524 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7530 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7532 return (struct isl_basic_set
*)
7533 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7536 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7543 for (i
= 0; i
< map
->n
; ++i
) {
7544 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7555 /* Apply the expansion computed by isl_merge_divs.
7556 * The expansion itself is given by "exp" while the resulting
7557 * list of divs is given by "div".
7559 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7560 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7565 bset
= isl_basic_set_cow(bset
);
7569 if (div
->n_row
< bset
->n_div
)
7570 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7571 "not an expansion", goto error
);
7573 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7574 div
->n_row
- bset
->n_div
, 0,
7575 2 * (div
->n_row
- bset
->n_div
));
7577 n_div
= bset
->n_div
;
7578 for (i
= n_div
; i
< div
->n_row
; ++i
)
7579 if (isl_basic_set_alloc_div(bset
) < 0)
7583 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7584 if (j
>= 0 && exp
[j
] == i
) {
7586 isl_basic_map_swap_div(bset
, i
, j
);
7589 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7590 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7598 isl_basic_set_free(bset
);
7603 /* Look for a div in dst that corresponds to the div "div" in src.
7604 * The divs before "div" in src and dst are assumed to be the same.
7606 * Returns -1 if no corresponding div was found and the position
7607 * of the corresponding div in dst otherwise.
7609 static int find_div(struct isl_basic_map
*dst
,
7610 struct isl_basic_map
*src
, unsigned div
)
7614 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7616 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7617 for (i
= div
; i
< dst
->n_div
; ++i
)
7618 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7619 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7620 dst
->n_div
- div
) == -1)
7625 struct isl_basic_map
*isl_basic_map_align_divs(
7626 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7634 if (src
->n_div
== 0)
7637 for (i
= 0; i
< src
->n_div
; ++i
)
7638 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7640 src
= isl_basic_map_order_divs(src
);
7641 dst
= isl_basic_map_cow(dst
);
7642 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7643 src
->n_div
, 0, 2 * src
->n_div
);
7646 total
= isl_space_dim(src
->dim
, isl_dim_all
);
7647 for (i
= 0; i
< src
->n_div
; ++i
) {
7648 int j
= find_div(dst
, src
, i
);
7650 j
= isl_basic_map_alloc_div(dst
);
7653 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7654 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7655 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7659 isl_basic_map_swap_div(dst
, i
, j
);
7663 isl_basic_map_free(dst
);
7667 struct isl_basic_set
*isl_basic_set_align_divs(
7668 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7670 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7671 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7674 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7682 map
= isl_map_compute_divs(map
);
7683 map
= isl_map_cow(map
);
7687 for (i
= 1; i
< map
->n
; ++i
)
7688 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7689 for (i
= 1; i
< map
->n
; ++i
)
7690 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7692 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7696 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7698 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7701 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7702 __isl_take isl_map
*map
)
7706 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7707 map
= isl_map_intersect_domain(map
, set
);
7708 set
= isl_map_range(map
);
7716 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7717 __isl_take isl_map
*map
)
7719 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7722 /* There is no need to cow as removing empty parts doesn't change
7723 * the meaning of the set.
7725 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7732 for (i
= map
->n
- 1; i
>= 0; --i
)
7733 remove_if_empty(map
, i
);
7738 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7740 return (struct isl_set
*)
7741 isl_map_remove_empty_parts((struct isl_map
*)set
);
7744 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7746 struct isl_basic_map
*bmap
;
7747 if (!map
|| map
->n
== 0)
7749 bmap
= map
->p
[map
->n
-1];
7750 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7751 return isl_basic_map_copy(bmap
);
7754 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7756 return (struct isl_basic_set
*)
7757 isl_map_copy_basic_map((struct isl_map
*)set
);
7760 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7761 __isl_keep isl_basic_map
*bmap
)
7767 for (i
= map
->n
-1; i
>= 0; --i
) {
7768 if (map
->p
[i
] != bmap
)
7770 map
= isl_map_cow(map
);
7773 isl_basic_map_free(map
->p
[i
]);
7774 if (i
!= map
->n
-1) {
7775 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7776 map
->p
[i
] = map
->p
[map
->n
-1];
7787 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7788 struct isl_basic_set
*bset
)
7790 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7791 (struct isl_basic_map
*)bset
);
7794 /* Given two basic sets bset1 and bset2, compute the maximal difference
7795 * between the values of dimension pos in bset1 and those in bset2
7796 * for any common value of the parameters and dimensions preceding pos.
7798 static enum isl_lp_result
basic_set_maximal_difference_at(
7799 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7800 int pos
, isl_int
*opt
)
7803 struct isl_basic_map
*bmap1
= NULL
;
7804 struct isl_basic_map
*bmap2
= NULL
;
7805 struct isl_ctx
*ctx
;
7806 struct isl_vec
*obj
;
7809 unsigned dim1
, dim2
;
7810 enum isl_lp_result res
;
7812 if (!bset1
|| !bset2
)
7813 return isl_lp_error
;
7815 nparam
= isl_basic_set_n_param(bset1
);
7816 dim1
= isl_basic_set_n_dim(bset1
);
7817 dim2
= isl_basic_set_n_dim(bset2
);
7818 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7819 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7820 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7821 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7822 if (!bmap1
|| !bmap2
)
7824 bmap1
= isl_basic_map_cow(bmap1
);
7825 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7826 pos
, (dim1
- pos
) + (dim2
- pos
),
7827 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7828 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7831 total
= isl_basic_map_total_dim(bmap1
);
7833 obj
= isl_vec_alloc(ctx
, 1 + total
);
7834 isl_seq_clr(obj
->block
.data
, 1 + total
);
7835 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7836 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7839 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7841 isl_basic_map_free(bmap1
);
7845 isl_basic_map_free(bmap1
);
7846 isl_basic_map_free(bmap2
);
7847 return isl_lp_error
;
7850 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7851 * for any common value of the parameters and dimensions preceding pos
7852 * in both basic sets, the values of dimension pos in bset1 are
7853 * smaller or larger than those in bset2.
7856 * 1 if bset1 follows bset2
7857 * -1 if bset1 precedes bset2
7858 * 0 if bset1 and bset2 are incomparable
7859 * -2 if some error occurred.
7861 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7862 struct isl_basic_set
*bset2
, int pos
)
7865 enum isl_lp_result res
;
7870 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7872 if (res
== isl_lp_empty
)
7874 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7875 res
== isl_lp_unbounded
)
7877 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7886 /* Given two basic sets bset1 and bset2, check whether
7887 * for any common value of the parameters and dimensions preceding pos
7888 * there is a value of dimension pos in bset1 that is larger
7889 * than a value of the same dimension in bset2.
7892 * 1 if there exists such a pair
7893 * 0 if there is no such pair, but there is a pair of equal values
7895 * -2 if some error occurred.
7897 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7898 __isl_keep isl_basic_set
*bset2
, int pos
)
7901 enum isl_lp_result res
;
7906 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7908 if (res
== isl_lp_empty
)
7910 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7911 res
== isl_lp_unbounded
)
7913 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7915 else if (res
== isl_lp_ok
)
7924 /* Given two sets set1 and set2, check whether
7925 * for any common value of the parameters and dimensions preceding pos
7926 * there is a value of dimension pos in set1 that is larger
7927 * than a value of the same dimension in set2.
7930 * 1 if there exists such a pair
7931 * 0 if there is no such pair, but there is a pair of equal values
7933 * -2 if some error occurred.
7935 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7936 __isl_keep isl_set
*set2
, int pos
)
7944 for (i
= 0; i
< set1
->n
; ++i
)
7945 for (j
= 0; j
< set2
->n
; ++j
) {
7947 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7948 if (f
== 1 || f
== -2)
7957 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7958 unsigned pos
, isl_int
*val
)
7966 total
= isl_basic_map_total_dim(bmap
);
7967 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7968 for (; d
+1 > pos
; --d
)
7969 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7973 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7975 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7977 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7980 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7986 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7987 unsigned pos
, isl_int
*val
)
7999 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8002 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8003 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8004 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8005 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8009 isl_int_set(*val
, v
);
8015 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8016 unsigned pos
, isl_int
*val
)
8018 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8022 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8025 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8028 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8029 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8031 if (pos
>= isl_basic_map_dim(bmap
, type
))
8033 return isl_basic_map_plain_has_fixed_var(bmap
,
8034 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8037 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8038 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8040 if (pos
>= isl_map_dim(map
, type
))
8042 return isl_map_plain_has_fixed_var(map
,
8043 map_offset(map
, type
) - 1 + pos
, val
);
8046 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8047 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8049 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8052 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8053 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8055 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8058 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8059 * then return this fixed value in *val.
8061 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8062 unsigned dim
, isl_int
*val
)
8064 return isl_basic_set_plain_has_fixed_var(bset
,
8065 isl_basic_set_n_param(bset
) + dim
, val
);
8068 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8069 * then return this fixed value in *val.
8071 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8072 unsigned dim
, isl_int
*val
)
8074 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8077 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8078 unsigned dim
, isl_int
*val
)
8080 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8083 /* Check if input variable in has fixed value and if so and if val is not NULL,
8084 * then return this fixed value in *val.
8086 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8087 unsigned in
, isl_int
*val
)
8089 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8092 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8093 * and if val is not NULL, then return this lower bound in *val.
8095 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8096 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8098 int i
, i_eq
= -1, i_ineq
= -1;
8105 total
= isl_basic_set_total_dim(bset
);
8106 nparam
= isl_basic_set_n_param(bset
);
8107 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8108 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8114 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8115 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8117 if (i_eq
!= -1 || i_ineq
!= -1)
8121 if (i_eq
== -1 && i_ineq
== -1)
8123 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8124 /* The coefficient should always be one due to normalization. */
8125 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8127 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8129 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8130 total
- nparam
- dim
- 1) != -1)
8133 isl_int_neg(*val
, c
[0]);
8137 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8138 unsigned dim
, isl_int
*val
)
8150 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8154 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8156 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8157 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8159 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8163 isl_int_set(*val
, v
);
8174 /* uset_gist depends on constraints without existentially quantified
8175 * variables sorting first.
8177 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8179 const struct constraint
*c1
= (const struct constraint
*)p1
;
8180 const struct constraint
*c2
= (const struct constraint
*)p2
;
8182 unsigned size
= isl_min(c1
->size
, c2
->size
);
8184 l1
= isl_seq_last_non_zero(c1
->c
, size
);
8185 l2
= isl_seq_last_non_zero(c2
->c
, size
);
8190 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
8193 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8194 struct isl_basic_map
*bmap
)
8197 struct constraint
*c
;
8202 total
= isl_basic_map_total_dim(bmap
);
8203 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8206 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8208 c
[i
].c
= bmap
->ineq
[i
];
8210 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8211 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8212 bmap
->ineq
[i
] = c
[i
].c
;
8216 isl_basic_map_free(bmap
);
8220 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8221 __isl_take isl_basic_set
*bset
)
8223 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8224 (struct isl_basic_map
*)bset
);
8227 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8231 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8233 bmap
= isl_basic_map_remove_redundancies(bmap
);
8234 bmap
= isl_basic_map_sort_constraints(bmap
);
8235 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8239 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8241 return (struct isl_basic_set
*)isl_basic_map_normalize(
8242 (struct isl_basic_map
*)bset
);
8245 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8246 const __isl_keep isl_basic_map
*bmap2
)
8253 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8254 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8255 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8256 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8257 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8258 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8259 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8260 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8261 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8262 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8263 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8265 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8267 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8269 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8270 return bmap1
->n_eq
- bmap2
->n_eq
;
8271 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8272 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8273 if (bmap1
->n_div
!= bmap2
->n_div
)
8274 return bmap1
->n_div
- bmap2
->n_div
;
8275 total
= isl_basic_map_total_dim(bmap1
);
8276 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8277 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8281 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8282 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8286 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8287 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8294 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8295 const __isl_keep isl_basic_set
*bset2
)
8297 return isl_basic_map_plain_cmp(bset1
, bset2
);
8300 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8306 if (set1
->n
!= set2
->n
)
8307 return set1
->n
- set2
->n
;
8309 for (i
= 0; i
< set1
->n
; ++i
) {
8310 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8318 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8319 __isl_keep isl_basic_map
*bmap2
)
8321 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8324 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8325 __isl_keep isl_basic_set
*bset2
)
8327 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8328 (isl_basic_map
*)bset2
);
8331 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8333 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8334 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8336 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8339 /* We normalize in place, but if anything goes wrong we need
8340 * to return NULL, so we need to make sure we don't change the
8341 * meaning of any possible other copies of map.
8343 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8346 struct isl_basic_map
*bmap
;
8350 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8352 for (i
= 0; i
< map
->n
; ++i
) {
8353 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8356 isl_basic_map_free(map
->p
[i
]);
8359 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8360 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8361 map
= isl_map_remove_empty_parts(map
);
8364 for (i
= map
->n
- 1; i
>= 1; --i
) {
8365 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8367 isl_basic_map_free(map
->p
[i
-1]);
8368 for (j
= i
; j
< map
->n
; ++j
)
8369 map
->p
[j
-1] = map
->p
[j
];
8379 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8381 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8384 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8394 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8397 map1
= isl_map_copy(map1
);
8398 map2
= isl_map_copy(map2
);
8399 map1
= isl_map_normalize(map1
);
8400 map2
= isl_map_normalize(map2
);
8403 equal
= map1
->n
== map2
->n
;
8404 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8405 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8418 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8420 return isl_map_plain_is_equal(map1
, map2
);
8423 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8425 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8426 (struct isl_map
*)set2
);
8429 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8431 return isl_set_plain_is_equal(set1
, set2
);
8434 /* Return an interval that ranges from min to max (inclusive)
8436 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8437 isl_int min
, isl_int max
)
8440 struct isl_basic_set
*bset
= NULL
;
8442 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8446 k
= isl_basic_set_alloc_inequality(bset
);
8449 isl_int_set_si(bset
->ineq
[k
][1], 1);
8450 isl_int_neg(bset
->ineq
[k
][0], min
);
8452 k
= isl_basic_set_alloc_inequality(bset
);
8455 isl_int_set_si(bset
->ineq
[k
][1], -1);
8456 isl_int_set(bset
->ineq
[k
][0], max
);
8460 isl_basic_set_free(bset
);
8464 /* Return the Cartesian product of the basic sets in list (in the given order).
8466 __isl_give isl_basic_set
*isl_basic_set_list_product(
8467 __isl_take
struct isl_basic_set_list
*list
)
8475 struct isl_basic_set
*product
= NULL
;
8479 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8480 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8481 nparam
= isl_basic_set_n_param(list
->p
[0]);
8482 dim
= isl_basic_set_n_dim(list
->p
[0]);
8483 extra
= list
->p
[0]->n_div
;
8484 n_eq
= list
->p
[0]->n_eq
;
8485 n_ineq
= list
->p
[0]->n_ineq
;
8486 for (i
= 1; i
< list
->n
; ++i
) {
8487 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8488 isl_assert(list
->ctx
,
8489 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8490 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8491 extra
+= list
->p
[i
]->n_div
;
8492 n_eq
+= list
->p
[i
]->n_eq
;
8493 n_ineq
+= list
->p
[i
]->n_ineq
;
8495 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8500 for (i
= 0; i
< list
->n
; ++i
) {
8501 isl_basic_set_add_constraints(product
,
8502 isl_basic_set_copy(list
->p
[i
]), dim
);
8503 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8505 isl_basic_set_list_free(list
);
8508 isl_basic_set_free(product
);
8509 isl_basic_set_list_free(list
);
8513 struct isl_basic_map
*isl_basic_map_product(
8514 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8516 isl_space
*dim_result
= NULL
;
8517 struct isl_basic_map
*bmap
;
8518 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8519 struct isl_dim_map
*dim_map1
, *dim_map2
;
8521 if (!bmap1
|| !bmap2
)
8524 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8525 bmap2
->dim
, isl_dim_param
), goto error
);
8526 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8527 isl_space_copy(bmap2
->dim
));
8529 in1
= isl_basic_map_n_in(bmap1
);
8530 in2
= isl_basic_map_n_in(bmap2
);
8531 out1
= isl_basic_map_n_out(bmap1
);
8532 out2
= isl_basic_map_n_out(bmap2
);
8533 nparam
= isl_basic_map_n_param(bmap1
);
8535 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8536 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8537 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8538 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8539 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8540 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8541 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8542 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8543 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8544 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8545 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8547 bmap
= isl_basic_map_alloc_space(dim_result
,
8548 bmap1
->n_div
+ bmap2
->n_div
,
8549 bmap1
->n_eq
+ bmap2
->n_eq
,
8550 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8551 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8552 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8553 bmap
= isl_basic_map_simplify(bmap
);
8554 return isl_basic_map_finalize(bmap
);
8556 isl_basic_map_free(bmap1
);
8557 isl_basic_map_free(bmap2
);
8561 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8562 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8564 isl_basic_map
*prod
;
8566 prod
= isl_basic_map_product(bmap1
, bmap2
);
8567 prod
= isl_basic_map_flatten(prod
);
8571 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8572 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8574 return isl_basic_map_flat_range_product(bset1
, bset2
);
8577 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8578 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8580 isl_space
*space_result
= NULL
;
8581 isl_basic_map
*bmap
;
8582 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8583 struct isl_dim_map
*dim_map1
, *dim_map2
;
8585 if (!bmap1
|| !bmap2
)
8588 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8589 isl_space_copy(bmap2
->dim
));
8591 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8592 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8593 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8594 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8596 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8597 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8598 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8599 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8600 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8601 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8602 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8603 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8604 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8605 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8606 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8608 bmap
= isl_basic_map_alloc_space(space_result
,
8609 bmap1
->n_div
+ bmap2
->n_div
,
8610 bmap1
->n_eq
+ bmap2
->n_eq
,
8611 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8612 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8613 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8614 bmap
= isl_basic_map_simplify(bmap
);
8615 return isl_basic_map_finalize(bmap
);
8617 isl_basic_map_free(bmap1
);
8618 isl_basic_map_free(bmap2
);
8622 __isl_give isl_basic_map
*isl_basic_map_range_product(
8623 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8625 isl_space
*dim_result
= NULL
;
8626 isl_basic_map
*bmap
;
8627 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8628 struct isl_dim_map
*dim_map1
, *dim_map2
;
8630 if (!bmap1
|| !bmap2
)
8633 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8634 bmap2
->dim
, isl_dim_param
))
8635 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8636 "parameters don't match", goto error
);
8638 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8639 isl_space_copy(bmap2
->dim
));
8641 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8642 out1
= isl_basic_map_n_out(bmap1
);
8643 out2
= isl_basic_map_n_out(bmap2
);
8644 nparam
= isl_basic_map_n_param(bmap1
);
8646 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8647 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8648 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8649 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8650 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8651 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8652 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8653 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8654 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8655 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8656 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8658 bmap
= isl_basic_map_alloc_space(dim_result
,
8659 bmap1
->n_div
+ bmap2
->n_div
,
8660 bmap1
->n_eq
+ bmap2
->n_eq
,
8661 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8662 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8663 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8664 bmap
= isl_basic_map_simplify(bmap
);
8665 return isl_basic_map_finalize(bmap
);
8667 isl_basic_map_free(bmap1
);
8668 isl_basic_map_free(bmap2
);
8672 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8673 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8675 isl_basic_map
*prod
;
8677 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8678 prod
= isl_basic_map_flatten_range(prod
);
8682 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8683 __isl_take isl_map
*map2
,
8684 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8685 __isl_take isl_space
*right
),
8686 __isl_give isl_basic_map
*(*basic_map_product
)(
8687 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8690 struct isl_map
*result
;
8696 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8697 map2
->dim
, isl_dim_param
), goto error
);
8699 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8700 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8701 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8703 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8704 isl_space_copy(map2
->dim
)),
8705 map1
->n
* map2
->n
, flags
);
8708 for (i
= 0; i
< map1
->n
; ++i
)
8709 for (j
= 0; j
< map2
->n
; ++j
) {
8710 struct isl_basic_map
*part
;
8711 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8712 isl_basic_map_copy(map2
->p
[j
]));
8713 if (isl_basic_map_is_empty(part
))
8714 isl_basic_map_free(part
);
8716 result
= isl_map_add_basic_map(result
, part
);
8729 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8731 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8732 __isl_take isl_map
*map2
)
8734 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8737 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8738 __isl_take isl_map
*map2
)
8740 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8743 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8745 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8746 __isl_take isl_map
*map2
)
8750 prod
= isl_map_product(map1
, map2
);
8751 prod
= isl_map_flatten(prod
);
8755 /* Given two set A and B, construct its Cartesian product A x B.
8757 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8759 return isl_map_range_product(set1
, set2
);
8762 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8763 __isl_take isl_set
*set2
)
8765 return isl_map_flat_range_product(set1
, set2
);
8768 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8770 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8771 __isl_take isl_map
*map2
)
8773 return map_product(map1
, map2
, &isl_space_domain_product
,
8774 &isl_basic_map_domain_product
);
8777 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8779 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8780 __isl_take isl_map
*map2
)
8782 return map_product(map1
, map2
, &isl_space_range_product
,
8783 &isl_basic_map_range_product
);
8786 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8787 __isl_take isl_map
*map2
)
8789 return isl_map_align_params_map_map_and(map1
, map2
,
8790 &map_domain_product_aligned
);
8793 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8794 __isl_take isl_map
*map2
)
8796 return isl_map_align_params_map_map_and(map1
, map2
,
8797 &map_range_product_aligned
);
8800 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8802 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8803 __isl_take isl_map
*map2
)
8807 prod
= isl_map_domain_product(map1
, map2
);
8808 prod
= isl_map_flatten_domain(prod
);
8812 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8814 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8815 __isl_take isl_map
*map2
)
8819 prod
= isl_map_range_product(map1
, map2
);
8820 prod
= isl_map_flatten_range(prod
);
8824 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8827 uint32_t hash
= isl_hash_init();
8832 bmap
= isl_basic_map_copy(bmap
);
8833 bmap
= isl_basic_map_normalize(bmap
);
8836 total
= isl_basic_map_total_dim(bmap
);
8837 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8838 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8840 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8841 isl_hash_hash(hash
, c_hash
);
8843 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8844 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8846 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8847 isl_hash_hash(hash
, c_hash
);
8849 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8850 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8852 if (isl_int_is_zero(bmap
->div
[i
][0]))
8854 isl_hash_byte(hash
, i
& 0xFF);
8855 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8856 isl_hash_hash(hash
, c_hash
);
8858 isl_basic_map_free(bmap
);
8862 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8864 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8867 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8874 map
= isl_map_copy(map
);
8875 map
= isl_map_normalize(map
);
8879 hash
= isl_hash_init();
8880 for (i
= 0; i
< map
->n
; ++i
) {
8882 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8883 isl_hash_hash(hash
, bmap_hash
);
8891 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8893 return isl_map_get_hash((isl_map
*)set
);
8896 /* Check if the value for dimension dim is completely determined
8897 * by the values of the other parameters and variables.
8898 * That is, check if dimension dim is involved in an equality.
8900 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8907 nparam
= isl_basic_set_n_param(bset
);
8908 for (i
= 0; i
< bset
->n_eq
; ++i
)
8909 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8914 /* Check if the value for dimension dim is completely determined
8915 * by the values of the other parameters and variables.
8916 * That is, check if dimension dim is involved in an equality
8917 * for each of the subsets.
8919 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8925 for (i
= 0; i
< set
->n
; ++i
) {
8927 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8934 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8936 return set
? set
->n
: 0;
8939 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8940 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8947 for (i
= 0; i
< map
->n
; ++i
)
8948 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8954 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8955 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8962 for (i
= 0; i
< set
->n
; ++i
)
8963 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8969 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8976 bset
= isl_basic_set_cow(bset
);
8980 dim
= isl_basic_set_get_space(bset
);
8981 dim
= isl_space_lift(dim
, bset
->n_div
);
8984 isl_space_free(bset
->dim
);
8986 bset
->extra
-= bset
->n_div
;
8989 bset
= isl_basic_set_finalize(bset
);
8993 isl_basic_set_free(bset
);
8997 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9003 set
= isl_set_align_divs(set
);
9008 set
= isl_set_cow(set
);
9012 n_div
= set
->p
[0]->n_div
;
9013 dim
= isl_set_get_space(set
);
9014 dim
= isl_space_lift(dim
, n_div
);
9017 isl_space_free(set
->dim
);
9020 for (i
= 0; i
< set
->n
; ++i
) {
9021 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9032 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9035 struct isl_basic_map
*bmap
;
9042 set
= isl_set_align_divs(set
);
9047 dim
= isl_set_get_space(set
);
9048 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9050 return isl_map_identity(isl_space_map_from_set(dim
));
9053 n_div
= set
->p
[0]->n_div
;
9054 dim
= isl_space_map_from_set(dim
);
9055 n_param
= isl_space_dim(dim
, isl_dim_param
);
9056 n_set
= isl_space_dim(dim
, isl_dim_in
);
9057 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9058 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9059 for (i
= 0; i
< n_set
; ++i
)
9060 bmap
= var_equal(bmap
, i
);
9062 total
= n_param
+ n_set
+ n_set
+ n_div
;
9063 for (i
= 0; i
< n_div
; ++i
) {
9064 k
= isl_basic_map_alloc_inequality(bmap
);
9067 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9068 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9069 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9070 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9071 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9072 set
->p
[0]->div
[i
][0]);
9074 l
= isl_basic_map_alloc_inequality(bmap
);
9077 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9078 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9079 set
->p
[0]->div
[i
][0]);
9080 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9084 bmap
= isl_basic_map_simplify(bmap
);
9085 bmap
= isl_basic_map_finalize(bmap
);
9086 return isl_map_from_basic_map(bmap
);
9089 isl_basic_map_free(bmap
);
9093 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9101 dim
= isl_basic_set_total_dim(bset
);
9102 size
+= bset
->n_eq
* (1 + dim
);
9103 size
+= bset
->n_ineq
* (1 + dim
);
9104 size
+= bset
->n_div
* (2 + dim
);
9109 int isl_set_size(__isl_keep isl_set
*set
)
9117 for (i
= 0; i
< set
->n
; ++i
)
9118 size
+= isl_basic_set_size(set
->p
[i
]);
9123 /* Check if there is any lower bound (if lower == 0) and/or upper
9124 * bound (if upper == 0) on the specified dim.
9126 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9127 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9134 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9136 pos
+= isl_basic_map_offset(bmap
, type
);
9138 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9139 if (isl_int_is_zero(bmap
->div
[i
][0]))
9141 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9145 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9146 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9149 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9150 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9157 return lower
&& upper
;
9160 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9161 enum isl_dim_type type
, unsigned pos
)
9163 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9166 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9167 enum isl_dim_type type
, unsigned pos
)
9169 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9172 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9173 enum isl_dim_type type
, unsigned pos
)
9175 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9178 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9179 enum isl_dim_type type
, unsigned pos
)
9186 for (i
= 0; i
< map
->n
; ++i
) {
9188 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9189 if (bounded
< 0 || !bounded
)
9196 /* Return 1 if the specified dim is involved in both an upper bound
9197 * and a lower bound.
9199 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9200 enum isl_dim_type type
, unsigned pos
)
9202 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9205 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9207 static int has_any_bound(__isl_keep isl_map
*map
,
9208 enum isl_dim_type type
, unsigned pos
,
9209 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9210 enum isl_dim_type type
, unsigned pos
))
9217 for (i
= 0; i
< map
->n
; ++i
) {
9219 bounded
= fn(map
->p
[i
], type
, pos
);
9220 if (bounded
< 0 || bounded
)
9227 /* Return 1 if the specified dim is involved in any lower bound.
9229 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9230 enum isl_dim_type type
, unsigned pos
)
9232 return has_any_bound(set
, type
, pos
,
9233 &isl_basic_map_dim_has_lower_bound
);
9236 /* Return 1 if the specified dim is involved in any upper bound.
9238 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9239 enum isl_dim_type type
, unsigned pos
)
9241 return has_any_bound(set
, type
, pos
,
9242 &isl_basic_map_dim_has_upper_bound
);
9245 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9247 static int has_bound(__isl_keep isl_map
*map
,
9248 enum isl_dim_type type
, unsigned pos
,
9249 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9250 enum isl_dim_type type
, unsigned pos
))
9257 for (i
= 0; i
< map
->n
; ++i
) {
9259 bounded
= fn(map
->p
[i
], type
, pos
);
9260 if (bounded
< 0 || !bounded
)
9267 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9269 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9270 enum isl_dim_type type
, unsigned pos
)
9272 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9275 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9277 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9278 enum isl_dim_type type
, unsigned pos
)
9280 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9283 /* For each of the "n" variables starting at "first", determine
9284 * the sign of the variable and put the results in the first "n"
9285 * elements of the array "signs".
9287 * 1 means that the variable is non-negative
9288 * -1 means that the variable is non-positive
9289 * 0 means the variable attains both positive and negative values.
9291 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9292 unsigned first
, unsigned n
, int *signs
)
9294 isl_vec
*bound
= NULL
;
9295 struct isl_tab
*tab
= NULL
;
9296 struct isl_tab_undo
*snap
;
9299 if (!bset
|| !signs
)
9302 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9303 tab
= isl_tab_from_basic_set(bset
, 0);
9307 isl_seq_clr(bound
->el
, bound
->size
);
9308 isl_int_set_si(bound
->el
[0], -1);
9310 snap
= isl_tab_snap(tab
);
9311 for (i
= 0; i
< n
; ++i
) {
9314 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9315 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9318 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9319 if (isl_tab_rollback(tab
, snap
) < 0)
9327 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9328 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9331 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9332 if (isl_tab_rollback(tab
, snap
) < 0)
9335 signs
[i
] = empty
? -1 : 0;
9339 isl_vec_free(bound
);
9343 isl_vec_free(bound
);
9347 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9348 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9350 if (!bset
|| !signs
)
9352 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9355 first
+= pos(bset
->dim
, type
) - 1;
9356 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9359 /* Check if the given basic map is obviously single-valued.
9360 * In particular, for each output dimension, check that there is
9361 * an equality that defines the output dimension in terms of
9362 * earlier dimensions.
9364 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9374 total
= 1 + isl_basic_map_total_dim(bmap
);
9375 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9376 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9378 for (i
= 0; i
< n_out
; ++i
) {
9379 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9380 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9382 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9383 total
- (o_out
+ i
+ 1)) == -1)
9386 if (j
>= bmap
->n_eq
)
9393 /* Check if the given basic map is single-valued.
9398 * and check if the result is a subset of the identity mapping.
9400 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9403 isl_basic_map
*test
;
9407 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9411 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9412 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9414 space
= isl_basic_map_get_space(bmap
);
9415 space
= isl_space_map_from_set(isl_space_range(space
));
9416 id
= isl_basic_map_identity(space
);
9418 sv
= isl_basic_map_is_subset(test
, id
);
9420 isl_basic_map_free(test
);
9421 isl_basic_map_free(id
);
9426 /* Check if the given map is obviously single-valued.
9428 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9437 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9440 /* Check if the given map is single-valued.
9445 * and check if the result is a subset of the identity mapping.
9447 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9454 sv
= isl_map_plain_is_single_valued(map
);
9458 test
= isl_map_reverse(isl_map_copy(map
));
9459 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9461 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9462 id
= isl_map_identity(dim
);
9464 sv
= isl_map_is_subset(test
, id
);
9472 int isl_map_is_injective(__isl_keep isl_map
*map
)
9476 map
= isl_map_copy(map
);
9477 map
= isl_map_reverse(map
);
9478 in
= isl_map_is_single_valued(map
);
9484 /* Check if the given map is obviously injective.
9486 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9490 map
= isl_map_copy(map
);
9491 map
= isl_map_reverse(map
);
9492 in
= isl_map_plain_is_single_valued(map
);
9498 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9502 sv
= isl_map_is_single_valued(map
);
9506 return isl_map_is_injective(map
);
9509 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9511 return isl_map_is_single_valued((isl_map
*)set
);
9514 int isl_map_is_translation(__isl_keep isl_map
*map
)
9519 delta
= isl_map_deltas(isl_map_copy(map
));
9520 ok
= isl_set_is_singleton(delta
);
9521 isl_set_free(delta
);
9526 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9528 if (isl_seq_first_non_zero(p
, pos
) != -1)
9530 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9535 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9544 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9547 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9548 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9549 for (j
= 0; j
< nvar
; ++j
) {
9550 int lower
= 0, upper
= 0;
9551 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9552 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9554 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9560 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9561 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9563 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9565 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9570 if (!lower
|| !upper
)
9577 int isl_set_is_box(__isl_keep isl_set
*set
)
9584 return isl_basic_set_is_box(set
->p
[0]);
9587 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9592 return isl_space_is_wrapping(bset
->dim
);
9595 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9600 return isl_space_is_wrapping(set
->dim
);
9603 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9605 bmap
= isl_basic_map_cow(bmap
);
9609 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9613 bmap
= isl_basic_map_finalize(bmap
);
9615 return (isl_basic_set
*)bmap
;
9617 isl_basic_map_free(bmap
);
9621 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9625 map
= isl_map_cow(map
);
9629 for (i
= 0; i
< map
->n
; ++i
) {
9630 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9634 map
->dim
= isl_space_wrap(map
->dim
);
9638 return (isl_set
*)map
;
9644 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9646 bset
= isl_basic_set_cow(bset
);
9650 bset
->dim
= isl_space_unwrap(bset
->dim
);
9654 bset
= isl_basic_set_finalize(bset
);
9656 return (isl_basic_map
*)bset
;
9658 isl_basic_set_free(bset
);
9662 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9669 if (!isl_set_is_wrapping(set
))
9670 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9673 set
= isl_set_cow(set
);
9677 for (i
= 0; i
< set
->n
; ++i
) {
9678 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9683 set
->dim
= isl_space_unwrap(set
->dim
);
9687 return (isl_map
*)set
;
9693 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9694 enum isl_dim_type type
)
9699 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9702 bmap
= isl_basic_map_cow(bmap
);
9706 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9710 bmap
= isl_basic_map_finalize(bmap
);
9714 isl_basic_map_free(bmap
);
9718 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9719 enum isl_dim_type type
)
9726 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9729 map
= isl_map_cow(map
);
9733 for (i
= 0; i
< map
->n
; ++i
) {
9734 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9738 map
->dim
= isl_space_reset(map
->dim
, type
);
9748 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9753 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9756 bmap
= isl_basic_map_cow(bmap
);
9760 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9764 bmap
= isl_basic_map_finalize(bmap
);
9768 isl_basic_map_free(bmap
);
9772 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9774 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9777 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9778 __isl_take isl_basic_map
*bmap
)
9783 if (!bmap
->dim
->nested
[0])
9786 bmap
= isl_basic_map_cow(bmap
);
9790 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9794 bmap
= isl_basic_map_finalize(bmap
);
9798 isl_basic_map_free(bmap
);
9802 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9803 __isl_take isl_basic_map
*bmap
)
9808 if (!bmap
->dim
->nested
[1])
9811 bmap
= isl_basic_map_cow(bmap
);
9815 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9819 bmap
= isl_basic_map_finalize(bmap
);
9823 isl_basic_map_free(bmap
);
9827 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9834 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9837 map
= isl_map_cow(map
);
9841 for (i
= 0; i
< map
->n
; ++i
) {
9842 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9846 map
->dim
= isl_space_flatten(map
->dim
);
9856 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9858 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9861 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9863 isl_space
*dim
, *flat_dim
;
9866 dim
= isl_set_get_space(set
);
9867 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9868 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9869 map
= isl_map_intersect_domain(map
, set
);
9874 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9881 if (!map
->dim
->nested
[0])
9884 map
= isl_map_cow(map
);
9888 for (i
= 0; i
< map
->n
; ++i
) {
9889 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9893 map
->dim
= isl_space_flatten_domain(map
->dim
);
9903 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9910 if (!map
->dim
->nested
[1])
9913 map
= isl_map_cow(map
);
9917 for (i
= 0; i
< map
->n
; ++i
) {
9918 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9922 map
->dim
= isl_space_flatten_range(map
->dim
);
9932 /* Reorder the dimensions of "bmap" according to the given dim_map
9933 * and set the dimension specification to "dim".
9935 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9936 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9941 bmap
= isl_basic_map_cow(bmap
);
9942 if (!bmap
|| !dim
|| !dim_map
)
9945 flags
= bmap
->flags
;
9946 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9947 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9948 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9949 res
= isl_basic_map_alloc_space(dim
,
9950 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9951 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9954 res
= isl_basic_map_finalize(res
);
9958 isl_basic_map_free(bmap
);
9959 isl_space_free(dim
);
9963 /* Reorder the dimensions of "map" according to given reordering.
9965 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9966 __isl_take isl_reordering
*r
)
9969 struct isl_dim_map
*dim_map
;
9971 map
= isl_map_cow(map
);
9972 dim_map
= isl_dim_map_from_reordering(r
);
9973 if (!map
|| !r
|| !dim_map
)
9976 for (i
= 0; i
< map
->n
; ++i
) {
9977 struct isl_dim_map
*dim_map_i
;
9979 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9981 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9982 isl_space_copy(r
->dim
), dim_map_i
);
9988 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
9990 isl_reordering_free(r
);
9996 isl_reordering_free(r
);
10000 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10001 __isl_take isl_reordering
*r
)
10003 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10006 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10007 __isl_take isl_space
*model
)
10011 if (!map
|| !model
)
10014 ctx
= isl_space_get_ctx(model
);
10015 if (!isl_space_has_named_params(model
))
10016 isl_die(ctx
, isl_error_invalid
,
10017 "model has unnamed parameters", goto error
);
10018 if (!isl_space_has_named_params(map
->dim
))
10019 isl_die(ctx
, isl_error_invalid
,
10020 "relation has unnamed parameters", goto error
);
10021 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10022 isl_reordering
*exp
;
10024 model
= isl_space_drop_dims(model
, isl_dim_in
,
10025 0, isl_space_dim(model
, isl_dim_in
));
10026 model
= isl_space_drop_dims(model
, isl_dim_out
,
10027 0, isl_space_dim(model
, isl_dim_out
));
10028 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10029 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10030 map
= isl_map_realign(map
, exp
);
10033 isl_space_free(model
);
10036 isl_space_free(model
);
10041 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10042 __isl_take isl_space
*model
)
10044 return isl_map_align_params(set
, model
);
10047 /* Align the parameters of "bmap" to those of "model", introducing
10048 * additional parameters if needed.
10050 __isl_give isl_basic_map
*isl_basic_map_align_params(
10051 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10055 if (!bmap
|| !model
)
10058 ctx
= isl_space_get_ctx(model
);
10059 if (!isl_space_has_named_params(model
))
10060 isl_die(ctx
, isl_error_invalid
,
10061 "model has unnamed parameters", goto error
);
10062 if (!isl_space_has_named_params(bmap
->dim
))
10063 isl_die(ctx
, isl_error_invalid
,
10064 "relation has unnamed parameters", goto error
);
10065 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10066 isl_reordering
*exp
;
10067 struct isl_dim_map
*dim_map
;
10069 model
= isl_space_drop_dims(model
, isl_dim_in
,
10070 0, isl_space_dim(model
, isl_dim_in
));
10071 model
= isl_space_drop_dims(model
, isl_dim_out
,
10072 0, isl_space_dim(model
, isl_dim_out
));
10073 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10074 exp
= isl_reordering_extend_space(exp
,
10075 isl_basic_map_get_space(bmap
));
10076 dim_map
= isl_dim_map_from_reordering(exp
);
10077 bmap
= isl_basic_map_realign(bmap
,
10078 exp
? isl_space_copy(exp
->dim
) : NULL
,
10079 isl_dim_map_extend(dim_map
, bmap
));
10080 isl_reordering_free(exp
);
10084 isl_space_free(model
);
10087 isl_space_free(model
);
10088 isl_basic_map_free(bmap
);
10092 /* Align the parameters of "bset" to those of "model", introducing
10093 * additional parameters if needed.
10095 __isl_give isl_basic_set
*isl_basic_set_align_params(
10096 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10098 return isl_basic_map_align_params(bset
, model
);
10101 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10102 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10103 enum isl_dim_type c2
, enum isl_dim_type c3
,
10104 enum isl_dim_type c4
, enum isl_dim_type c5
)
10106 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10107 struct isl_mat
*mat
;
10113 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10114 isl_basic_map_total_dim(bmap
) + 1);
10117 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10118 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10119 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10120 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10121 isl_int_set(mat
->row
[i
][pos
],
10122 bmap
->eq
[i
][off
+ k
]);
10130 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10131 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10132 enum isl_dim_type c2
, enum isl_dim_type c3
,
10133 enum isl_dim_type c4
, enum isl_dim_type c5
)
10135 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10136 struct isl_mat
*mat
;
10142 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10143 isl_basic_map_total_dim(bmap
) + 1);
10146 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10147 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10148 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10149 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10150 isl_int_set(mat
->row
[i
][pos
],
10151 bmap
->ineq
[i
][off
+ k
]);
10159 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10160 __isl_take isl_space
*dim
,
10161 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10162 enum isl_dim_type c2
, enum isl_dim_type c3
,
10163 enum isl_dim_type c4
, enum isl_dim_type c5
)
10165 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10166 isl_basic_map
*bmap
;
10172 if (!dim
|| !eq
|| !ineq
)
10175 if (eq
->n_col
!= ineq
->n_col
)
10176 isl_die(dim
->ctx
, isl_error_invalid
,
10177 "equalities and inequalities matrices should have "
10178 "same number of columns", goto error
);
10180 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10182 if (eq
->n_col
< total
)
10183 isl_die(dim
->ctx
, isl_error_invalid
,
10184 "number of columns too small", goto error
);
10186 extra
= eq
->n_col
- total
;
10188 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10189 eq
->n_row
, ineq
->n_row
);
10192 for (i
= 0; i
< extra
; ++i
) {
10193 k
= isl_basic_map_alloc_div(bmap
);
10196 isl_int_set_si(bmap
->div
[k
][0], 0);
10198 for (i
= 0; i
< eq
->n_row
; ++i
) {
10199 l
= isl_basic_map_alloc_equality(bmap
);
10202 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10203 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10204 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10205 isl_int_set(bmap
->eq
[l
][off
+ k
],
10211 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10212 l
= isl_basic_map_alloc_inequality(bmap
);
10215 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10216 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10217 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10218 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10219 ineq
->row
[i
][pos
]);
10225 isl_space_free(dim
);
10227 isl_mat_free(ineq
);
10231 isl_space_free(dim
);
10233 isl_mat_free(ineq
);
10237 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10238 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10239 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10241 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10242 c1
, c2
, c3
, c4
, isl_dim_in
);
10245 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10246 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10247 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10249 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10250 c1
, c2
, c3
, c4
, isl_dim_in
);
10253 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10254 __isl_take isl_space
*dim
,
10255 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10256 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10258 return (isl_basic_set
*)
10259 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10260 c1
, c2
, c3
, c4
, isl_dim_in
);
10263 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10268 return isl_space_can_zip(bmap
->dim
);
10271 int isl_map_can_zip(__isl_keep isl_map
*map
)
10276 return isl_space_can_zip(map
->dim
);
10279 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10280 * (A -> C) -> (B -> D).
10282 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10291 if (!isl_basic_map_can_zip(bmap
))
10292 isl_die(bmap
->ctx
, isl_error_invalid
,
10293 "basic map cannot be zipped", goto error
);
10294 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10295 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10296 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10297 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10298 bmap
= isl_basic_map_cow(bmap
);
10299 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10302 bmap
->dim
= isl_space_zip(bmap
->dim
);
10307 isl_basic_map_free(bmap
);
10311 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10312 * (A -> C) -> (B -> D).
10314 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10321 if (!isl_map_can_zip(map
))
10322 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10325 map
= isl_map_cow(map
);
10329 for (i
= 0; i
< map
->n
; ++i
) {
10330 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10335 map
->dim
= isl_space_zip(map
->dim
);
10345 /* Can we apply isl_basic_map_curry to "bmap"?
10346 * That is, does it have a nested relation in its domain?
10348 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10353 return isl_space_can_curry(bmap
->dim
);
10356 /* Can we apply isl_map_curry to "map"?
10357 * That is, does it have a nested relation in its domain?
10359 int isl_map_can_curry(__isl_keep isl_map
*map
)
10364 return isl_space_can_curry(map
->dim
);
10367 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10370 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10376 if (!isl_basic_map_can_curry(bmap
))
10377 isl_die(bmap
->ctx
, isl_error_invalid
,
10378 "basic map cannot be curried", goto error
);
10379 bmap
->dim
= isl_space_curry(bmap
->dim
);
10384 isl_basic_map_free(bmap
);
10388 /* Given a map (A -> B) -> C, return the corresponding map
10391 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10398 if (!isl_map_can_curry(map
))
10399 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10402 map
= isl_map_cow(map
);
10406 for (i
= 0; i
< map
->n
; ++i
) {
10407 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10412 map
->dim
= isl_space_curry(map
->dim
);
10422 /* Can we apply isl_basic_map_uncurry to "bmap"?
10423 * That is, does it have a nested relation in its domain?
10425 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10430 return isl_space_can_uncurry(bmap
->dim
);
10433 /* Can we apply isl_map_uncurry to "map"?
10434 * That is, does it have a nested relation in its domain?
10436 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10441 return isl_space_can_uncurry(map
->dim
);
10444 /* Given a basic map A -> (B -> C), return the corresponding basic map
10447 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10453 if (!isl_basic_map_can_uncurry(bmap
))
10454 isl_die(bmap
->ctx
, isl_error_invalid
,
10455 "basic map cannot be uncurried",
10456 return isl_basic_map_free(bmap
));
10457 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10459 return isl_basic_map_free(bmap
);
10463 /* Given a map A -> (B -> C), return the corresponding map
10466 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10473 if (!isl_map_can_uncurry(map
))
10474 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10475 return isl_map_free(map
));
10477 map
= isl_map_cow(map
);
10481 for (i
= 0; i
< map
->n
; ++i
) {
10482 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10484 return isl_map_free(map
);
10487 map
->dim
= isl_space_uncurry(map
->dim
);
10489 return isl_map_free(map
);
10494 /* Construct a basic map mapping the domain of the affine expression
10495 * to a one-dimensional range prescribed by the affine expression.
10497 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10501 isl_local_space
*ls
;
10502 isl_basic_map
*bmap
;
10507 ls
= isl_aff_get_local_space(aff
);
10508 bmap
= isl_basic_map_from_local_space(ls
);
10509 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10510 k
= isl_basic_map_alloc_equality(bmap
);
10514 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10515 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10516 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10517 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10518 aff
->v
->size
- (pos
+ 1));
10521 bmap
= isl_basic_map_finalize(bmap
);
10525 isl_basic_map_free(bmap
);
10529 /* Construct a map mapping the domain of the affine expression
10530 * to a one-dimensional range prescribed by the affine expression.
10532 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10534 isl_basic_map
*bmap
;
10536 bmap
= isl_basic_map_from_aff(aff
);
10537 return isl_map_from_basic_map(bmap
);
10540 /* Construct a basic map mapping the domain the multi-affine expression
10541 * to its range, with each dimension in the range equated to the
10542 * corresponding affine expression.
10544 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10545 __isl_take isl_multi_aff
*maff
)
10549 isl_basic_map
*bmap
;
10554 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10555 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10556 "invalid space", return isl_multi_aff_free(maff
));
10558 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10559 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10561 for (i
= 0; i
< maff
->n
; ++i
) {
10563 isl_basic_map
*bmap_i
;
10565 aff
= isl_aff_copy(maff
->p
[i
]);
10566 bmap_i
= isl_basic_map_from_aff(aff
);
10568 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10571 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10573 isl_multi_aff_free(maff
);
10577 /* Construct a map mapping the domain the multi-affine expression
10578 * to its range, with each dimension in the range equated to the
10579 * corresponding affine expression.
10581 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10583 isl_basic_map
*bmap
;
10585 bmap
= isl_basic_map_from_multi_aff(maff
);
10586 return isl_map_from_basic_map(bmap
);
10589 /* Construct a basic map mapping a domain in the given space to
10590 * to an n-dimensional range, with n the number of elements in the list,
10591 * where each coordinate in the range is prescribed by the
10592 * corresponding affine expression.
10593 * The domains of all affine expressions in the list are assumed to match
10596 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10597 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10601 isl_basic_map
*bmap
;
10606 dim
= isl_space_from_domain(domain_dim
);
10607 bmap
= isl_basic_map_universe(dim
);
10609 for (i
= 0; i
< list
->n
; ++i
) {
10611 isl_basic_map
*bmap_i
;
10613 aff
= isl_aff_copy(list
->p
[i
]);
10614 bmap_i
= isl_basic_map_from_aff(aff
);
10616 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10619 isl_aff_list_free(list
);
10623 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10624 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10626 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10629 /* Construct a basic map where the given dimensions are equal to each other.
10631 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10632 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10634 isl_basic_map
*bmap
= NULL
;
10640 if (pos1
>= isl_space_dim(space
, type1
))
10641 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10642 "index out of bounds", goto error
);
10643 if (pos2
>= isl_space_dim(space
, type2
))
10644 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10645 "index out of bounds", goto error
);
10647 if (type1
== type2
&& pos1
== pos2
)
10648 return isl_basic_map_universe(space
);
10650 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10651 i
= isl_basic_map_alloc_equality(bmap
);
10654 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10655 pos1
+= isl_basic_map_offset(bmap
, type1
);
10656 pos2
+= isl_basic_map_offset(bmap
, type2
);
10657 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10658 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10659 bmap
= isl_basic_map_finalize(bmap
);
10660 isl_space_free(space
);
10663 isl_space_free(space
);
10664 isl_basic_map_free(bmap
);
10668 /* Add a constraint imposing that the given two dimensions are equal.
10670 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10671 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10675 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10677 bmap
= isl_basic_map_intersect(bmap
, eq
);
10682 /* Add a constraint imposing that the given two dimensions are equal.
10684 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10685 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10687 isl_basic_map
*bmap
;
10689 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10691 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10696 /* Add a constraint imposing that the given two dimensions have opposite values.
10698 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10699 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10701 isl_basic_map
*bmap
= NULL
;
10707 if (pos1
>= isl_map_dim(map
, type1
))
10708 isl_die(map
->ctx
, isl_error_invalid
,
10709 "index out of bounds", goto error
);
10710 if (pos2
>= isl_map_dim(map
, type2
))
10711 isl_die(map
->ctx
, isl_error_invalid
,
10712 "index out of bounds", goto error
);
10714 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10715 i
= isl_basic_map_alloc_equality(bmap
);
10718 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10719 pos1
+= isl_basic_map_offset(bmap
, type1
);
10720 pos2
+= isl_basic_map_offset(bmap
, type2
);
10721 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10722 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10723 bmap
= isl_basic_map_finalize(bmap
);
10725 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10729 isl_basic_map_free(bmap
);
10734 /* Add a constraint imposing that the value of the first dimension is
10735 * greater than or equal to that of the second.
10737 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10738 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10741 isl_local_space
*ls
;
10746 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10747 isl_die(bmap
->ctx
, isl_error_invalid
,
10748 "index out of bounds", return isl_basic_map_free(bmap
));
10749 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10750 isl_die(bmap
->ctx
, isl_error_invalid
,
10751 "index out of bounds", return isl_basic_map_free(bmap
));
10753 if (type1
== type2
&& pos1
== pos2
)
10756 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10757 c
= isl_inequality_alloc(ls
);
10758 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10759 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10760 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10765 /* Add a constraint imposing that the value of the first dimension is
10766 * greater than that of the second.
10768 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10769 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10771 isl_basic_map
*bmap
= NULL
;
10777 if (pos1
>= isl_map_dim(map
, type1
))
10778 isl_die(map
->ctx
, isl_error_invalid
,
10779 "index out of bounds", goto error
);
10780 if (pos2
>= isl_map_dim(map
, type2
))
10781 isl_die(map
->ctx
, isl_error_invalid
,
10782 "index out of bounds", goto error
);
10784 if (type1
== type2
&& pos1
== pos2
) {
10785 isl_space
*space
= isl_map_get_space(map
);
10787 return isl_map_empty(space
);
10790 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10791 i
= isl_basic_map_alloc_inequality(bmap
);
10794 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10795 pos1
+= isl_basic_map_offset(bmap
, type1
);
10796 pos2
+= isl_basic_map_offset(bmap
, type2
);
10797 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10798 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10799 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10800 bmap
= isl_basic_map_finalize(bmap
);
10802 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10806 isl_basic_map_free(bmap
);
10811 /* Add a constraint imposing that the value of the first dimension is
10812 * smaller than that of the second.
10814 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
10815 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10817 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
10820 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10824 isl_local_space
*ls
;
10829 if (!isl_basic_map_divs_known(bmap
))
10830 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10831 "some divs are unknown", return NULL
);
10833 ls
= isl_basic_map_get_local_space(bmap
);
10834 div
= isl_local_space_get_div(ls
, pos
);
10835 isl_local_space_free(ls
);
10840 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10843 return isl_basic_map_get_div(bset
, pos
);
10846 /* Plug in "subs" for dimension "type", "pos" of "bset".
10848 * Let i be the dimension to replace and let "subs" be of the form
10852 * Any integer division with a non-zero coefficient for i,
10854 * floor((a i + g)/m)
10858 * floor((a f + d g)/(m d))
10860 * Constraints of the form
10868 * We currently require that "subs" is an integral expression.
10869 * Handling rational expressions may require us to add stride constraints
10870 * as we do in isl_basic_set_preimage_multi_aff.
10872 __isl_give isl_basic_set
*isl_basic_set_substitute(
10873 __isl_take isl_basic_set
*bset
,
10874 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10880 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10883 bset
= isl_basic_set_cow(bset
);
10884 if (!bset
|| !subs
)
10887 ctx
= isl_basic_set_get_ctx(bset
);
10888 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10889 isl_die(ctx
, isl_error_invalid
,
10890 "spaces don't match", goto error
);
10891 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10892 isl_die(ctx
, isl_error_unsupported
,
10893 "cannot handle divs yet", goto error
);
10894 if (!isl_int_is_one(subs
->v
->el
[0]))
10895 isl_die(ctx
, isl_error_invalid
,
10896 "can only substitute integer expressions", goto error
);
10898 pos
+= isl_basic_set_offset(bset
, type
);
10902 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10903 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10905 isl_int_set(v
, bset
->eq
[i
][pos
]);
10906 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10907 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10908 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10911 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10912 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10914 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10915 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10916 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10917 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10920 for (i
= 0; i
< bset
->n_div
; ++i
) {
10921 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10923 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10924 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10925 isl_seq_combine(bset
->div
[i
] + 1,
10926 subs
->v
->el
[0], bset
->div
[i
] + 1,
10927 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10928 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10933 bset
= isl_basic_set_simplify(bset
);
10934 return isl_basic_set_finalize(bset
);
10936 isl_basic_set_free(bset
);
10940 /* Plug in "subs" for dimension "type", "pos" of "set".
10942 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10943 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10947 if (set
&& isl_set_plain_is_empty(set
))
10950 set
= isl_set_cow(set
);
10954 for (i
= set
->n
- 1; i
>= 0; --i
) {
10955 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10956 if (remove_if_empty(set
, i
) < 0)
10966 /* Check if the range of "ma" is compatible with "space".
10967 * Return -1 if anything is wrong.
10969 static int check_space_compatible_range_multi_aff(
10970 __isl_keep isl_space
*space
, __isl_keep isl_multi_aff
*ma
)
10973 isl_space
*ma_space
;
10975 ma_space
= isl_multi_aff_get_space(ma
);
10976 m
= isl_space_is_range_internal(space
, ma_space
);
10977 isl_space_free(ma_space
);
10979 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10980 "spaces don't match", return -1);
10984 /* Check if the range of "ma" is compatible with "bset".
10985 * Return -1 if anything is wrong.
10987 static int check_basic_set_compatible_range_multi_aff(
10988 __isl_keep isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
10990 return check_space_compatible_range_multi_aff(bset
->dim
, ma
);
10993 /* Copy the divs from "ma" to "bset", adding zeros for the coefficients
10994 * of the other divs in "bset".
10996 static int set_ma_divs(__isl_keep isl_basic_set
*bset
,
10997 __isl_keep isl_multi_aff
*ma
, int n_div
)
11000 isl_local_space
*ls
;
11005 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11009 for (i
= 0; i
< n_div
; ++i
) {
11010 isl_seq_cpy(bset
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
11011 isl_seq_clr(bset
->div
[i
] + ls
->div
->n_col
, bset
->n_div
- n_div
);
11012 if (isl_basic_set_add_div_constraints(bset
, i
) < 0)
11016 isl_local_space_free(ls
);
11019 isl_local_space_free(ls
);
11023 /* How many stride constraints does "ma" enforce?
11024 * That is, how many of the affine expressions have a denominator
11025 * different from one?
11027 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11032 for (i
= 0; i
< ma
->n
; ++i
)
11033 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11039 /* For each affine expression in ma of the form
11041 * x_i = (f_i y + h_i)/m_i
11043 * with m_i different from one, add a constraint to "bset"
11046 * f_i y + h_i = m_i alpha_i
11048 * with alpha_i an additional existentially quantified variable.
11050 static __isl_give isl_basic_set
*add_ma_strides(
11051 __isl_take isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11057 total
= isl_basic_set_total_dim(bset
);
11058 for (i
= 0; i
< ma
->n
; ++i
) {
11061 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11063 div
= isl_basic_set_alloc_div(bset
);
11064 k
= isl_basic_set_alloc_equality(bset
);
11065 if (div
< 0 || k
< 0)
11067 isl_int_set_si(bset
->div
[div
][0], 0);
11068 len
= ma
->p
[i
]->v
->size
;
11069 isl_seq_cpy(bset
->eq
[k
], ma
->p
[i
]->v
->el
+ 1, len
- 1);
11070 isl_seq_clr(bset
->eq
[k
] + len
- 1, 1 + total
- (len
- 1));
11071 isl_int_neg(bset
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11077 isl_basic_set_free(bset
);
11081 /* Compute the preimage of "bset" under the function represented by "ma".
11082 * In other words, plug in "ma" in "bset". The result is a basic set
11083 * that lives in the domain space of "ma".
11085 * If bset is represented by
11087 * A(p) + B x + C(divs) >= 0
11089 * and ma is represented by
11091 * x = D(p) + F(y) + G(divs')
11093 * then the result is
11095 * A(p) + B D(p) + B F(y) + B G(divs') + C(divs) >= 0
11097 * The divs in the input set are similarly adjusted.
11100 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
11104 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
11106 * If bset is not a rational set and if F(y) involves any denominators
11108 * x_i = (f_i y + h_i)/m_i
11110 * the additional constraints are added to ensure that we only
11111 * map back integer points. That is we enforce
11113 * f_i y + h_i = m_i alpha_i
11115 * with alpha_i an additional existentially quantified variable.
11117 * We first copy over the divs from "ma".
11118 * Then we add the modified constraints and divs from "bset".
11119 * Finally, we add the stride constraints, if needed.
11121 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11122 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11126 isl_basic_set
*res
= NULL
;
11127 int n_div_bset
, n_div_ma
;
11128 isl_int f
, c1
, c2
, g
;
11129 int rational
, strides
;
11136 ma
= isl_multi_aff_align_divs(ma
);
11139 if (check_basic_set_compatible_range_multi_aff(bset
, ma
) < 0)
11142 n_div_bset
= isl_basic_set_dim(bset
, isl_dim_div
);
11143 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11145 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
11146 rational
= isl_basic_set_is_rational(bset
);
11147 strides
= rational
? 0 : multi_aff_strides(ma
);
11148 res
= isl_basic_set_alloc_space(space
, n_div_ma
+ n_div_bset
+ strides
,
11149 bset
->n_eq
+ strides
, bset
->n_ineq
+ 2 * n_div_ma
);
11151 res
= isl_basic_set_set_rational(res
);
11153 for (i
= 0; i
< n_div_ma
+ n_div_bset
; ++i
)
11154 if (isl_basic_set_alloc_div(res
) < 0)
11157 if (set_ma_divs(res
, ma
, n_div_ma
) < 0)
11160 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11161 k
= isl_basic_set_alloc_equality(res
);
11164 isl_seq_preimage(res
->eq
[k
], bset
->eq
[i
], ma
, n_div_ma
,
11165 n_div_bset
, f
, c1
, c2
, g
, 0);
11168 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11169 k
= isl_basic_set_alloc_inequality(res
);
11172 isl_seq_preimage(res
->ineq
[k
], bset
->ineq
[i
], ma
, n_div_ma
,
11173 n_div_bset
, f
, c1
, c2
, g
, 0);
11176 for (i
= 0; i
< bset
->n_div
; ++i
) {
11177 if (isl_int_is_zero(bset
->div
[i
][0])) {
11178 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11181 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bset
->div
[i
],
11182 ma
, n_div_ma
, n_div_bset
, f
, c1
, c2
, g
, 1);
11186 res
= add_ma_strides(res
, ma
);
11192 isl_basic_set_free(bset
);
11193 isl_multi_aff_free(ma
);
11194 res
= isl_basic_set_simplify(res
);
11195 return isl_basic_set_finalize(res
);
11201 isl_basic_set_free(bset
);
11202 isl_multi_aff_free(ma
);
11203 isl_basic_set_free(res
);
11207 /* Check if the range of "ma" is compatible with "set".
11208 * Return -1 if anything is wrong.
11210 static int check_set_compatible_range_multi_aff(
11211 __isl_keep isl_set
*set
, __isl_keep isl_multi_aff
*ma
)
11213 return check_space_compatible_range_multi_aff(set
->dim
, ma
);
11216 /* Compute the preimage of "set" under the function represented by "ma".
11217 * In other words, plug in "ma" in "set. The result is a set
11218 * that lives in the domain space of "ma".
11220 static __isl_give isl_set
*set_preimage_multi_aff(__isl_take isl_set
*set
,
11221 __isl_take isl_multi_aff
*ma
)
11225 set
= isl_set_cow(set
);
11226 ma
= isl_multi_aff_align_divs(ma
);
11229 if (check_set_compatible_range_multi_aff(set
, ma
) < 0)
11232 for (i
= 0; i
< set
->n
; ++i
) {
11233 set
->p
[i
] = isl_basic_set_preimage_multi_aff(set
->p
[i
],
11234 isl_multi_aff_copy(ma
));
11239 isl_space_free(set
->dim
);
11240 set
->dim
= isl_multi_aff_get_domain_space(ma
);
11244 isl_multi_aff_free(ma
);
11246 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
11247 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
11250 isl_multi_aff_free(ma
);
11255 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11256 __isl_take isl_multi_aff
*ma
)
11261 if (isl_space_match(set
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11262 return set_preimage_multi_aff(set
, ma
);
11264 if (!isl_space_has_named_params(set
->dim
) ||
11265 !isl_space_has_named_params(ma
->space
))
11266 isl_die(set
->ctx
, isl_error_invalid
,
11267 "unaligned unnamed parameters", goto error
);
11268 set
= isl_set_align_params(set
, isl_multi_aff_get_space(ma
));
11269 ma
= isl_multi_aff_align_params(ma
, isl_set_get_space(set
));
11271 return set_preimage_multi_aff(set
, ma
);
11273 isl_multi_aff_free(ma
);
11274 return isl_set_free(set
);
11277 /* Compute the preimage of "set" under the function represented by "pma".
11278 * In other words, plug in "pma" in "set. The result is a set
11279 * that lives in the domain space of "pma".
11281 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11282 __isl_take isl_pw_multi_aff
*pma
)
11291 isl_pw_multi_aff_free(pma
);
11292 res
= isl_set_empty(isl_set_get_space(set
));
11297 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11298 isl_multi_aff_copy(pma
->p
[0].maff
));
11299 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11301 for (i
= 1; i
< pma
->n
; ++i
) {
11304 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11305 isl_multi_aff_copy(pma
->p
[i
].maff
));
11306 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11307 res
= isl_set_union(res
, res_i
);
11310 isl_pw_multi_aff_free(pma
);
11314 isl_pw_multi_aff_free(pma
);
11319 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11320 __isl_take isl_pw_multi_aff
*pma
)
11325 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11326 return set_preimage_pw_multi_aff(set
, pma
);
11328 if (!isl_space_has_named_params(set
->dim
) ||
11329 !isl_space_has_named_params(pma
->dim
))
11330 isl_die(set
->ctx
, isl_error_invalid
,
11331 "unaligned unnamed parameters", goto error
);
11332 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11333 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11335 return set_preimage_pw_multi_aff(set
, pma
);
11337 isl_pw_multi_aff_free(pma
);
11338 return isl_set_free(set
);