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
)
2861 isl_map
*result
= NULL
;
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)
2908 result
= isl_map_add_basic_map(result
, part
);
2918 isl_map_free(result
);
2922 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2923 __isl_take isl_map
*map2
)
2927 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2928 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2929 "spaces don't match", goto error
);
2930 return map_intersect_internal(map1
, map2
);
2937 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2938 __isl_take isl_map
*map2
)
2940 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2943 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2945 return (struct isl_set
*)
2946 isl_map_intersect((struct isl_map
*)set1
,
2947 (struct isl_map
*)set2
);
2950 /* map_intersect_internal accepts intersections
2951 * with parameter domains, so we can just call that function.
2953 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2954 __isl_take isl_set
*params
)
2956 return map_intersect_internal(map
, params
);
2959 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2960 __isl_take isl_map
*map2
)
2962 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2965 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2966 __isl_take isl_set
*params
)
2968 return isl_map_intersect_params(set
, params
);
2971 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2974 struct isl_basic_set
*bset
;
2979 bmap
= isl_basic_map_cow(bmap
);
2982 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2983 in
= isl_basic_map_n_in(bmap
);
2984 bset
= isl_basic_set_from_basic_map(bmap
);
2985 bset
= isl_basic_set_swap_vars(bset
, in
);
2986 return isl_basic_map_from_basic_set(bset
, dim
);
2989 static __isl_give isl_basic_map
*basic_map_space_reset(
2990 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2994 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
2997 space
= isl_basic_map_get_space(bmap
);
2998 space
= isl_space_reset(space
, type
);
2999 bmap
= isl_basic_map_reset_space(bmap
, space
);
3003 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3004 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3005 unsigned pos
, unsigned n
)
3008 struct isl_basic_map
*res
;
3009 struct isl_dim_map
*dim_map
;
3010 unsigned total
, off
;
3011 enum isl_dim_type t
;
3014 return basic_map_space_reset(bmap
, type
);
3019 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3021 total
= isl_basic_map_total_dim(bmap
) + n
;
3022 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3024 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3026 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3028 unsigned size
= isl_basic_map_dim(bmap
, t
);
3029 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3031 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3032 pos
, size
- pos
, off
+ pos
+ n
);
3034 off
+= isl_space_dim(res_dim
, t
);
3036 isl_dim_map_div(dim_map
, bmap
, off
);
3038 res
= isl_basic_map_alloc_space(res_dim
,
3039 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3040 if (isl_basic_map_is_rational(bmap
))
3041 res
= isl_basic_map_set_rational(res
);
3042 if (isl_basic_map_plain_is_empty(bmap
)) {
3043 isl_basic_map_free(bmap
);
3044 return isl_basic_map_set_to_empty(res
);
3046 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3047 return isl_basic_map_finalize(res
);
3050 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3051 __isl_take isl_basic_set
*bset
,
3052 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3054 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3057 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3058 enum isl_dim_type type
, unsigned n
)
3062 return isl_basic_map_insert_dims(bmap
, type
,
3063 isl_basic_map_dim(bmap
, type
), n
);
3066 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3067 enum isl_dim_type type
, unsigned n
)
3071 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3072 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3074 isl_basic_set_free(bset
);
3078 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3079 enum isl_dim_type type
)
3083 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3086 space
= isl_map_get_space(map
);
3087 space
= isl_space_reset(space
, type
);
3088 map
= isl_map_reset_space(map
, space
);
3092 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3093 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3098 return map_space_reset(map
, type
);
3100 map
= isl_map_cow(map
);
3104 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3108 for (i
= 0; i
< map
->n
; ++i
) {
3109 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3120 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3121 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3123 return isl_map_insert_dims(set
, type
, pos
, n
);
3126 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3127 enum isl_dim_type type
, unsigned n
)
3131 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3134 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3135 enum isl_dim_type type
, unsigned n
)
3139 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3140 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3146 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3147 __isl_take isl_basic_map
*bmap
,
3148 enum isl_dim_type dst_type
, unsigned dst_pos
,
3149 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3151 struct isl_dim_map
*dim_map
;
3152 struct isl_basic_map
*res
;
3153 enum isl_dim_type t
;
3154 unsigned total
, off
;
3161 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3164 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3167 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3169 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3170 pos(bmap
->dim
, src_type
) + src_pos
+
3171 ((src_type
< dst_type
) ? n
: 0)) {
3172 bmap
= isl_basic_map_cow(bmap
);
3176 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3177 src_type
, src_pos
, n
);
3181 bmap
= isl_basic_map_finalize(bmap
);
3186 total
= isl_basic_map_total_dim(bmap
);
3187 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3190 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3191 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3192 if (t
== dst_type
) {
3193 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3196 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3199 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3200 dst_pos
, size
- dst_pos
, off
);
3201 off
+= size
- dst_pos
;
3202 } else if (t
== src_type
) {
3203 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3206 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3207 src_pos
+ n
, size
- src_pos
- n
, off
);
3208 off
+= size
- src_pos
- n
;
3210 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3214 isl_dim_map_div(dim_map
, bmap
, off
);
3216 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3217 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3218 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3220 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3221 src_type
, src_pos
, n
);
3225 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3226 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3227 bmap
= isl_basic_map_finalize(bmap
);
3231 isl_basic_map_free(bmap
);
3235 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3236 enum isl_dim_type dst_type
, unsigned dst_pos
,
3237 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3239 return (isl_basic_set
*)isl_basic_map_move_dims(
3240 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3243 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3244 enum isl_dim_type dst_type
, unsigned dst_pos
,
3245 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3249 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3250 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3251 src_type
, src_pos
, n
);
3257 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3258 enum isl_dim_type dst_type
, unsigned dst_pos
,
3259 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3268 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3271 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3274 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3276 map
= isl_map_cow(map
);
3280 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3284 for (i
= 0; i
< map
->n
; ++i
) {
3285 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3287 src_type
, src_pos
, n
);
3298 /* Move the specified dimensions to the last columns right before
3299 * the divs. Don't change the dimension specification of bmap.
3300 * That's the responsibility of the caller.
3302 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3303 enum isl_dim_type type
, unsigned first
, unsigned n
)
3305 struct isl_dim_map
*dim_map
;
3306 struct isl_basic_map
*res
;
3307 enum isl_dim_type t
;
3308 unsigned total
, off
;
3312 if (pos(bmap
->dim
, type
) + first
+ n
==
3313 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3316 total
= isl_basic_map_total_dim(bmap
);
3317 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3320 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3321 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3323 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3326 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3327 first
, n
, total
- bmap
->n_div
- n
);
3328 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3329 first
+ n
, size
- (first
+ n
), off
);
3330 off
+= size
- (first
+ n
);
3332 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3336 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3338 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3339 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3340 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3344 /* Turn the n dimensions of type type, starting at first
3345 * into existentially quantified variables.
3347 __isl_give isl_basic_map
*isl_basic_map_project_out(
3348 __isl_take isl_basic_map
*bmap
,
3349 enum isl_dim_type type
, unsigned first
, unsigned n
)
3357 return basic_map_space_reset(bmap
, type
);
3362 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3363 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3365 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3368 bmap
= move_last(bmap
, type
, first
, n
);
3369 bmap
= isl_basic_map_cow(bmap
);
3373 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3374 old
= bmap
->block2
.data
;
3375 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3376 (bmap
->extra
+ n
) * (1 + row_size
));
3377 if (!bmap
->block2
.data
)
3379 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3382 for (i
= 0; i
< n
; ++i
) {
3383 new_div
[i
] = bmap
->block2
.data
+
3384 (bmap
->extra
+ i
) * (1 + row_size
);
3385 isl_seq_clr(new_div
[i
], 1 + row_size
);
3387 for (i
= 0; i
< bmap
->extra
; ++i
)
3388 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3390 bmap
->div
= new_div
;
3394 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3397 bmap
= isl_basic_map_simplify(bmap
);
3398 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3399 return isl_basic_map_finalize(bmap
);
3401 isl_basic_map_free(bmap
);
3405 /* Turn the n dimensions of type type, starting at first
3406 * into existentially quantified variables.
3408 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3409 enum isl_dim_type type
, unsigned first
, unsigned n
)
3411 return (isl_basic_set
*)isl_basic_map_project_out(
3412 (isl_basic_map
*)bset
, type
, first
, n
);
3415 /* Turn the n dimensions of type type, starting at first
3416 * into existentially quantified variables.
3418 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3419 enum isl_dim_type type
, unsigned first
, unsigned n
)
3427 return map_space_reset(map
, type
);
3429 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3431 map
= isl_map_cow(map
);
3435 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3439 for (i
= 0; i
< map
->n
; ++i
) {
3440 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3451 /* Turn the n dimensions of type type, starting at first
3452 * into existentially quantified variables.
3454 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3455 enum isl_dim_type type
, unsigned first
, unsigned n
)
3457 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3460 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3464 for (i
= 0; i
< n
; ++i
) {
3465 j
= isl_basic_map_alloc_div(bmap
);
3468 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3472 isl_basic_map_free(bmap
);
3476 struct isl_basic_map
*isl_basic_map_apply_range(
3477 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3479 isl_space
*dim_result
= NULL
;
3480 struct isl_basic_map
*bmap
;
3481 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3482 struct isl_dim_map
*dim_map1
, *dim_map2
;
3484 if (!bmap1
|| !bmap2
)
3487 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3488 isl_space_copy(bmap2
->dim
));
3490 n_in
= isl_basic_map_n_in(bmap1
);
3491 n_out
= isl_basic_map_n_out(bmap2
);
3492 n
= isl_basic_map_n_out(bmap1
);
3493 nparam
= isl_basic_map_n_param(bmap1
);
3495 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3496 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3497 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3498 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3499 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3500 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3501 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3502 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3503 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3504 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3505 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3507 bmap
= isl_basic_map_alloc_space(dim_result
,
3508 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3509 bmap1
->n_eq
+ bmap2
->n_eq
,
3510 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3511 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3512 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3513 bmap
= add_divs(bmap
, n
);
3514 bmap
= isl_basic_map_simplify(bmap
);
3515 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3516 return isl_basic_map_finalize(bmap
);
3518 isl_basic_map_free(bmap1
);
3519 isl_basic_map_free(bmap2
);
3523 struct isl_basic_set
*isl_basic_set_apply(
3524 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3529 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3532 return (struct isl_basic_set
*)
3533 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3535 isl_basic_set_free(bset
);
3536 isl_basic_map_free(bmap
);
3540 struct isl_basic_map
*isl_basic_map_apply_domain(
3541 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3543 if (!bmap1
|| !bmap2
)
3546 isl_assert(bmap1
->ctx
,
3547 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3548 isl_assert(bmap1
->ctx
,
3549 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3552 bmap1
= isl_basic_map_reverse(bmap1
);
3553 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3554 return isl_basic_map_reverse(bmap1
);
3556 isl_basic_map_free(bmap1
);
3557 isl_basic_map_free(bmap2
);
3561 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3562 * A \cap B -> f(A) + f(B)
3564 struct isl_basic_map
*isl_basic_map_sum(
3565 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3567 unsigned n_in
, n_out
, nparam
, total
, pos
;
3568 struct isl_basic_map
*bmap
= NULL
;
3569 struct isl_dim_map
*dim_map1
, *dim_map2
;
3572 if (!bmap1
|| !bmap2
)
3575 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3578 nparam
= isl_basic_map_n_param(bmap1
);
3579 n_in
= isl_basic_map_n_in(bmap1
);
3580 n_out
= isl_basic_map_n_out(bmap1
);
3582 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3583 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3584 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3585 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3586 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3587 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3588 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3589 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3590 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3591 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3592 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3594 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3595 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3596 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3597 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3598 for (i
= 0; i
< n_out
; ++i
) {
3599 int j
= isl_basic_map_alloc_equality(bmap
);
3602 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3603 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3604 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3605 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3607 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3608 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3609 bmap
= add_divs(bmap
, 2 * n_out
);
3611 bmap
= isl_basic_map_simplify(bmap
);
3612 return isl_basic_map_finalize(bmap
);
3614 isl_basic_map_free(bmap
);
3615 isl_basic_map_free(bmap1
);
3616 isl_basic_map_free(bmap2
);
3620 /* Given two maps A -> f(A) and B -> g(B), construct a map
3621 * A \cap B -> f(A) + f(B)
3623 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3625 struct isl_map
*result
;
3631 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3633 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3634 map1
->n
* map2
->n
, 0);
3637 for (i
= 0; i
< map1
->n
; ++i
)
3638 for (j
= 0; j
< map2
->n
; ++j
) {
3639 struct isl_basic_map
*part
;
3640 part
= isl_basic_map_sum(
3641 isl_basic_map_copy(map1
->p
[i
]),
3642 isl_basic_map_copy(map2
->p
[j
]));
3643 if (isl_basic_map_is_empty(part
))
3644 isl_basic_map_free(part
);
3646 result
= isl_map_add_basic_map(result
, part
);
3659 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3660 __isl_take isl_set
*set2
)
3662 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3665 /* Given a basic map A -> f(A), construct A -> -f(A).
3667 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3672 bmap
= isl_basic_map_cow(bmap
);
3676 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3677 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3678 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3679 for (j
= 0; j
< n
; ++j
)
3680 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3681 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3682 for (j
= 0; j
< n
; ++j
)
3683 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3684 for (i
= 0; i
< bmap
->n_div
; ++i
)
3685 for (j
= 0; j
< n
; ++j
)
3686 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3687 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3688 return isl_basic_map_finalize(bmap
);
3691 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3693 return isl_basic_map_neg(bset
);
3696 /* Given a map A -> f(A), construct A -> -f(A).
3698 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3702 map
= isl_map_cow(map
);
3706 for (i
= 0; i
< map
->n
; ++i
) {
3707 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3718 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3720 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3723 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3724 * A -> floor(f(A)/d).
3726 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3729 unsigned n_in
, n_out
, nparam
, total
, pos
;
3730 struct isl_basic_map
*result
= NULL
;
3731 struct isl_dim_map
*dim_map
;
3737 nparam
= isl_basic_map_n_param(bmap
);
3738 n_in
= isl_basic_map_n_in(bmap
);
3739 n_out
= isl_basic_map_n_out(bmap
);
3741 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3742 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3743 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3744 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3745 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3746 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3748 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3749 bmap
->n_div
+ n_out
,
3750 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3751 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3752 result
= add_divs(result
, n_out
);
3753 for (i
= 0; i
< n_out
; ++i
) {
3755 j
= isl_basic_map_alloc_inequality(result
);
3758 isl_seq_clr(result
->ineq
[j
], 1+total
);
3759 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3760 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3761 j
= isl_basic_map_alloc_inequality(result
);
3764 isl_seq_clr(result
->ineq
[j
], 1+total
);
3765 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3766 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3767 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3770 result
= isl_basic_map_simplify(result
);
3771 return isl_basic_map_finalize(result
);
3773 isl_basic_map_free(result
);
3777 /* Given a map A -> f(A) and an integer d, construct a map
3778 * A -> floor(f(A)/d).
3780 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3784 map
= isl_map_cow(map
);
3788 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3789 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3790 for (i
= 0; i
< map
->n
; ++i
) {
3791 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3802 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3808 i
= isl_basic_map_alloc_equality(bmap
);
3811 nparam
= isl_basic_map_n_param(bmap
);
3812 n_in
= isl_basic_map_n_in(bmap
);
3813 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3814 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3815 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3816 return isl_basic_map_finalize(bmap
);
3818 isl_basic_map_free(bmap
);
3822 /* Add a constraints to "bmap" expressing i_pos < o_pos
3824 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3830 i
= isl_basic_map_alloc_inequality(bmap
);
3833 nparam
= isl_basic_map_n_param(bmap
);
3834 n_in
= isl_basic_map_n_in(bmap
);
3835 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3836 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3837 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3838 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3839 return isl_basic_map_finalize(bmap
);
3841 isl_basic_map_free(bmap
);
3845 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3847 static __isl_give isl_basic_map
*var_less_or_equal(
3848 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3854 i
= isl_basic_map_alloc_inequality(bmap
);
3857 nparam
= isl_basic_map_n_param(bmap
);
3858 n_in
= isl_basic_map_n_in(bmap
);
3859 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3860 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3861 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3862 return isl_basic_map_finalize(bmap
);
3864 isl_basic_map_free(bmap
);
3868 /* Add a constraints to "bmap" expressing i_pos > o_pos
3870 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3876 i
= isl_basic_map_alloc_inequality(bmap
);
3879 nparam
= isl_basic_map_n_param(bmap
);
3880 n_in
= isl_basic_map_n_in(bmap
);
3881 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3882 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3883 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3884 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3885 return isl_basic_map_finalize(bmap
);
3887 isl_basic_map_free(bmap
);
3891 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3893 static __isl_give isl_basic_map
*var_more_or_equal(
3894 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3900 i
= isl_basic_map_alloc_inequality(bmap
);
3903 nparam
= isl_basic_map_n_param(bmap
);
3904 n_in
= isl_basic_map_n_in(bmap
);
3905 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3906 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3907 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3908 return isl_basic_map_finalize(bmap
);
3910 isl_basic_map_free(bmap
);
3914 __isl_give isl_basic_map
*isl_basic_map_equal(
3915 __isl_take isl_space
*dim
, unsigned n_equal
)
3918 struct isl_basic_map
*bmap
;
3919 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3922 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3923 bmap
= var_equal(bmap
, i
);
3924 return isl_basic_map_finalize(bmap
);
3927 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3929 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3933 struct isl_basic_map
*bmap
;
3934 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3937 for (i
= 0; i
< pos
&& bmap
; ++i
)
3938 bmap
= var_equal(bmap
, i
);
3940 bmap
= var_less(bmap
, pos
);
3941 return isl_basic_map_finalize(bmap
);
3944 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3946 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3947 __isl_take isl_space
*dim
, unsigned pos
)
3950 isl_basic_map
*bmap
;
3952 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3953 for (i
= 0; i
< pos
; ++i
)
3954 bmap
= var_equal(bmap
, i
);
3955 bmap
= var_less_or_equal(bmap
, pos
);
3956 return isl_basic_map_finalize(bmap
);
3959 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3961 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3965 struct isl_basic_map
*bmap
;
3966 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3969 for (i
= 0; i
< pos
&& bmap
; ++i
)
3970 bmap
= var_equal(bmap
, i
);
3972 bmap
= var_more(bmap
, pos
);
3973 return isl_basic_map_finalize(bmap
);
3976 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3978 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3979 __isl_take isl_space
*dim
, unsigned pos
)
3982 isl_basic_map
*bmap
;
3984 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3985 for (i
= 0; i
< pos
; ++i
)
3986 bmap
= var_equal(bmap
, i
);
3987 bmap
= var_more_or_equal(bmap
, pos
);
3988 return isl_basic_map_finalize(bmap
);
3991 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3992 unsigned n
, int equal
)
3994 struct isl_map
*map
;
3997 if (n
== 0 && equal
)
3998 return isl_map_universe(dims
);
4000 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4002 for (i
= 0; i
+ 1 < n
; ++i
)
4003 map
= isl_map_add_basic_map(map
,
4004 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4007 map
= isl_map_add_basic_map(map
,
4008 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4010 map
= isl_map_add_basic_map(map
,
4011 isl_basic_map_less_at(dims
, n
- 1));
4013 isl_space_free(dims
);
4018 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4022 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4025 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4027 return map_lex_lte_first(dim
, n
, 0);
4030 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4032 return map_lex_lte_first(dim
, n
, 1);
4035 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4037 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4040 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4042 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4045 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4046 unsigned n
, int equal
)
4048 struct isl_map
*map
;
4051 if (n
== 0 && equal
)
4052 return isl_map_universe(dims
);
4054 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4056 for (i
= 0; i
+ 1 < n
; ++i
)
4057 map
= isl_map_add_basic_map(map
,
4058 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4061 map
= isl_map_add_basic_map(map
,
4062 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4064 map
= isl_map_add_basic_map(map
,
4065 isl_basic_map_more_at(dims
, n
- 1));
4067 isl_space_free(dims
);
4072 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4076 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4079 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4081 return map_lex_gte_first(dim
, n
, 0);
4084 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4086 return map_lex_gte_first(dim
, n
, 1);
4089 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4091 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4094 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4096 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4099 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4100 __isl_take isl_set
*set2
)
4103 map
= isl_map_lex_le(isl_set_get_space(set1
));
4104 map
= isl_map_intersect_domain(map
, set1
);
4105 map
= isl_map_intersect_range(map
, set2
);
4109 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4110 __isl_take isl_set
*set2
)
4113 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4114 map
= isl_map_intersect_domain(map
, set1
);
4115 map
= isl_map_intersect_range(map
, set2
);
4119 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4120 __isl_take isl_set
*set2
)
4123 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4124 map
= isl_map_intersect_domain(map
, set1
);
4125 map
= isl_map_intersect_range(map
, set2
);
4129 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4130 __isl_take isl_set
*set2
)
4133 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4134 map
= isl_map_intersect_domain(map
, set1
);
4135 map
= isl_map_intersect_range(map
, set2
);
4139 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4140 __isl_take isl_map
*map2
)
4143 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4144 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4145 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4149 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4150 __isl_take isl_map
*map2
)
4153 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4154 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4155 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4159 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4160 __isl_take isl_map
*map2
)
4163 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4164 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4165 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4169 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4170 __isl_take isl_map
*map2
)
4173 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4174 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4175 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4179 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4180 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4182 struct isl_basic_map
*bmap
;
4184 bset
= isl_basic_set_cow(bset
);
4188 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4189 isl_space_free(bset
->dim
);
4190 bmap
= (struct isl_basic_map
*) bset
;
4192 return isl_basic_map_finalize(bmap
);
4194 isl_basic_set_free(bset
);
4195 isl_space_free(dim
);
4199 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4203 if (bmap
->dim
->n_in
== 0)
4204 return (struct isl_basic_set
*)bmap
;
4205 bmap
= isl_basic_map_cow(bmap
);
4208 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4211 bmap
= isl_basic_map_finalize(bmap
);
4212 return (struct isl_basic_set
*)bmap
;
4214 isl_basic_map_free(bmap
);
4218 /* For a div d = floor(f/m), add the constraints
4221 * -(f-(n-1)) + m d >= 0
4223 * Note that the second constraint is the negation of
4227 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4228 unsigned pos
, isl_int
*div
)
4231 unsigned total
= isl_basic_map_total_dim(bmap
);
4233 i
= isl_basic_map_alloc_inequality(bmap
);
4236 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4237 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4239 j
= isl_basic_map_alloc_inequality(bmap
);
4242 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4243 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4244 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4248 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4249 unsigned pos
, isl_int
*div
)
4251 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4255 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4257 unsigned total
= isl_basic_map_total_dim(bmap
);
4258 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4260 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4264 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4266 return isl_basic_map_add_div_constraints(bset
, div
);
4269 struct isl_basic_set
*isl_basic_map_underlying_set(
4270 struct isl_basic_map
*bmap
)
4274 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4276 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4277 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4278 return (struct isl_basic_set
*)bmap
;
4279 bmap
= isl_basic_map_cow(bmap
);
4282 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4285 bmap
->extra
-= bmap
->n_div
;
4287 bmap
= isl_basic_map_finalize(bmap
);
4288 return (struct isl_basic_set
*)bmap
;
4290 isl_basic_map_free(bmap
);
4294 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4295 __isl_take isl_basic_set
*bset
)
4297 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4300 struct isl_basic_map
*isl_basic_map_overlying_set(
4301 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4303 struct isl_basic_map
*bmap
;
4304 struct isl_ctx
*ctx
;
4311 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4312 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4313 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4315 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4316 isl_basic_map_free(like
);
4317 return (struct isl_basic_map
*)bset
;
4319 bset
= isl_basic_set_cow(bset
);
4322 total
= bset
->dim
->n_out
+ bset
->extra
;
4323 bmap
= (struct isl_basic_map
*)bset
;
4324 isl_space_free(bmap
->dim
);
4325 bmap
->dim
= isl_space_copy(like
->dim
);
4328 bmap
->n_div
= like
->n_div
;
4329 bmap
->extra
+= like
->n_div
;
4333 ltotal
= total
- bmap
->extra
+ like
->extra
;
4336 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4337 bmap
->extra
* (1 + 1 + total
));
4338 if (isl_blk_is_error(bmap
->block2
))
4340 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4344 for (i
= 0; i
< bmap
->extra
; ++i
)
4345 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4346 for (i
= 0; i
< like
->n_div
; ++i
) {
4347 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4348 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4350 bmap
= isl_basic_map_extend_constraints(bmap
,
4351 0, 2 * like
->n_div
);
4352 for (i
= 0; i
< like
->n_div
; ++i
) {
4353 if (isl_int_is_zero(bmap
->div
[i
][0]))
4355 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4359 isl_basic_map_free(like
);
4360 bmap
= isl_basic_map_simplify(bmap
);
4361 bmap
= isl_basic_map_finalize(bmap
);
4364 isl_basic_map_free(like
);
4365 isl_basic_set_free(bset
);
4369 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4370 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4372 return (struct isl_basic_set
*)
4373 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4376 struct isl_set
*isl_set_from_underlying_set(
4377 struct isl_set
*set
, struct isl_basic_set
*like
)
4383 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4385 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4386 isl_basic_set_free(like
);
4389 set
= isl_set_cow(set
);
4392 for (i
= 0; i
< set
->n
; ++i
) {
4393 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4394 isl_basic_set_copy(like
));
4398 isl_space_free(set
->dim
);
4399 set
->dim
= isl_space_copy(like
->dim
);
4402 isl_basic_set_free(like
);
4405 isl_basic_set_free(like
);
4410 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4414 map
= isl_map_cow(map
);
4417 map
->dim
= isl_space_cow(map
->dim
);
4421 for (i
= 1; i
< map
->n
; ++i
)
4422 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4424 for (i
= 0; i
< map
->n
; ++i
) {
4425 map
->p
[i
] = (struct isl_basic_map
*)
4426 isl_basic_map_underlying_set(map
->p
[i
]);
4431 map
->dim
= isl_space_underlying(map
->dim
, 0);
4433 isl_space_free(map
->dim
);
4434 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4438 return (struct isl_set
*)map
;
4444 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4446 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4449 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4450 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4452 bmap
= isl_basic_map_cow(bmap
);
4456 isl_space_free(bmap
->dim
);
4459 bmap
= isl_basic_map_finalize(bmap
);
4463 isl_basic_map_free(bmap
);
4464 isl_space_free(dim
);
4468 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4469 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4471 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4475 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4476 __isl_take isl_space
*dim
)
4480 map
= isl_map_cow(map
);
4484 for (i
= 0; i
< map
->n
; ++i
) {
4485 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4486 isl_space_copy(dim
));
4490 isl_space_free(map
->dim
);
4496 isl_space_free(dim
);
4500 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4501 __isl_take isl_space
*dim
)
4503 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4506 /* Compute the parameter domain of the given basic set.
4508 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4513 if (isl_basic_set_is_params(bset
))
4516 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4517 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4518 space
= isl_basic_set_get_space(bset
);
4519 space
= isl_space_params(space
);
4520 bset
= isl_basic_set_reset_space(bset
, space
);
4524 /* Construct a zero-dimensional basic set with the given parameter domain.
4526 __isl_give isl_basic_set
*isl_basic_set_from_params(
4527 __isl_take isl_basic_set
*bset
)
4530 space
= isl_basic_set_get_space(bset
);
4531 space
= isl_space_set_from_params(space
);
4532 bset
= isl_basic_set_reset_space(bset
, space
);
4536 /* Compute the parameter domain of the given set.
4538 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4543 if (isl_set_is_params(set
))
4546 n
= isl_set_dim(set
, isl_dim_set
);
4547 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4548 space
= isl_set_get_space(set
);
4549 space
= isl_space_params(space
);
4550 set
= isl_set_reset_space(set
, space
);
4554 /* Construct a zero-dimensional set with the given parameter domain.
4556 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4559 space
= isl_set_get_space(set
);
4560 space
= isl_space_set_from_params(space
);
4561 set
= isl_set_reset_space(set
, space
);
4565 /* Compute the parameter domain of the given map.
4567 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4572 n
= isl_map_dim(map
, isl_dim_in
);
4573 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4574 n
= isl_map_dim(map
, isl_dim_out
);
4575 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4576 space
= isl_map_get_space(map
);
4577 space
= isl_space_params(space
);
4578 map
= isl_map_reset_space(map
, space
);
4582 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4585 struct isl_basic_set
*domain
;
4591 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4593 n_in
= isl_basic_map_n_in(bmap
);
4594 n_out
= isl_basic_map_n_out(bmap
);
4595 domain
= isl_basic_set_from_basic_map(bmap
);
4596 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4598 domain
= isl_basic_set_reset_space(domain
, dim
);
4603 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4607 return isl_space_may_be_set(bmap
->dim
);
4610 /* Is this basic map actually a set?
4611 * Users should never call this function. Outside of isl,
4612 * the type should indicate whether something is a set or a map.
4614 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4618 return isl_space_is_set(bmap
->dim
);
4621 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4625 if (isl_basic_map_is_set(bmap
))
4627 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4630 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4631 __isl_take isl_basic_map
*bmap
)
4635 isl_basic_map
*domain
;
4636 int nparam
, n_in
, n_out
;
4639 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4640 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4641 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4643 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4644 domain
= isl_basic_map_universe(dim
);
4646 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4647 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4648 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4650 total
= isl_basic_map_total_dim(bmap
);
4652 for (i
= 0; i
< n_in
; ++i
) {
4653 k
= isl_basic_map_alloc_equality(bmap
);
4656 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4657 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4658 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4661 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4662 return isl_basic_map_finalize(bmap
);
4664 isl_basic_map_free(bmap
);
4668 __isl_give isl_basic_map
*isl_basic_map_range_map(
4669 __isl_take isl_basic_map
*bmap
)
4673 isl_basic_map
*range
;
4674 int nparam
, n_in
, n_out
;
4677 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4678 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4679 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4681 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4682 range
= isl_basic_map_universe(dim
);
4684 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4685 bmap
= isl_basic_map_apply_range(bmap
, range
);
4686 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4688 total
= isl_basic_map_total_dim(bmap
);
4690 for (i
= 0; i
< n_out
; ++i
) {
4691 k
= isl_basic_map_alloc_equality(bmap
);
4694 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4695 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4696 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4699 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4700 return isl_basic_map_finalize(bmap
);
4702 isl_basic_map_free(bmap
);
4706 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4710 return isl_space_may_be_set(map
->dim
);
4713 /* Is this map actually a set?
4714 * Users should never call this function. Outside of isl,
4715 * the type should indicate whether something is a set or a map.
4717 int isl_map_is_set(__isl_keep isl_map
*map
)
4721 return isl_space_is_set(map
->dim
);
4724 struct isl_set
*isl_map_range(struct isl_map
*map
)
4727 struct isl_set
*set
;
4731 if (isl_map_is_set(map
))
4732 return (isl_set
*)map
;
4734 map
= isl_map_cow(map
);
4738 set
= (struct isl_set
*) map
;
4739 set
->dim
= isl_space_range(set
->dim
);
4742 for (i
= 0; i
< map
->n
; ++i
) {
4743 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4747 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4748 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4755 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4758 isl_space
*domain_dim
;
4760 map
= isl_map_cow(map
);
4764 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4765 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4766 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4769 for (i
= 0; i
< map
->n
; ++i
) {
4770 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4774 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4775 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4782 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4785 isl_space
*range_dim
;
4787 map
= isl_map_cow(map
);
4791 range_dim
= isl_space_range(isl_map_get_space(map
));
4792 range_dim
= isl_space_from_range(range_dim
);
4793 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4794 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4797 for (i
= 0; i
< map
->n
; ++i
) {
4798 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4802 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4803 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4810 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4811 __isl_take isl_space
*dim
)
4814 struct isl_map
*map
= NULL
;
4816 set
= isl_set_cow(set
);
4819 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4820 map
= (struct isl_map
*)set
;
4821 for (i
= 0; i
< set
->n
; ++i
) {
4822 map
->p
[i
] = isl_basic_map_from_basic_set(
4823 set
->p
[i
], isl_space_copy(dim
));
4827 isl_space_free(map
->dim
);
4831 isl_space_free(dim
);
4836 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4837 __isl_take isl_basic_set
*bset
)
4839 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4842 __isl_give isl_basic_map
*isl_basic_map_from_range(
4843 __isl_take isl_basic_set
*bset
)
4846 space
= isl_basic_set_get_space(bset
);
4847 space
= isl_space_from_range(space
);
4848 bset
= isl_basic_set_reset_space(bset
, space
);
4849 return (isl_basic_map
*)bset
;
4852 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4855 space
= isl_set_get_space(set
);
4856 space
= isl_space_from_range(space
);
4857 set
= isl_set_reset_space(set
, space
);
4858 return (struct isl_map
*)set
;
4861 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4863 return isl_map_reverse(isl_map_from_range(set
));
4866 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4867 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4869 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4872 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4873 __isl_take isl_set
*range
)
4875 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4878 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4881 struct isl_set
*set
= NULL
;
4885 map
= isl_map_cow(map
);
4888 map
->dim
= isl_space_as_set_space(map
->dim
);
4891 set
= (struct isl_set
*)map
;
4892 for (i
= 0; i
< map
->n
; ++i
) {
4893 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4903 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4906 struct isl_map
*map
;
4911 isl_die(dim
->ctx
, isl_error_internal
,
4912 "negative number of basic maps", goto error
);
4913 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4914 sizeof(struct isl_map
) +
4915 (n
- 1) * sizeof(struct isl_basic_map
*));
4919 map
->ctx
= dim
->ctx
;
4920 isl_ctx_ref(map
->ctx
);
4928 isl_space_free(dim
);
4932 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4933 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4936 struct isl_map
*map
;
4939 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4943 map
= isl_map_alloc_space(dims
, n
, flags
);
4947 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4949 struct isl_basic_map
*bmap
;
4950 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4951 bmap
= isl_basic_map_set_to_empty(bmap
);
4955 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4957 struct isl_basic_set
*bset
;
4958 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4959 bset
= isl_basic_set_set_to_empty(bset
);
4963 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4965 struct isl_basic_map
*bmap
;
4968 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4969 bmap
= isl_basic_map_set_to_empty(bmap
);
4973 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4975 struct isl_basic_map
*bmap
;
4978 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4979 bmap
= isl_basic_map_set_to_empty(bmap
);
4983 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4985 struct isl_basic_set
*bset
;
4988 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4989 bset
= isl_basic_set_set_to_empty(bset
);
4993 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
4995 struct isl_basic_map
*bmap
;
4996 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
4997 bmap
= isl_basic_map_finalize(bmap
);
5001 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5003 struct isl_basic_set
*bset
;
5004 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5005 bset
= isl_basic_set_finalize(bset
);
5009 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5012 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5013 isl_basic_map
*bmap
;
5015 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5016 for (i
= 0; i
< total
; ++i
) {
5017 int k
= isl_basic_map_alloc_inequality(bmap
);
5020 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5021 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5025 isl_basic_map_free(bmap
);
5029 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5031 return isl_basic_map_nat_universe(dim
);
5034 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5036 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5039 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5041 return isl_map_nat_universe(dim
);
5044 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5045 __isl_keep isl_basic_map
*model
)
5049 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5052 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5056 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5059 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5060 __isl_keep isl_set
*model
)
5064 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5067 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5069 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5072 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5076 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5079 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5083 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5086 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5088 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5091 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5095 return isl_set_empty(isl_space_copy(model
->dim
));
5098 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5100 struct isl_map
*map
;
5103 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5104 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5108 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5110 struct isl_set
*set
;
5113 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5114 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5118 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5122 return isl_set_universe(isl_space_copy(model
->dim
));
5125 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5128 struct isl_map
*dup
;
5132 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5133 for (i
= 0; i
< map
->n
; ++i
)
5134 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5138 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5139 __isl_take isl_basic_map
*bmap
)
5143 if (isl_basic_map_plain_is_empty(bmap
)) {
5144 isl_basic_map_free(bmap
);
5147 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5148 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5149 map
->p
[map
->n
] = bmap
;
5151 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5157 isl_basic_map_free(bmap
);
5161 void *isl_map_free(struct isl_map
*map
)
5171 isl_ctx_deref(map
->ctx
);
5172 for (i
= 0; i
< map
->n
; ++i
)
5173 isl_basic_map_free(map
->p
[i
]);
5174 isl_space_free(map
->dim
);
5180 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5181 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5185 base
= isl_map_cow(base
);
5189 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5192 for (i
= 0; i
< base
->n
; ++i
) {
5193 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5194 isl_space_copy(base
->dim
), 0, 0, 0);
5204 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5205 unsigned nparam
, unsigned dim
)
5207 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5211 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5212 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5216 bmap
= isl_basic_map_cow(bmap
);
5217 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5218 j
= isl_basic_map_alloc_equality(bmap
);
5221 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5222 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5223 isl_int_set_si(bmap
->eq
[j
][0], value
);
5224 bmap
= isl_basic_map_simplify(bmap
);
5225 return isl_basic_map_finalize(bmap
);
5227 isl_basic_map_free(bmap
);
5231 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5232 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5236 bmap
= isl_basic_map_cow(bmap
);
5237 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5238 j
= isl_basic_map_alloc_equality(bmap
);
5241 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5242 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5243 isl_int_set(bmap
->eq
[j
][0], value
);
5244 bmap
= isl_basic_map_simplify(bmap
);
5245 return isl_basic_map_finalize(bmap
);
5247 isl_basic_map_free(bmap
);
5251 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5252 enum isl_dim_type type
, unsigned pos
, int value
)
5256 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5257 return isl_basic_map_fix_pos_si(bmap
,
5258 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5260 isl_basic_map_free(bmap
);
5264 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5265 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5269 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5270 return isl_basic_map_fix_pos(bmap
,
5271 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5273 isl_basic_map_free(bmap
);
5277 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5278 enum isl_dim_type type
, unsigned pos
, int value
)
5280 return (struct isl_basic_set
*)
5281 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5285 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5286 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5288 return (struct isl_basic_set
*)
5289 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5293 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5294 unsigned input
, int value
)
5296 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5299 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5300 unsigned dim
, int value
)
5302 return (struct isl_basic_set
*)
5303 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5304 isl_dim_set
, dim
, value
);
5307 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5309 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5316 isl_basic_map_free(map
->p
[i
]);
5317 if (i
!= map
->n
- 1) {
5318 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5319 map
->p
[i
] = map
->p
[map
->n
- 1];
5326 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5327 enum isl_dim_type type
, unsigned pos
, int value
)
5331 map
= isl_map_cow(map
);
5335 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5336 for (i
= map
->n
- 1; i
>= 0; --i
) {
5337 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5338 if (remove_if_empty(map
, i
) < 0)
5341 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5348 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5349 enum isl_dim_type type
, unsigned pos
, int value
)
5351 return (struct isl_set
*)
5352 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5355 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5356 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5360 map
= isl_map_cow(map
);
5364 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5365 for (i
= 0; i
< map
->n
; ++i
) {
5366 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5370 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5377 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5378 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5380 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5383 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5384 unsigned input
, int value
)
5386 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5389 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5391 return (struct isl_set
*)
5392 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5395 static __isl_give isl_basic_map
*basic_map_bound_si(
5396 __isl_take isl_basic_map
*bmap
,
5397 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5403 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5404 pos
+= isl_basic_map_offset(bmap
, type
);
5405 bmap
= isl_basic_map_cow(bmap
);
5406 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5407 j
= isl_basic_map_alloc_inequality(bmap
);
5410 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5412 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5413 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5415 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5416 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5418 bmap
= isl_basic_map_simplify(bmap
);
5419 return isl_basic_map_finalize(bmap
);
5421 isl_basic_map_free(bmap
);
5425 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5426 __isl_take isl_basic_map
*bmap
,
5427 enum isl_dim_type type
, unsigned pos
, int value
)
5429 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5432 /* Constrain the values of the given dimension to be no greater than "value".
5434 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5435 __isl_take isl_basic_map
*bmap
,
5436 enum isl_dim_type type
, unsigned pos
, int value
)
5438 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5441 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5442 unsigned dim
, isl_int value
)
5446 bset
= isl_basic_set_cow(bset
);
5447 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5448 j
= isl_basic_set_alloc_inequality(bset
);
5451 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5452 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5453 isl_int_neg(bset
->ineq
[j
][0], value
);
5454 bset
= isl_basic_set_simplify(bset
);
5455 return isl_basic_set_finalize(bset
);
5457 isl_basic_set_free(bset
);
5461 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5462 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5466 map
= isl_map_cow(map
);
5470 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5471 for (i
= 0; i
< map
->n
; ++i
) {
5472 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5473 type
, pos
, value
, upper
);
5477 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5484 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5485 enum isl_dim_type type
, unsigned pos
, int value
)
5487 return map_bound_si(map
, type
, pos
, value
, 0);
5490 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5491 enum isl_dim_type type
, unsigned pos
, int value
)
5493 return map_bound_si(map
, type
, pos
, value
, 1);
5496 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5497 enum isl_dim_type type
, unsigned pos
, int value
)
5499 return (struct isl_set
*)
5500 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5503 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5504 enum isl_dim_type type
, unsigned pos
, int value
)
5506 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5509 /* Bound the given variable of "bmap" from below (or above is "upper"
5510 * is set) to "value".
5512 static __isl_give isl_basic_map
*basic_map_bound(
5513 __isl_take isl_basic_map
*bmap
,
5514 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5520 if (pos
>= isl_basic_map_dim(bmap
, type
))
5521 isl_die(bmap
->ctx
, isl_error_invalid
,
5522 "index out of bounds", goto error
);
5523 pos
+= isl_basic_map_offset(bmap
, type
);
5524 bmap
= isl_basic_map_cow(bmap
);
5525 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5526 j
= isl_basic_map_alloc_inequality(bmap
);
5529 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5531 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5532 isl_int_set(bmap
->ineq
[j
][0], value
);
5534 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5535 isl_int_neg(bmap
->ineq
[j
][0], value
);
5537 bmap
= isl_basic_map_simplify(bmap
);
5538 return isl_basic_map_finalize(bmap
);
5540 isl_basic_map_free(bmap
);
5544 /* Bound the given variable of "map" from below (or above is "upper"
5545 * is set) to "value".
5547 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5548 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5552 map
= isl_map_cow(map
);
5556 if (pos
>= isl_map_dim(map
, type
))
5557 isl_die(map
->ctx
, isl_error_invalid
,
5558 "index out of bounds", goto error
);
5559 for (i
= map
->n
- 1; i
>= 0; --i
) {
5560 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5561 if (remove_if_empty(map
, i
) < 0)
5564 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5571 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5572 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5574 return map_bound(map
, type
, pos
, value
, 0);
5577 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5578 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5580 return map_bound(map
, type
, pos
, value
, 1);
5583 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5584 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5586 return isl_map_lower_bound(set
, type
, pos
, value
);
5589 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5590 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5592 return isl_map_upper_bound(set
, type
, pos
, value
);
5595 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5600 set
= isl_set_cow(set
);
5604 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5605 for (i
= 0; i
< set
->n
; ++i
) {
5606 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5616 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5620 map
= isl_map_cow(map
);
5624 map
->dim
= isl_space_reverse(map
->dim
);
5627 for (i
= 0; i
< map
->n
; ++i
) {
5628 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5632 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5639 static struct isl_map
*isl_basic_map_partial_lexopt(
5640 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5641 struct isl_set
**empty
, int max
)
5645 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5646 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5648 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5650 isl_basic_map_free(bmap
);
5651 isl_basic_set_free(dom
);
5657 struct isl_map
*isl_basic_map_partial_lexmax(
5658 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5659 struct isl_set
**empty
)
5661 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5664 struct isl_map
*isl_basic_map_partial_lexmin(
5665 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5666 struct isl_set
**empty
)
5668 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5671 struct isl_set
*isl_basic_set_partial_lexmin(
5672 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5673 struct isl_set
**empty
)
5675 return (struct isl_set
*)
5676 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5680 struct isl_set
*isl_basic_set_partial_lexmax(
5681 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5682 struct isl_set
**empty
)
5684 return (struct isl_set
*)
5685 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5689 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5690 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5691 __isl_give isl_set
**empty
)
5693 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5696 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5697 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5698 __isl_give isl_set
**empty
)
5700 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5703 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5704 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5705 __isl_give isl_set
**empty
)
5707 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5710 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5711 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5712 __isl_give isl_set
**empty
)
5714 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5717 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5718 __isl_take isl_basic_map
*bmap
, int max
)
5720 isl_basic_set
*dom
= NULL
;
5721 isl_space
*dom_space
;
5725 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5726 dom
= isl_basic_set_universe(dom_space
);
5727 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5729 isl_basic_map_free(bmap
);
5733 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5734 __isl_take isl_basic_map
*bmap
)
5736 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5740 #define TYPE isl_pw_multi_aff
5742 #define SUFFIX _pw_multi_aff
5744 #define EMPTY isl_pw_multi_aff_empty
5746 #define ADD isl_pw_multi_aff_union_add
5747 #include "isl_map_lexopt_templ.c"
5749 /* Given a map "map", compute the lexicographically minimal
5750 * (or maximal) image element for each domain element in dom,
5751 * in the form of an isl_pw_multi_aff.
5752 * Set *empty to those elements in dom that do not have an image element.
5754 * We first compute the lexicographically minimal or maximal element
5755 * in the first basic map. This results in a partial solution "res"
5756 * and a subset "todo" of dom that still need to be handled.
5757 * We then consider each of the remaining maps in "map" and successively
5758 * update both "res" and "todo".
5760 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5761 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5762 __isl_give isl_set
**empty
, int max
)
5765 isl_pw_multi_aff
*res
;
5771 if (isl_map_plain_is_empty(map
)) {
5776 return isl_pw_multi_aff_from_map(map
);
5779 res
= basic_map_partial_lexopt_pw_multi_aff(
5780 isl_basic_map_copy(map
->p
[0]),
5781 isl_set_copy(dom
), &todo
, max
);
5783 for (i
= 1; i
< map
->n
; ++i
) {
5784 isl_pw_multi_aff
*res_i
;
5787 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5788 isl_basic_map_copy(map
->p
[i
]),
5789 isl_set_copy(dom
), &todo_i
, max
);
5792 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5794 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5796 todo
= isl_set_intersect(todo
, todo_i
);
5817 #define TYPE isl_map
5821 #define EMPTY isl_map_empty
5823 #define ADD isl_map_union_disjoint
5824 #include "isl_map_lexopt_templ.c"
5826 /* Given a map "map", compute the lexicographically minimal
5827 * (or maximal) image element for each domain element in dom.
5828 * Set *empty to those elements in dom that do not have an image element.
5830 * We first compute the lexicographically minimal or maximal element
5831 * in the first basic map. This results in a partial solution "res"
5832 * and a subset "todo" of dom that still need to be handled.
5833 * We then consider each of the remaining maps in "map" and successively
5834 * update both "res" and "todo".
5836 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5837 * Assume we are computing the lexicographical maximum.
5838 * We first compute the lexicographically maximal element in basic map i.
5839 * This results in a partial solution res_i and a subset todo_i.
5840 * Then we combine these results with those obtain for the first k basic maps
5841 * to obtain a result that is valid for the first k+1 basic maps.
5842 * In particular, the set where there is no solution is the set where
5843 * there is no solution for the first k basic maps and also no solution
5844 * for the ith basic map, i.e.,
5846 * todo^i = todo^k * todo_i
5848 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5849 * solutions, arbitrarily breaking ties in favor of res^k.
5850 * That is, when res^k(a) >= res_i(a), we pick res^k and
5851 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5852 * the lexicographic order.)
5853 * In practice, we compute
5855 * res^k * (res_i . "<=")
5859 * res_i * (res^k . "<")
5861 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5862 * where only one of res^k and res_i provides a solution and we simply pick
5869 * Note that we only compute these intersections when dom(res^k) intersects
5870 * dom(res_i). Otherwise, the only effect of these intersections is to
5871 * potentially break up res^k and res_i into smaller pieces.
5872 * We want to avoid such splintering as much as possible.
5873 * In fact, an earlier implementation of this function would look for
5874 * better results in the domain of res^k and for extra results in todo^k,
5875 * but this would always result in a splintering according to todo^k,
5876 * even when the domain of basic map i is disjoint from the domains of
5877 * the previous basic maps.
5879 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5880 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5881 __isl_give isl_set
**empty
, int max
)
5884 struct isl_map
*res
;
5885 struct isl_set
*todo
;
5890 if (isl_map_plain_is_empty(map
)) {
5898 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5899 isl_set_copy(dom
), &todo
, max
);
5901 for (i
= 1; i
< map
->n
; ++i
) {
5905 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5907 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5908 isl_set_copy(dom
), &todo_i
, max
);
5911 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5912 le
= isl_map_lex_le(dim
);
5914 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5915 le
= isl_map_lex_ge(dim
);
5917 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5918 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5919 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5920 le
= isl_map_intersect(le
, isl_map_copy(res
));
5922 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5923 res
= isl_map_intersect_domain(res
,
5924 isl_set_copy(todo_i
));
5925 res_i
= isl_map_intersect_domain(res_i
,
5926 isl_set_copy(todo
));
5929 res
= isl_map_union_disjoint(res
, res_i
);
5930 res
= isl_map_union_disjoint(res
, lt
);
5931 res
= isl_map_union_disjoint(res
, le
);
5933 todo
= isl_set_intersect(todo
, todo_i
);
5953 __isl_give isl_map
*isl_map_partial_lexmax(
5954 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5955 __isl_give isl_set
**empty
)
5957 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5960 __isl_give isl_map
*isl_map_partial_lexmin(
5961 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5962 __isl_give isl_set
**empty
)
5964 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5967 __isl_give isl_set
*isl_set_partial_lexmin(
5968 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5969 __isl_give isl_set
**empty
)
5971 return (struct isl_set
*)
5972 isl_map_partial_lexmin((struct isl_map
*)set
,
5976 __isl_give isl_set
*isl_set_partial_lexmax(
5977 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5978 __isl_give isl_set
**empty
)
5980 return (struct isl_set
*)
5981 isl_map_partial_lexmax((struct isl_map
*)set
,
5985 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5987 struct isl_basic_set
*dom
= NULL
;
5992 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
5993 dom
= isl_basic_set_universe(dom_dim
);
5994 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5996 isl_basic_map_free(bmap
);
6000 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6002 return isl_basic_map_lexopt(bmap
, 0);
6005 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6007 return isl_basic_map_lexopt(bmap
, 1);
6010 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6012 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6015 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6017 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6020 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
6022 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
6025 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
6027 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
6030 /* Extract the first and only affine expression from list
6031 * and then add it to *pwaff with the given dom.
6032 * This domain is known to be disjoint from other domains
6033 * because of the way isl_basic_map_foreach_lexmax works.
6035 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6036 __isl_take isl_aff_list
*list
, void *user
)
6038 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6040 isl_pw_aff
**pwaff
= user
;
6041 isl_pw_aff
*pwaff_i
;
6045 if (isl_aff_list_n_aff(list
) != 1)
6046 isl_die(ctx
, isl_error_internal
,
6047 "expecting single element list", goto error
);
6049 aff
= isl_aff_list_get_aff(list
, 0);
6050 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6052 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6054 isl_aff_list_free(list
);
6058 isl_basic_set_free(dom
);
6059 isl_aff_list_free(list
);
6063 /* Given a basic map with one output dimension, compute the minimum or
6064 * maximum of that dimension as an isl_pw_aff.
6066 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6067 * call update_dim_opt on each leaf of the result.
6069 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6072 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6076 dim
= isl_space_from_domain(isl_space_domain(dim
));
6077 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6078 pwaff
= isl_pw_aff_empty(dim
);
6080 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6082 return isl_pw_aff_free(pwaff
);
6087 /* Compute the minimum or maximum of the given output dimension
6088 * as a function of the parameters and the input dimensions,
6089 * but independently of the other output dimensions.
6091 * We first project out the other output dimension and then compute
6092 * the "lexicographic" maximum in each basic map, combining the results
6093 * using isl_pw_aff_union_max.
6095 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6102 n_out
= isl_map_dim(map
, isl_dim_out
);
6103 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6104 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6109 isl_space
*dim
= isl_map_get_space(map
);
6110 dim
= isl_space_domain(isl_space_from_range(dim
));
6112 return isl_pw_aff_empty(dim
);
6115 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6116 for (i
= 1; i
< map
->n
; ++i
) {
6117 isl_pw_aff
*pwaff_i
;
6119 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6120 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6128 /* Compute the maximum of the given output dimension as a function of the
6129 * parameters and input dimensions, but independently of
6130 * the other output dimensions.
6132 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6134 return map_dim_opt(map
, pos
, 1);
6137 /* Compute the minimum or maximum of the given set dimension
6138 * as a function of the parameters,
6139 * but independently of the other set dimensions.
6141 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6144 return map_dim_opt(set
, pos
, max
);
6147 /* Compute the maximum of the given set dimension as a function of the
6148 * parameters, but independently of the other set dimensions.
6150 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6152 return set_dim_opt(set
, pos
, 1);
6155 /* Compute the minimum of the given set dimension as a function of the
6156 * parameters, but independently of the other set dimensions.
6158 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6160 return set_dim_opt(set
, pos
, 0);
6163 /* Apply a preimage specified by "mat" on the parameters of "bset".
6164 * bset is assumed to have only parameters and divs.
6166 static struct isl_basic_set
*basic_set_parameter_preimage(
6167 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6174 bset
->dim
= isl_space_cow(bset
->dim
);
6178 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6180 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6182 bset
->dim
->nparam
= 0;
6183 bset
->dim
->n_out
= nparam
;
6184 bset
= isl_basic_set_preimage(bset
, mat
);
6186 bset
->dim
->nparam
= bset
->dim
->n_out
;
6187 bset
->dim
->n_out
= 0;
6192 isl_basic_set_free(bset
);
6196 /* Apply a preimage specified by "mat" on the parameters of "set".
6197 * set is assumed to have only parameters and divs.
6199 static struct isl_set
*set_parameter_preimage(
6200 struct isl_set
*set
, struct isl_mat
*mat
)
6202 isl_space
*dim
= NULL
;
6208 dim
= isl_space_copy(set
->dim
);
6209 dim
= isl_space_cow(dim
);
6213 nparam
= isl_set_dim(set
, isl_dim_param
);
6215 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6218 dim
->n_out
= nparam
;
6219 isl_set_reset_space(set
, dim
);
6220 set
= isl_set_preimage(set
, mat
);
6223 dim
= isl_space_copy(set
->dim
);
6224 dim
= isl_space_cow(dim
);
6227 dim
->nparam
= dim
->n_out
;
6229 isl_set_reset_space(set
, dim
);
6232 isl_space_free(dim
);
6239 /* Intersect the basic set "bset" with the affine space specified by the
6240 * equalities in "eq".
6242 static struct isl_basic_set
*basic_set_append_equalities(
6243 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6251 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6256 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6257 for (i
= 0; i
< eq
->n_row
; ++i
) {
6258 k
= isl_basic_set_alloc_equality(bset
);
6261 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6262 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6266 bset
= isl_basic_set_gauss(bset
, NULL
);
6267 bset
= isl_basic_set_finalize(bset
);
6272 isl_basic_set_free(bset
);
6276 /* Intersect the set "set" with the affine space specified by the
6277 * equalities in "eq".
6279 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6287 for (i
= 0; i
< set
->n
; ++i
) {
6288 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6301 /* Project the given basic set onto its parameter domain, possibly introducing
6302 * new, explicit, existential variables in the constraints.
6303 * The input has parameters and (possibly implicit) existential variables.
6304 * The output has the same parameters, but only
6305 * explicit existentially quantified variables.
6307 * The actual projection is performed by pip, but pip doesn't seem
6308 * to like equalities very much, so we first remove the equalities
6309 * among the parameters by performing a variable compression on
6310 * the parameters. Afterward, an inverse transformation is performed
6311 * and the equalities among the parameters are inserted back in.
6313 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6317 struct isl_mat
*T
, *T2
;
6318 struct isl_set
*set
;
6319 unsigned nparam
, n_div
;
6321 bset
= isl_basic_set_cow(bset
);
6325 if (bset
->n_eq
== 0)
6326 return isl_basic_set_lexmin(bset
);
6328 isl_basic_set_gauss(bset
, NULL
);
6330 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6331 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6333 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6334 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6337 if (i
== bset
->n_eq
)
6338 return isl_basic_set_lexmin(bset
);
6340 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6342 eq
= isl_mat_cow(eq
);
6343 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6344 if (T
&& T
->n_col
== 0) {
6348 bset
= isl_basic_set_set_to_empty(bset
);
6349 return isl_set_from_basic_set(bset
);
6351 bset
= basic_set_parameter_preimage(bset
, T
);
6353 set
= isl_basic_set_lexmin(bset
);
6354 set
= set_parameter_preimage(set
, T2
);
6355 set
= set_append_equalities(set
, eq
);
6359 /* Compute an explicit representation for all the existentially
6360 * quantified variables.
6361 * The input and output dimensions are first turned into parameters.
6362 * compute_divs then returns a map with the same parameters and
6363 * no input or output dimensions and the dimension specification
6364 * is reset to that of the input.
6366 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6368 struct isl_basic_set
*bset
;
6369 struct isl_set
*set
;
6370 struct isl_map
*map
;
6371 isl_space
*dim
, *orig_dim
= NULL
;
6376 bmap
= isl_basic_map_cow(bmap
);
6380 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6381 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6382 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6383 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6387 orig_dim
= bmap
->dim
;
6389 bset
= (struct isl_basic_set
*)bmap
;
6391 set
= parameter_compute_divs(bset
);
6392 map
= (struct isl_map
*)set
;
6393 map
= isl_map_reset_space(map
, orig_dim
);
6397 isl_basic_map_free(bmap
);
6401 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6409 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6410 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6411 if (isl_int_is_zero(bmap
->div
[i
][0]))
6413 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6419 static int map_divs_known(__isl_keep isl_map
*map
)
6426 for (i
= 0; i
< map
->n
; ++i
) {
6427 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6435 /* If bmap contains any unknown divs, then compute explicit
6436 * expressions for them. However, this computation may be
6437 * quite expensive, so first try to remove divs that aren't
6440 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6443 struct isl_map
*map
;
6445 known
= isl_basic_map_divs_known(bmap
);
6449 return isl_map_from_basic_map(bmap
);
6451 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6453 known
= isl_basic_map_divs_known(bmap
);
6457 return isl_map_from_basic_map(bmap
);
6459 map
= compute_divs(bmap
);
6462 isl_basic_map_free(bmap
);
6466 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6470 struct isl_map
*res
;
6477 known
= map_divs_known(map
);
6485 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6486 for (i
= 1 ; i
< map
->n
; ++i
) {
6488 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6489 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6490 res
= isl_map_union_disjoint(res
, r2
);
6492 res
= isl_map_union(res
, r2
);
6499 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6501 return (struct isl_set
*)
6502 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6505 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6507 return (struct isl_set
*)
6508 isl_map_compute_divs((struct isl_map
*)set
);
6511 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6514 struct isl_set
*set
;
6519 map
= isl_map_cow(map
);
6523 set
= (struct isl_set
*)map
;
6524 set
->dim
= isl_space_domain(set
->dim
);
6527 for (i
= 0; i
< map
->n
; ++i
) {
6528 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6532 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6533 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6540 /* Return the union of "map1" and "map2", where we assume for now that
6541 * "map1" and "map2" are disjoint. Note that the basic maps inside
6542 * "map1" or "map2" may not be disjoint from each other.
6543 * Also note that this function is also called from isl_map_union,
6544 * which takes care of handling the situation where "map1" and "map2"
6545 * may not be disjoint.
6547 * If one of the inputs is empty, we can simply return the other input.
6548 * Similarly, if one of the inputs is universal, then it is equal to the union.
6550 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6551 __isl_take isl_map
*map2
)
6555 struct isl_map
*map
= NULL
;
6570 is_universe
= isl_map_plain_is_universe(map1
);
6571 if (is_universe
< 0)
6578 is_universe
= isl_map_plain_is_universe(map2
);
6579 if (is_universe
< 0)
6586 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6588 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6589 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6590 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6592 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6593 map1
->n
+ map2
->n
, flags
);
6596 for (i
= 0; i
< map1
->n
; ++i
) {
6597 map
= isl_map_add_basic_map(map
,
6598 isl_basic_map_copy(map1
->p
[i
]));
6602 for (i
= 0; i
< map2
->n
; ++i
) {
6603 map
= isl_map_add_basic_map(map
,
6604 isl_basic_map_copy(map2
->p
[i
]));
6618 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6619 __isl_take isl_map
*map2
)
6621 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6624 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6626 map1
= isl_map_union_disjoint(map1
, map2
);
6630 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6634 struct isl_set
*isl_set_union_disjoint(
6635 struct isl_set
*set1
, struct isl_set
*set2
)
6637 return (struct isl_set
*)
6638 isl_map_union_disjoint(
6639 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6642 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6644 return (struct isl_set
*)
6645 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6648 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6651 * "map" and "set" are assumed to be compatible and non-NULL.
6653 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6654 __isl_take isl_set
*set
,
6655 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6656 __isl_take isl_basic_set
*bset
))
6659 struct isl_map
*result
;
6662 if (isl_set_plain_is_universe(set
)) {
6667 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6668 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6669 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6671 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6672 map
->n
* set
->n
, flags
);
6673 for (i
= 0; result
&& i
< map
->n
; ++i
)
6674 for (j
= 0; j
< set
->n
; ++j
) {
6675 result
= isl_map_add_basic_map(result
,
6676 fn(isl_basic_map_copy(map
->p
[i
]),
6677 isl_basic_set_copy(set
->p
[j
])));
6687 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6688 __isl_take isl_set
*set
)
6693 if (!isl_map_compatible_range(map
, set
))
6694 isl_die(set
->ctx
, isl_error_invalid
,
6695 "incompatible spaces", goto error
);
6697 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6704 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6705 __isl_take isl_set
*set
)
6707 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6710 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
6711 __isl_take isl_set
*set
)
6716 if (!isl_map_compatible_domain(map
, set
))
6717 isl_die(set
->ctx
, isl_error_invalid
,
6718 "incompatible spaces", goto error
);
6720 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
6727 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
6728 __isl_take isl_set
*set
)
6730 return isl_map_align_params_map_map_and(map
, set
,
6731 &map_intersect_domain
);
6734 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6735 __isl_take isl_map
*map2
)
6739 map1
= isl_map_reverse(map1
);
6740 map1
= isl_map_apply_range(map1
, map2
);
6741 return isl_map_reverse(map1
);
6748 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6749 __isl_take isl_map
*map2
)
6751 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6754 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6755 __isl_take isl_map
*map2
)
6757 isl_space
*dim_result
;
6758 struct isl_map
*result
;
6764 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6765 isl_space_copy(map2
->dim
));
6767 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6770 for (i
= 0; i
< map1
->n
; ++i
)
6771 for (j
= 0; j
< map2
->n
; ++j
) {
6772 result
= isl_map_add_basic_map(result
,
6773 isl_basic_map_apply_range(
6774 isl_basic_map_copy(map1
->p
[i
]),
6775 isl_basic_map_copy(map2
->p
[j
])));
6781 if (result
&& result
->n
<= 1)
6782 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6790 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6791 __isl_take isl_map
*map2
)
6793 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6797 * returns range - domain
6799 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6801 isl_space
*dims
, *target_dim
;
6802 struct isl_basic_set
*bset
;
6809 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6810 bmap
->dim
, isl_dim_out
),
6812 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6813 dim
= isl_basic_map_n_in(bmap
);
6814 nparam
= isl_basic_map_n_param(bmap
);
6815 bset
= isl_basic_set_from_basic_map(bmap
);
6816 bset
= isl_basic_set_cow(bset
);
6817 dims
= isl_basic_set_get_space(bset
);
6818 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6819 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6820 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6821 for (i
= 0; i
< dim
; ++i
) {
6822 int j
= isl_basic_map_alloc_equality(
6823 (struct isl_basic_map
*)bset
);
6826 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6827 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6828 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6829 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6831 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6832 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6835 isl_basic_map_free(bmap
);
6840 * returns range - domain
6842 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6846 struct isl_set
*result
;
6851 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6852 map
->dim
, isl_dim_out
),
6854 dim
= isl_map_get_space(map
);
6855 dim
= isl_space_domain(dim
);
6856 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6859 for (i
= 0; i
< map
->n
; ++i
)
6860 result
= isl_set_add_basic_set(result
,
6861 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6870 * returns [domain -> range] -> range - domain
6872 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6873 __isl_take isl_basic_map
*bmap
)
6877 isl_basic_map
*domain
;
6881 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6882 isl_die(bmap
->ctx
, isl_error_invalid
,
6883 "domain and range don't match", goto error
);
6885 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6886 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6888 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6889 domain
= isl_basic_map_universe(dim
);
6891 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6892 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6893 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6895 total
= isl_basic_map_total_dim(bmap
);
6897 for (i
= 0; i
< n
; ++i
) {
6898 k
= isl_basic_map_alloc_equality(bmap
);
6901 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6902 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6903 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6904 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6907 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6908 return isl_basic_map_finalize(bmap
);
6910 isl_basic_map_free(bmap
);
6915 * returns [domain -> range] -> range - domain
6917 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6920 isl_space
*domain_dim
;
6925 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6926 isl_die(map
->ctx
, isl_error_invalid
,
6927 "domain and range don't match", goto error
);
6929 map
= isl_map_cow(map
);
6933 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6934 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6935 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6938 for (i
= 0; i
< map
->n
; ++i
) {
6939 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6943 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6950 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6952 struct isl_basic_map
*bmap
;
6960 nparam
= dims
->nparam
;
6962 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6966 for (i
= 0; i
< dim
; ++i
) {
6967 int j
= isl_basic_map_alloc_equality(bmap
);
6970 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6971 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6972 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6974 return isl_basic_map_finalize(bmap
);
6976 isl_basic_map_free(bmap
);
6980 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6984 if (dim
->n_in
!= dim
->n_out
)
6985 isl_die(dim
->ctx
, isl_error_invalid
,
6986 "number of input and output dimensions needs to be "
6987 "the same", goto error
);
6988 return basic_map_identity(dim
);
6990 isl_space_free(dim
);
6994 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6996 if (!model
|| !model
->dim
)
6998 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7001 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7003 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7006 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7008 if (!model
|| !model
->dim
)
7010 return isl_map_identity(isl_space_copy(model
->dim
));
7013 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7015 if (!model
|| !model
->dim
)
7017 return isl_map_identity(isl_space_copy(model
->dim
));
7020 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7022 isl_space
*dim
= isl_set_get_space(set
);
7024 id
= isl_map_identity(isl_space_map_from_set(dim
));
7025 return isl_map_intersect_range(id
, set
);
7028 /* Construct a basic set with all set dimensions having only non-negative
7031 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7032 __isl_take isl_space
*space
)
7037 struct isl_basic_set
*bset
;
7041 nparam
= space
->nparam
;
7043 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7046 for (i
= 0; i
< dim
; ++i
) {
7047 int k
= isl_basic_set_alloc_inequality(bset
);
7050 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7051 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7055 isl_basic_set_free(bset
);
7059 /* Construct the half-space x_pos >= 0.
7061 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7065 isl_basic_set
*nonneg
;
7067 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7068 k
= isl_basic_set_alloc_inequality(nonneg
);
7071 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7072 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7074 return isl_basic_set_finalize(nonneg
);
7076 isl_basic_set_free(nonneg
);
7080 /* Construct the half-space x_pos <= -1.
7082 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7087 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7088 k
= isl_basic_set_alloc_inequality(neg
);
7091 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7092 isl_int_set_si(neg
->ineq
[k
][0], -1);
7093 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7095 return isl_basic_set_finalize(neg
);
7097 isl_basic_set_free(neg
);
7101 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7102 enum isl_dim_type type
, unsigned first
, unsigned n
)
7105 isl_basic_set
*nonneg
;
7113 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7115 for (i
= 0; i
< n
; ++i
) {
7116 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7117 pos(set
->dim
, type
) + first
+ i
);
7118 neg
= neg_halfspace(isl_set_get_space(set
),
7119 pos(set
->dim
, type
) + first
+ i
);
7121 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7130 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7131 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7138 if (isl_set_plain_is_empty(set
)) {
7143 return fn(set
, signs
, user
);
7146 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7148 half
= isl_set_intersect(half
, isl_set_copy(set
));
7149 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7153 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7155 half
= isl_set_intersect(half
, set
);
7156 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7162 /* Call "fn" on the intersections of "set" with each of the orthants
7163 * (except for obviously empty intersections). The orthant is identified
7164 * by the signs array, with each entry having value 1 or -1 according
7165 * to the sign of the corresponding variable.
7167 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7168 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7178 if (isl_set_plain_is_empty(set
))
7181 nparam
= isl_set_dim(set
, isl_dim_param
);
7182 nvar
= isl_set_dim(set
, isl_dim_set
);
7184 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7186 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7194 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7196 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7199 int isl_basic_map_is_subset(
7200 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7203 struct isl_map
*map1
;
7204 struct isl_map
*map2
;
7206 if (!bmap1
|| !bmap2
)
7209 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7210 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7212 is_subset
= isl_map_is_subset(map1
, map2
);
7220 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7221 __isl_keep isl_basic_set
*bset2
)
7223 return isl_basic_map_is_subset(bset1
, bset2
);
7226 int isl_basic_map_is_equal(
7227 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7231 if (!bmap1
|| !bmap2
)
7233 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7236 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7240 int isl_basic_set_is_equal(
7241 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7243 return isl_basic_map_is_equal(
7244 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7247 int isl_map_is_empty(struct isl_map
*map
)
7254 for (i
= 0; i
< map
->n
; ++i
) {
7255 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7264 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7266 return map
? map
->n
== 0 : -1;
7269 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7271 return isl_map_plain_is_empty(map
);
7274 int isl_set_plain_is_empty(struct isl_set
*set
)
7276 return set
? set
->n
== 0 : -1;
7279 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7281 return isl_set_plain_is_empty(set
);
7284 int isl_set_is_empty(struct isl_set
*set
)
7286 return isl_map_is_empty((struct isl_map
*)set
);
7289 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7294 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7297 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7302 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7305 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7311 is_subset
= isl_map_is_subset(map1
, map2
);
7314 is_subset
= isl_map_is_subset(map2
, map1
);
7318 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7320 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7323 int isl_basic_map_is_strict_subset(
7324 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7328 if (!bmap1
|| !bmap2
)
7330 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7333 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7334 if (is_subset
== -1)
7339 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7345 is_subset
= isl_map_is_subset(map1
, map2
);
7348 is_subset
= isl_map_is_subset(map2
, map1
);
7349 if (is_subset
== -1)
7354 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7356 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7359 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7363 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7366 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7370 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7373 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7380 for (i
= 0; i
< map
->n
; ++i
) {
7381 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7389 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7391 return isl_map_plain_is_universe((isl_map
*) set
);
7394 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7396 return isl_set_plain_is_universe(set
);
7399 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7401 struct isl_basic_set
*bset
= NULL
;
7402 struct isl_vec
*sample
= NULL
;
7409 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7412 if (isl_basic_map_is_universe(bmap
))
7415 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7416 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7417 copy
= isl_basic_map_remove_redundancies(copy
);
7418 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
7419 isl_basic_map_free(copy
);
7423 total
= 1 + isl_basic_map_total_dim(bmap
);
7424 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7425 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7431 isl_vec_free(bmap
->sample
);
7432 bmap
->sample
= NULL
;
7433 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7436 sample
= isl_basic_set_sample_vec(bset
);
7439 empty
= sample
->size
== 0;
7440 isl_vec_free(bmap
->sample
);
7441 bmap
->sample
= sample
;
7443 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7448 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7452 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7455 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7457 return isl_basic_map_plain_is_empty(bmap
);
7460 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7464 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7467 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7469 return isl_basic_set_plain_is_empty(bset
);
7472 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7474 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7477 struct isl_map
*isl_basic_map_union(
7478 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7480 struct isl_map
*map
;
7481 if (!bmap1
|| !bmap2
)
7484 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7486 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7489 map
= isl_map_add_basic_map(map
, bmap1
);
7490 map
= isl_map_add_basic_map(map
, bmap2
);
7493 isl_basic_map_free(bmap1
);
7494 isl_basic_map_free(bmap2
);
7498 struct isl_set
*isl_basic_set_union(
7499 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7501 return (struct isl_set
*)isl_basic_map_union(
7502 (struct isl_basic_map
*)bset1
,
7503 (struct isl_basic_map
*)bset2
);
7506 /* Order divs such that any div only depends on previous divs */
7507 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7515 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7517 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7519 if (isl_int_is_zero(bmap
->div
[i
][0]))
7521 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7525 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7531 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7533 return (struct isl_basic_set
*)
7534 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7537 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7544 for (i
= 0; i
< map
->n
; ++i
) {
7545 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7556 /* Apply the expansion computed by isl_merge_divs.
7557 * The expansion itself is given by "exp" while the resulting
7558 * list of divs is given by "div".
7560 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7561 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7566 bset
= isl_basic_set_cow(bset
);
7570 if (div
->n_row
< bset
->n_div
)
7571 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7572 "not an expansion", goto error
);
7574 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7575 div
->n_row
- bset
->n_div
, 0,
7576 2 * (div
->n_row
- bset
->n_div
));
7578 n_div
= bset
->n_div
;
7579 for (i
= n_div
; i
< div
->n_row
; ++i
)
7580 if (isl_basic_set_alloc_div(bset
) < 0)
7584 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7585 if (j
>= 0 && exp
[j
] == i
) {
7587 isl_basic_map_swap_div(bset
, i
, j
);
7590 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7591 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7599 isl_basic_set_free(bset
);
7604 /* Look for a div in dst that corresponds to the div "div" in src.
7605 * The divs before "div" in src and dst are assumed to be the same.
7607 * Returns -1 if no corresponding div was found and the position
7608 * of the corresponding div in dst otherwise.
7610 static int find_div(struct isl_basic_map
*dst
,
7611 struct isl_basic_map
*src
, unsigned div
)
7615 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7617 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7618 for (i
= div
; i
< dst
->n_div
; ++i
)
7619 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7620 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7621 dst
->n_div
- div
) == -1)
7626 struct isl_basic_map
*isl_basic_map_align_divs(
7627 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7635 if (src
->n_div
== 0)
7638 for (i
= 0; i
< src
->n_div
; ++i
)
7639 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7641 src
= isl_basic_map_order_divs(src
);
7642 dst
= isl_basic_map_cow(dst
);
7643 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7644 src
->n_div
, 0, 2 * src
->n_div
);
7647 total
= isl_space_dim(src
->dim
, isl_dim_all
);
7648 for (i
= 0; i
< src
->n_div
; ++i
) {
7649 int j
= find_div(dst
, src
, i
);
7651 j
= isl_basic_map_alloc_div(dst
);
7654 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7655 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7656 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7660 isl_basic_map_swap_div(dst
, i
, j
);
7664 isl_basic_map_free(dst
);
7668 struct isl_basic_set
*isl_basic_set_align_divs(
7669 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7671 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7672 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7675 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7683 map
= isl_map_compute_divs(map
);
7684 map
= isl_map_cow(map
);
7688 for (i
= 1; i
< map
->n
; ++i
)
7689 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7690 for (i
= 1; i
< map
->n
; ++i
)
7691 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7693 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7697 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7699 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7702 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7703 __isl_take isl_map
*map
)
7707 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7708 map
= isl_map_intersect_domain(map
, set
);
7709 set
= isl_map_range(map
);
7717 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7718 __isl_take isl_map
*map
)
7720 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7723 /* There is no need to cow as removing empty parts doesn't change
7724 * the meaning of the set.
7726 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7733 for (i
= map
->n
- 1; i
>= 0; --i
)
7734 remove_if_empty(map
, i
);
7739 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7741 return (struct isl_set
*)
7742 isl_map_remove_empty_parts((struct isl_map
*)set
);
7745 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7747 struct isl_basic_map
*bmap
;
7748 if (!map
|| map
->n
== 0)
7750 bmap
= map
->p
[map
->n
-1];
7751 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7752 return isl_basic_map_copy(bmap
);
7755 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7757 return (struct isl_basic_set
*)
7758 isl_map_copy_basic_map((struct isl_map
*)set
);
7761 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7762 __isl_keep isl_basic_map
*bmap
)
7768 for (i
= map
->n
-1; i
>= 0; --i
) {
7769 if (map
->p
[i
] != bmap
)
7771 map
= isl_map_cow(map
);
7774 isl_basic_map_free(map
->p
[i
]);
7775 if (i
!= map
->n
-1) {
7776 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7777 map
->p
[i
] = map
->p
[map
->n
-1];
7788 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7789 struct isl_basic_set
*bset
)
7791 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7792 (struct isl_basic_map
*)bset
);
7795 /* Given two basic sets bset1 and bset2, compute the maximal difference
7796 * between the values of dimension pos in bset1 and those in bset2
7797 * for any common value of the parameters and dimensions preceding pos.
7799 static enum isl_lp_result
basic_set_maximal_difference_at(
7800 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7801 int pos
, isl_int
*opt
)
7804 struct isl_basic_map
*bmap1
= NULL
;
7805 struct isl_basic_map
*bmap2
= NULL
;
7806 struct isl_ctx
*ctx
;
7807 struct isl_vec
*obj
;
7810 unsigned dim1
, dim2
;
7811 enum isl_lp_result res
;
7813 if (!bset1
|| !bset2
)
7814 return isl_lp_error
;
7816 nparam
= isl_basic_set_n_param(bset1
);
7817 dim1
= isl_basic_set_n_dim(bset1
);
7818 dim2
= isl_basic_set_n_dim(bset2
);
7819 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7820 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7821 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7822 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7823 if (!bmap1
|| !bmap2
)
7825 bmap1
= isl_basic_map_cow(bmap1
);
7826 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7827 pos
, (dim1
- pos
) + (dim2
- pos
),
7828 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7829 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7832 total
= isl_basic_map_total_dim(bmap1
);
7834 obj
= isl_vec_alloc(ctx
, 1 + total
);
7835 isl_seq_clr(obj
->block
.data
, 1 + total
);
7836 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7837 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7840 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7842 isl_basic_map_free(bmap1
);
7846 isl_basic_map_free(bmap1
);
7847 isl_basic_map_free(bmap2
);
7848 return isl_lp_error
;
7851 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7852 * for any common value of the parameters and dimensions preceding pos
7853 * in both basic sets, the values of dimension pos in bset1 are
7854 * smaller or larger than those in bset2.
7857 * 1 if bset1 follows bset2
7858 * -1 if bset1 precedes bset2
7859 * 0 if bset1 and bset2 are incomparable
7860 * -2 if some error occurred.
7862 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7863 struct isl_basic_set
*bset2
, int pos
)
7866 enum isl_lp_result res
;
7871 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7873 if (res
== isl_lp_empty
)
7875 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7876 res
== isl_lp_unbounded
)
7878 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7887 /* Given two basic sets bset1 and bset2, check whether
7888 * for any common value of the parameters and dimensions preceding pos
7889 * there is a value of dimension pos in bset1 that is larger
7890 * than a value of the same dimension in bset2.
7893 * 1 if there exists such a pair
7894 * 0 if there is no such pair, but there is a pair of equal values
7896 * -2 if some error occurred.
7898 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7899 __isl_keep isl_basic_set
*bset2
, int pos
)
7902 enum isl_lp_result res
;
7907 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7909 if (res
== isl_lp_empty
)
7911 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7912 res
== isl_lp_unbounded
)
7914 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7916 else if (res
== isl_lp_ok
)
7925 /* Given two sets set1 and set2, check whether
7926 * for any common value of the parameters and dimensions preceding pos
7927 * there is a value of dimension pos in set1 that is larger
7928 * than a value of the same dimension in set2.
7931 * 1 if there exists such a pair
7932 * 0 if there is no such pair, but there is a pair of equal values
7934 * -2 if some error occurred.
7936 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7937 __isl_keep isl_set
*set2
, int pos
)
7945 for (i
= 0; i
< set1
->n
; ++i
)
7946 for (j
= 0; j
< set2
->n
; ++j
) {
7948 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7949 if (f
== 1 || f
== -2)
7958 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7959 unsigned pos
, isl_int
*val
)
7967 total
= isl_basic_map_total_dim(bmap
);
7968 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7969 for (; d
+1 > pos
; --d
)
7970 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7974 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7976 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7978 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7981 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7987 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7988 unsigned pos
, isl_int
*val
)
8000 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8003 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8004 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8005 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8006 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8010 isl_int_set(*val
, v
);
8016 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8017 unsigned pos
, isl_int
*val
)
8019 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8023 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8026 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8029 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8030 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8032 if (pos
>= isl_basic_map_dim(bmap
, type
))
8034 return isl_basic_map_plain_has_fixed_var(bmap
,
8035 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8038 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8039 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8041 if (pos
>= isl_map_dim(map
, type
))
8043 return isl_map_plain_has_fixed_var(map
,
8044 map_offset(map
, type
) - 1 + pos
, val
);
8047 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8048 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8050 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8053 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8054 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8056 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8059 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8060 * then return this fixed value in *val.
8062 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8063 unsigned dim
, isl_int
*val
)
8065 return isl_basic_set_plain_has_fixed_var(bset
,
8066 isl_basic_set_n_param(bset
) + dim
, val
);
8069 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8070 * then return this fixed value in *val.
8072 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8073 unsigned dim
, isl_int
*val
)
8075 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8078 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8079 unsigned dim
, isl_int
*val
)
8081 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8084 /* Check if input variable in has fixed value and if so and if val is not NULL,
8085 * then return this fixed value in *val.
8087 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8088 unsigned in
, isl_int
*val
)
8090 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8093 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8094 * and if val is not NULL, then return this lower bound in *val.
8096 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8097 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8099 int i
, i_eq
= -1, i_ineq
= -1;
8106 total
= isl_basic_set_total_dim(bset
);
8107 nparam
= isl_basic_set_n_param(bset
);
8108 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8109 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8115 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8116 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8118 if (i_eq
!= -1 || i_ineq
!= -1)
8122 if (i_eq
== -1 && i_ineq
== -1)
8124 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8125 /* The coefficient should always be one due to normalization. */
8126 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8128 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8130 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8131 total
- nparam
- dim
- 1) != -1)
8134 isl_int_neg(*val
, c
[0]);
8138 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8139 unsigned dim
, isl_int
*val
)
8151 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8155 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8157 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8158 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8160 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8164 isl_int_set(*val
, v
);
8175 /* uset_gist depends on constraints without existentially quantified
8176 * variables sorting first.
8178 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8180 const struct constraint
*c1
= (const struct constraint
*)p1
;
8181 const struct constraint
*c2
= (const struct constraint
*)p2
;
8183 unsigned size
= isl_min(c1
->size
, c2
->size
);
8185 l1
= isl_seq_last_non_zero(c1
->c
, size
);
8186 l2
= isl_seq_last_non_zero(c2
->c
, size
);
8191 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
8194 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8195 struct isl_basic_map
*bmap
)
8198 struct constraint
*c
;
8203 total
= isl_basic_map_total_dim(bmap
);
8204 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8207 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8209 c
[i
].c
= bmap
->ineq
[i
];
8211 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8212 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8213 bmap
->ineq
[i
] = c
[i
].c
;
8217 isl_basic_map_free(bmap
);
8221 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8222 __isl_take isl_basic_set
*bset
)
8224 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8225 (struct isl_basic_map
*)bset
);
8228 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8232 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8234 bmap
= isl_basic_map_remove_redundancies(bmap
);
8235 bmap
= isl_basic_map_sort_constraints(bmap
);
8236 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8240 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8242 return (struct isl_basic_set
*)isl_basic_map_normalize(
8243 (struct isl_basic_map
*)bset
);
8246 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8247 const __isl_keep isl_basic_map
*bmap2
)
8254 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8255 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8256 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8257 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8258 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8259 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8260 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8261 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8262 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8263 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8264 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8266 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8268 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8270 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8271 return bmap1
->n_eq
- bmap2
->n_eq
;
8272 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8273 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8274 if (bmap1
->n_div
!= bmap2
->n_div
)
8275 return bmap1
->n_div
- bmap2
->n_div
;
8276 total
= isl_basic_map_total_dim(bmap1
);
8277 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8278 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8282 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8283 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8287 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8288 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8295 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8296 const __isl_keep isl_basic_set
*bset2
)
8298 return isl_basic_map_plain_cmp(bset1
, bset2
);
8301 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8307 if (set1
->n
!= set2
->n
)
8308 return set1
->n
- set2
->n
;
8310 for (i
= 0; i
< set1
->n
; ++i
) {
8311 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8319 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8320 __isl_keep isl_basic_map
*bmap2
)
8322 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8325 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8326 __isl_keep isl_basic_set
*bset2
)
8328 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8329 (isl_basic_map
*)bset2
);
8332 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8334 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8335 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8337 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8340 /* We normalize in place, but if anything goes wrong we need
8341 * to return NULL, so we need to make sure we don't change the
8342 * meaning of any possible other copies of map.
8344 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8347 struct isl_basic_map
*bmap
;
8351 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8353 for (i
= 0; i
< map
->n
; ++i
) {
8354 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8357 isl_basic_map_free(map
->p
[i
]);
8360 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8361 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8362 map
= isl_map_remove_empty_parts(map
);
8365 for (i
= map
->n
- 1; i
>= 1; --i
) {
8366 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8368 isl_basic_map_free(map
->p
[i
-1]);
8369 for (j
= i
; j
< map
->n
; ++j
)
8370 map
->p
[j
-1] = map
->p
[j
];
8380 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8382 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8385 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8395 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8398 map1
= isl_map_copy(map1
);
8399 map2
= isl_map_copy(map2
);
8400 map1
= isl_map_normalize(map1
);
8401 map2
= isl_map_normalize(map2
);
8404 equal
= map1
->n
== map2
->n
;
8405 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8406 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8419 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8421 return isl_map_plain_is_equal(map1
, map2
);
8424 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8426 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8427 (struct isl_map
*)set2
);
8430 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8432 return isl_set_plain_is_equal(set1
, set2
);
8435 /* Return an interval that ranges from min to max (inclusive)
8437 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8438 isl_int min
, isl_int max
)
8441 struct isl_basic_set
*bset
= NULL
;
8443 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8447 k
= isl_basic_set_alloc_inequality(bset
);
8450 isl_int_set_si(bset
->ineq
[k
][1], 1);
8451 isl_int_neg(bset
->ineq
[k
][0], min
);
8453 k
= isl_basic_set_alloc_inequality(bset
);
8456 isl_int_set_si(bset
->ineq
[k
][1], -1);
8457 isl_int_set(bset
->ineq
[k
][0], max
);
8461 isl_basic_set_free(bset
);
8465 /* Return the Cartesian product of the basic sets in list (in the given order).
8467 __isl_give isl_basic_set
*isl_basic_set_list_product(
8468 __isl_take
struct isl_basic_set_list
*list
)
8476 struct isl_basic_set
*product
= NULL
;
8480 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8481 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8482 nparam
= isl_basic_set_n_param(list
->p
[0]);
8483 dim
= isl_basic_set_n_dim(list
->p
[0]);
8484 extra
= list
->p
[0]->n_div
;
8485 n_eq
= list
->p
[0]->n_eq
;
8486 n_ineq
= list
->p
[0]->n_ineq
;
8487 for (i
= 1; i
< list
->n
; ++i
) {
8488 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8489 isl_assert(list
->ctx
,
8490 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8491 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8492 extra
+= list
->p
[i
]->n_div
;
8493 n_eq
+= list
->p
[i
]->n_eq
;
8494 n_ineq
+= list
->p
[i
]->n_ineq
;
8496 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8501 for (i
= 0; i
< list
->n
; ++i
) {
8502 isl_basic_set_add_constraints(product
,
8503 isl_basic_set_copy(list
->p
[i
]), dim
);
8504 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8506 isl_basic_set_list_free(list
);
8509 isl_basic_set_free(product
);
8510 isl_basic_set_list_free(list
);
8514 struct isl_basic_map
*isl_basic_map_product(
8515 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8517 isl_space
*dim_result
= NULL
;
8518 struct isl_basic_map
*bmap
;
8519 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8520 struct isl_dim_map
*dim_map1
, *dim_map2
;
8522 if (!bmap1
|| !bmap2
)
8525 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8526 bmap2
->dim
, isl_dim_param
), goto error
);
8527 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8528 isl_space_copy(bmap2
->dim
));
8530 in1
= isl_basic_map_n_in(bmap1
);
8531 in2
= isl_basic_map_n_in(bmap2
);
8532 out1
= isl_basic_map_n_out(bmap1
);
8533 out2
= isl_basic_map_n_out(bmap2
);
8534 nparam
= isl_basic_map_n_param(bmap1
);
8536 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8537 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8538 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8539 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8540 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8541 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8542 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8543 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8544 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8545 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8546 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8548 bmap
= isl_basic_map_alloc_space(dim_result
,
8549 bmap1
->n_div
+ bmap2
->n_div
,
8550 bmap1
->n_eq
+ bmap2
->n_eq
,
8551 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8552 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8553 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8554 bmap
= isl_basic_map_simplify(bmap
);
8555 return isl_basic_map_finalize(bmap
);
8557 isl_basic_map_free(bmap1
);
8558 isl_basic_map_free(bmap2
);
8562 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8563 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8565 isl_basic_map
*prod
;
8567 prod
= isl_basic_map_product(bmap1
, bmap2
);
8568 prod
= isl_basic_map_flatten(prod
);
8572 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8573 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8575 return isl_basic_map_flat_range_product(bset1
, bset2
);
8578 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8579 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8581 isl_space
*space_result
= NULL
;
8582 isl_basic_map
*bmap
;
8583 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8584 struct isl_dim_map
*dim_map1
, *dim_map2
;
8586 if (!bmap1
|| !bmap2
)
8589 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8590 isl_space_copy(bmap2
->dim
));
8592 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8593 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8594 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8595 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8597 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8598 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8599 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8600 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8601 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8602 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8603 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8604 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8605 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8606 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8607 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8609 bmap
= isl_basic_map_alloc_space(space_result
,
8610 bmap1
->n_div
+ bmap2
->n_div
,
8611 bmap1
->n_eq
+ bmap2
->n_eq
,
8612 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8613 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8614 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8615 bmap
= isl_basic_map_simplify(bmap
);
8616 return isl_basic_map_finalize(bmap
);
8618 isl_basic_map_free(bmap1
);
8619 isl_basic_map_free(bmap2
);
8623 __isl_give isl_basic_map
*isl_basic_map_range_product(
8624 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8626 isl_space
*dim_result
= NULL
;
8627 isl_basic_map
*bmap
;
8628 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8629 struct isl_dim_map
*dim_map1
, *dim_map2
;
8631 if (!bmap1
|| !bmap2
)
8634 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8635 bmap2
->dim
, isl_dim_param
))
8636 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8637 "parameters don't match", goto error
);
8639 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8640 isl_space_copy(bmap2
->dim
));
8642 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8643 out1
= isl_basic_map_n_out(bmap1
);
8644 out2
= isl_basic_map_n_out(bmap2
);
8645 nparam
= isl_basic_map_n_param(bmap1
);
8647 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8648 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8649 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8650 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8651 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8652 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8653 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8654 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8655 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8656 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8657 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8659 bmap
= isl_basic_map_alloc_space(dim_result
,
8660 bmap1
->n_div
+ bmap2
->n_div
,
8661 bmap1
->n_eq
+ bmap2
->n_eq
,
8662 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8663 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8664 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8665 bmap
= isl_basic_map_simplify(bmap
);
8666 return isl_basic_map_finalize(bmap
);
8668 isl_basic_map_free(bmap1
);
8669 isl_basic_map_free(bmap2
);
8673 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8674 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8676 isl_basic_map
*prod
;
8678 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8679 prod
= isl_basic_map_flatten_range(prod
);
8683 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8684 __isl_take isl_map
*map2
,
8685 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8686 __isl_take isl_space
*right
),
8687 __isl_give isl_basic_map
*(*basic_map_product
)(
8688 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8691 struct isl_map
*result
;
8697 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8698 map2
->dim
, isl_dim_param
), goto error
);
8700 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8701 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8702 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8704 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8705 isl_space_copy(map2
->dim
)),
8706 map1
->n
* map2
->n
, flags
);
8709 for (i
= 0; i
< map1
->n
; ++i
)
8710 for (j
= 0; j
< map2
->n
; ++j
) {
8711 struct isl_basic_map
*part
;
8712 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8713 isl_basic_map_copy(map2
->p
[j
]));
8714 if (isl_basic_map_is_empty(part
))
8715 isl_basic_map_free(part
);
8717 result
= isl_map_add_basic_map(result
, part
);
8730 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8732 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8733 __isl_take isl_map
*map2
)
8735 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8738 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8739 __isl_take isl_map
*map2
)
8741 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8744 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8746 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8747 __isl_take isl_map
*map2
)
8751 prod
= isl_map_product(map1
, map2
);
8752 prod
= isl_map_flatten(prod
);
8756 /* Given two set A and B, construct its Cartesian product A x B.
8758 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8760 return isl_map_range_product(set1
, set2
);
8763 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8764 __isl_take isl_set
*set2
)
8766 return isl_map_flat_range_product(set1
, set2
);
8769 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8771 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8772 __isl_take isl_map
*map2
)
8774 return map_product(map1
, map2
, &isl_space_domain_product
,
8775 &isl_basic_map_domain_product
);
8778 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8780 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8781 __isl_take isl_map
*map2
)
8783 return map_product(map1
, map2
, &isl_space_range_product
,
8784 &isl_basic_map_range_product
);
8787 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8788 __isl_take isl_map
*map2
)
8790 return isl_map_align_params_map_map_and(map1
, map2
,
8791 &map_domain_product_aligned
);
8794 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8795 __isl_take isl_map
*map2
)
8797 return isl_map_align_params_map_map_and(map1
, map2
,
8798 &map_range_product_aligned
);
8801 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8803 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8804 __isl_take isl_map
*map2
)
8808 prod
= isl_map_domain_product(map1
, map2
);
8809 prod
= isl_map_flatten_domain(prod
);
8813 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8815 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8816 __isl_take isl_map
*map2
)
8820 prod
= isl_map_range_product(map1
, map2
);
8821 prod
= isl_map_flatten_range(prod
);
8825 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8828 uint32_t hash
= isl_hash_init();
8833 bmap
= isl_basic_map_copy(bmap
);
8834 bmap
= isl_basic_map_normalize(bmap
);
8837 total
= isl_basic_map_total_dim(bmap
);
8838 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8839 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8841 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8842 isl_hash_hash(hash
, c_hash
);
8844 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8845 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8847 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8848 isl_hash_hash(hash
, c_hash
);
8850 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8851 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8853 if (isl_int_is_zero(bmap
->div
[i
][0]))
8855 isl_hash_byte(hash
, i
& 0xFF);
8856 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8857 isl_hash_hash(hash
, c_hash
);
8859 isl_basic_map_free(bmap
);
8863 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8865 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8868 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8875 map
= isl_map_copy(map
);
8876 map
= isl_map_normalize(map
);
8880 hash
= isl_hash_init();
8881 for (i
= 0; i
< map
->n
; ++i
) {
8883 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8884 isl_hash_hash(hash
, bmap_hash
);
8892 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8894 return isl_map_get_hash((isl_map
*)set
);
8897 /* Check if the value for dimension dim is completely determined
8898 * by the values of the other parameters and variables.
8899 * That is, check if dimension dim is involved in an equality.
8901 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8908 nparam
= isl_basic_set_n_param(bset
);
8909 for (i
= 0; i
< bset
->n_eq
; ++i
)
8910 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8915 /* Check if the value for dimension dim is completely determined
8916 * by the values of the other parameters and variables.
8917 * That is, check if dimension dim is involved in an equality
8918 * for each of the subsets.
8920 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8926 for (i
= 0; i
< set
->n
; ++i
) {
8928 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8935 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8937 return set
? set
->n
: 0;
8940 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8941 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8948 for (i
= 0; i
< map
->n
; ++i
)
8949 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8955 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8956 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8963 for (i
= 0; i
< set
->n
; ++i
)
8964 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8970 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8977 bset
= isl_basic_set_cow(bset
);
8981 dim
= isl_basic_set_get_space(bset
);
8982 dim
= isl_space_lift(dim
, bset
->n_div
);
8985 isl_space_free(bset
->dim
);
8987 bset
->extra
-= bset
->n_div
;
8990 bset
= isl_basic_set_finalize(bset
);
8994 isl_basic_set_free(bset
);
8998 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9004 set
= isl_set_align_divs(set
);
9009 set
= isl_set_cow(set
);
9013 n_div
= set
->p
[0]->n_div
;
9014 dim
= isl_set_get_space(set
);
9015 dim
= isl_space_lift(dim
, n_div
);
9018 isl_space_free(set
->dim
);
9021 for (i
= 0; i
< set
->n
; ++i
) {
9022 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9033 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9036 struct isl_basic_map
*bmap
;
9043 set
= isl_set_align_divs(set
);
9048 dim
= isl_set_get_space(set
);
9049 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9051 return isl_map_identity(isl_space_map_from_set(dim
));
9054 n_div
= set
->p
[0]->n_div
;
9055 dim
= isl_space_map_from_set(dim
);
9056 n_param
= isl_space_dim(dim
, isl_dim_param
);
9057 n_set
= isl_space_dim(dim
, isl_dim_in
);
9058 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9059 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9060 for (i
= 0; i
< n_set
; ++i
)
9061 bmap
= var_equal(bmap
, i
);
9063 total
= n_param
+ n_set
+ n_set
+ n_div
;
9064 for (i
= 0; i
< n_div
; ++i
) {
9065 k
= isl_basic_map_alloc_inequality(bmap
);
9068 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9069 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9070 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9071 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9072 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9073 set
->p
[0]->div
[i
][0]);
9075 l
= isl_basic_map_alloc_inequality(bmap
);
9078 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9079 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9080 set
->p
[0]->div
[i
][0]);
9081 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9085 bmap
= isl_basic_map_simplify(bmap
);
9086 bmap
= isl_basic_map_finalize(bmap
);
9087 return isl_map_from_basic_map(bmap
);
9090 isl_basic_map_free(bmap
);
9094 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9102 dim
= isl_basic_set_total_dim(bset
);
9103 size
+= bset
->n_eq
* (1 + dim
);
9104 size
+= bset
->n_ineq
* (1 + dim
);
9105 size
+= bset
->n_div
* (2 + dim
);
9110 int isl_set_size(__isl_keep isl_set
*set
)
9118 for (i
= 0; i
< set
->n
; ++i
)
9119 size
+= isl_basic_set_size(set
->p
[i
]);
9124 /* Check if there is any lower bound (if lower == 0) and/or upper
9125 * bound (if upper == 0) on the specified dim.
9127 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9128 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9135 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9137 pos
+= isl_basic_map_offset(bmap
, type
);
9139 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9140 if (isl_int_is_zero(bmap
->div
[i
][0]))
9142 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9146 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9147 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9150 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9151 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9158 return lower
&& upper
;
9161 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9162 enum isl_dim_type type
, unsigned pos
)
9164 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9167 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9168 enum isl_dim_type type
, unsigned pos
)
9170 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9173 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9174 enum isl_dim_type type
, unsigned pos
)
9176 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9179 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9180 enum isl_dim_type type
, unsigned pos
)
9187 for (i
= 0; i
< map
->n
; ++i
) {
9189 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9190 if (bounded
< 0 || !bounded
)
9197 /* Return 1 if the specified dim is involved in both an upper bound
9198 * and a lower bound.
9200 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9201 enum isl_dim_type type
, unsigned pos
)
9203 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9206 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9208 static int has_any_bound(__isl_keep isl_map
*map
,
9209 enum isl_dim_type type
, unsigned pos
,
9210 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9211 enum isl_dim_type type
, unsigned pos
))
9218 for (i
= 0; i
< map
->n
; ++i
) {
9220 bounded
= fn(map
->p
[i
], type
, pos
);
9221 if (bounded
< 0 || bounded
)
9228 /* Return 1 if the specified dim is involved in any lower bound.
9230 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9231 enum isl_dim_type type
, unsigned pos
)
9233 return has_any_bound(set
, type
, pos
,
9234 &isl_basic_map_dim_has_lower_bound
);
9237 /* Return 1 if the specified dim is involved in any upper bound.
9239 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9240 enum isl_dim_type type
, unsigned pos
)
9242 return has_any_bound(set
, type
, pos
,
9243 &isl_basic_map_dim_has_upper_bound
);
9246 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9248 static int has_bound(__isl_keep isl_map
*map
,
9249 enum isl_dim_type type
, unsigned pos
,
9250 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9251 enum isl_dim_type type
, unsigned pos
))
9258 for (i
= 0; i
< map
->n
; ++i
) {
9260 bounded
= fn(map
->p
[i
], type
, pos
);
9261 if (bounded
< 0 || !bounded
)
9268 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9270 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9271 enum isl_dim_type type
, unsigned pos
)
9273 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9276 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9278 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9279 enum isl_dim_type type
, unsigned pos
)
9281 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9284 /* For each of the "n" variables starting at "first", determine
9285 * the sign of the variable and put the results in the first "n"
9286 * elements of the array "signs".
9288 * 1 means that the variable is non-negative
9289 * -1 means that the variable is non-positive
9290 * 0 means the variable attains both positive and negative values.
9292 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9293 unsigned first
, unsigned n
, int *signs
)
9295 isl_vec
*bound
= NULL
;
9296 struct isl_tab
*tab
= NULL
;
9297 struct isl_tab_undo
*snap
;
9300 if (!bset
|| !signs
)
9303 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9304 tab
= isl_tab_from_basic_set(bset
, 0);
9308 isl_seq_clr(bound
->el
, bound
->size
);
9309 isl_int_set_si(bound
->el
[0], -1);
9311 snap
= isl_tab_snap(tab
);
9312 for (i
= 0; i
< n
; ++i
) {
9315 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9316 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9319 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9320 if (isl_tab_rollback(tab
, snap
) < 0)
9328 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9329 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9332 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9333 if (isl_tab_rollback(tab
, snap
) < 0)
9336 signs
[i
] = empty
? -1 : 0;
9340 isl_vec_free(bound
);
9344 isl_vec_free(bound
);
9348 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9349 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9351 if (!bset
|| !signs
)
9353 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9356 first
+= pos(bset
->dim
, type
) - 1;
9357 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9360 /* Check if the given basic map is obviously single-valued.
9361 * In particular, for each output dimension, check that there is
9362 * an equality that defines the output dimension in terms of
9363 * earlier dimensions.
9365 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9375 total
= 1 + isl_basic_map_total_dim(bmap
);
9376 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9377 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9379 for (i
= 0; i
< n_out
; ++i
) {
9380 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9381 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9383 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9384 total
- (o_out
+ i
+ 1)) == -1)
9387 if (j
>= bmap
->n_eq
)
9394 /* Check if the given basic map is single-valued.
9399 * and check if the result is a subset of the identity mapping.
9401 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9404 isl_basic_map
*test
;
9408 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9412 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9413 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9415 space
= isl_basic_map_get_space(bmap
);
9416 space
= isl_space_map_from_set(isl_space_range(space
));
9417 id
= isl_basic_map_identity(space
);
9419 sv
= isl_basic_map_is_subset(test
, id
);
9421 isl_basic_map_free(test
);
9422 isl_basic_map_free(id
);
9427 /* Check if the given map is obviously single-valued.
9429 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9438 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9441 /* Check if the given map is single-valued.
9446 * and check if the result is a subset of the identity mapping.
9448 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9455 sv
= isl_map_plain_is_single_valued(map
);
9459 test
= isl_map_reverse(isl_map_copy(map
));
9460 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9462 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9463 id
= isl_map_identity(dim
);
9465 sv
= isl_map_is_subset(test
, id
);
9473 int isl_map_is_injective(__isl_keep isl_map
*map
)
9477 map
= isl_map_copy(map
);
9478 map
= isl_map_reverse(map
);
9479 in
= isl_map_is_single_valued(map
);
9485 /* Check if the given map is obviously injective.
9487 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9491 map
= isl_map_copy(map
);
9492 map
= isl_map_reverse(map
);
9493 in
= isl_map_plain_is_single_valued(map
);
9499 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9503 sv
= isl_map_is_single_valued(map
);
9507 return isl_map_is_injective(map
);
9510 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9512 return isl_map_is_single_valued((isl_map
*)set
);
9515 int isl_map_is_translation(__isl_keep isl_map
*map
)
9520 delta
= isl_map_deltas(isl_map_copy(map
));
9521 ok
= isl_set_is_singleton(delta
);
9522 isl_set_free(delta
);
9527 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9529 if (isl_seq_first_non_zero(p
, pos
) != -1)
9531 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9536 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9545 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9548 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9549 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9550 for (j
= 0; j
< nvar
; ++j
) {
9551 int lower
= 0, upper
= 0;
9552 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9553 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9555 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9561 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9562 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9564 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9566 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9571 if (!lower
|| !upper
)
9578 int isl_set_is_box(__isl_keep isl_set
*set
)
9585 return isl_basic_set_is_box(set
->p
[0]);
9588 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9593 return isl_space_is_wrapping(bset
->dim
);
9596 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9601 return isl_space_is_wrapping(set
->dim
);
9604 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9606 bmap
= isl_basic_map_cow(bmap
);
9610 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9614 bmap
= isl_basic_map_finalize(bmap
);
9616 return (isl_basic_set
*)bmap
;
9618 isl_basic_map_free(bmap
);
9622 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9626 map
= isl_map_cow(map
);
9630 for (i
= 0; i
< map
->n
; ++i
) {
9631 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9635 map
->dim
= isl_space_wrap(map
->dim
);
9639 return (isl_set
*)map
;
9645 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9647 bset
= isl_basic_set_cow(bset
);
9651 bset
->dim
= isl_space_unwrap(bset
->dim
);
9655 bset
= isl_basic_set_finalize(bset
);
9657 return (isl_basic_map
*)bset
;
9659 isl_basic_set_free(bset
);
9663 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9670 if (!isl_set_is_wrapping(set
))
9671 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9674 set
= isl_set_cow(set
);
9678 for (i
= 0; i
< set
->n
; ++i
) {
9679 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9684 set
->dim
= isl_space_unwrap(set
->dim
);
9688 return (isl_map
*)set
;
9694 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9695 enum isl_dim_type type
)
9700 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9703 bmap
= isl_basic_map_cow(bmap
);
9707 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9711 bmap
= isl_basic_map_finalize(bmap
);
9715 isl_basic_map_free(bmap
);
9719 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9720 enum isl_dim_type type
)
9727 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9730 map
= isl_map_cow(map
);
9734 for (i
= 0; i
< map
->n
; ++i
) {
9735 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9739 map
->dim
= isl_space_reset(map
->dim
, type
);
9749 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9754 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9757 bmap
= isl_basic_map_cow(bmap
);
9761 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9765 bmap
= isl_basic_map_finalize(bmap
);
9769 isl_basic_map_free(bmap
);
9773 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9775 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9778 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9779 __isl_take isl_basic_map
*bmap
)
9784 if (!bmap
->dim
->nested
[0])
9787 bmap
= isl_basic_map_cow(bmap
);
9791 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9795 bmap
= isl_basic_map_finalize(bmap
);
9799 isl_basic_map_free(bmap
);
9803 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9804 __isl_take isl_basic_map
*bmap
)
9809 if (!bmap
->dim
->nested
[1])
9812 bmap
= isl_basic_map_cow(bmap
);
9816 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9820 bmap
= isl_basic_map_finalize(bmap
);
9824 isl_basic_map_free(bmap
);
9828 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9835 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9838 map
= isl_map_cow(map
);
9842 for (i
= 0; i
< map
->n
; ++i
) {
9843 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9847 map
->dim
= isl_space_flatten(map
->dim
);
9857 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9859 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9862 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9864 isl_space
*dim
, *flat_dim
;
9867 dim
= isl_set_get_space(set
);
9868 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9869 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9870 map
= isl_map_intersect_domain(map
, set
);
9875 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9882 if (!map
->dim
->nested
[0])
9885 map
= isl_map_cow(map
);
9889 for (i
= 0; i
< map
->n
; ++i
) {
9890 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9894 map
->dim
= isl_space_flatten_domain(map
->dim
);
9904 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9911 if (!map
->dim
->nested
[1])
9914 map
= isl_map_cow(map
);
9918 for (i
= 0; i
< map
->n
; ++i
) {
9919 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9923 map
->dim
= isl_space_flatten_range(map
->dim
);
9933 /* Reorder the dimensions of "bmap" according to the given dim_map
9934 * and set the dimension specification to "dim".
9936 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9937 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9942 bmap
= isl_basic_map_cow(bmap
);
9943 if (!bmap
|| !dim
|| !dim_map
)
9946 flags
= bmap
->flags
;
9947 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9948 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9949 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9950 res
= isl_basic_map_alloc_space(dim
,
9951 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9952 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9955 res
= isl_basic_map_finalize(res
);
9959 isl_basic_map_free(bmap
);
9960 isl_space_free(dim
);
9964 /* Reorder the dimensions of "map" according to given reordering.
9966 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9967 __isl_take isl_reordering
*r
)
9970 struct isl_dim_map
*dim_map
;
9972 map
= isl_map_cow(map
);
9973 dim_map
= isl_dim_map_from_reordering(r
);
9974 if (!map
|| !r
|| !dim_map
)
9977 for (i
= 0; i
< map
->n
; ++i
) {
9978 struct isl_dim_map
*dim_map_i
;
9980 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9982 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9983 isl_space_copy(r
->dim
), dim_map_i
);
9989 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
9991 isl_reordering_free(r
);
9997 isl_reordering_free(r
);
10001 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10002 __isl_take isl_reordering
*r
)
10004 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10007 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10008 __isl_take isl_space
*model
)
10012 if (!map
|| !model
)
10015 ctx
= isl_space_get_ctx(model
);
10016 if (!isl_space_has_named_params(model
))
10017 isl_die(ctx
, isl_error_invalid
,
10018 "model has unnamed parameters", goto error
);
10019 if (!isl_space_has_named_params(map
->dim
))
10020 isl_die(ctx
, isl_error_invalid
,
10021 "relation has unnamed parameters", goto error
);
10022 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10023 isl_reordering
*exp
;
10025 model
= isl_space_drop_dims(model
, isl_dim_in
,
10026 0, isl_space_dim(model
, isl_dim_in
));
10027 model
= isl_space_drop_dims(model
, isl_dim_out
,
10028 0, isl_space_dim(model
, isl_dim_out
));
10029 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10030 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10031 map
= isl_map_realign(map
, exp
);
10034 isl_space_free(model
);
10037 isl_space_free(model
);
10042 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10043 __isl_take isl_space
*model
)
10045 return isl_map_align_params(set
, model
);
10048 /* Align the parameters of "bmap" to those of "model", introducing
10049 * additional parameters if needed.
10051 __isl_give isl_basic_map
*isl_basic_map_align_params(
10052 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10056 if (!bmap
|| !model
)
10059 ctx
= isl_space_get_ctx(model
);
10060 if (!isl_space_has_named_params(model
))
10061 isl_die(ctx
, isl_error_invalid
,
10062 "model has unnamed parameters", goto error
);
10063 if (!isl_space_has_named_params(bmap
->dim
))
10064 isl_die(ctx
, isl_error_invalid
,
10065 "relation has unnamed parameters", goto error
);
10066 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10067 isl_reordering
*exp
;
10068 struct isl_dim_map
*dim_map
;
10070 model
= isl_space_drop_dims(model
, isl_dim_in
,
10071 0, isl_space_dim(model
, isl_dim_in
));
10072 model
= isl_space_drop_dims(model
, isl_dim_out
,
10073 0, isl_space_dim(model
, isl_dim_out
));
10074 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10075 exp
= isl_reordering_extend_space(exp
,
10076 isl_basic_map_get_space(bmap
));
10077 dim_map
= isl_dim_map_from_reordering(exp
);
10078 bmap
= isl_basic_map_realign(bmap
,
10079 exp
? isl_space_copy(exp
->dim
) : NULL
,
10080 isl_dim_map_extend(dim_map
, bmap
));
10081 isl_reordering_free(exp
);
10085 isl_space_free(model
);
10088 isl_space_free(model
);
10089 isl_basic_map_free(bmap
);
10093 /* Align the parameters of "bset" to those of "model", introducing
10094 * additional parameters if needed.
10096 __isl_give isl_basic_set
*isl_basic_set_align_params(
10097 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10099 return isl_basic_map_align_params(bset
, model
);
10102 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10103 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10104 enum isl_dim_type c2
, enum isl_dim_type c3
,
10105 enum isl_dim_type c4
, enum isl_dim_type c5
)
10107 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10108 struct isl_mat
*mat
;
10114 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10115 isl_basic_map_total_dim(bmap
) + 1);
10118 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10119 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10120 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10121 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10122 isl_int_set(mat
->row
[i
][pos
],
10123 bmap
->eq
[i
][off
+ k
]);
10131 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10132 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10133 enum isl_dim_type c2
, enum isl_dim_type c3
,
10134 enum isl_dim_type c4
, enum isl_dim_type c5
)
10136 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10137 struct isl_mat
*mat
;
10143 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10144 isl_basic_map_total_dim(bmap
) + 1);
10147 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10148 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10149 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10150 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10151 isl_int_set(mat
->row
[i
][pos
],
10152 bmap
->ineq
[i
][off
+ k
]);
10160 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10161 __isl_take isl_space
*dim
,
10162 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10163 enum isl_dim_type c2
, enum isl_dim_type c3
,
10164 enum isl_dim_type c4
, enum isl_dim_type c5
)
10166 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10167 isl_basic_map
*bmap
;
10173 if (!dim
|| !eq
|| !ineq
)
10176 if (eq
->n_col
!= ineq
->n_col
)
10177 isl_die(dim
->ctx
, isl_error_invalid
,
10178 "equalities and inequalities matrices should have "
10179 "same number of columns", goto error
);
10181 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10183 if (eq
->n_col
< total
)
10184 isl_die(dim
->ctx
, isl_error_invalid
,
10185 "number of columns too small", goto error
);
10187 extra
= eq
->n_col
- total
;
10189 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10190 eq
->n_row
, ineq
->n_row
);
10193 for (i
= 0; i
< extra
; ++i
) {
10194 k
= isl_basic_map_alloc_div(bmap
);
10197 isl_int_set_si(bmap
->div
[k
][0], 0);
10199 for (i
= 0; i
< eq
->n_row
; ++i
) {
10200 l
= isl_basic_map_alloc_equality(bmap
);
10203 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10204 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10205 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10206 isl_int_set(bmap
->eq
[l
][off
+ k
],
10212 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10213 l
= isl_basic_map_alloc_inequality(bmap
);
10216 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10217 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10218 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10219 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10220 ineq
->row
[i
][pos
]);
10226 isl_space_free(dim
);
10228 isl_mat_free(ineq
);
10232 isl_space_free(dim
);
10234 isl_mat_free(ineq
);
10238 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10239 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10240 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10242 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10243 c1
, c2
, c3
, c4
, isl_dim_in
);
10246 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10247 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10248 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10250 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10251 c1
, c2
, c3
, c4
, isl_dim_in
);
10254 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10255 __isl_take isl_space
*dim
,
10256 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10257 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10259 return (isl_basic_set
*)
10260 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10261 c1
, c2
, c3
, c4
, isl_dim_in
);
10264 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10269 return isl_space_can_zip(bmap
->dim
);
10272 int isl_map_can_zip(__isl_keep isl_map
*map
)
10277 return isl_space_can_zip(map
->dim
);
10280 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10281 * (A -> C) -> (B -> D).
10283 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10292 if (!isl_basic_map_can_zip(bmap
))
10293 isl_die(bmap
->ctx
, isl_error_invalid
,
10294 "basic map cannot be zipped", goto error
);
10295 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10296 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10297 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10298 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10299 bmap
= isl_basic_map_cow(bmap
);
10300 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10303 bmap
->dim
= isl_space_zip(bmap
->dim
);
10308 isl_basic_map_free(bmap
);
10312 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10313 * (A -> C) -> (B -> D).
10315 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10322 if (!isl_map_can_zip(map
))
10323 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10326 map
= isl_map_cow(map
);
10330 for (i
= 0; i
< map
->n
; ++i
) {
10331 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10336 map
->dim
= isl_space_zip(map
->dim
);
10346 /* Can we apply isl_basic_map_curry to "bmap"?
10347 * That is, does it have a nested relation in its domain?
10349 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10354 return isl_space_can_curry(bmap
->dim
);
10357 /* Can we apply isl_map_curry to "map"?
10358 * That is, does it have a nested relation in its domain?
10360 int isl_map_can_curry(__isl_keep isl_map
*map
)
10365 return isl_space_can_curry(map
->dim
);
10368 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10371 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10377 if (!isl_basic_map_can_curry(bmap
))
10378 isl_die(bmap
->ctx
, isl_error_invalid
,
10379 "basic map cannot be curried", goto error
);
10380 bmap
->dim
= isl_space_curry(bmap
->dim
);
10385 isl_basic_map_free(bmap
);
10389 /* Given a map (A -> B) -> C, return the corresponding map
10392 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10399 if (!isl_map_can_curry(map
))
10400 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10403 map
= isl_map_cow(map
);
10407 for (i
= 0; i
< map
->n
; ++i
) {
10408 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10413 map
->dim
= isl_space_curry(map
->dim
);
10423 /* Can we apply isl_basic_map_uncurry to "bmap"?
10424 * That is, does it have a nested relation in its domain?
10426 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10431 return isl_space_can_uncurry(bmap
->dim
);
10434 /* Can we apply isl_map_uncurry to "map"?
10435 * That is, does it have a nested relation in its domain?
10437 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10442 return isl_space_can_uncurry(map
->dim
);
10445 /* Given a basic map A -> (B -> C), return the corresponding basic map
10448 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10454 if (!isl_basic_map_can_uncurry(bmap
))
10455 isl_die(bmap
->ctx
, isl_error_invalid
,
10456 "basic map cannot be uncurried",
10457 return isl_basic_map_free(bmap
));
10458 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10460 return isl_basic_map_free(bmap
);
10464 /* Given a map A -> (B -> C), return the corresponding map
10467 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10474 if (!isl_map_can_uncurry(map
))
10475 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10476 return isl_map_free(map
));
10478 map
= isl_map_cow(map
);
10482 for (i
= 0; i
< map
->n
; ++i
) {
10483 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10485 return isl_map_free(map
);
10488 map
->dim
= isl_space_uncurry(map
->dim
);
10490 return isl_map_free(map
);
10495 /* Construct a basic map mapping the domain of the affine expression
10496 * to a one-dimensional range prescribed by the affine expression.
10498 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10502 isl_local_space
*ls
;
10503 isl_basic_map
*bmap
;
10508 ls
= isl_aff_get_local_space(aff
);
10509 bmap
= isl_basic_map_from_local_space(ls
);
10510 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10511 k
= isl_basic_map_alloc_equality(bmap
);
10515 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10516 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10517 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10518 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10519 aff
->v
->size
- (pos
+ 1));
10522 bmap
= isl_basic_map_finalize(bmap
);
10526 isl_basic_map_free(bmap
);
10530 /* Construct a map mapping the domain of the affine expression
10531 * to a one-dimensional range prescribed by the affine expression.
10533 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10535 isl_basic_map
*bmap
;
10537 bmap
= isl_basic_map_from_aff(aff
);
10538 return isl_map_from_basic_map(bmap
);
10541 /* Construct a basic map mapping the domain the multi-affine expression
10542 * to its range, with each dimension in the range equated to the
10543 * corresponding affine expression.
10545 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10546 __isl_take isl_multi_aff
*maff
)
10550 isl_basic_map
*bmap
;
10555 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10556 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10557 "invalid space", return isl_multi_aff_free(maff
));
10559 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10560 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10562 for (i
= 0; i
< maff
->n
; ++i
) {
10564 isl_basic_map
*bmap_i
;
10566 aff
= isl_aff_copy(maff
->p
[i
]);
10567 bmap_i
= isl_basic_map_from_aff(aff
);
10569 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10572 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10574 isl_multi_aff_free(maff
);
10578 /* Construct a map mapping the domain the multi-affine expression
10579 * to its range, with each dimension in the range equated to the
10580 * corresponding affine expression.
10582 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10584 isl_basic_map
*bmap
;
10586 bmap
= isl_basic_map_from_multi_aff(maff
);
10587 return isl_map_from_basic_map(bmap
);
10590 /* Construct a basic map mapping a domain in the given space to
10591 * to an n-dimensional range, with n the number of elements in the list,
10592 * where each coordinate in the range is prescribed by the
10593 * corresponding affine expression.
10594 * The domains of all affine expressions in the list are assumed to match
10597 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10598 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10602 isl_basic_map
*bmap
;
10607 dim
= isl_space_from_domain(domain_dim
);
10608 bmap
= isl_basic_map_universe(dim
);
10610 for (i
= 0; i
< list
->n
; ++i
) {
10612 isl_basic_map
*bmap_i
;
10614 aff
= isl_aff_copy(list
->p
[i
]);
10615 bmap_i
= isl_basic_map_from_aff(aff
);
10617 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10620 isl_aff_list_free(list
);
10624 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10625 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10627 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10630 /* Construct a basic map where the given dimensions are equal to each other.
10632 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10633 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10635 isl_basic_map
*bmap
= NULL
;
10641 if (pos1
>= isl_space_dim(space
, type1
))
10642 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10643 "index out of bounds", goto error
);
10644 if (pos2
>= isl_space_dim(space
, type2
))
10645 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10646 "index out of bounds", goto error
);
10648 if (type1
== type2
&& pos1
== pos2
)
10649 return isl_basic_map_universe(space
);
10651 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10652 i
= isl_basic_map_alloc_equality(bmap
);
10655 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10656 pos1
+= isl_basic_map_offset(bmap
, type1
);
10657 pos2
+= isl_basic_map_offset(bmap
, type2
);
10658 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10659 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10660 bmap
= isl_basic_map_finalize(bmap
);
10661 isl_space_free(space
);
10664 isl_space_free(space
);
10665 isl_basic_map_free(bmap
);
10669 /* Add a constraint imposing that the given two dimensions are equal.
10671 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10672 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10676 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10678 bmap
= isl_basic_map_intersect(bmap
, eq
);
10683 /* Add a constraint imposing that the given two dimensions are equal.
10685 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10686 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10688 isl_basic_map
*bmap
;
10690 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10692 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10697 /* Add a constraint imposing that the given two dimensions have opposite values.
10699 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10700 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10702 isl_basic_map
*bmap
= NULL
;
10708 if (pos1
>= isl_map_dim(map
, type1
))
10709 isl_die(map
->ctx
, isl_error_invalid
,
10710 "index out of bounds", goto error
);
10711 if (pos2
>= isl_map_dim(map
, type2
))
10712 isl_die(map
->ctx
, isl_error_invalid
,
10713 "index out of bounds", goto error
);
10715 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10716 i
= isl_basic_map_alloc_equality(bmap
);
10719 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10720 pos1
+= isl_basic_map_offset(bmap
, type1
);
10721 pos2
+= isl_basic_map_offset(bmap
, type2
);
10722 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10723 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10724 bmap
= isl_basic_map_finalize(bmap
);
10726 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10730 isl_basic_map_free(bmap
);
10735 /* Add a constraint imposing that the value of the first dimension is
10736 * greater than or equal to that of the second.
10738 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10739 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10742 isl_local_space
*ls
;
10747 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10748 isl_die(bmap
->ctx
, isl_error_invalid
,
10749 "index out of bounds", return isl_basic_map_free(bmap
));
10750 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10751 isl_die(bmap
->ctx
, isl_error_invalid
,
10752 "index out of bounds", return isl_basic_map_free(bmap
));
10754 if (type1
== type2
&& pos1
== pos2
)
10757 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10758 c
= isl_inequality_alloc(ls
);
10759 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10760 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10761 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10766 /* Add a constraint imposing that the value of the first dimension is
10767 * greater than that of the second.
10769 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10770 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10772 isl_basic_map
*bmap
= NULL
;
10778 if (pos1
>= isl_map_dim(map
, type1
))
10779 isl_die(map
->ctx
, isl_error_invalid
,
10780 "index out of bounds", goto error
);
10781 if (pos2
>= isl_map_dim(map
, type2
))
10782 isl_die(map
->ctx
, isl_error_invalid
,
10783 "index out of bounds", goto error
);
10785 if (type1
== type2
&& pos1
== pos2
) {
10786 isl_space
*space
= isl_map_get_space(map
);
10788 return isl_map_empty(space
);
10791 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10792 i
= isl_basic_map_alloc_inequality(bmap
);
10795 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10796 pos1
+= isl_basic_map_offset(bmap
, type1
);
10797 pos2
+= isl_basic_map_offset(bmap
, type2
);
10798 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10799 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10800 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10801 bmap
= isl_basic_map_finalize(bmap
);
10803 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10807 isl_basic_map_free(bmap
);
10812 /* Add a constraint imposing that the value of the first dimension is
10813 * smaller than that of the second.
10815 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
10816 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10818 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
10821 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10825 isl_local_space
*ls
;
10830 if (!isl_basic_map_divs_known(bmap
))
10831 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10832 "some divs are unknown", return NULL
);
10834 ls
= isl_basic_map_get_local_space(bmap
);
10835 div
= isl_local_space_get_div(ls
, pos
);
10836 isl_local_space_free(ls
);
10841 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10844 return isl_basic_map_get_div(bset
, pos
);
10847 /* Plug in "subs" for dimension "type", "pos" of "bset".
10849 * Let i be the dimension to replace and let "subs" be of the form
10853 * Any integer division with a non-zero coefficient for i,
10855 * floor((a i + g)/m)
10859 * floor((a f + d g)/(m d))
10861 * Constraints of the form
10869 * We currently require that "subs" is an integral expression.
10870 * Handling rational expressions may require us to add stride constraints
10871 * as we do in isl_basic_set_preimage_multi_aff.
10873 __isl_give isl_basic_set
*isl_basic_set_substitute(
10874 __isl_take isl_basic_set
*bset
,
10875 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10881 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10884 bset
= isl_basic_set_cow(bset
);
10885 if (!bset
|| !subs
)
10888 ctx
= isl_basic_set_get_ctx(bset
);
10889 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10890 isl_die(ctx
, isl_error_invalid
,
10891 "spaces don't match", goto error
);
10892 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10893 isl_die(ctx
, isl_error_unsupported
,
10894 "cannot handle divs yet", goto error
);
10895 if (!isl_int_is_one(subs
->v
->el
[0]))
10896 isl_die(ctx
, isl_error_invalid
,
10897 "can only substitute integer expressions", goto error
);
10899 pos
+= isl_basic_set_offset(bset
, type
);
10903 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10904 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10906 isl_int_set(v
, bset
->eq
[i
][pos
]);
10907 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10908 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10909 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10912 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10913 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10915 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10916 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10917 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10918 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10921 for (i
= 0; i
< bset
->n_div
; ++i
) {
10922 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10924 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10925 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10926 isl_seq_combine(bset
->div
[i
] + 1,
10927 subs
->v
->el
[0], bset
->div
[i
] + 1,
10928 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10929 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10934 bset
= isl_basic_set_simplify(bset
);
10935 return isl_basic_set_finalize(bset
);
10937 isl_basic_set_free(bset
);
10941 /* Plug in "subs" for dimension "type", "pos" of "set".
10943 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10944 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10948 if (set
&& isl_set_plain_is_empty(set
))
10951 set
= isl_set_cow(set
);
10955 for (i
= set
->n
- 1; i
>= 0; --i
) {
10956 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10957 if (remove_if_empty(set
, i
) < 0)
10967 /* Check if the range of "ma" is compatible with "space".
10968 * Return -1 if anything is wrong.
10970 static int check_space_compatible_range_multi_aff(
10971 __isl_keep isl_space
*space
, __isl_keep isl_multi_aff
*ma
)
10974 isl_space
*ma_space
;
10976 ma_space
= isl_multi_aff_get_space(ma
);
10977 m
= isl_space_is_range_internal(space
, ma_space
);
10978 isl_space_free(ma_space
);
10980 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10981 "spaces don't match", return -1);
10985 /* Check if the range of "ma" is compatible with "bset".
10986 * Return -1 if anything is wrong.
10988 static int check_basic_set_compatible_range_multi_aff(
10989 __isl_keep isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
10991 return check_space_compatible_range_multi_aff(bset
->dim
, ma
);
10994 /* Copy the divs from "ma" to "bset", adding zeros for the coefficients
10995 * of the other divs in "bset".
10997 static int set_ma_divs(__isl_keep isl_basic_set
*bset
,
10998 __isl_keep isl_multi_aff
*ma
, int n_div
)
11001 isl_local_space
*ls
;
11006 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11010 for (i
= 0; i
< n_div
; ++i
) {
11011 isl_seq_cpy(bset
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
11012 isl_seq_clr(bset
->div
[i
] + ls
->div
->n_col
, bset
->n_div
- n_div
);
11013 if (isl_basic_set_add_div_constraints(bset
, i
) < 0)
11017 isl_local_space_free(ls
);
11020 isl_local_space_free(ls
);
11024 /* How many stride constraints does "ma" enforce?
11025 * That is, how many of the affine expressions have a denominator
11026 * different from one?
11028 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11033 for (i
= 0; i
< ma
->n
; ++i
)
11034 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11040 /* For each affine expression in ma of the form
11042 * x_i = (f_i y + h_i)/m_i
11044 * with m_i different from one, add a constraint to "bset"
11047 * f_i y + h_i = m_i alpha_i
11049 * with alpha_i an additional existentially quantified variable.
11051 static __isl_give isl_basic_set
*add_ma_strides(
11052 __isl_take isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11058 total
= isl_basic_set_total_dim(bset
);
11059 for (i
= 0; i
< ma
->n
; ++i
) {
11062 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11064 div
= isl_basic_set_alloc_div(bset
);
11065 k
= isl_basic_set_alloc_equality(bset
);
11066 if (div
< 0 || k
< 0)
11068 isl_int_set_si(bset
->div
[div
][0], 0);
11069 len
= ma
->p
[i
]->v
->size
;
11070 isl_seq_cpy(bset
->eq
[k
], ma
->p
[i
]->v
->el
+ 1, len
- 1);
11071 isl_seq_clr(bset
->eq
[k
] + len
- 1, 1 + total
- (len
- 1));
11072 isl_int_neg(bset
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11078 isl_basic_set_free(bset
);
11082 /* Compute the preimage of "bset" under the function represented by "ma".
11083 * In other words, plug in "ma" in "bset". The result is a basic set
11084 * that lives in the domain space of "ma".
11086 * If bset is represented by
11088 * A(p) + B x + C(divs) >= 0
11090 * and ma is represented by
11092 * x = D(p) + F(y) + G(divs')
11094 * then the result is
11096 * A(p) + B D(p) + B F(y) + B G(divs') + C(divs) >= 0
11098 * The divs in the input set are similarly adjusted.
11101 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
11105 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
11107 * If bset is not a rational set and if F(y) involves any denominators
11109 * x_i = (f_i y + h_i)/m_i
11111 * the additional constraints are added to ensure that we only
11112 * map back integer points. That is we enforce
11114 * f_i y + h_i = m_i alpha_i
11116 * with alpha_i an additional existentially quantified variable.
11118 * We first copy over the divs from "ma".
11119 * Then we add the modified constraints and divs from "bset".
11120 * Finally, we add the stride constraints, if needed.
11122 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11123 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11127 isl_basic_set
*res
= NULL
;
11128 int n_div_bset
, n_div_ma
;
11129 isl_int f
, c1
, c2
, g
;
11130 int rational
, strides
;
11137 ma
= isl_multi_aff_align_divs(ma
);
11140 if (check_basic_set_compatible_range_multi_aff(bset
, ma
) < 0)
11143 n_div_bset
= isl_basic_set_dim(bset
, isl_dim_div
);
11144 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11146 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
11147 rational
= isl_basic_set_is_rational(bset
);
11148 strides
= rational
? 0 : multi_aff_strides(ma
);
11149 res
= isl_basic_set_alloc_space(space
, n_div_ma
+ n_div_bset
+ strides
,
11150 bset
->n_eq
+ strides
, bset
->n_ineq
+ 2 * n_div_ma
);
11152 res
= isl_basic_set_set_rational(res
);
11154 for (i
= 0; i
< n_div_ma
+ n_div_bset
; ++i
)
11155 if (isl_basic_set_alloc_div(res
) < 0)
11158 if (set_ma_divs(res
, ma
, n_div_ma
) < 0)
11161 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11162 k
= isl_basic_set_alloc_equality(res
);
11165 isl_seq_preimage(res
->eq
[k
], bset
->eq
[i
], ma
, n_div_ma
,
11166 n_div_bset
, f
, c1
, c2
, g
, 0);
11169 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11170 k
= isl_basic_set_alloc_inequality(res
);
11173 isl_seq_preimage(res
->ineq
[k
], bset
->ineq
[i
], ma
, n_div_ma
,
11174 n_div_bset
, f
, c1
, c2
, g
, 0);
11177 for (i
= 0; i
< bset
->n_div
; ++i
) {
11178 if (isl_int_is_zero(bset
->div
[i
][0])) {
11179 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11182 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bset
->div
[i
],
11183 ma
, n_div_ma
, n_div_bset
, f
, c1
, c2
, g
, 1);
11187 res
= add_ma_strides(res
, ma
);
11193 isl_basic_set_free(bset
);
11194 isl_multi_aff_free(ma
);
11195 res
= isl_basic_set_simplify(res
);
11196 return isl_basic_set_finalize(res
);
11202 isl_basic_set_free(bset
);
11203 isl_multi_aff_free(ma
);
11204 isl_basic_set_free(res
);
11208 /* Check if the range of "ma" is compatible with "set".
11209 * Return -1 if anything is wrong.
11211 static int check_set_compatible_range_multi_aff(
11212 __isl_keep isl_set
*set
, __isl_keep isl_multi_aff
*ma
)
11214 return check_space_compatible_range_multi_aff(set
->dim
, ma
);
11217 /* Compute the preimage of "set" under the function represented by "ma".
11218 * In other words, plug in "ma" in "set. The result is a set
11219 * that lives in the domain space of "ma".
11221 static __isl_give isl_set
*set_preimage_multi_aff(__isl_take isl_set
*set
,
11222 __isl_take isl_multi_aff
*ma
)
11226 set
= isl_set_cow(set
);
11227 ma
= isl_multi_aff_align_divs(ma
);
11230 if (check_set_compatible_range_multi_aff(set
, ma
) < 0)
11233 for (i
= 0; i
< set
->n
; ++i
) {
11234 set
->p
[i
] = isl_basic_set_preimage_multi_aff(set
->p
[i
],
11235 isl_multi_aff_copy(ma
));
11240 isl_space_free(set
->dim
);
11241 set
->dim
= isl_multi_aff_get_domain_space(ma
);
11245 isl_multi_aff_free(ma
);
11247 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
11248 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
11251 isl_multi_aff_free(ma
);
11256 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11257 __isl_take isl_multi_aff
*ma
)
11262 if (isl_space_match(set
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11263 return set_preimage_multi_aff(set
, ma
);
11265 if (!isl_space_has_named_params(set
->dim
) ||
11266 !isl_space_has_named_params(ma
->space
))
11267 isl_die(set
->ctx
, isl_error_invalid
,
11268 "unaligned unnamed parameters", goto error
);
11269 set
= isl_set_align_params(set
, isl_multi_aff_get_space(ma
));
11270 ma
= isl_multi_aff_align_params(ma
, isl_set_get_space(set
));
11272 return set_preimage_multi_aff(set
, ma
);
11274 isl_multi_aff_free(ma
);
11275 return isl_set_free(set
);
11278 /* Compute the preimage of "set" under the function represented by "pma".
11279 * In other words, plug in "pma" in "set. The result is a set
11280 * that lives in the domain space of "pma".
11282 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11283 __isl_take isl_pw_multi_aff
*pma
)
11292 isl_pw_multi_aff_free(pma
);
11293 res
= isl_set_empty(isl_set_get_space(set
));
11298 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11299 isl_multi_aff_copy(pma
->p
[0].maff
));
11300 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11302 for (i
= 1; i
< pma
->n
; ++i
) {
11305 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11306 isl_multi_aff_copy(pma
->p
[i
].maff
));
11307 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11308 res
= isl_set_union(res
, res_i
);
11311 isl_pw_multi_aff_free(pma
);
11315 isl_pw_multi_aff_free(pma
);
11320 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11321 __isl_take isl_pw_multi_aff
*pma
)
11326 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11327 return set_preimage_pw_multi_aff(set
, pma
);
11329 if (!isl_space_has_named_params(set
->dim
) ||
11330 !isl_space_has_named_params(pma
->dim
))
11331 isl_die(set
->ctx
, isl_error_invalid
,
11332 "unaligned unnamed parameters", goto error
);
11333 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11334 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11336 return set_preimage_pw_multi_aff(set
, pma
);
11338 isl_pw_multi_aff_free(pma
);
11339 return isl_set_free(set
);