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
)
1626 nparam
= isl_basic_set_n_param(bset
);
1627 dim
= isl_basic_set_n_dim(bset
);
1628 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1630 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1632 isl_basic_set_free(bset
);
1636 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1642 total
= isl_basic_map_total_dim(bmap
);
1643 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1644 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1646 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1648 i
= isl_basic_map_alloc_equality(bmap
);
1652 isl_int_set_si(bmap
->eq
[i
][0], 1);
1653 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1654 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1655 isl_vec_free(bmap
->sample
);
1656 bmap
->sample
= NULL
;
1657 return isl_basic_map_finalize(bmap
);
1659 isl_basic_map_free(bmap
);
1663 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1665 return (struct isl_basic_set
*)
1666 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1669 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1672 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1673 isl_int
*t
= bmap
->div
[a
];
1674 bmap
->div
[a
] = bmap
->div
[b
];
1677 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1678 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1680 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1681 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1683 for (i
= 0; i
< bmap
->n_div
; ++i
)
1684 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1685 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1688 /* Eliminate the specified n dimensions starting at first from the
1689 * constraints, without removing the dimensions from the space.
1690 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1692 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1693 enum isl_dim_type type
, unsigned first
, unsigned n
)
1702 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1703 isl_die(map
->ctx
, isl_error_invalid
,
1704 "index out of bounds", goto error
);
1706 map
= isl_map_cow(map
);
1710 for (i
= 0; i
< map
->n
; ++i
) {
1711 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1721 /* Eliminate the specified n dimensions starting at first from the
1722 * constraints, without removing the dimensions from the space.
1723 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1725 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1726 enum isl_dim_type type
, unsigned first
, unsigned n
)
1728 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1731 /* Eliminate the specified n dimensions starting at first from the
1732 * constraints, without removing the dimensions from the space.
1733 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1735 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1736 unsigned first
, unsigned n
)
1738 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1741 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1742 __isl_take isl_basic_map
*bmap
)
1746 bmap
= isl_basic_map_eliminate_vars(bmap
,
1747 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1751 return isl_basic_map_finalize(bmap
);
1754 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1755 __isl_take isl_basic_set
*bset
)
1757 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1758 (struct isl_basic_map
*)bset
);
1761 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1770 map
= isl_map_cow(map
);
1774 for (i
= 0; i
< map
->n
; ++i
) {
1775 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1785 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1787 return isl_map_remove_divs(set
);
1790 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1791 enum isl_dim_type type
, unsigned first
, unsigned n
)
1795 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1797 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1799 bmap
= isl_basic_map_eliminate_vars(bmap
,
1800 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1803 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1805 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1808 isl_basic_map_free(bmap
);
1812 /* Return true if the definition of the given div (recursively) involves
1813 * any of the given variables.
1815 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1816 unsigned first
, unsigned n
)
1819 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1821 if (isl_int_is_zero(bmap
->div
[div
][0]))
1823 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1826 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1827 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1829 if (div_involves_vars(bmap
, i
, first
, n
))
1836 /* Try and add a lower and/or upper bound on "div" to "bmap"
1837 * based on inequality "i".
1838 * "total" is the total number of variables (excluding the divs).
1839 * "v" is a temporary object that can be used during the calculations.
1840 * If "lb" is set, then a lower bound should be constructed.
1841 * If "ub" is set, then an upper bound should be constructed.
1843 * The calling function has already checked that the inequality does not
1844 * reference "div", but we still need to check that the inequality is
1845 * of the right form. We'll consider the case where we want to construct
1846 * a lower bound. The construction of upper bounds is similar.
1848 * Let "div" be of the form
1850 * q = floor((a + f(x))/d)
1852 * We essentially check if constraint "i" is of the form
1856 * so that we can use it to derive a lower bound on "div".
1857 * However, we allow a slightly more general form
1861 * with the condition that the coefficients of g(x) - f(x) are all
1863 * Rewriting this constraint as
1867 * adding a + f(x) to both sides and dividing by d, we obtain
1869 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1871 * Taking the floor on both sides, we obtain
1873 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1877 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1879 * In the case of an upper bound, we construct the constraint
1881 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1884 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1885 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1886 unsigned total
, isl_int v
, int lb
, int ub
)
1890 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1892 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1893 bmap
->div
[div
][1 + 1 + j
]);
1894 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1897 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1898 bmap
->div
[div
][1 + 1 + j
]);
1899 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1905 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1907 int k
= isl_basic_map_alloc_inequality(bmap
);
1910 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1911 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1912 bmap
->div
[div
][1 + j
]);
1913 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1914 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1916 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1919 int k
= isl_basic_map_alloc_inequality(bmap
);
1922 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1923 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1924 bmap
->div
[div
][1 + j
]);
1925 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1926 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1928 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1933 isl_basic_map_free(bmap
);
1937 /* This function is called right before "div" is eliminated from "bmap"
1938 * using Fourier-Motzkin.
1939 * Look through the constraints of "bmap" for constraints on the argument
1940 * of the integer division and use them to construct constraints on the
1941 * integer division itself. These constraints can then be combined
1942 * during the Fourier-Motzkin elimination.
1943 * Note that it is only useful to introduce lower bounds on "div"
1944 * if "bmap" already contains upper bounds on "div" as the newly
1945 * introduce lower bounds can then be combined with the pre-existing
1946 * upper bounds. Similarly for upper bounds.
1947 * We therefore first check if "bmap" contains any lower and/or upper bounds
1950 * It is interesting to note that the introduction of these constraints
1951 * can indeed lead to more accurate results, even when compared to
1952 * deriving constraints on the argument of "div" from constraints on "div".
1953 * Consider, for example, the set
1955 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1957 * The second constraint can be rewritten as
1959 * 2 * [(-i-2j+3)/4] + k >= 0
1961 * from which we can derive
1963 * -i - 2j + 3 >= -2k
1969 * Combined with the first constraint, we obtain
1971 * -3 <= 3 + 2k or k >= -3
1973 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1974 * the first constraint, we obtain
1976 * [(i + 2j)/4] >= [-3/4] = -1
1978 * Combining this constraint with the second constraint, we obtain
1982 static __isl_give isl_basic_map
*insert_bounds_on_div(
1983 __isl_take isl_basic_map
*bmap
, int div
)
1986 int check_lb
, check_ub
;
1993 if (isl_int_is_zero(bmap
->div
[div
][0]))
1996 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2000 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2001 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2008 if (!check_lb
&& !check_ub
)
2013 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2014 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2017 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2018 check_lb
, check_ub
);
2026 /* Remove all divs (recursively) involving any of the given dimensions
2027 * in their definitions.
2029 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2030 __isl_take isl_basic_map
*bmap
,
2031 enum isl_dim_type type
, unsigned first
, unsigned n
)
2037 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2039 first
+= isl_basic_map_offset(bmap
, type
);
2041 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2042 if (!div_involves_vars(bmap
, i
, first
, n
))
2044 bmap
= insert_bounds_on_div(bmap
, i
);
2045 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2053 isl_basic_map_free(bmap
);
2057 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2058 __isl_take isl_basic_set
*bset
,
2059 enum isl_dim_type type
, unsigned first
, unsigned n
)
2061 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2064 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2065 enum isl_dim_type type
, unsigned first
, unsigned n
)
2074 map
= isl_map_cow(map
);
2078 for (i
= 0; i
< map
->n
; ++i
) {
2079 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2090 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2091 enum isl_dim_type type
, unsigned first
, unsigned n
)
2093 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2097 /* Does the desciption of "bmap" depend on the specified dimensions?
2098 * We also check whether the dimensions appear in any of the div definitions.
2099 * In principle there is no need for this check. If the dimensions appear
2100 * in a div definition, they also appear in the defining constraints of that
2103 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2104 enum isl_dim_type type
, unsigned first
, unsigned n
)
2111 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2112 isl_die(bmap
->ctx
, isl_error_invalid
,
2113 "index out of bounds", return -1);
2115 first
+= isl_basic_map_offset(bmap
, type
);
2116 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2117 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2119 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2120 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2122 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2123 if (isl_int_is_zero(bmap
->div
[i
][0]))
2125 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2132 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2133 enum isl_dim_type type
, unsigned first
, unsigned n
)
2140 if (first
+ n
> isl_map_dim(map
, type
))
2141 isl_die(map
->ctx
, isl_error_invalid
,
2142 "index out of bounds", return -1);
2144 for (i
= 0; i
< map
->n
; ++i
) {
2145 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2147 if (involves
< 0 || involves
)
2154 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2155 enum isl_dim_type type
, unsigned first
, unsigned n
)
2157 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2160 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2161 enum isl_dim_type type
, unsigned first
, unsigned n
)
2163 return isl_map_involves_dims(set
, type
, first
, n
);
2166 /* Return true if the definition of the given div is unknown or depends
2169 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2172 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2174 if (isl_int_is_zero(bmap
->div
[div
][0]))
2177 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2178 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2180 if (div_is_unknown(bmap
, i
))
2187 /* Remove all divs that are unknown or defined in terms of unknown divs.
2189 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2190 __isl_take isl_basic_map
*bmap
)
2197 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2198 if (!div_is_unknown(bmap
, i
))
2200 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2209 /* Remove all divs that are unknown or defined in terms of unknown divs.
2211 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2212 __isl_take isl_basic_set
*bset
)
2214 return isl_basic_map_remove_unknown_divs(bset
);
2217 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2226 map
= isl_map_cow(map
);
2230 for (i
= 0; i
< map
->n
; ++i
) {
2231 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2241 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2243 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2246 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2247 __isl_take isl_basic_set
*bset
,
2248 enum isl_dim_type type
, unsigned first
, unsigned n
)
2250 return (isl_basic_set
*)
2251 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2254 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2255 enum isl_dim_type type
, unsigned first
, unsigned n
)
2262 map
= isl_map_cow(map
);
2265 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2267 for (i
= 0; i
< map
->n
; ++i
) {
2268 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2269 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2273 map
= isl_map_drop(map
, type
, first
, n
);
2280 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2281 enum isl_dim_type type
, unsigned first
, unsigned n
)
2283 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2286 /* Project out n inputs starting at first using Fourier-Motzkin */
2287 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2288 unsigned first
, unsigned n
)
2290 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2293 static void dump_term(struct isl_basic_map
*bmap
,
2294 isl_int c
, int pos
, FILE *out
)
2297 unsigned in
= isl_basic_map_n_in(bmap
);
2298 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2299 unsigned nparam
= isl_basic_map_n_param(bmap
);
2301 isl_int_print(out
, c
, 0);
2303 if (!isl_int_is_one(c
))
2304 isl_int_print(out
, c
, 0);
2305 if (pos
< 1 + nparam
) {
2306 name
= isl_space_get_dim_name(bmap
->dim
,
2307 isl_dim_param
, pos
- 1);
2309 fprintf(out
, "%s", name
);
2311 fprintf(out
, "p%d", pos
- 1);
2312 } else if (pos
< 1 + nparam
+ in
)
2313 fprintf(out
, "i%d", pos
- 1 - nparam
);
2314 else if (pos
< 1 + nparam
+ dim
)
2315 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2317 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2321 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2322 int sign
, FILE *out
)
2326 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2330 for (i
= 0, first
= 1; i
< len
; ++i
) {
2331 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2334 fprintf(out
, " + ");
2336 isl_int_abs(v
, c
[i
]);
2337 dump_term(bmap
, v
, i
, out
);
2344 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2345 const char *op
, FILE *out
, int indent
)
2349 fprintf(out
, "%*s", indent
, "");
2351 dump_constraint_sign(bmap
, c
, 1, out
);
2352 fprintf(out
, " %s ", op
);
2353 dump_constraint_sign(bmap
, c
, -1, out
);
2357 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2358 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2360 fprintf(out
, "%*s", indent
, "");
2361 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2366 static void dump_constraints(struct isl_basic_map
*bmap
,
2367 isl_int
**c
, unsigned n
,
2368 const char *op
, FILE *out
, int indent
)
2372 for (i
= 0; i
< n
; ++i
)
2373 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2376 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2380 unsigned total
= isl_basic_map_total_dim(bmap
);
2382 for (j
= 0; j
< 1 + total
; ++j
) {
2383 if (isl_int_is_zero(exp
[j
]))
2385 if (!first
&& isl_int_is_pos(exp
[j
]))
2387 dump_term(bmap
, exp
[j
], j
, out
);
2392 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2396 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2397 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2399 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2400 fprintf(out
, "%*s", indent
, "");
2401 fprintf(out
, "e%d = [(", i
);
2402 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2404 isl_int_print(out
, bmap
->div
[i
][0], 0);
2405 fprintf(out
, "]\n");
2409 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2410 FILE *out
, int indent
)
2413 fprintf(out
, "null basic set\n");
2417 fprintf(out
, "%*s", indent
, "");
2418 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2419 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2420 bset
->extra
, bset
->flags
);
2421 dump((struct isl_basic_map
*)bset
, out
, indent
);
2424 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2425 FILE *out
, int indent
)
2428 fprintf(out
, "null basic map\n");
2432 fprintf(out
, "%*s", indent
, "");
2433 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2434 "flags: %x, n_name: %d\n",
2436 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2437 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2438 dump(bmap
, out
, indent
);
2441 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2446 total
= isl_basic_map_total_dim(bmap
);
2447 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2448 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2449 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2450 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2454 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2457 struct isl_set
*set
;
2461 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2462 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2463 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2464 sizeof(struct isl_set
) +
2465 (n
- 1) * sizeof(struct isl_basic_set
*));
2469 set
->ctx
= dim
->ctx
;
2470 isl_ctx_ref(set
->ctx
);
2478 isl_space_free(dim
);
2482 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2483 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2485 struct isl_set
*set
;
2488 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2492 set
= isl_set_alloc_space(dims
, n
, flags
);
2496 /* Make sure "map" has room for at least "n" more basic maps.
2498 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2501 struct isl_map
*grown
= NULL
;
2505 isl_assert(map
->ctx
, n
>= 0, goto error
);
2506 if (map
->n
+ n
<= map
->size
)
2508 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2511 for (i
= 0; i
< map
->n
; ++i
) {
2512 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2520 isl_map_free(grown
);
2525 /* Make sure "set" has room for at least "n" more basic sets.
2527 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2529 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2532 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2535 struct isl_set
*dup
;
2540 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2543 for (i
= 0; i
< set
->n
; ++i
)
2544 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2548 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2550 return isl_map_from_basic_map(bset
);
2553 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2555 struct isl_map
*map
;
2560 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2561 return isl_map_add_basic_map(map
, bmap
);
2564 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2565 __isl_take isl_basic_set
*bset
)
2567 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2568 (struct isl_basic_map
*)bset
);
2571 void *isl_set_free(__isl_take isl_set
*set
)
2581 isl_ctx_deref(set
->ctx
);
2582 for (i
= 0; i
< set
->n
; ++i
)
2583 isl_basic_set_free(set
->p
[i
]);
2584 isl_space_free(set
->dim
);
2590 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2595 fprintf(out
, "null set\n");
2599 fprintf(out
, "%*s", indent
, "");
2600 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2601 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2603 for (i
= 0; i
< set
->n
; ++i
) {
2604 fprintf(out
, "%*s", indent
, "");
2605 fprintf(out
, "basic set %d:\n", i
);
2606 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2610 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2615 fprintf(out
, "null map\n");
2619 fprintf(out
, "%*s", indent
, "");
2620 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2621 "flags: %x, n_name: %d\n",
2622 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2623 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2624 for (i
= 0; i
< map
->n
; ++i
) {
2625 fprintf(out
, "%*s", indent
, "");
2626 fprintf(out
, "basic map %d:\n", i
);
2627 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2631 struct isl_basic_map
*isl_basic_map_intersect_domain(
2632 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2634 struct isl_basic_map
*bmap_domain
;
2639 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2640 bset
->dim
, isl_dim_param
), goto error
);
2642 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2643 isl_assert(bset
->ctx
,
2644 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2646 bmap
= isl_basic_map_cow(bmap
);
2649 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2650 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2651 bmap_domain
= isl_basic_map_from_domain(bset
);
2652 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2654 bmap
= isl_basic_map_simplify(bmap
);
2655 return isl_basic_map_finalize(bmap
);
2657 isl_basic_map_free(bmap
);
2658 isl_basic_set_free(bset
);
2662 struct isl_basic_map
*isl_basic_map_intersect_range(
2663 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2665 struct isl_basic_map
*bmap_range
;
2670 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2671 bset
->dim
, isl_dim_param
), goto error
);
2673 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2674 isl_assert(bset
->ctx
,
2675 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2677 if (isl_basic_set_is_universe(bset
)) {
2678 isl_basic_set_free(bset
);
2682 bmap
= isl_basic_map_cow(bmap
);
2685 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2686 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2687 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2688 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2690 bmap
= isl_basic_map_simplify(bmap
);
2691 return isl_basic_map_finalize(bmap
);
2693 isl_basic_map_free(bmap
);
2694 isl_basic_set_free(bset
);
2698 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2704 total
= 1 + isl_basic_map_total_dim(bmap
);
2705 if (total
!= vec
->size
)
2710 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2711 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2712 if (!isl_int_is_zero(s
)) {
2718 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2719 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2720 if (isl_int_is_neg(s
)) {
2731 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2733 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2736 struct isl_basic_map
*isl_basic_map_intersect(
2737 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2739 struct isl_vec
*sample
= NULL
;
2741 if (!bmap1
|| !bmap2
)
2744 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2745 bmap2
->dim
, isl_dim_param
), goto error
);
2746 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2747 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2748 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2749 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2750 return isl_basic_map_intersect(bmap2
, bmap1
);
2752 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2753 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2754 isl_assert(bmap1
->ctx
,
2755 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2757 if (bmap1
->sample
&&
2758 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2759 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2760 sample
= isl_vec_copy(bmap1
->sample
);
2761 else if (bmap2
->sample
&&
2762 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2763 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2764 sample
= isl_vec_copy(bmap2
->sample
);
2766 bmap1
= isl_basic_map_cow(bmap1
);
2769 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2770 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2771 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2774 isl_vec_free(sample
);
2776 isl_vec_free(bmap1
->sample
);
2777 bmap1
->sample
= sample
;
2780 bmap1
= isl_basic_map_simplify(bmap1
);
2781 return isl_basic_map_finalize(bmap1
);
2784 isl_vec_free(sample
);
2785 isl_basic_map_free(bmap1
);
2786 isl_basic_map_free(bmap2
);
2790 struct isl_basic_set
*isl_basic_set_intersect(
2791 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2793 return (struct isl_basic_set
*)
2794 isl_basic_map_intersect(
2795 (struct isl_basic_map
*)bset1
,
2796 (struct isl_basic_map
*)bset2
);
2799 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2800 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2802 return isl_basic_set_intersect(bset1
, bset2
);
2805 /* Special case of isl_map_intersect, where both map1 and map2
2806 * are convex, without any divs and such that either map1 or map2
2807 * contains a single constraint. This constraint is then simply
2808 * added to the other map.
2810 static __isl_give isl_map
*map_intersect_add_constraint(
2811 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2813 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2814 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2815 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2816 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2818 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2819 return isl_map_intersect(map2
, map1
);
2821 isl_assert(map2
->ctx
,
2822 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2824 map1
= isl_map_cow(map1
);
2827 if (isl_map_plain_is_empty(map1
)) {
2831 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2832 if (map2
->p
[0]->n_eq
== 1)
2833 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2835 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2836 map2
->p
[0]->ineq
[0]);
2838 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2839 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2843 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2844 isl_basic_map_free(map1
->p
[0]);
2857 /* map2 may be either a parameter domain or a map living in the same
2860 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2861 __isl_take isl_map
*map2
)
2870 if ((isl_map_plain_is_empty(map1
) ||
2871 isl_map_plain_is_universe(map2
)) &&
2872 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2876 if ((isl_map_plain_is_empty(map2
) ||
2877 isl_map_plain_is_universe(map1
)) &&
2878 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2883 if (map1
->n
== 1 && map2
->n
== 1 &&
2884 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2885 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2886 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2887 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2888 return map_intersect_add_constraint(map1
, map2
);
2890 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2891 isl_space_dim(map2
->dim
, isl_dim_param
))
2892 isl_assert(map1
->ctx
,
2893 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2895 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2896 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2897 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2899 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2900 map1
->n
* map2
->n
, flags
);
2903 for (i
= 0; i
< map1
->n
; ++i
)
2904 for (j
= 0; j
< map2
->n
; ++j
) {
2905 struct isl_basic_map
*part
;
2906 part
= isl_basic_map_intersect(
2907 isl_basic_map_copy(map1
->p
[i
]),
2908 isl_basic_map_copy(map2
->p
[j
]));
2909 if (isl_basic_map_is_empty(part
) < 0)
2910 part
= isl_basic_map_free(part
);
2911 result
= isl_map_add_basic_map(result
, part
);
2924 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2925 __isl_take isl_map
*map2
)
2929 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2930 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2931 "spaces don't match", goto error
);
2932 return map_intersect_internal(map1
, map2
);
2939 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2940 __isl_take isl_map
*map2
)
2942 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2945 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2947 return (struct isl_set
*)
2948 isl_map_intersect((struct isl_map
*)set1
,
2949 (struct isl_map
*)set2
);
2952 /* map_intersect_internal accepts intersections
2953 * with parameter domains, so we can just call that function.
2955 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2956 __isl_take isl_set
*params
)
2958 return map_intersect_internal(map
, params
);
2961 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2962 __isl_take isl_map
*map2
)
2964 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2967 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2968 __isl_take isl_set
*params
)
2970 return isl_map_intersect_params(set
, params
);
2973 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2976 struct isl_basic_set
*bset
;
2981 bmap
= isl_basic_map_cow(bmap
);
2984 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2985 in
= isl_basic_map_n_in(bmap
);
2986 bset
= isl_basic_set_from_basic_map(bmap
);
2987 bset
= isl_basic_set_swap_vars(bset
, in
);
2988 return isl_basic_map_from_basic_set(bset
, dim
);
2991 static __isl_give isl_basic_map
*basic_map_space_reset(
2992 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2998 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3001 space
= isl_basic_map_get_space(bmap
);
3002 space
= isl_space_reset(space
, type
);
3003 bmap
= isl_basic_map_reset_space(bmap
, space
);
3007 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3008 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3009 unsigned pos
, unsigned n
)
3012 struct isl_basic_map
*res
;
3013 struct isl_dim_map
*dim_map
;
3014 unsigned total
, off
;
3015 enum isl_dim_type t
;
3018 return basic_map_space_reset(bmap
, type
);
3023 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3025 total
= isl_basic_map_total_dim(bmap
) + n
;
3026 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3028 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3030 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3032 unsigned size
= isl_basic_map_dim(bmap
, t
);
3033 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3035 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3036 pos
, size
- pos
, off
+ pos
+ n
);
3038 off
+= isl_space_dim(res_dim
, t
);
3040 isl_dim_map_div(dim_map
, bmap
, off
);
3042 res
= isl_basic_map_alloc_space(res_dim
,
3043 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3044 if (isl_basic_map_is_rational(bmap
))
3045 res
= isl_basic_map_set_rational(res
);
3046 if (isl_basic_map_plain_is_empty(bmap
)) {
3047 isl_basic_map_free(bmap
);
3048 return isl_basic_map_set_to_empty(res
);
3050 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3051 return isl_basic_map_finalize(res
);
3054 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3055 __isl_take isl_basic_set
*bset
,
3056 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3058 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3061 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3062 enum isl_dim_type type
, unsigned n
)
3066 return isl_basic_map_insert_dims(bmap
, type
,
3067 isl_basic_map_dim(bmap
, type
), n
);
3070 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3071 enum isl_dim_type type
, unsigned n
)
3075 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3076 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3078 isl_basic_set_free(bset
);
3082 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3083 enum isl_dim_type type
)
3087 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3090 space
= isl_map_get_space(map
);
3091 space
= isl_space_reset(space
, type
);
3092 map
= isl_map_reset_space(map
, space
);
3096 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3097 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3102 return map_space_reset(map
, type
);
3104 map
= isl_map_cow(map
);
3108 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3112 for (i
= 0; i
< map
->n
; ++i
) {
3113 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3124 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3125 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3127 return isl_map_insert_dims(set
, type
, pos
, n
);
3130 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3131 enum isl_dim_type type
, unsigned n
)
3135 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3138 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3139 enum isl_dim_type type
, unsigned n
)
3143 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3144 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3150 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3151 __isl_take isl_basic_map
*bmap
,
3152 enum isl_dim_type dst_type
, unsigned dst_pos
,
3153 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3155 struct isl_dim_map
*dim_map
;
3156 struct isl_basic_map
*res
;
3157 enum isl_dim_type t
;
3158 unsigned total
, off
;
3165 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3168 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3171 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3173 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3174 pos(bmap
->dim
, src_type
) + src_pos
+
3175 ((src_type
< dst_type
) ? n
: 0)) {
3176 bmap
= isl_basic_map_cow(bmap
);
3180 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3181 src_type
, src_pos
, n
);
3185 bmap
= isl_basic_map_finalize(bmap
);
3190 total
= isl_basic_map_total_dim(bmap
);
3191 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3194 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3195 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3196 if (t
== dst_type
) {
3197 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3200 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3203 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3204 dst_pos
, size
- dst_pos
, off
);
3205 off
+= size
- dst_pos
;
3206 } else if (t
== src_type
) {
3207 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3210 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3211 src_pos
+ n
, size
- src_pos
- n
, off
);
3212 off
+= size
- src_pos
- n
;
3214 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3218 isl_dim_map_div(dim_map
, bmap
, off
);
3220 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3221 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3222 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3226 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3227 src_type
, src_pos
, n
);
3231 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3232 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3233 bmap
= isl_basic_map_finalize(bmap
);
3237 isl_basic_map_free(bmap
);
3241 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3242 enum isl_dim_type dst_type
, unsigned dst_pos
,
3243 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3245 return (isl_basic_set
*)isl_basic_map_move_dims(
3246 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3249 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3250 enum isl_dim_type dst_type
, unsigned dst_pos
,
3251 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3255 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3256 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3257 src_type
, src_pos
, n
);
3263 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3264 enum isl_dim_type dst_type
, unsigned dst_pos
,
3265 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3274 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3277 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3280 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3282 map
= isl_map_cow(map
);
3286 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3290 for (i
= 0; i
< map
->n
; ++i
) {
3291 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3293 src_type
, src_pos
, n
);
3304 /* Move the specified dimensions to the last columns right before
3305 * the divs. Don't change the dimension specification of bmap.
3306 * That's the responsibility of the caller.
3308 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3309 enum isl_dim_type type
, unsigned first
, unsigned n
)
3311 struct isl_dim_map
*dim_map
;
3312 struct isl_basic_map
*res
;
3313 enum isl_dim_type t
;
3314 unsigned total
, off
;
3318 if (pos(bmap
->dim
, type
) + first
+ n
==
3319 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3322 total
= isl_basic_map_total_dim(bmap
);
3323 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3326 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3327 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3329 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3332 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3333 first
, n
, total
- bmap
->n_div
- n
);
3334 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3335 first
+ n
, size
- (first
+ n
), off
);
3336 off
+= size
- (first
+ n
);
3338 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3342 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3344 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3345 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3346 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3350 /* Turn the n dimensions of type type, starting at first
3351 * into existentially quantified variables.
3353 __isl_give isl_basic_map
*isl_basic_map_project_out(
3354 __isl_take isl_basic_map
*bmap
,
3355 enum isl_dim_type type
, unsigned first
, unsigned n
)
3363 return basic_map_space_reset(bmap
, type
);
3368 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3369 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3371 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3374 bmap
= move_last(bmap
, type
, first
, n
);
3375 bmap
= isl_basic_map_cow(bmap
);
3379 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3380 old
= bmap
->block2
.data
;
3381 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3382 (bmap
->extra
+ n
) * (1 + row_size
));
3383 if (!bmap
->block2
.data
)
3385 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3388 for (i
= 0; i
< n
; ++i
) {
3389 new_div
[i
] = bmap
->block2
.data
+
3390 (bmap
->extra
+ i
) * (1 + row_size
);
3391 isl_seq_clr(new_div
[i
], 1 + row_size
);
3393 for (i
= 0; i
< bmap
->extra
; ++i
)
3394 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3396 bmap
->div
= new_div
;
3400 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3403 bmap
= isl_basic_map_simplify(bmap
);
3404 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3405 return isl_basic_map_finalize(bmap
);
3407 isl_basic_map_free(bmap
);
3411 /* Turn the n dimensions of type type, starting at first
3412 * into existentially quantified variables.
3414 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3415 enum isl_dim_type type
, unsigned first
, unsigned n
)
3417 return (isl_basic_set
*)isl_basic_map_project_out(
3418 (isl_basic_map
*)bset
, type
, first
, n
);
3421 /* Turn the n dimensions of type type, starting at first
3422 * into existentially quantified variables.
3424 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3425 enum isl_dim_type type
, unsigned first
, unsigned n
)
3433 return map_space_reset(map
, type
);
3435 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3437 map
= isl_map_cow(map
);
3441 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3445 for (i
= 0; i
< map
->n
; ++i
) {
3446 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3457 /* Turn the n dimensions of type type, starting at first
3458 * into existentially quantified variables.
3460 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3461 enum isl_dim_type type
, unsigned first
, unsigned n
)
3463 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3466 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3470 for (i
= 0; i
< n
; ++i
) {
3471 j
= isl_basic_map_alloc_div(bmap
);
3474 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3478 isl_basic_map_free(bmap
);
3482 struct isl_basic_map
*isl_basic_map_apply_range(
3483 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3485 isl_space
*dim_result
= NULL
;
3486 struct isl_basic_map
*bmap
;
3487 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3488 struct isl_dim_map
*dim_map1
, *dim_map2
;
3490 if (!bmap1
|| !bmap2
)
3493 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3494 isl_space_copy(bmap2
->dim
));
3496 n_in
= isl_basic_map_n_in(bmap1
);
3497 n_out
= isl_basic_map_n_out(bmap2
);
3498 n
= isl_basic_map_n_out(bmap1
);
3499 nparam
= isl_basic_map_n_param(bmap1
);
3501 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3502 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3503 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3504 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3505 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3506 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3507 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3508 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3509 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3510 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3511 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3513 bmap
= isl_basic_map_alloc_space(dim_result
,
3514 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3515 bmap1
->n_eq
+ bmap2
->n_eq
,
3516 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3517 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3518 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3519 bmap
= add_divs(bmap
, n
);
3520 bmap
= isl_basic_map_simplify(bmap
);
3521 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3522 return isl_basic_map_finalize(bmap
);
3524 isl_basic_map_free(bmap1
);
3525 isl_basic_map_free(bmap2
);
3529 struct isl_basic_set
*isl_basic_set_apply(
3530 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3535 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3538 return (struct isl_basic_set
*)
3539 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3541 isl_basic_set_free(bset
);
3542 isl_basic_map_free(bmap
);
3546 struct isl_basic_map
*isl_basic_map_apply_domain(
3547 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3549 if (!bmap1
|| !bmap2
)
3552 isl_assert(bmap1
->ctx
,
3553 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3554 isl_assert(bmap1
->ctx
,
3555 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3558 bmap1
= isl_basic_map_reverse(bmap1
);
3559 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3560 return isl_basic_map_reverse(bmap1
);
3562 isl_basic_map_free(bmap1
);
3563 isl_basic_map_free(bmap2
);
3567 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3568 * A \cap B -> f(A) + f(B)
3570 struct isl_basic_map
*isl_basic_map_sum(
3571 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3573 unsigned n_in
, n_out
, nparam
, total
, pos
;
3574 struct isl_basic_map
*bmap
= NULL
;
3575 struct isl_dim_map
*dim_map1
, *dim_map2
;
3578 if (!bmap1
|| !bmap2
)
3581 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3584 nparam
= isl_basic_map_n_param(bmap1
);
3585 n_in
= isl_basic_map_n_in(bmap1
);
3586 n_out
= isl_basic_map_n_out(bmap1
);
3588 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3589 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3590 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3591 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3592 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3593 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3594 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3595 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3596 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3597 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3598 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3600 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3601 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3602 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3603 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3604 for (i
= 0; i
< n_out
; ++i
) {
3605 int j
= isl_basic_map_alloc_equality(bmap
);
3608 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3609 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3610 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3611 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3613 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3614 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3615 bmap
= add_divs(bmap
, 2 * n_out
);
3617 bmap
= isl_basic_map_simplify(bmap
);
3618 return isl_basic_map_finalize(bmap
);
3620 isl_basic_map_free(bmap
);
3621 isl_basic_map_free(bmap1
);
3622 isl_basic_map_free(bmap2
);
3626 /* Given two maps A -> f(A) and B -> g(B), construct a map
3627 * A \cap B -> f(A) + f(B)
3629 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3631 struct isl_map
*result
;
3637 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3639 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3640 map1
->n
* map2
->n
, 0);
3643 for (i
= 0; i
< map1
->n
; ++i
)
3644 for (j
= 0; j
< map2
->n
; ++j
) {
3645 struct isl_basic_map
*part
;
3646 part
= isl_basic_map_sum(
3647 isl_basic_map_copy(map1
->p
[i
]),
3648 isl_basic_map_copy(map2
->p
[j
]));
3649 if (isl_basic_map_is_empty(part
))
3650 isl_basic_map_free(part
);
3652 result
= isl_map_add_basic_map(result
, part
);
3665 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3666 __isl_take isl_set
*set2
)
3668 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3671 /* Given a basic map A -> f(A), construct A -> -f(A).
3673 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3678 bmap
= isl_basic_map_cow(bmap
);
3682 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3683 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3684 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3685 for (j
= 0; j
< n
; ++j
)
3686 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3687 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3688 for (j
= 0; j
< n
; ++j
)
3689 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3690 for (i
= 0; i
< bmap
->n_div
; ++i
)
3691 for (j
= 0; j
< n
; ++j
)
3692 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3693 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3694 return isl_basic_map_finalize(bmap
);
3697 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3699 return isl_basic_map_neg(bset
);
3702 /* Given a map A -> f(A), construct A -> -f(A).
3704 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3708 map
= isl_map_cow(map
);
3712 for (i
= 0; i
< map
->n
; ++i
) {
3713 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3724 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3726 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3729 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3730 * A -> floor(f(A)/d).
3732 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3735 unsigned n_in
, n_out
, nparam
, total
, pos
;
3736 struct isl_basic_map
*result
= NULL
;
3737 struct isl_dim_map
*dim_map
;
3743 nparam
= isl_basic_map_n_param(bmap
);
3744 n_in
= isl_basic_map_n_in(bmap
);
3745 n_out
= isl_basic_map_n_out(bmap
);
3747 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3748 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3749 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3750 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3751 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3752 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3754 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3755 bmap
->n_div
+ n_out
,
3756 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3757 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3758 result
= add_divs(result
, n_out
);
3759 for (i
= 0; i
< n_out
; ++i
) {
3761 j
= isl_basic_map_alloc_inequality(result
);
3764 isl_seq_clr(result
->ineq
[j
], 1+total
);
3765 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3766 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3767 j
= isl_basic_map_alloc_inequality(result
);
3770 isl_seq_clr(result
->ineq
[j
], 1+total
);
3771 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3772 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3773 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3776 result
= isl_basic_map_simplify(result
);
3777 return isl_basic_map_finalize(result
);
3779 isl_basic_map_free(result
);
3783 /* Given a map A -> f(A) and an integer d, construct a map
3784 * A -> floor(f(A)/d).
3786 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3790 map
= isl_map_cow(map
);
3794 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3795 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3796 for (i
= 0; i
< map
->n
; ++i
) {
3797 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3808 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3814 i
= isl_basic_map_alloc_equality(bmap
);
3817 nparam
= isl_basic_map_n_param(bmap
);
3818 n_in
= isl_basic_map_n_in(bmap
);
3819 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3820 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3821 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3822 return isl_basic_map_finalize(bmap
);
3824 isl_basic_map_free(bmap
);
3828 /* Add a constraints to "bmap" expressing i_pos < o_pos
3830 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3836 i
= isl_basic_map_alloc_inequality(bmap
);
3839 nparam
= isl_basic_map_n_param(bmap
);
3840 n_in
= isl_basic_map_n_in(bmap
);
3841 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3842 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3843 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3844 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3845 return isl_basic_map_finalize(bmap
);
3847 isl_basic_map_free(bmap
);
3851 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3853 static __isl_give isl_basic_map
*var_less_or_equal(
3854 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3860 i
= isl_basic_map_alloc_inequality(bmap
);
3863 nparam
= isl_basic_map_n_param(bmap
);
3864 n_in
= isl_basic_map_n_in(bmap
);
3865 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3866 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3867 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3868 return isl_basic_map_finalize(bmap
);
3870 isl_basic_map_free(bmap
);
3874 /* Add a constraints to "bmap" expressing i_pos > o_pos
3876 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3882 i
= isl_basic_map_alloc_inequality(bmap
);
3885 nparam
= isl_basic_map_n_param(bmap
);
3886 n_in
= isl_basic_map_n_in(bmap
);
3887 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3888 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3889 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3890 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3891 return isl_basic_map_finalize(bmap
);
3893 isl_basic_map_free(bmap
);
3897 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3899 static __isl_give isl_basic_map
*var_more_or_equal(
3900 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3906 i
= isl_basic_map_alloc_inequality(bmap
);
3909 nparam
= isl_basic_map_n_param(bmap
);
3910 n_in
= isl_basic_map_n_in(bmap
);
3911 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3912 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3913 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3914 return isl_basic_map_finalize(bmap
);
3916 isl_basic_map_free(bmap
);
3920 __isl_give isl_basic_map
*isl_basic_map_equal(
3921 __isl_take isl_space
*dim
, unsigned n_equal
)
3924 struct isl_basic_map
*bmap
;
3925 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3928 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3929 bmap
= var_equal(bmap
, i
);
3930 return isl_basic_map_finalize(bmap
);
3933 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3935 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3939 struct isl_basic_map
*bmap
;
3940 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3943 for (i
= 0; i
< pos
&& bmap
; ++i
)
3944 bmap
= var_equal(bmap
, i
);
3946 bmap
= var_less(bmap
, pos
);
3947 return isl_basic_map_finalize(bmap
);
3950 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3952 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3953 __isl_take isl_space
*dim
, unsigned pos
)
3956 isl_basic_map
*bmap
;
3958 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3959 for (i
= 0; i
< pos
; ++i
)
3960 bmap
= var_equal(bmap
, i
);
3961 bmap
= var_less_or_equal(bmap
, pos
);
3962 return isl_basic_map_finalize(bmap
);
3965 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3967 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3971 struct isl_basic_map
*bmap
;
3972 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3975 for (i
= 0; i
< pos
&& bmap
; ++i
)
3976 bmap
= var_equal(bmap
, i
);
3978 bmap
= var_more(bmap
, pos
);
3979 return isl_basic_map_finalize(bmap
);
3982 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3984 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3985 __isl_take isl_space
*dim
, unsigned pos
)
3988 isl_basic_map
*bmap
;
3990 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3991 for (i
= 0; i
< pos
; ++i
)
3992 bmap
= var_equal(bmap
, i
);
3993 bmap
= var_more_or_equal(bmap
, pos
);
3994 return isl_basic_map_finalize(bmap
);
3997 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3998 unsigned n
, int equal
)
4000 struct isl_map
*map
;
4003 if (n
== 0 && equal
)
4004 return isl_map_universe(dims
);
4006 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4008 for (i
= 0; i
+ 1 < n
; ++i
)
4009 map
= isl_map_add_basic_map(map
,
4010 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4013 map
= isl_map_add_basic_map(map
,
4014 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4016 map
= isl_map_add_basic_map(map
,
4017 isl_basic_map_less_at(dims
, n
- 1));
4019 isl_space_free(dims
);
4024 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4028 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4031 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4033 return map_lex_lte_first(dim
, n
, 0);
4036 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4038 return map_lex_lte_first(dim
, n
, 1);
4041 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4043 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4046 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4048 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4051 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4052 unsigned n
, int equal
)
4054 struct isl_map
*map
;
4057 if (n
== 0 && equal
)
4058 return isl_map_universe(dims
);
4060 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4062 for (i
= 0; i
+ 1 < n
; ++i
)
4063 map
= isl_map_add_basic_map(map
,
4064 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4067 map
= isl_map_add_basic_map(map
,
4068 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4070 map
= isl_map_add_basic_map(map
,
4071 isl_basic_map_more_at(dims
, n
- 1));
4073 isl_space_free(dims
);
4078 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4082 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4085 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4087 return map_lex_gte_first(dim
, n
, 0);
4090 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4092 return map_lex_gte_first(dim
, n
, 1);
4095 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4097 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4100 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4102 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4105 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4106 __isl_take isl_set
*set2
)
4109 map
= isl_map_lex_le(isl_set_get_space(set1
));
4110 map
= isl_map_intersect_domain(map
, set1
);
4111 map
= isl_map_intersect_range(map
, set2
);
4115 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4116 __isl_take isl_set
*set2
)
4119 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4120 map
= isl_map_intersect_domain(map
, set1
);
4121 map
= isl_map_intersect_range(map
, set2
);
4125 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4126 __isl_take isl_set
*set2
)
4129 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4130 map
= isl_map_intersect_domain(map
, set1
);
4131 map
= isl_map_intersect_range(map
, set2
);
4135 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4136 __isl_take isl_set
*set2
)
4139 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4140 map
= isl_map_intersect_domain(map
, set1
);
4141 map
= isl_map_intersect_range(map
, set2
);
4145 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4146 __isl_take isl_map
*map2
)
4149 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4150 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4151 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4155 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4156 __isl_take isl_map
*map2
)
4159 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4160 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4161 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4165 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4166 __isl_take isl_map
*map2
)
4169 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4170 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4171 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4175 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4176 __isl_take isl_map
*map2
)
4179 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4180 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4181 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4185 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4186 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4188 struct isl_basic_map
*bmap
;
4190 bset
= isl_basic_set_cow(bset
);
4194 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4195 isl_space_free(bset
->dim
);
4196 bmap
= (struct isl_basic_map
*) bset
;
4198 return isl_basic_map_finalize(bmap
);
4200 isl_basic_set_free(bset
);
4201 isl_space_free(dim
);
4205 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4209 if (bmap
->dim
->n_in
== 0)
4210 return (struct isl_basic_set
*)bmap
;
4211 bmap
= isl_basic_map_cow(bmap
);
4214 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4217 bmap
= isl_basic_map_finalize(bmap
);
4218 return (struct isl_basic_set
*)bmap
;
4220 isl_basic_map_free(bmap
);
4224 /* For a div d = floor(f/m), add the constraints
4227 * -(f-(n-1)) + m d >= 0
4229 * Note that the second constraint is the negation of
4233 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4234 unsigned pos
, isl_int
*div
)
4237 unsigned total
= isl_basic_map_total_dim(bmap
);
4239 i
= isl_basic_map_alloc_inequality(bmap
);
4242 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4243 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4245 j
= isl_basic_map_alloc_inequality(bmap
);
4248 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4249 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4250 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4254 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4255 unsigned pos
, isl_int
*div
)
4257 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4261 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4263 unsigned total
= isl_basic_map_total_dim(bmap
);
4264 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4266 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4270 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4272 return isl_basic_map_add_div_constraints(bset
, div
);
4275 struct isl_basic_set
*isl_basic_map_underlying_set(
4276 struct isl_basic_map
*bmap
)
4280 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4282 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4283 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4284 return (struct isl_basic_set
*)bmap
;
4285 bmap
= isl_basic_map_cow(bmap
);
4288 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4291 bmap
->extra
-= bmap
->n_div
;
4293 bmap
= isl_basic_map_finalize(bmap
);
4294 return (struct isl_basic_set
*)bmap
;
4296 isl_basic_map_free(bmap
);
4300 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4301 __isl_take isl_basic_set
*bset
)
4303 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4306 struct isl_basic_map
*isl_basic_map_overlying_set(
4307 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4309 struct isl_basic_map
*bmap
;
4310 struct isl_ctx
*ctx
;
4317 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4318 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4319 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4321 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4322 isl_basic_map_free(like
);
4323 return (struct isl_basic_map
*)bset
;
4325 bset
= isl_basic_set_cow(bset
);
4328 total
= bset
->dim
->n_out
+ bset
->extra
;
4329 bmap
= (struct isl_basic_map
*)bset
;
4330 isl_space_free(bmap
->dim
);
4331 bmap
->dim
= isl_space_copy(like
->dim
);
4334 bmap
->n_div
= like
->n_div
;
4335 bmap
->extra
+= like
->n_div
;
4339 ltotal
= total
- bmap
->extra
+ like
->extra
;
4342 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4343 bmap
->extra
* (1 + 1 + total
));
4344 if (isl_blk_is_error(bmap
->block2
))
4346 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4350 for (i
= 0; i
< bmap
->extra
; ++i
)
4351 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4352 for (i
= 0; i
< like
->n_div
; ++i
) {
4353 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4354 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4356 bmap
= isl_basic_map_extend_constraints(bmap
,
4357 0, 2 * like
->n_div
);
4358 for (i
= 0; i
< like
->n_div
; ++i
) {
4361 if (isl_int_is_zero(bmap
->div
[i
][0]))
4363 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4364 bmap
= isl_basic_map_free(bmap
);
4367 isl_basic_map_free(like
);
4368 bmap
= isl_basic_map_simplify(bmap
);
4369 bmap
= isl_basic_map_finalize(bmap
);
4372 isl_basic_map_free(like
);
4373 isl_basic_set_free(bset
);
4377 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4378 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4380 return (struct isl_basic_set
*)
4381 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4384 struct isl_set
*isl_set_from_underlying_set(
4385 struct isl_set
*set
, struct isl_basic_set
*like
)
4391 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4393 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4394 isl_basic_set_free(like
);
4397 set
= isl_set_cow(set
);
4400 for (i
= 0; i
< set
->n
; ++i
) {
4401 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4402 isl_basic_set_copy(like
));
4406 isl_space_free(set
->dim
);
4407 set
->dim
= isl_space_copy(like
->dim
);
4410 isl_basic_set_free(like
);
4413 isl_basic_set_free(like
);
4418 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4422 map
= isl_map_cow(map
);
4425 map
->dim
= isl_space_cow(map
->dim
);
4429 for (i
= 1; i
< map
->n
; ++i
)
4430 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4432 for (i
= 0; i
< map
->n
; ++i
) {
4433 map
->p
[i
] = (struct isl_basic_map
*)
4434 isl_basic_map_underlying_set(map
->p
[i
]);
4439 map
->dim
= isl_space_underlying(map
->dim
, 0);
4441 isl_space_free(map
->dim
);
4442 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4446 return (struct isl_set
*)map
;
4452 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4454 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4457 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4458 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4460 bmap
= isl_basic_map_cow(bmap
);
4464 isl_space_free(bmap
->dim
);
4467 bmap
= isl_basic_map_finalize(bmap
);
4471 isl_basic_map_free(bmap
);
4472 isl_space_free(dim
);
4476 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4477 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4479 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4483 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4484 __isl_take isl_space
*dim
)
4488 map
= isl_map_cow(map
);
4492 for (i
= 0; i
< map
->n
; ++i
) {
4493 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4494 isl_space_copy(dim
));
4498 isl_space_free(map
->dim
);
4504 isl_space_free(dim
);
4508 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4509 __isl_take isl_space
*dim
)
4511 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4514 /* Compute the parameter domain of the given basic set.
4516 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4521 if (isl_basic_set_is_params(bset
))
4524 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4525 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4526 space
= isl_basic_set_get_space(bset
);
4527 space
= isl_space_params(space
);
4528 bset
= isl_basic_set_reset_space(bset
, space
);
4532 /* Construct a zero-dimensional basic set with the given parameter domain.
4534 __isl_give isl_basic_set
*isl_basic_set_from_params(
4535 __isl_take isl_basic_set
*bset
)
4538 space
= isl_basic_set_get_space(bset
);
4539 space
= isl_space_set_from_params(space
);
4540 bset
= isl_basic_set_reset_space(bset
, space
);
4544 /* Compute the parameter domain of the given set.
4546 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4551 if (isl_set_is_params(set
))
4554 n
= isl_set_dim(set
, isl_dim_set
);
4555 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4556 space
= isl_set_get_space(set
);
4557 space
= isl_space_params(space
);
4558 set
= isl_set_reset_space(set
, space
);
4562 /* Construct a zero-dimensional set with the given parameter domain.
4564 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4567 space
= isl_set_get_space(set
);
4568 space
= isl_space_set_from_params(space
);
4569 set
= isl_set_reset_space(set
, space
);
4573 /* Compute the parameter domain of the given map.
4575 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4580 n
= isl_map_dim(map
, isl_dim_in
);
4581 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4582 n
= isl_map_dim(map
, isl_dim_out
);
4583 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4584 space
= isl_map_get_space(map
);
4585 space
= isl_space_params(space
);
4586 map
= isl_map_reset_space(map
, space
);
4590 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4593 struct isl_basic_set
*domain
;
4599 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4601 n_in
= isl_basic_map_n_in(bmap
);
4602 n_out
= isl_basic_map_n_out(bmap
);
4603 domain
= isl_basic_set_from_basic_map(bmap
);
4604 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4606 domain
= isl_basic_set_reset_space(domain
, dim
);
4611 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4615 return isl_space_may_be_set(bmap
->dim
);
4618 /* Is this basic map actually a set?
4619 * Users should never call this function. Outside of isl,
4620 * the type should indicate whether something is a set or a map.
4622 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4626 return isl_space_is_set(bmap
->dim
);
4629 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4633 if (isl_basic_map_is_set(bmap
))
4635 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4638 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4639 __isl_take isl_basic_map
*bmap
)
4643 isl_basic_map
*domain
;
4644 int nparam
, n_in
, n_out
;
4647 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4648 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4649 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4651 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4652 domain
= isl_basic_map_universe(dim
);
4654 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4655 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4656 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4658 total
= isl_basic_map_total_dim(bmap
);
4660 for (i
= 0; i
< n_in
; ++i
) {
4661 k
= isl_basic_map_alloc_equality(bmap
);
4664 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4665 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4666 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4669 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4670 return isl_basic_map_finalize(bmap
);
4672 isl_basic_map_free(bmap
);
4676 __isl_give isl_basic_map
*isl_basic_map_range_map(
4677 __isl_take isl_basic_map
*bmap
)
4681 isl_basic_map
*range
;
4682 int nparam
, n_in
, n_out
;
4685 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4686 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4687 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4689 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4690 range
= isl_basic_map_universe(dim
);
4692 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4693 bmap
= isl_basic_map_apply_range(bmap
, range
);
4694 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4696 total
= isl_basic_map_total_dim(bmap
);
4698 for (i
= 0; i
< n_out
; ++i
) {
4699 k
= isl_basic_map_alloc_equality(bmap
);
4702 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4703 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4704 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4707 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4708 return isl_basic_map_finalize(bmap
);
4710 isl_basic_map_free(bmap
);
4714 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4718 return isl_space_may_be_set(map
->dim
);
4721 /* Is this map actually a set?
4722 * Users should never call this function. Outside of isl,
4723 * the type should indicate whether something is a set or a map.
4725 int isl_map_is_set(__isl_keep isl_map
*map
)
4729 return isl_space_is_set(map
->dim
);
4732 struct isl_set
*isl_map_range(struct isl_map
*map
)
4735 struct isl_set
*set
;
4739 if (isl_map_is_set(map
))
4740 return (isl_set
*)map
;
4742 map
= isl_map_cow(map
);
4746 set
= (struct isl_set
*) map
;
4747 set
->dim
= isl_space_range(set
->dim
);
4750 for (i
= 0; i
< map
->n
; ++i
) {
4751 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4755 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4756 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4763 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4766 isl_space
*domain_dim
;
4768 map
= isl_map_cow(map
);
4772 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4773 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4774 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4777 for (i
= 0; i
< map
->n
; ++i
) {
4778 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4782 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4783 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4790 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4793 isl_space
*range_dim
;
4795 map
= isl_map_cow(map
);
4799 range_dim
= isl_space_range(isl_map_get_space(map
));
4800 range_dim
= isl_space_from_range(range_dim
);
4801 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4802 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4805 for (i
= 0; i
< map
->n
; ++i
) {
4806 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4810 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4811 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4818 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4819 __isl_take isl_space
*dim
)
4822 struct isl_map
*map
= NULL
;
4824 set
= isl_set_cow(set
);
4827 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4828 map
= (struct isl_map
*)set
;
4829 for (i
= 0; i
< set
->n
; ++i
) {
4830 map
->p
[i
] = isl_basic_map_from_basic_set(
4831 set
->p
[i
], isl_space_copy(dim
));
4835 isl_space_free(map
->dim
);
4839 isl_space_free(dim
);
4844 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4845 __isl_take isl_basic_set
*bset
)
4847 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4850 __isl_give isl_basic_map
*isl_basic_map_from_range(
4851 __isl_take isl_basic_set
*bset
)
4854 space
= isl_basic_set_get_space(bset
);
4855 space
= isl_space_from_range(space
);
4856 bset
= isl_basic_set_reset_space(bset
, space
);
4857 return (isl_basic_map
*)bset
;
4860 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4863 space
= isl_set_get_space(set
);
4864 space
= isl_space_from_range(space
);
4865 set
= isl_set_reset_space(set
, space
);
4866 return (struct isl_map
*)set
;
4869 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4871 return isl_map_reverse(isl_map_from_range(set
));
4874 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4875 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4877 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4880 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4881 __isl_take isl_set
*range
)
4883 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4886 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4889 struct isl_set
*set
= NULL
;
4893 map
= isl_map_cow(map
);
4896 map
->dim
= isl_space_as_set_space(map
->dim
);
4899 set
= (struct isl_set
*)map
;
4900 for (i
= 0; i
< map
->n
; ++i
) {
4901 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4911 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4914 struct isl_map
*map
;
4919 isl_die(dim
->ctx
, isl_error_internal
,
4920 "negative number of basic maps", goto error
);
4921 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4922 sizeof(struct isl_map
) +
4923 (n
- 1) * sizeof(struct isl_basic_map
*));
4927 map
->ctx
= dim
->ctx
;
4928 isl_ctx_ref(map
->ctx
);
4936 isl_space_free(dim
);
4940 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4941 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4944 struct isl_map
*map
;
4947 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4951 map
= isl_map_alloc_space(dims
, n
, flags
);
4955 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4957 struct isl_basic_map
*bmap
;
4958 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4959 bmap
= isl_basic_map_set_to_empty(bmap
);
4963 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4965 struct isl_basic_set
*bset
;
4966 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4967 bset
= isl_basic_set_set_to_empty(bset
);
4971 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4973 struct isl_basic_map
*bmap
;
4976 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4977 bmap
= isl_basic_map_set_to_empty(bmap
);
4981 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4983 struct isl_basic_map
*bmap
;
4986 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4987 bmap
= isl_basic_map_set_to_empty(bmap
);
4991 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4993 struct isl_basic_set
*bset
;
4996 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4997 bset
= isl_basic_set_set_to_empty(bset
);
5001 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5003 struct isl_basic_map
*bmap
;
5004 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5005 bmap
= isl_basic_map_finalize(bmap
);
5009 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5011 struct isl_basic_set
*bset
;
5012 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5013 bset
= isl_basic_set_finalize(bset
);
5017 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5020 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5021 isl_basic_map
*bmap
;
5023 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5024 for (i
= 0; i
< total
; ++i
) {
5025 int k
= isl_basic_map_alloc_inequality(bmap
);
5028 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5029 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5033 isl_basic_map_free(bmap
);
5037 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5039 return isl_basic_map_nat_universe(dim
);
5042 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5044 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5047 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5049 return isl_map_nat_universe(dim
);
5052 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5053 __isl_keep isl_basic_map
*model
)
5057 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5060 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5064 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5067 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5068 __isl_keep isl_set
*model
)
5072 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5075 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5077 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5080 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5084 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5087 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5091 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5094 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5096 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5099 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5103 return isl_set_empty(isl_space_copy(model
->dim
));
5106 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5108 struct isl_map
*map
;
5111 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5112 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5116 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5118 struct isl_set
*set
;
5121 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5122 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5126 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5130 return isl_set_universe(isl_space_copy(model
->dim
));
5133 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5136 struct isl_map
*dup
;
5140 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5141 for (i
= 0; i
< map
->n
; ++i
)
5142 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5146 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5147 __isl_take isl_basic_map
*bmap
)
5151 if (isl_basic_map_plain_is_empty(bmap
)) {
5152 isl_basic_map_free(bmap
);
5155 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5156 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5157 map
->p
[map
->n
] = bmap
;
5159 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5165 isl_basic_map_free(bmap
);
5169 void *isl_map_free(struct isl_map
*map
)
5179 isl_ctx_deref(map
->ctx
);
5180 for (i
= 0; i
< map
->n
; ++i
)
5181 isl_basic_map_free(map
->p
[i
]);
5182 isl_space_free(map
->dim
);
5188 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5189 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5193 base
= isl_map_cow(base
);
5197 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5200 for (i
= 0; i
< base
->n
; ++i
) {
5201 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5202 isl_space_copy(base
->dim
), 0, 0, 0);
5212 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5213 unsigned nparam
, unsigned dim
)
5215 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5219 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5220 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5224 bmap
= isl_basic_map_cow(bmap
);
5225 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5226 j
= isl_basic_map_alloc_equality(bmap
);
5229 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5230 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5231 isl_int_set_si(bmap
->eq
[j
][0], value
);
5232 bmap
= isl_basic_map_simplify(bmap
);
5233 return isl_basic_map_finalize(bmap
);
5235 isl_basic_map_free(bmap
);
5239 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5240 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5244 bmap
= isl_basic_map_cow(bmap
);
5245 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5246 j
= isl_basic_map_alloc_equality(bmap
);
5249 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5250 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5251 isl_int_set(bmap
->eq
[j
][0], value
);
5252 bmap
= isl_basic_map_simplify(bmap
);
5253 return isl_basic_map_finalize(bmap
);
5255 isl_basic_map_free(bmap
);
5259 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5260 enum isl_dim_type type
, unsigned pos
, int value
)
5264 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5265 return isl_basic_map_fix_pos_si(bmap
,
5266 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5268 isl_basic_map_free(bmap
);
5272 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5273 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5277 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5278 return isl_basic_map_fix_pos(bmap
,
5279 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5281 isl_basic_map_free(bmap
);
5285 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5286 enum isl_dim_type type
, unsigned pos
, int value
)
5288 return (struct isl_basic_set
*)
5289 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5293 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5294 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5296 return (struct isl_basic_set
*)
5297 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5301 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5302 unsigned input
, int value
)
5304 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5307 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5308 unsigned dim
, int value
)
5310 return (struct isl_basic_set
*)
5311 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5312 isl_dim_set
, dim
, value
);
5315 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5317 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5324 isl_basic_map_free(map
->p
[i
]);
5325 if (i
!= map
->n
- 1) {
5326 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5327 map
->p
[i
] = map
->p
[map
->n
- 1];
5334 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5335 enum isl_dim_type type
, unsigned pos
, int value
)
5339 map
= isl_map_cow(map
);
5343 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5344 for (i
= map
->n
- 1; i
>= 0; --i
) {
5345 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5346 if (remove_if_empty(map
, i
) < 0)
5349 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5356 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5357 enum isl_dim_type type
, unsigned pos
, int value
)
5359 return (struct isl_set
*)
5360 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5363 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5364 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5368 map
= isl_map_cow(map
);
5372 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5373 for (i
= 0; i
< map
->n
; ++i
) {
5374 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5378 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5385 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5386 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5388 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5391 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5392 unsigned input
, int value
)
5394 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5397 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5399 return (struct isl_set
*)
5400 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5403 static __isl_give isl_basic_map
*basic_map_bound_si(
5404 __isl_take isl_basic_map
*bmap
,
5405 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5411 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5412 pos
+= isl_basic_map_offset(bmap
, type
);
5413 bmap
= isl_basic_map_cow(bmap
);
5414 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5415 j
= isl_basic_map_alloc_inequality(bmap
);
5418 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5420 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5421 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5423 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5424 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5426 bmap
= isl_basic_map_simplify(bmap
);
5427 return isl_basic_map_finalize(bmap
);
5429 isl_basic_map_free(bmap
);
5433 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5434 __isl_take isl_basic_map
*bmap
,
5435 enum isl_dim_type type
, unsigned pos
, int value
)
5437 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5440 /* Constrain the values of the given dimension to be no greater than "value".
5442 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5443 __isl_take isl_basic_map
*bmap
,
5444 enum isl_dim_type type
, unsigned pos
, int value
)
5446 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5449 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5450 unsigned dim
, isl_int value
)
5454 bset
= isl_basic_set_cow(bset
);
5455 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5456 j
= isl_basic_set_alloc_inequality(bset
);
5459 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5460 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5461 isl_int_neg(bset
->ineq
[j
][0], value
);
5462 bset
= isl_basic_set_simplify(bset
);
5463 return isl_basic_set_finalize(bset
);
5465 isl_basic_set_free(bset
);
5469 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5470 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5474 map
= isl_map_cow(map
);
5478 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5479 for (i
= 0; i
< map
->n
; ++i
) {
5480 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5481 type
, pos
, value
, upper
);
5485 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5492 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5493 enum isl_dim_type type
, unsigned pos
, int value
)
5495 return map_bound_si(map
, type
, pos
, value
, 0);
5498 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5499 enum isl_dim_type type
, unsigned pos
, int value
)
5501 return map_bound_si(map
, type
, pos
, value
, 1);
5504 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5505 enum isl_dim_type type
, unsigned pos
, int value
)
5507 return (struct isl_set
*)
5508 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5511 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5512 enum isl_dim_type type
, unsigned pos
, int value
)
5514 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5517 /* Bound the given variable of "bmap" from below (or above is "upper"
5518 * is set) to "value".
5520 static __isl_give isl_basic_map
*basic_map_bound(
5521 __isl_take isl_basic_map
*bmap
,
5522 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5528 if (pos
>= isl_basic_map_dim(bmap
, type
))
5529 isl_die(bmap
->ctx
, isl_error_invalid
,
5530 "index out of bounds", goto error
);
5531 pos
+= isl_basic_map_offset(bmap
, type
);
5532 bmap
= isl_basic_map_cow(bmap
);
5533 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5534 j
= isl_basic_map_alloc_inequality(bmap
);
5537 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5539 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5540 isl_int_set(bmap
->ineq
[j
][0], value
);
5542 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5543 isl_int_neg(bmap
->ineq
[j
][0], value
);
5545 bmap
= isl_basic_map_simplify(bmap
);
5546 return isl_basic_map_finalize(bmap
);
5548 isl_basic_map_free(bmap
);
5552 /* Bound the given variable of "map" from below (or above is "upper"
5553 * is set) to "value".
5555 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5556 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5560 map
= isl_map_cow(map
);
5564 if (pos
>= isl_map_dim(map
, type
))
5565 isl_die(map
->ctx
, isl_error_invalid
,
5566 "index out of bounds", goto error
);
5567 for (i
= map
->n
- 1; i
>= 0; --i
) {
5568 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5569 if (remove_if_empty(map
, i
) < 0)
5572 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5579 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5580 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5582 return map_bound(map
, type
, pos
, value
, 0);
5585 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5586 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5588 return map_bound(map
, type
, pos
, value
, 1);
5591 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5592 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5594 return isl_map_lower_bound(set
, type
, pos
, value
);
5597 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5598 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5600 return isl_map_upper_bound(set
, type
, pos
, value
);
5603 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5608 set
= isl_set_cow(set
);
5612 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5613 for (i
= 0; i
< set
->n
; ++i
) {
5614 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5624 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5628 map
= isl_map_cow(map
);
5632 map
->dim
= isl_space_reverse(map
->dim
);
5635 for (i
= 0; i
< map
->n
; ++i
) {
5636 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5640 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5647 static struct isl_map
*isl_basic_map_partial_lexopt(
5648 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5649 struct isl_set
**empty
, int max
)
5653 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5654 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5656 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5658 isl_basic_map_free(bmap
);
5659 isl_basic_set_free(dom
);
5665 struct isl_map
*isl_basic_map_partial_lexmax(
5666 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5667 struct isl_set
**empty
)
5669 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5672 struct isl_map
*isl_basic_map_partial_lexmin(
5673 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5674 struct isl_set
**empty
)
5676 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5679 struct isl_set
*isl_basic_set_partial_lexmin(
5680 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5681 struct isl_set
**empty
)
5683 return (struct isl_set
*)
5684 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5688 struct isl_set
*isl_basic_set_partial_lexmax(
5689 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5690 struct isl_set
**empty
)
5692 return (struct isl_set
*)
5693 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5697 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5698 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5699 __isl_give isl_set
**empty
)
5701 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5704 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5705 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5706 __isl_give isl_set
**empty
)
5708 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5711 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5712 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5713 __isl_give isl_set
**empty
)
5715 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5718 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5719 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5720 __isl_give isl_set
**empty
)
5722 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5725 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5726 __isl_take isl_basic_map
*bmap
, int max
)
5728 isl_basic_set
*dom
= NULL
;
5729 isl_space
*dom_space
;
5733 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5734 dom
= isl_basic_set_universe(dom_space
);
5735 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5737 isl_basic_map_free(bmap
);
5741 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5742 __isl_take isl_basic_map
*bmap
)
5744 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5748 #define TYPE isl_pw_multi_aff
5750 #define SUFFIX _pw_multi_aff
5752 #define EMPTY isl_pw_multi_aff_empty
5754 #define ADD isl_pw_multi_aff_union_add
5755 #include "isl_map_lexopt_templ.c"
5757 /* Given a map "map", compute the lexicographically minimal
5758 * (or maximal) image element for each domain element in dom,
5759 * in the form of an isl_pw_multi_aff.
5760 * Set *empty to those elements in dom that do not have an image element.
5762 * We first compute the lexicographically minimal or maximal element
5763 * in the first basic map. This results in a partial solution "res"
5764 * and a subset "todo" of dom that still need to be handled.
5765 * We then consider each of the remaining maps in "map" and successively
5766 * update both "res" and "todo".
5768 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5769 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5770 __isl_give isl_set
**empty
, int max
)
5773 isl_pw_multi_aff
*res
;
5779 if (isl_map_plain_is_empty(map
)) {
5784 return isl_pw_multi_aff_from_map(map
);
5787 res
= basic_map_partial_lexopt_pw_multi_aff(
5788 isl_basic_map_copy(map
->p
[0]),
5789 isl_set_copy(dom
), &todo
, max
);
5791 for (i
= 1; i
< map
->n
; ++i
) {
5792 isl_pw_multi_aff
*res_i
;
5795 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5796 isl_basic_map_copy(map
->p
[i
]),
5797 isl_set_copy(dom
), &todo_i
, max
);
5800 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5802 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5804 todo
= isl_set_intersect(todo
, todo_i
);
5825 #define TYPE isl_map
5829 #define EMPTY isl_map_empty
5831 #define ADD isl_map_union_disjoint
5832 #include "isl_map_lexopt_templ.c"
5834 /* Given a map "map", compute the lexicographically minimal
5835 * (or maximal) image element for each domain element in dom.
5836 * Set *empty to those elements in dom that do not have an image element.
5838 * We first compute the lexicographically minimal or maximal element
5839 * in the first basic map. This results in a partial solution "res"
5840 * and a subset "todo" of dom that still need to be handled.
5841 * We then consider each of the remaining maps in "map" and successively
5842 * update both "res" and "todo".
5844 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5845 * Assume we are computing the lexicographical maximum.
5846 * We first compute the lexicographically maximal element in basic map i.
5847 * This results in a partial solution res_i and a subset todo_i.
5848 * Then we combine these results with those obtain for the first k basic maps
5849 * to obtain a result that is valid for the first k+1 basic maps.
5850 * In particular, the set where there is no solution is the set where
5851 * there is no solution for the first k basic maps and also no solution
5852 * for the ith basic map, i.e.,
5854 * todo^i = todo^k * todo_i
5856 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5857 * solutions, arbitrarily breaking ties in favor of res^k.
5858 * That is, when res^k(a) >= res_i(a), we pick res^k and
5859 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5860 * the lexicographic order.)
5861 * In practice, we compute
5863 * res^k * (res_i . "<=")
5867 * res_i * (res^k . "<")
5869 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5870 * where only one of res^k and res_i provides a solution and we simply pick
5877 * Note that we only compute these intersections when dom(res^k) intersects
5878 * dom(res_i). Otherwise, the only effect of these intersections is to
5879 * potentially break up res^k and res_i into smaller pieces.
5880 * We want to avoid such splintering as much as possible.
5881 * In fact, an earlier implementation of this function would look for
5882 * better results in the domain of res^k and for extra results in todo^k,
5883 * but this would always result in a splintering according to todo^k,
5884 * even when the domain of basic map i is disjoint from the domains of
5885 * the previous basic maps.
5887 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5888 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5889 __isl_give isl_set
**empty
, int max
)
5892 struct isl_map
*res
;
5893 struct isl_set
*todo
;
5898 if (isl_map_plain_is_empty(map
)) {
5906 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5907 isl_set_copy(dom
), &todo
, max
);
5909 for (i
= 1; i
< map
->n
; ++i
) {
5913 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5915 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5916 isl_set_copy(dom
), &todo_i
, max
);
5919 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5920 le
= isl_map_lex_le(dim
);
5922 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5923 le
= isl_map_lex_ge(dim
);
5925 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5926 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5927 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5928 le
= isl_map_intersect(le
, isl_map_copy(res
));
5930 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5931 res
= isl_map_intersect_domain(res
,
5932 isl_set_copy(todo_i
));
5933 res_i
= isl_map_intersect_domain(res_i
,
5934 isl_set_copy(todo
));
5937 res
= isl_map_union_disjoint(res
, res_i
);
5938 res
= isl_map_union_disjoint(res
, lt
);
5939 res
= isl_map_union_disjoint(res
, le
);
5941 todo
= isl_set_intersect(todo
, todo_i
);
5961 __isl_give isl_map
*isl_map_partial_lexmax(
5962 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5963 __isl_give isl_set
**empty
)
5965 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5968 __isl_give isl_map
*isl_map_partial_lexmin(
5969 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5970 __isl_give isl_set
**empty
)
5972 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5975 __isl_give isl_set
*isl_set_partial_lexmin(
5976 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5977 __isl_give isl_set
**empty
)
5979 return (struct isl_set
*)
5980 isl_map_partial_lexmin((struct isl_map
*)set
,
5984 __isl_give isl_set
*isl_set_partial_lexmax(
5985 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5986 __isl_give isl_set
**empty
)
5988 return (struct isl_set
*)
5989 isl_map_partial_lexmax((struct isl_map
*)set
,
5993 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5995 struct isl_basic_set
*dom
= NULL
;
6000 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
6001 dom
= isl_basic_set_universe(dom_dim
);
6002 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6004 isl_basic_map_free(bmap
);
6008 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6010 return isl_basic_map_lexopt(bmap
, 0);
6013 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6015 return isl_basic_map_lexopt(bmap
, 1);
6018 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6020 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6023 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6025 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6028 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
6030 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
6033 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
6035 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
6038 /* Extract the first and only affine expression from list
6039 * and then add it to *pwaff with the given dom.
6040 * This domain is known to be disjoint from other domains
6041 * because of the way isl_basic_map_foreach_lexmax works.
6043 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6044 __isl_take isl_aff_list
*list
, void *user
)
6046 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6048 isl_pw_aff
**pwaff
= user
;
6049 isl_pw_aff
*pwaff_i
;
6053 if (isl_aff_list_n_aff(list
) != 1)
6054 isl_die(ctx
, isl_error_internal
,
6055 "expecting single element list", goto error
);
6057 aff
= isl_aff_list_get_aff(list
, 0);
6058 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6060 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6062 isl_aff_list_free(list
);
6066 isl_basic_set_free(dom
);
6067 isl_aff_list_free(list
);
6071 /* Given a basic map with one output dimension, compute the minimum or
6072 * maximum of that dimension as an isl_pw_aff.
6074 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6075 * call update_dim_opt on each leaf of the result.
6077 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6080 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6084 dim
= isl_space_from_domain(isl_space_domain(dim
));
6085 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6086 pwaff
= isl_pw_aff_empty(dim
);
6088 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6090 return isl_pw_aff_free(pwaff
);
6095 /* Compute the minimum or maximum of the given output dimension
6096 * as a function of the parameters and the input dimensions,
6097 * but independently of the other output dimensions.
6099 * We first project out the other output dimension and then compute
6100 * the "lexicographic" maximum in each basic map, combining the results
6101 * using isl_pw_aff_union_max.
6103 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6110 n_out
= isl_map_dim(map
, isl_dim_out
);
6111 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6112 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6117 isl_space
*dim
= isl_map_get_space(map
);
6118 dim
= isl_space_domain(isl_space_from_range(dim
));
6120 return isl_pw_aff_empty(dim
);
6123 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6124 for (i
= 1; i
< map
->n
; ++i
) {
6125 isl_pw_aff
*pwaff_i
;
6127 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6128 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6136 /* Compute the maximum of the given output dimension as a function of the
6137 * parameters and input dimensions, but independently of
6138 * the other output dimensions.
6140 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6142 return map_dim_opt(map
, pos
, 1);
6145 /* Compute the minimum or maximum of the given set dimension
6146 * as a function of the parameters,
6147 * but independently of the other set dimensions.
6149 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6152 return map_dim_opt(set
, pos
, max
);
6155 /* Compute the maximum 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_max(__isl_take isl_set
*set
, int pos
)
6160 return set_dim_opt(set
, pos
, 1);
6163 /* Compute the minimum of the given set dimension as a function of the
6164 * parameters, but independently of the other set dimensions.
6166 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6168 return set_dim_opt(set
, pos
, 0);
6171 /* Apply a preimage specified by "mat" on the parameters of "bset".
6172 * bset is assumed to have only parameters and divs.
6174 static struct isl_basic_set
*basic_set_parameter_preimage(
6175 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6182 bset
->dim
= isl_space_cow(bset
->dim
);
6186 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6188 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6190 bset
->dim
->nparam
= 0;
6191 bset
->dim
->n_out
= nparam
;
6192 bset
= isl_basic_set_preimage(bset
, mat
);
6194 bset
->dim
->nparam
= bset
->dim
->n_out
;
6195 bset
->dim
->n_out
= 0;
6200 isl_basic_set_free(bset
);
6204 /* Apply a preimage specified by "mat" on the parameters of "set".
6205 * set is assumed to have only parameters and divs.
6207 static struct isl_set
*set_parameter_preimage(
6208 struct isl_set
*set
, struct isl_mat
*mat
)
6210 isl_space
*dim
= NULL
;
6216 dim
= isl_space_copy(set
->dim
);
6217 dim
= isl_space_cow(dim
);
6221 nparam
= isl_set_dim(set
, isl_dim_param
);
6223 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6226 dim
->n_out
= nparam
;
6227 isl_set_reset_space(set
, dim
);
6228 set
= isl_set_preimage(set
, mat
);
6231 dim
= isl_space_copy(set
->dim
);
6232 dim
= isl_space_cow(dim
);
6235 dim
->nparam
= dim
->n_out
;
6237 isl_set_reset_space(set
, dim
);
6240 isl_space_free(dim
);
6247 /* Intersect the basic set "bset" with the affine space specified by the
6248 * equalities in "eq".
6250 static struct isl_basic_set
*basic_set_append_equalities(
6251 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6259 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6264 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6265 for (i
= 0; i
< eq
->n_row
; ++i
) {
6266 k
= isl_basic_set_alloc_equality(bset
);
6269 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6270 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6274 bset
= isl_basic_set_gauss(bset
, NULL
);
6275 bset
= isl_basic_set_finalize(bset
);
6280 isl_basic_set_free(bset
);
6284 /* Intersect the set "set" with the affine space specified by the
6285 * equalities in "eq".
6287 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6295 for (i
= 0; i
< set
->n
; ++i
) {
6296 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6309 /* Project the given basic set onto its parameter domain, possibly introducing
6310 * new, explicit, existential variables in the constraints.
6311 * The input has parameters and (possibly implicit) existential variables.
6312 * The output has the same parameters, but only
6313 * explicit existentially quantified variables.
6315 * The actual projection is performed by pip, but pip doesn't seem
6316 * to like equalities very much, so we first remove the equalities
6317 * among the parameters by performing a variable compression on
6318 * the parameters. Afterward, an inverse transformation is performed
6319 * and the equalities among the parameters are inserted back in.
6321 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6325 struct isl_mat
*T
, *T2
;
6326 struct isl_set
*set
;
6327 unsigned nparam
, n_div
;
6329 bset
= isl_basic_set_cow(bset
);
6333 if (bset
->n_eq
== 0)
6334 return isl_basic_set_lexmin(bset
);
6336 isl_basic_set_gauss(bset
, NULL
);
6338 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6339 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6341 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6342 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6345 if (i
== bset
->n_eq
)
6346 return isl_basic_set_lexmin(bset
);
6348 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6350 eq
= isl_mat_cow(eq
);
6351 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6352 if (T
&& T
->n_col
== 0) {
6356 bset
= isl_basic_set_set_to_empty(bset
);
6357 return isl_set_from_basic_set(bset
);
6359 bset
= basic_set_parameter_preimage(bset
, T
);
6361 set
= isl_basic_set_lexmin(bset
);
6362 set
= set_parameter_preimage(set
, T2
);
6363 set
= set_append_equalities(set
, eq
);
6367 /* Compute an explicit representation for all the existentially
6368 * quantified variables.
6369 * The input and output dimensions are first turned into parameters.
6370 * compute_divs then returns a map with the same parameters and
6371 * no input or output dimensions and the dimension specification
6372 * is reset to that of the input.
6374 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6376 struct isl_basic_set
*bset
;
6377 struct isl_set
*set
;
6378 struct isl_map
*map
;
6379 isl_space
*dim
, *orig_dim
= NULL
;
6384 bmap
= isl_basic_map_cow(bmap
);
6388 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6389 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6390 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6391 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6395 orig_dim
= bmap
->dim
;
6397 bset
= (struct isl_basic_set
*)bmap
;
6399 set
= parameter_compute_divs(bset
);
6400 map
= (struct isl_map
*)set
;
6401 map
= isl_map_reset_space(map
, orig_dim
);
6405 isl_basic_map_free(bmap
);
6409 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6417 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6418 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6419 if (isl_int_is_zero(bmap
->div
[i
][0]))
6421 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6427 static int map_divs_known(__isl_keep isl_map
*map
)
6434 for (i
= 0; i
< map
->n
; ++i
) {
6435 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6443 /* If bmap contains any unknown divs, then compute explicit
6444 * expressions for them. However, this computation may be
6445 * quite expensive, so first try to remove divs that aren't
6448 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6451 struct isl_map
*map
;
6453 known
= isl_basic_map_divs_known(bmap
);
6457 return isl_map_from_basic_map(bmap
);
6459 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6461 known
= isl_basic_map_divs_known(bmap
);
6465 return isl_map_from_basic_map(bmap
);
6467 map
= compute_divs(bmap
);
6470 isl_basic_map_free(bmap
);
6474 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6478 struct isl_map
*res
;
6485 known
= map_divs_known(map
);
6493 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6494 for (i
= 1 ; i
< map
->n
; ++i
) {
6496 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6497 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6498 res
= isl_map_union_disjoint(res
, r2
);
6500 res
= isl_map_union(res
, r2
);
6507 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6509 return (struct isl_set
*)
6510 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6513 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6515 return (struct isl_set
*)
6516 isl_map_compute_divs((struct isl_map
*)set
);
6519 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6522 struct isl_set
*set
;
6527 map
= isl_map_cow(map
);
6531 set
= (struct isl_set
*)map
;
6532 set
->dim
= isl_space_domain(set
->dim
);
6535 for (i
= 0; i
< map
->n
; ++i
) {
6536 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6540 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6541 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6548 /* Return the union of "map1" and "map2", where we assume for now that
6549 * "map1" and "map2" are disjoint. Note that the basic maps inside
6550 * "map1" or "map2" may not be disjoint from each other.
6551 * Also note that this function is also called from isl_map_union,
6552 * which takes care of handling the situation where "map1" and "map2"
6553 * may not be disjoint.
6555 * If one of the inputs is empty, we can simply return the other input.
6556 * Similarly, if one of the inputs is universal, then it is equal to the union.
6558 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6559 __isl_take isl_map
*map2
)
6563 struct isl_map
*map
= NULL
;
6578 is_universe
= isl_map_plain_is_universe(map1
);
6579 if (is_universe
< 0)
6586 is_universe
= isl_map_plain_is_universe(map2
);
6587 if (is_universe
< 0)
6594 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6596 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6597 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6598 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6600 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6601 map1
->n
+ map2
->n
, flags
);
6604 for (i
= 0; i
< map1
->n
; ++i
) {
6605 map
= isl_map_add_basic_map(map
,
6606 isl_basic_map_copy(map1
->p
[i
]));
6610 for (i
= 0; i
< map2
->n
; ++i
) {
6611 map
= isl_map_add_basic_map(map
,
6612 isl_basic_map_copy(map2
->p
[i
]));
6626 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6627 __isl_take isl_map
*map2
)
6629 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6632 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6634 map1
= isl_map_union_disjoint(map1
, map2
);
6638 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6642 struct isl_set
*isl_set_union_disjoint(
6643 struct isl_set
*set1
, struct isl_set
*set2
)
6645 return (struct isl_set
*)
6646 isl_map_union_disjoint(
6647 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6650 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6652 return (struct isl_set
*)
6653 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6656 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6659 * "map" and "set" are assumed to be compatible and non-NULL.
6661 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6662 __isl_take isl_set
*set
,
6663 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6664 __isl_take isl_basic_set
*bset
))
6667 struct isl_map
*result
;
6670 if (isl_set_plain_is_universe(set
)) {
6675 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6676 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6677 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6679 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6680 map
->n
* set
->n
, flags
);
6681 for (i
= 0; result
&& i
< map
->n
; ++i
)
6682 for (j
= 0; j
< set
->n
; ++j
) {
6683 result
= isl_map_add_basic_map(result
,
6684 fn(isl_basic_map_copy(map
->p
[i
]),
6685 isl_basic_set_copy(set
->p
[j
])));
6695 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6696 __isl_take isl_set
*set
)
6701 if (!isl_map_compatible_range(map
, set
))
6702 isl_die(set
->ctx
, isl_error_invalid
,
6703 "incompatible spaces", goto error
);
6705 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6712 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6713 __isl_take isl_set
*set
)
6715 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6718 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
6719 __isl_take isl_set
*set
)
6724 if (!isl_map_compatible_domain(map
, set
))
6725 isl_die(set
->ctx
, isl_error_invalid
,
6726 "incompatible spaces", goto error
);
6728 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
6735 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
6736 __isl_take isl_set
*set
)
6738 return isl_map_align_params_map_map_and(map
, set
,
6739 &map_intersect_domain
);
6742 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6743 __isl_take isl_map
*map2
)
6747 map1
= isl_map_reverse(map1
);
6748 map1
= isl_map_apply_range(map1
, map2
);
6749 return isl_map_reverse(map1
);
6756 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6757 __isl_take isl_map
*map2
)
6759 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6762 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6763 __isl_take isl_map
*map2
)
6765 isl_space
*dim_result
;
6766 struct isl_map
*result
;
6772 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6773 isl_space_copy(map2
->dim
));
6775 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6778 for (i
= 0; i
< map1
->n
; ++i
)
6779 for (j
= 0; j
< map2
->n
; ++j
) {
6780 result
= isl_map_add_basic_map(result
,
6781 isl_basic_map_apply_range(
6782 isl_basic_map_copy(map1
->p
[i
]),
6783 isl_basic_map_copy(map2
->p
[j
])));
6789 if (result
&& result
->n
<= 1)
6790 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6798 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6799 __isl_take isl_map
*map2
)
6801 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6805 * returns range - domain
6807 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6809 isl_space
*dims
, *target_dim
;
6810 struct isl_basic_set
*bset
;
6817 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6818 bmap
->dim
, isl_dim_out
),
6820 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6821 dim
= isl_basic_map_n_in(bmap
);
6822 nparam
= isl_basic_map_n_param(bmap
);
6823 bset
= isl_basic_set_from_basic_map(bmap
);
6824 bset
= isl_basic_set_cow(bset
);
6825 dims
= isl_basic_set_get_space(bset
);
6826 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6827 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6828 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6829 for (i
= 0; i
< dim
; ++i
) {
6830 int j
= isl_basic_map_alloc_equality(
6831 (struct isl_basic_map
*)bset
);
6833 bset
= isl_basic_set_free(bset
);
6836 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6837 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6838 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6839 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6841 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6842 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6845 isl_basic_map_free(bmap
);
6850 * returns range - domain
6852 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6856 struct isl_set
*result
;
6861 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6862 map
->dim
, isl_dim_out
),
6864 dim
= isl_map_get_space(map
);
6865 dim
= isl_space_domain(dim
);
6866 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6869 for (i
= 0; i
< map
->n
; ++i
)
6870 result
= isl_set_add_basic_set(result
,
6871 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6880 * returns [domain -> range] -> range - domain
6882 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6883 __isl_take isl_basic_map
*bmap
)
6887 isl_basic_map
*domain
;
6891 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6892 isl_die(bmap
->ctx
, isl_error_invalid
,
6893 "domain and range don't match", goto error
);
6895 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6896 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6898 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6899 domain
= isl_basic_map_universe(dim
);
6901 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6902 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6903 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6905 total
= isl_basic_map_total_dim(bmap
);
6907 for (i
= 0; i
< n
; ++i
) {
6908 k
= isl_basic_map_alloc_equality(bmap
);
6911 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6912 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6913 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6914 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6917 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6918 return isl_basic_map_finalize(bmap
);
6920 isl_basic_map_free(bmap
);
6925 * returns [domain -> range] -> range - domain
6927 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6930 isl_space
*domain_dim
;
6935 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6936 isl_die(map
->ctx
, isl_error_invalid
,
6937 "domain and range don't match", goto error
);
6939 map
= isl_map_cow(map
);
6943 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6944 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6945 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6948 for (i
= 0; i
< map
->n
; ++i
) {
6949 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6953 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6960 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6962 struct isl_basic_map
*bmap
;
6970 nparam
= dims
->nparam
;
6972 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6976 for (i
= 0; i
< dim
; ++i
) {
6977 int j
= isl_basic_map_alloc_equality(bmap
);
6980 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6981 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6982 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6984 return isl_basic_map_finalize(bmap
);
6986 isl_basic_map_free(bmap
);
6990 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6994 if (dim
->n_in
!= dim
->n_out
)
6995 isl_die(dim
->ctx
, isl_error_invalid
,
6996 "number of input and output dimensions needs to be "
6997 "the same", goto error
);
6998 return basic_map_identity(dim
);
7000 isl_space_free(dim
);
7004 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7006 if (!model
|| !model
->dim
)
7008 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7011 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7013 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7016 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7018 if (!model
|| !model
->dim
)
7020 return isl_map_identity(isl_space_copy(model
->dim
));
7023 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7025 if (!model
|| !model
->dim
)
7027 return isl_map_identity(isl_space_copy(model
->dim
));
7030 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7032 isl_space
*dim
= isl_set_get_space(set
);
7034 id
= isl_map_identity(isl_space_map_from_set(dim
));
7035 return isl_map_intersect_range(id
, set
);
7038 /* Construct a basic set with all set dimensions having only non-negative
7041 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7042 __isl_take isl_space
*space
)
7047 struct isl_basic_set
*bset
;
7051 nparam
= space
->nparam
;
7053 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7056 for (i
= 0; i
< dim
; ++i
) {
7057 int k
= isl_basic_set_alloc_inequality(bset
);
7060 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7061 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7065 isl_basic_set_free(bset
);
7069 /* Construct the half-space x_pos >= 0.
7071 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7075 isl_basic_set
*nonneg
;
7077 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7078 k
= isl_basic_set_alloc_inequality(nonneg
);
7081 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7082 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7084 return isl_basic_set_finalize(nonneg
);
7086 isl_basic_set_free(nonneg
);
7090 /* Construct the half-space x_pos <= -1.
7092 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7097 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7098 k
= isl_basic_set_alloc_inequality(neg
);
7101 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7102 isl_int_set_si(neg
->ineq
[k
][0], -1);
7103 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7105 return isl_basic_set_finalize(neg
);
7107 isl_basic_set_free(neg
);
7111 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7112 enum isl_dim_type type
, unsigned first
, unsigned n
)
7115 isl_basic_set
*nonneg
;
7123 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7125 for (i
= 0; i
< n
; ++i
) {
7126 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7127 pos(set
->dim
, type
) + first
+ i
);
7128 neg
= neg_halfspace(isl_set_get_space(set
),
7129 pos(set
->dim
, type
) + first
+ i
);
7131 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7140 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7141 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7148 if (isl_set_plain_is_empty(set
)) {
7153 return fn(set
, signs
, user
);
7156 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7158 half
= isl_set_intersect(half
, isl_set_copy(set
));
7159 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7163 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7165 half
= isl_set_intersect(half
, set
);
7166 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7172 /* Call "fn" on the intersections of "set" with each of the orthants
7173 * (except for obviously empty intersections). The orthant is identified
7174 * by the signs array, with each entry having value 1 or -1 according
7175 * to the sign of the corresponding variable.
7177 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7178 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7188 if (isl_set_plain_is_empty(set
))
7191 nparam
= isl_set_dim(set
, isl_dim_param
);
7192 nvar
= isl_set_dim(set
, isl_dim_set
);
7194 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7196 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7204 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7206 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7209 int isl_basic_map_is_subset(
7210 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7213 struct isl_map
*map1
;
7214 struct isl_map
*map2
;
7216 if (!bmap1
|| !bmap2
)
7219 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7220 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7222 is_subset
= isl_map_is_subset(map1
, map2
);
7230 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7231 __isl_keep isl_basic_set
*bset2
)
7233 return isl_basic_map_is_subset(bset1
, bset2
);
7236 int isl_basic_map_is_equal(
7237 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7241 if (!bmap1
|| !bmap2
)
7243 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7246 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7250 int isl_basic_set_is_equal(
7251 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7253 return isl_basic_map_is_equal(
7254 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7257 int isl_map_is_empty(struct isl_map
*map
)
7264 for (i
= 0; i
< map
->n
; ++i
) {
7265 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7274 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7276 return map
? map
->n
== 0 : -1;
7279 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7281 return isl_map_plain_is_empty(map
);
7284 int isl_set_plain_is_empty(struct isl_set
*set
)
7286 return set
? set
->n
== 0 : -1;
7289 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7291 return isl_set_plain_is_empty(set
);
7294 int isl_set_is_empty(struct isl_set
*set
)
7296 return isl_map_is_empty((struct isl_map
*)set
);
7299 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7304 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7307 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7312 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7315 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7321 is_subset
= isl_map_is_subset(map1
, map2
);
7324 is_subset
= isl_map_is_subset(map2
, map1
);
7328 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7330 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7333 int isl_basic_map_is_strict_subset(
7334 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7338 if (!bmap1
|| !bmap2
)
7340 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7343 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7344 if (is_subset
== -1)
7349 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7355 is_subset
= isl_map_is_subset(map1
, map2
);
7358 is_subset
= isl_map_is_subset(map2
, map1
);
7359 if (is_subset
== -1)
7364 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7366 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7369 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7373 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7376 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7380 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7383 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7390 for (i
= 0; i
< map
->n
; ++i
) {
7391 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7399 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7401 return isl_map_plain_is_universe((isl_map
*) set
);
7404 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7406 return isl_set_plain_is_universe(set
);
7409 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7411 struct isl_basic_set
*bset
= NULL
;
7412 struct isl_vec
*sample
= NULL
;
7419 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7422 if (isl_basic_map_is_universe(bmap
))
7425 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7426 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7427 copy
= isl_basic_map_remove_redundancies(copy
);
7428 empty
= isl_basic_map_plain_is_empty(copy
);
7429 isl_basic_map_free(copy
);
7433 total
= 1 + isl_basic_map_total_dim(bmap
);
7434 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7435 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7441 isl_vec_free(bmap
->sample
);
7442 bmap
->sample
= NULL
;
7443 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7446 sample
= isl_basic_set_sample_vec(bset
);
7449 empty
= sample
->size
== 0;
7450 isl_vec_free(bmap
->sample
);
7451 bmap
->sample
= sample
;
7453 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7458 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7462 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7465 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7467 return isl_basic_map_plain_is_empty(bmap
);
7470 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7474 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7477 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7479 return isl_basic_set_plain_is_empty(bset
);
7482 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7484 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7487 struct isl_map
*isl_basic_map_union(
7488 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7490 struct isl_map
*map
;
7491 if (!bmap1
|| !bmap2
)
7494 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7496 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7499 map
= isl_map_add_basic_map(map
, bmap1
);
7500 map
= isl_map_add_basic_map(map
, bmap2
);
7503 isl_basic_map_free(bmap1
);
7504 isl_basic_map_free(bmap2
);
7508 struct isl_set
*isl_basic_set_union(
7509 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7511 return (struct isl_set
*)isl_basic_map_union(
7512 (struct isl_basic_map
*)bset1
,
7513 (struct isl_basic_map
*)bset2
);
7516 /* Order divs such that any div only depends on previous divs */
7517 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7525 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7527 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7529 if (isl_int_is_zero(bmap
->div
[i
][0]))
7531 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7535 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7541 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7543 return (struct isl_basic_set
*)
7544 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7547 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7554 for (i
= 0; i
< map
->n
; ++i
) {
7555 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7566 /* Apply the expansion computed by isl_merge_divs.
7567 * The expansion itself is given by "exp" while the resulting
7568 * list of divs is given by "div".
7570 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7571 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7576 bset
= isl_basic_set_cow(bset
);
7580 if (div
->n_row
< bset
->n_div
)
7581 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7582 "not an expansion", goto error
);
7584 n_div
= bset
->n_div
;
7585 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7586 div
->n_row
- n_div
, 0,
7587 2 * (div
->n_row
- n_div
));
7589 for (i
= n_div
; i
< div
->n_row
; ++i
)
7590 if (isl_basic_set_alloc_div(bset
) < 0)
7594 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7595 if (j
>= 0 && exp
[j
] == i
) {
7597 isl_basic_map_swap_div(bset
, i
, j
);
7600 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7601 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7609 isl_basic_set_free(bset
);
7614 /* Look for a div in dst that corresponds to the div "div" in src.
7615 * The divs before "div" in src and dst are assumed to be the same.
7617 * Returns -1 if no corresponding div was found and the position
7618 * of the corresponding div in dst otherwise.
7620 static int find_div(struct isl_basic_map
*dst
,
7621 struct isl_basic_map
*src
, unsigned div
)
7625 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7627 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7628 for (i
= div
; i
< dst
->n_div
; ++i
)
7629 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7630 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7631 dst
->n_div
- div
) == -1)
7636 struct isl_basic_map
*isl_basic_map_align_divs(
7637 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7645 if (src
->n_div
== 0)
7648 for (i
= 0; i
< src
->n_div
; ++i
)
7649 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7651 src
= isl_basic_map_order_divs(src
);
7652 dst
= isl_basic_map_cow(dst
);
7653 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7654 src
->n_div
, 0, 2 * src
->n_div
);
7657 total
= isl_space_dim(src
->dim
, isl_dim_all
);
7658 for (i
= 0; i
< src
->n_div
; ++i
) {
7659 int j
= find_div(dst
, src
, i
);
7661 j
= isl_basic_map_alloc_div(dst
);
7664 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7665 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7666 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7670 isl_basic_map_swap_div(dst
, i
, j
);
7674 isl_basic_map_free(dst
);
7678 struct isl_basic_set
*isl_basic_set_align_divs(
7679 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7681 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7682 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7685 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7693 map
= isl_map_compute_divs(map
);
7694 map
= isl_map_cow(map
);
7698 for (i
= 1; i
< map
->n
; ++i
)
7699 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7700 for (i
= 1; i
< map
->n
; ++i
)
7701 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7703 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7707 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7709 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7712 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7713 __isl_take isl_map
*map
)
7717 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7718 map
= isl_map_intersect_domain(map
, set
);
7719 set
= isl_map_range(map
);
7727 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7728 __isl_take isl_map
*map
)
7730 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7733 /* There is no need to cow as removing empty parts doesn't change
7734 * the meaning of the set.
7736 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7743 for (i
= map
->n
- 1; i
>= 0; --i
)
7744 remove_if_empty(map
, i
);
7749 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7751 return (struct isl_set
*)
7752 isl_map_remove_empty_parts((struct isl_map
*)set
);
7755 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7757 struct isl_basic_map
*bmap
;
7758 if (!map
|| map
->n
== 0)
7760 bmap
= map
->p
[map
->n
-1];
7761 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7762 return isl_basic_map_copy(bmap
);
7765 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7767 return (struct isl_basic_set
*)
7768 isl_map_copy_basic_map((struct isl_map
*)set
);
7771 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7772 __isl_keep isl_basic_map
*bmap
)
7778 for (i
= map
->n
-1; i
>= 0; --i
) {
7779 if (map
->p
[i
] != bmap
)
7781 map
= isl_map_cow(map
);
7784 isl_basic_map_free(map
->p
[i
]);
7785 if (i
!= map
->n
-1) {
7786 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7787 map
->p
[i
] = map
->p
[map
->n
-1];
7798 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7799 struct isl_basic_set
*bset
)
7801 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7802 (struct isl_basic_map
*)bset
);
7805 /* Given two basic sets bset1 and bset2, compute the maximal difference
7806 * between the values of dimension pos in bset1 and those in bset2
7807 * for any common value of the parameters and dimensions preceding pos.
7809 static enum isl_lp_result
basic_set_maximal_difference_at(
7810 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7811 int pos
, isl_int
*opt
)
7814 struct isl_basic_map
*bmap1
= NULL
;
7815 struct isl_basic_map
*bmap2
= NULL
;
7816 struct isl_ctx
*ctx
;
7817 struct isl_vec
*obj
;
7820 unsigned dim1
, dim2
;
7821 enum isl_lp_result res
;
7823 if (!bset1
|| !bset2
)
7824 return isl_lp_error
;
7826 nparam
= isl_basic_set_n_param(bset1
);
7827 dim1
= isl_basic_set_n_dim(bset1
);
7828 dim2
= isl_basic_set_n_dim(bset2
);
7829 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7830 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7831 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7832 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7833 if (!bmap1
|| !bmap2
)
7835 bmap1
= isl_basic_map_cow(bmap1
);
7836 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7837 pos
, (dim1
- pos
) + (dim2
- pos
),
7838 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7839 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7842 total
= isl_basic_map_total_dim(bmap1
);
7844 obj
= isl_vec_alloc(ctx
, 1 + total
);
7847 isl_seq_clr(obj
->block
.data
, 1 + total
);
7848 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7849 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7850 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7852 isl_basic_map_free(bmap1
);
7856 isl_basic_map_free(bmap2
);
7858 isl_basic_map_free(bmap1
);
7859 return isl_lp_error
;
7862 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7863 * for any common value of the parameters and dimensions preceding pos
7864 * in both basic sets, the values of dimension pos in bset1 are
7865 * smaller or larger than those in bset2.
7868 * 1 if bset1 follows bset2
7869 * -1 if bset1 precedes bset2
7870 * 0 if bset1 and bset2 are incomparable
7871 * -2 if some error occurred.
7873 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7874 struct isl_basic_set
*bset2
, int pos
)
7877 enum isl_lp_result res
;
7882 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7884 if (res
== isl_lp_empty
)
7886 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7887 res
== isl_lp_unbounded
)
7889 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7898 /* Given two basic sets bset1 and bset2, check whether
7899 * for any common value of the parameters and dimensions preceding pos
7900 * there is a value of dimension pos in bset1 that is larger
7901 * than a value of the same dimension in bset2.
7904 * 1 if there exists such a pair
7905 * 0 if there is no such pair, but there is a pair of equal values
7907 * -2 if some error occurred.
7909 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7910 __isl_keep isl_basic_set
*bset2
, int pos
)
7913 enum isl_lp_result res
;
7918 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7920 if (res
== isl_lp_empty
)
7922 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7923 res
== isl_lp_unbounded
)
7925 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7927 else if (res
== isl_lp_ok
)
7936 /* Given two sets set1 and set2, check whether
7937 * for any common value of the parameters and dimensions preceding pos
7938 * there is a value of dimension pos in set1 that is larger
7939 * than a value of the same dimension in set2.
7942 * 1 if there exists such a pair
7943 * 0 if there is no such pair, but there is a pair of equal values
7945 * -2 if some error occurred.
7947 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7948 __isl_keep isl_set
*set2
, int pos
)
7956 for (i
= 0; i
< set1
->n
; ++i
)
7957 for (j
= 0; j
< set2
->n
; ++j
) {
7959 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7960 if (f
== 1 || f
== -2)
7969 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7970 unsigned pos
, isl_int
*val
)
7978 total
= isl_basic_map_total_dim(bmap
);
7979 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7980 for (; d
+1 > pos
; --d
)
7981 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7985 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7987 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7989 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7992 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7998 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7999 unsigned pos
, isl_int
*val
)
8011 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8014 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8015 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8016 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8017 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8021 isl_int_set(*val
, v
);
8027 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8028 unsigned pos
, isl_int
*val
)
8030 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8034 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8037 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8040 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8041 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8043 if (pos
>= isl_basic_map_dim(bmap
, type
))
8045 return isl_basic_map_plain_has_fixed_var(bmap
,
8046 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8049 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8050 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8052 if (pos
>= isl_map_dim(map
, type
))
8054 return isl_map_plain_has_fixed_var(map
,
8055 map_offset(map
, type
) - 1 + pos
, val
);
8058 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8059 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8061 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8064 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8065 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8067 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8070 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8071 * then return this fixed value in *val.
8073 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8074 unsigned dim
, isl_int
*val
)
8076 return isl_basic_set_plain_has_fixed_var(bset
,
8077 isl_basic_set_n_param(bset
) + dim
, val
);
8080 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8081 * then return this fixed value in *val.
8083 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8084 unsigned dim
, isl_int
*val
)
8086 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8089 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8090 unsigned dim
, isl_int
*val
)
8092 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8095 /* Check if input variable in has fixed value and if so and if val is not NULL,
8096 * then return this fixed value in *val.
8098 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8099 unsigned in
, isl_int
*val
)
8101 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8104 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8105 * and if val is not NULL, then return this lower bound in *val.
8107 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8108 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8110 int i
, i_eq
= -1, i_ineq
= -1;
8117 total
= isl_basic_set_total_dim(bset
);
8118 nparam
= isl_basic_set_n_param(bset
);
8119 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8120 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8126 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8127 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8129 if (i_eq
!= -1 || i_ineq
!= -1)
8133 if (i_eq
== -1 && i_ineq
== -1)
8135 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8136 /* The coefficient should always be one due to normalization. */
8137 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8139 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8141 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8142 total
- nparam
- dim
- 1) != -1)
8145 isl_int_neg(*val
, c
[0]);
8149 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8150 unsigned dim
, isl_int
*val
)
8162 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8166 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8168 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8169 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8171 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8175 isl_int_set(*val
, v
);
8186 /* uset_gist depends on constraints without existentially quantified
8187 * variables sorting first.
8189 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8191 const struct constraint
*c1
= (const struct constraint
*)p1
;
8192 const struct constraint
*c2
= (const struct constraint
*)p2
;
8194 unsigned size
= isl_min(c1
->size
, c2
->size
);
8196 l1
= isl_seq_last_non_zero(c1
->c
, size
);
8197 l2
= isl_seq_last_non_zero(c2
->c
, size
);
8202 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
8205 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8206 struct isl_basic_map
*bmap
)
8209 struct constraint
*c
;
8214 total
= isl_basic_map_total_dim(bmap
);
8215 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8218 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8220 c
[i
].c
= bmap
->ineq
[i
];
8222 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8223 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8224 bmap
->ineq
[i
] = c
[i
].c
;
8228 isl_basic_map_free(bmap
);
8232 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8233 __isl_take isl_basic_set
*bset
)
8235 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8236 (struct isl_basic_map
*)bset
);
8239 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8243 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8245 bmap
= isl_basic_map_remove_redundancies(bmap
);
8246 bmap
= isl_basic_map_sort_constraints(bmap
);
8248 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8252 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8254 return (struct isl_basic_set
*)isl_basic_map_normalize(
8255 (struct isl_basic_map
*)bset
);
8258 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8259 const __isl_keep isl_basic_map
*bmap2
)
8266 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8267 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8268 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8269 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8270 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8271 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8272 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8273 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8274 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8275 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8276 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8278 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8280 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8282 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8283 return bmap1
->n_eq
- bmap2
->n_eq
;
8284 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8285 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8286 if (bmap1
->n_div
!= bmap2
->n_div
)
8287 return bmap1
->n_div
- bmap2
->n_div
;
8288 total
= isl_basic_map_total_dim(bmap1
);
8289 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8290 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8294 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8295 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8299 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8300 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8307 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8308 const __isl_keep isl_basic_set
*bset2
)
8310 return isl_basic_map_plain_cmp(bset1
, bset2
);
8313 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8319 if (set1
->n
!= set2
->n
)
8320 return set1
->n
- set2
->n
;
8322 for (i
= 0; i
< set1
->n
; ++i
) {
8323 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8331 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8332 __isl_keep isl_basic_map
*bmap2
)
8334 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8337 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8338 __isl_keep isl_basic_set
*bset2
)
8340 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8341 (isl_basic_map
*)bset2
);
8344 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8346 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8347 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8349 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8352 /* We normalize in place, but if anything goes wrong we need
8353 * to return NULL, so we need to make sure we don't change the
8354 * meaning of any possible other copies of map.
8356 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8359 struct isl_basic_map
*bmap
;
8363 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8365 for (i
= 0; i
< map
->n
; ++i
) {
8366 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8369 isl_basic_map_free(map
->p
[i
]);
8372 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8373 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8374 map
= isl_map_remove_empty_parts(map
);
8377 for (i
= map
->n
- 1; i
>= 1; --i
) {
8378 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8380 isl_basic_map_free(map
->p
[i
-1]);
8381 for (j
= i
; j
< map
->n
; ++j
)
8382 map
->p
[j
-1] = map
->p
[j
];
8392 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8394 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8397 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8407 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8410 map1
= isl_map_copy(map1
);
8411 map2
= isl_map_copy(map2
);
8412 map1
= isl_map_normalize(map1
);
8413 map2
= isl_map_normalize(map2
);
8416 equal
= map1
->n
== map2
->n
;
8417 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8418 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8431 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8433 return isl_map_plain_is_equal(map1
, map2
);
8436 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8438 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8439 (struct isl_map
*)set2
);
8442 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8444 return isl_set_plain_is_equal(set1
, set2
);
8447 /* Return an interval that ranges from min to max (inclusive)
8449 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8450 isl_int min
, isl_int max
)
8453 struct isl_basic_set
*bset
= NULL
;
8455 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8459 k
= isl_basic_set_alloc_inequality(bset
);
8462 isl_int_set_si(bset
->ineq
[k
][1], 1);
8463 isl_int_neg(bset
->ineq
[k
][0], min
);
8465 k
= isl_basic_set_alloc_inequality(bset
);
8468 isl_int_set_si(bset
->ineq
[k
][1], -1);
8469 isl_int_set(bset
->ineq
[k
][0], max
);
8473 isl_basic_set_free(bset
);
8477 /* Return the Cartesian product of the basic sets in list (in the given order).
8479 __isl_give isl_basic_set
*isl_basic_set_list_product(
8480 __isl_take
struct isl_basic_set_list
*list
)
8488 struct isl_basic_set
*product
= NULL
;
8492 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8493 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8494 nparam
= isl_basic_set_n_param(list
->p
[0]);
8495 dim
= isl_basic_set_n_dim(list
->p
[0]);
8496 extra
= list
->p
[0]->n_div
;
8497 n_eq
= list
->p
[0]->n_eq
;
8498 n_ineq
= list
->p
[0]->n_ineq
;
8499 for (i
= 1; i
< list
->n
; ++i
) {
8500 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8501 isl_assert(list
->ctx
,
8502 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8503 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8504 extra
+= list
->p
[i
]->n_div
;
8505 n_eq
+= list
->p
[i
]->n_eq
;
8506 n_ineq
+= list
->p
[i
]->n_ineq
;
8508 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8513 for (i
= 0; i
< list
->n
; ++i
) {
8514 isl_basic_set_add_constraints(product
,
8515 isl_basic_set_copy(list
->p
[i
]), dim
);
8516 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8518 isl_basic_set_list_free(list
);
8521 isl_basic_set_free(product
);
8522 isl_basic_set_list_free(list
);
8526 struct isl_basic_map
*isl_basic_map_product(
8527 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8529 isl_space
*dim_result
= NULL
;
8530 struct isl_basic_map
*bmap
;
8531 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8532 struct isl_dim_map
*dim_map1
, *dim_map2
;
8534 if (!bmap1
|| !bmap2
)
8537 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8538 bmap2
->dim
, isl_dim_param
), goto error
);
8539 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8540 isl_space_copy(bmap2
->dim
));
8542 in1
= isl_basic_map_n_in(bmap1
);
8543 in2
= isl_basic_map_n_in(bmap2
);
8544 out1
= isl_basic_map_n_out(bmap1
);
8545 out2
= isl_basic_map_n_out(bmap2
);
8546 nparam
= isl_basic_map_n_param(bmap1
);
8548 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8549 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8550 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8551 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8552 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8553 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8554 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8555 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8556 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8557 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8558 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8560 bmap
= isl_basic_map_alloc_space(dim_result
,
8561 bmap1
->n_div
+ bmap2
->n_div
,
8562 bmap1
->n_eq
+ bmap2
->n_eq
,
8563 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8564 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8565 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8566 bmap
= isl_basic_map_simplify(bmap
);
8567 return isl_basic_map_finalize(bmap
);
8569 isl_basic_map_free(bmap1
);
8570 isl_basic_map_free(bmap2
);
8574 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8575 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8577 isl_basic_map
*prod
;
8579 prod
= isl_basic_map_product(bmap1
, bmap2
);
8580 prod
= isl_basic_map_flatten(prod
);
8584 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8585 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8587 return isl_basic_map_flat_range_product(bset1
, bset2
);
8590 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8591 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8593 isl_space
*space_result
= NULL
;
8594 isl_basic_map
*bmap
;
8595 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8596 struct isl_dim_map
*dim_map1
, *dim_map2
;
8598 if (!bmap1
|| !bmap2
)
8601 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8602 isl_space_copy(bmap2
->dim
));
8604 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8605 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8606 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8607 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8609 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8610 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8611 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8612 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8613 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8614 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8615 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8616 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8617 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8618 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8619 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8621 bmap
= isl_basic_map_alloc_space(space_result
,
8622 bmap1
->n_div
+ bmap2
->n_div
,
8623 bmap1
->n_eq
+ bmap2
->n_eq
,
8624 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8625 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8626 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8627 bmap
= isl_basic_map_simplify(bmap
);
8628 return isl_basic_map_finalize(bmap
);
8630 isl_basic_map_free(bmap1
);
8631 isl_basic_map_free(bmap2
);
8635 __isl_give isl_basic_map
*isl_basic_map_range_product(
8636 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8638 isl_space
*dim_result
= NULL
;
8639 isl_basic_map
*bmap
;
8640 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8641 struct isl_dim_map
*dim_map1
, *dim_map2
;
8643 if (!bmap1
|| !bmap2
)
8646 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8647 bmap2
->dim
, isl_dim_param
))
8648 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8649 "parameters don't match", goto error
);
8651 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8652 isl_space_copy(bmap2
->dim
));
8654 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8655 out1
= isl_basic_map_n_out(bmap1
);
8656 out2
= isl_basic_map_n_out(bmap2
);
8657 nparam
= isl_basic_map_n_param(bmap1
);
8659 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8660 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8661 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8662 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8663 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8664 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8665 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8666 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8667 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8668 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8669 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8671 bmap
= isl_basic_map_alloc_space(dim_result
,
8672 bmap1
->n_div
+ bmap2
->n_div
,
8673 bmap1
->n_eq
+ bmap2
->n_eq
,
8674 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8675 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8676 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8677 bmap
= isl_basic_map_simplify(bmap
);
8678 return isl_basic_map_finalize(bmap
);
8680 isl_basic_map_free(bmap1
);
8681 isl_basic_map_free(bmap2
);
8685 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8686 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8688 isl_basic_map
*prod
;
8690 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8691 prod
= isl_basic_map_flatten_range(prod
);
8695 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8696 __isl_take isl_map
*map2
,
8697 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8698 __isl_take isl_space
*right
),
8699 __isl_give isl_basic_map
*(*basic_map_product
)(
8700 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8703 struct isl_map
*result
;
8709 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8710 map2
->dim
, isl_dim_param
), goto error
);
8712 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8713 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8714 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8716 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8717 isl_space_copy(map2
->dim
)),
8718 map1
->n
* map2
->n
, flags
);
8721 for (i
= 0; i
< map1
->n
; ++i
)
8722 for (j
= 0; j
< map2
->n
; ++j
) {
8723 struct isl_basic_map
*part
;
8724 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8725 isl_basic_map_copy(map2
->p
[j
]));
8726 if (isl_basic_map_is_empty(part
))
8727 isl_basic_map_free(part
);
8729 result
= isl_map_add_basic_map(result
, part
);
8742 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8744 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8745 __isl_take isl_map
*map2
)
8747 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8750 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8751 __isl_take isl_map
*map2
)
8753 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8756 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8758 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8759 __isl_take isl_map
*map2
)
8763 prod
= isl_map_product(map1
, map2
);
8764 prod
= isl_map_flatten(prod
);
8768 /* Given two set A and B, construct its Cartesian product A x B.
8770 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8772 return isl_map_range_product(set1
, set2
);
8775 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8776 __isl_take isl_set
*set2
)
8778 return isl_map_flat_range_product(set1
, set2
);
8781 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8783 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8784 __isl_take isl_map
*map2
)
8786 return map_product(map1
, map2
, &isl_space_domain_product
,
8787 &isl_basic_map_domain_product
);
8790 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8792 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8793 __isl_take isl_map
*map2
)
8795 return map_product(map1
, map2
, &isl_space_range_product
,
8796 &isl_basic_map_range_product
);
8799 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8800 __isl_take isl_map
*map2
)
8802 return isl_map_align_params_map_map_and(map1
, map2
,
8803 &map_domain_product_aligned
);
8806 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8807 __isl_take isl_map
*map2
)
8809 return isl_map_align_params_map_map_and(map1
, map2
,
8810 &map_range_product_aligned
);
8813 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8815 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8816 __isl_take isl_map
*map2
)
8820 prod
= isl_map_domain_product(map1
, map2
);
8821 prod
= isl_map_flatten_domain(prod
);
8825 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8827 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8828 __isl_take isl_map
*map2
)
8832 prod
= isl_map_range_product(map1
, map2
);
8833 prod
= isl_map_flatten_range(prod
);
8837 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8840 uint32_t hash
= isl_hash_init();
8845 bmap
= isl_basic_map_copy(bmap
);
8846 bmap
= isl_basic_map_normalize(bmap
);
8849 total
= isl_basic_map_total_dim(bmap
);
8850 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8851 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8853 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8854 isl_hash_hash(hash
, c_hash
);
8856 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8857 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8859 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8860 isl_hash_hash(hash
, c_hash
);
8862 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8863 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8865 if (isl_int_is_zero(bmap
->div
[i
][0]))
8867 isl_hash_byte(hash
, i
& 0xFF);
8868 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8869 isl_hash_hash(hash
, c_hash
);
8871 isl_basic_map_free(bmap
);
8875 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8877 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8880 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8887 map
= isl_map_copy(map
);
8888 map
= isl_map_normalize(map
);
8892 hash
= isl_hash_init();
8893 for (i
= 0; i
< map
->n
; ++i
) {
8895 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8896 isl_hash_hash(hash
, bmap_hash
);
8904 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8906 return isl_map_get_hash((isl_map
*)set
);
8909 /* Check if the value for dimension dim is completely determined
8910 * by the values of the other parameters and variables.
8911 * That is, check if dimension dim is involved in an equality.
8913 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8920 nparam
= isl_basic_set_n_param(bset
);
8921 for (i
= 0; i
< bset
->n_eq
; ++i
)
8922 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8927 /* Check if the value for dimension dim is completely determined
8928 * by the values of the other parameters and variables.
8929 * That is, check if dimension dim is involved in an equality
8930 * for each of the subsets.
8932 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8938 for (i
= 0; i
< set
->n
; ++i
) {
8940 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8947 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8949 return set
? set
->n
: 0;
8952 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8953 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8960 for (i
= 0; i
< map
->n
; ++i
)
8961 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8967 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8968 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8975 for (i
= 0; i
< set
->n
; ++i
)
8976 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8982 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8989 bset
= isl_basic_set_cow(bset
);
8993 dim
= isl_basic_set_get_space(bset
);
8994 dim
= isl_space_lift(dim
, bset
->n_div
);
8997 isl_space_free(bset
->dim
);
8999 bset
->extra
-= bset
->n_div
;
9002 bset
= isl_basic_set_finalize(bset
);
9006 isl_basic_set_free(bset
);
9010 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9016 set
= isl_set_align_divs(set
);
9021 set
= isl_set_cow(set
);
9025 n_div
= set
->p
[0]->n_div
;
9026 dim
= isl_set_get_space(set
);
9027 dim
= isl_space_lift(dim
, n_div
);
9030 isl_space_free(set
->dim
);
9033 for (i
= 0; i
< set
->n
; ++i
) {
9034 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9045 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9048 struct isl_basic_map
*bmap
;
9055 set
= isl_set_align_divs(set
);
9060 dim
= isl_set_get_space(set
);
9061 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9063 return isl_map_identity(isl_space_map_from_set(dim
));
9066 n_div
= set
->p
[0]->n_div
;
9067 dim
= isl_space_map_from_set(dim
);
9068 n_param
= isl_space_dim(dim
, isl_dim_param
);
9069 n_set
= isl_space_dim(dim
, isl_dim_in
);
9070 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9071 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9072 for (i
= 0; i
< n_set
; ++i
)
9073 bmap
= var_equal(bmap
, i
);
9075 total
= n_param
+ n_set
+ n_set
+ n_div
;
9076 for (i
= 0; i
< n_div
; ++i
) {
9077 k
= isl_basic_map_alloc_inequality(bmap
);
9080 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9081 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9082 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9083 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9084 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9085 set
->p
[0]->div
[i
][0]);
9087 l
= isl_basic_map_alloc_inequality(bmap
);
9090 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9091 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9092 set
->p
[0]->div
[i
][0]);
9093 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9097 bmap
= isl_basic_map_simplify(bmap
);
9098 bmap
= isl_basic_map_finalize(bmap
);
9099 return isl_map_from_basic_map(bmap
);
9102 isl_basic_map_free(bmap
);
9106 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9114 dim
= isl_basic_set_total_dim(bset
);
9115 size
+= bset
->n_eq
* (1 + dim
);
9116 size
+= bset
->n_ineq
* (1 + dim
);
9117 size
+= bset
->n_div
* (2 + dim
);
9122 int isl_set_size(__isl_keep isl_set
*set
)
9130 for (i
= 0; i
< set
->n
; ++i
)
9131 size
+= isl_basic_set_size(set
->p
[i
]);
9136 /* Check if there is any lower bound (if lower == 0) and/or upper
9137 * bound (if upper == 0) on the specified dim.
9139 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9140 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9147 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9149 pos
+= isl_basic_map_offset(bmap
, type
);
9151 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9152 if (isl_int_is_zero(bmap
->div
[i
][0]))
9154 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9158 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9159 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9162 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9163 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9170 return lower
&& upper
;
9173 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9174 enum isl_dim_type type
, unsigned pos
)
9176 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9179 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9180 enum isl_dim_type type
, unsigned pos
)
9182 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9185 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9186 enum isl_dim_type type
, unsigned pos
)
9188 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9191 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9192 enum isl_dim_type type
, unsigned pos
)
9199 for (i
= 0; i
< map
->n
; ++i
) {
9201 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9202 if (bounded
< 0 || !bounded
)
9209 /* Return 1 if the specified dim is involved in both an upper bound
9210 * and a lower bound.
9212 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9213 enum isl_dim_type type
, unsigned pos
)
9215 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9218 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9220 static int has_any_bound(__isl_keep isl_map
*map
,
9221 enum isl_dim_type type
, unsigned pos
,
9222 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9223 enum isl_dim_type type
, unsigned pos
))
9230 for (i
= 0; i
< map
->n
; ++i
) {
9232 bounded
= fn(map
->p
[i
], type
, pos
);
9233 if (bounded
< 0 || bounded
)
9240 /* Return 1 if the specified dim is involved in any lower bound.
9242 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9243 enum isl_dim_type type
, unsigned pos
)
9245 return has_any_bound(set
, type
, pos
,
9246 &isl_basic_map_dim_has_lower_bound
);
9249 /* Return 1 if the specified dim is involved in any upper bound.
9251 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9252 enum isl_dim_type type
, unsigned pos
)
9254 return has_any_bound(set
, type
, pos
,
9255 &isl_basic_map_dim_has_upper_bound
);
9258 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9260 static int has_bound(__isl_keep isl_map
*map
,
9261 enum isl_dim_type type
, unsigned pos
,
9262 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9263 enum isl_dim_type type
, unsigned pos
))
9270 for (i
= 0; i
< map
->n
; ++i
) {
9272 bounded
= fn(map
->p
[i
], type
, pos
);
9273 if (bounded
< 0 || !bounded
)
9280 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9282 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9283 enum isl_dim_type type
, unsigned pos
)
9285 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9288 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9290 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9291 enum isl_dim_type type
, unsigned pos
)
9293 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9296 /* For each of the "n" variables starting at "first", determine
9297 * the sign of the variable and put the results in the first "n"
9298 * elements of the array "signs".
9300 * 1 means that the variable is non-negative
9301 * -1 means that the variable is non-positive
9302 * 0 means the variable attains both positive and negative values.
9304 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9305 unsigned first
, unsigned n
, int *signs
)
9307 isl_vec
*bound
= NULL
;
9308 struct isl_tab
*tab
= NULL
;
9309 struct isl_tab_undo
*snap
;
9312 if (!bset
|| !signs
)
9315 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9316 tab
= isl_tab_from_basic_set(bset
, 0);
9320 isl_seq_clr(bound
->el
, bound
->size
);
9321 isl_int_set_si(bound
->el
[0], -1);
9323 snap
= isl_tab_snap(tab
);
9324 for (i
= 0; i
< n
; ++i
) {
9327 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9328 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9331 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9332 if (isl_tab_rollback(tab
, snap
) < 0)
9340 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9341 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9344 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9345 if (isl_tab_rollback(tab
, snap
) < 0)
9348 signs
[i
] = empty
? -1 : 0;
9352 isl_vec_free(bound
);
9356 isl_vec_free(bound
);
9360 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9361 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9363 if (!bset
|| !signs
)
9365 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9368 first
+= pos(bset
->dim
, type
) - 1;
9369 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9372 /* Check if the given basic map is obviously single-valued.
9373 * In particular, for each output dimension, check that there is
9374 * an equality that defines the output dimension in terms of
9375 * earlier dimensions.
9377 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9387 total
= 1 + isl_basic_map_total_dim(bmap
);
9388 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9389 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9391 for (i
= 0; i
< n_out
; ++i
) {
9392 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9393 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9395 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9396 total
- (o_out
+ i
+ 1)) == -1)
9399 if (j
>= bmap
->n_eq
)
9406 /* Check if the given basic map is single-valued.
9411 * and check if the result is a subset of the identity mapping.
9413 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9416 isl_basic_map
*test
;
9420 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9424 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9425 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9427 space
= isl_basic_map_get_space(bmap
);
9428 space
= isl_space_map_from_set(isl_space_range(space
));
9429 id
= isl_basic_map_identity(space
);
9431 sv
= isl_basic_map_is_subset(test
, id
);
9433 isl_basic_map_free(test
);
9434 isl_basic_map_free(id
);
9439 /* Check if the given map is obviously single-valued.
9441 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9450 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9453 /* Check if the given map is single-valued.
9458 * and check if the result is a subset of the identity mapping.
9460 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9467 sv
= isl_map_plain_is_single_valued(map
);
9471 test
= isl_map_reverse(isl_map_copy(map
));
9472 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9474 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9475 id
= isl_map_identity(dim
);
9477 sv
= isl_map_is_subset(test
, id
);
9485 int isl_map_is_injective(__isl_keep isl_map
*map
)
9489 map
= isl_map_copy(map
);
9490 map
= isl_map_reverse(map
);
9491 in
= isl_map_is_single_valued(map
);
9497 /* Check if the given map is obviously injective.
9499 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9503 map
= isl_map_copy(map
);
9504 map
= isl_map_reverse(map
);
9505 in
= isl_map_plain_is_single_valued(map
);
9511 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9515 sv
= isl_map_is_single_valued(map
);
9519 return isl_map_is_injective(map
);
9522 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9524 return isl_map_is_single_valued((isl_map
*)set
);
9527 int isl_map_is_translation(__isl_keep isl_map
*map
)
9532 delta
= isl_map_deltas(isl_map_copy(map
));
9533 ok
= isl_set_is_singleton(delta
);
9534 isl_set_free(delta
);
9539 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9541 if (isl_seq_first_non_zero(p
, pos
) != -1)
9543 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9548 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9557 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9560 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9561 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9562 for (j
= 0; j
< nvar
; ++j
) {
9563 int lower
= 0, upper
= 0;
9564 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9565 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9567 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9573 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9574 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9576 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9578 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9583 if (!lower
|| !upper
)
9590 int isl_set_is_box(__isl_keep isl_set
*set
)
9597 return isl_basic_set_is_box(set
->p
[0]);
9600 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9605 return isl_space_is_wrapping(bset
->dim
);
9608 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9613 return isl_space_is_wrapping(set
->dim
);
9616 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9618 bmap
= isl_basic_map_cow(bmap
);
9622 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9626 bmap
= isl_basic_map_finalize(bmap
);
9628 return (isl_basic_set
*)bmap
;
9630 isl_basic_map_free(bmap
);
9634 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9638 map
= isl_map_cow(map
);
9642 for (i
= 0; i
< map
->n
; ++i
) {
9643 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9647 map
->dim
= isl_space_wrap(map
->dim
);
9651 return (isl_set
*)map
;
9657 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9659 bset
= isl_basic_set_cow(bset
);
9663 bset
->dim
= isl_space_unwrap(bset
->dim
);
9667 bset
= isl_basic_set_finalize(bset
);
9669 return (isl_basic_map
*)bset
;
9671 isl_basic_set_free(bset
);
9675 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9682 if (!isl_set_is_wrapping(set
))
9683 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9686 set
= isl_set_cow(set
);
9690 for (i
= 0; i
< set
->n
; ++i
) {
9691 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9696 set
->dim
= isl_space_unwrap(set
->dim
);
9700 return (isl_map
*)set
;
9706 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9707 enum isl_dim_type type
)
9712 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9715 bmap
= isl_basic_map_cow(bmap
);
9719 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9723 bmap
= isl_basic_map_finalize(bmap
);
9727 isl_basic_map_free(bmap
);
9731 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9732 enum isl_dim_type type
)
9739 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9742 map
= isl_map_cow(map
);
9746 for (i
= 0; i
< map
->n
; ++i
) {
9747 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9751 map
->dim
= isl_space_reset(map
->dim
, type
);
9761 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9766 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9769 bmap
= isl_basic_map_cow(bmap
);
9773 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9777 bmap
= isl_basic_map_finalize(bmap
);
9781 isl_basic_map_free(bmap
);
9785 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9787 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9790 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9791 __isl_take isl_basic_map
*bmap
)
9796 if (!bmap
->dim
->nested
[0])
9799 bmap
= isl_basic_map_cow(bmap
);
9803 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9807 bmap
= isl_basic_map_finalize(bmap
);
9811 isl_basic_map_free(bmap
);
9815 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9816 __isl_take isl_basic_map
*bmap
)
9821 if (!bmap
->dim
->nested
[1])
9824 bmap
= isl_basic_map_cow(bmap
);
9828 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9832 bmap
= isl_basic_map_finalize(bmap
);
9836 isl_basic_map_free(bmap
);
9840 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9847 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9850 map
= isl_map_cow(map
);
9854 for (i
= 0; i
< map
->n
; ++i
) {
9855 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9859 map
->dim
= isl_space_flatten(map
->dim
);
9869 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9871 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9874 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9876 isl_space
*dim
, *flat_dim
;
9879 dim
= isl_set_get_space(set
);
9880 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9881 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9882 map
= isl_map_intersect_domain(map
, set
);
9887 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9894 if (!map
->dim
->nested
[0])
9897 map
= isl_map_cow(map
);
9901 for (i
= 0; i
< map
->n
; ++i
) {
9902 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9906 map
->dim
= isl_space_flatten_domain(map
->dim
);
9916 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9923 if (!map
->dim
->nested
[1])
9926 map
= isl_map_cow(map
);
9930 for (i
= 0; i
< map
->n
; ++i
) {
9931 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9935 map
->dim
= isl_space_flatten_range(map
->dim
);
9945 /* Reorder the dimensions of "bmap" according to the given dim_map
9946 * and set the dimension specification to "dim".
9948 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9949 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9954 bmap
= isl_basic_map_cow(bmap
);
9955 if (!bmap
|| !dim
|| !dim_map
)
9958 flags
= bmap
->flags
;
9959 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9960 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9961 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9962 res
= isl_basic_map_alloc_space(dim
,
9963 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9964 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9967 res
= isl_basic_map_finalize(res
);
9971 isl_basic_map_free(bmap
);
9972 isl_space_free(dim
);
9976 /* Reorder the dimensions of "map" according to given reordering.
9978 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9979 __isl_take isl_reordering
*r
)
9982 struct isl_dim_map
*dim_map
;
9984 map
= isl_map_cow(map
);
9985 dim_map
= isl_dim_map_from_reordering(r
);
9986 if (!map
|| !r
|| !dim_map
)
9989 for (i
= 0; i
< map
->n
; ++i
) {
9990 struct isl_dim_map
*dim_map_i
;
9992 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9994 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9995 isl_space_copy(r
->dim
), dim_map_i
);
10001 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10003 isl_reordering_free(r
);
10009 isl_reordering_free(r
);
10013 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10014 __isl_take isl_reordering
*r
)
10016 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10019 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10020 __isl_take isl_space
*model
)
10024 if (!map
|| !model
)
10027 ctx
= isl_space_get_ctx(model
);
10028 if (!isl_space_has_named_params(model
))
10029 isl_die(ctx
, isl_error_invalid
,
10030 "model has unnamed parameters", goto error
);
10031 if (!isl_space_has_named_params(map
->dim
))
10032 isl_die(ctx
, isl_error_invalid
,
10033 "relation has unnamed parameters", goto error
);
10034 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10035 isl_reordering
*exp
;
10037 model
= isl_space_drop_dims(model
, isl_dim_in
,
10038 0, isl_space_dim(model
, isl_dim_in
));
10039 model
= isl_space_drop_dims(model
, isl_dim_out
,
10040 0, isl_space_dim(model
, isl_dim_out
));
10041 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10042 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10043 map
= isl_map_realign(map
, exp
);
10046 isl_space_free(model
);
10049 isl_space_free(model
);
10054 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10055 __isl_take isl_space
*model
)
10057 return isl_map_align_params(set
, model
);
10060 /* Align the parameters of "bmap" to those of "model", introducing
10061 * additional parameters if needed.
10063 __isl_give isl_basic_map
*isl_basic_map_align_params(
10064 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10068 if (!bmap
|| !model
)
10071 ctx
= isl_space_get_ctx(model
);
10072 if (!isl_space_has_named_params(model
))
10073 isl_die(ctx
, isl_error_invalid
,
10074 "model has unnamed parameters", goto error
);
10075 if (!isl_space_has_named_params(bmap
->dim
))
10076 isl_die(ctx
, isl_error_invalid
,
10077 "relation has unnamed parameters", goto error
);
10078 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10079 isl_reordering
*exp
;
10080 struct isl_dim_map
*dim_map
;
10082 model
= isl_space_drop_dims(model
, isl_dim_in
,
10083 0, isl_space_dim(model
, isl_dim_in
));
10084 model
= isl_space_drop_dims(model
, isl_dim_out
,
10085 0, isl_space_dim(model
, isl_dim_out
));
10086 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10087 exp
= isl_reordering_extend_space(exp
,
10088 isl_basic_map_get_space(bmap
));
10089 dim_map
= isl_dim_map_from_reordering(exp
);
10090 bmap
= isl_basic_map_realign(bmap
,
10091 exp
? isl_space_copy(exp
->dim
) : NULL
,
10092 isl_dim_map_extend(dim_map
, bmap
));
10093 isl_reordering_free(exp
);
10097 isl_space_free(model
);
10100 isl_space_free(model
);
10101 isl_basic_map_free(bmap
);
10105 /* Align the parameters of "bset" to those of "model", introducing
10106 * additional parameters if needed.
10108 __isl_give isl_basic_set
*isl_basic_set_align_params(
10109 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10111 return isl_basic_map_align_params(bset
, model
);
10114 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10115 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10116 enum isl_dim_type c2
, enum isl_dim_type c3
,
10117 enum isl_dim_type c4
, enum isl_dim_type c5
)
10119 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10120 struct isl_mat
*mat
;
10126 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10127 isl_basic_map_total_dim(bmap
) + 1);
10130 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10131 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10132 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10133 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10134 isl_int_set(mat
->row
[i
][pos
],
10135 bmap
->eq
[i
][off
+ k
]);
10143 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10144 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10145 enum isl_dim_type c2
, enum isl_dim_type c3
,
10146 enum isl_dim_type c4
, enum isl_dim_type c5
)
10148 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10149 struct isl_mat
*mat
;
10155 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10156 isl_basic_map_total_dim(bmap
) + 1);
10159 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10160 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10161 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10162 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10163 isl_int_set(mat
->row
[i
][pos
],
10164 bmap
->ineq
[i
][off
+ k
]);
10172 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10173 __isl_take isl_space
*dim
,
10174 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10175 enum isl_dim_type c2
, enum isl_dim_type c3
,
10176 enum isl_dim_type c4
, enum isl_dim_type c5
)
10178 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10179 isl_basic_map
*bmap
;
10185 if (!dim
|| !eq
|| !ineq
)
10188 if (eq
->n_col
!= ineq
->n_col
)
10189 isl_die(dim
->ctx
, isl_error_invalid
,
10190 "equalities and inequalities matrices should have "
10191 "same number of columns", goto error
);
10193 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10195 if (eq
->n_col
< total
)
10196 isl_die(dim
->ctx
, isl_error_invalid
,
10197 "number of columns too small", goto error
);
10199 extra
= eq
->n_col
- total
;
10201 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10202 eq
->n_row
, ineq
->n_row
);
10205 for (i
= 0; i
< extra
; ++i
) {
10206 k
= isl_basic_map_alloc_div(bmap
);
10209 isl_int_set_si(bmap
->div
[k
][0], 0);
10211 for (i
= 0; i
< eq
->n_row
; ++i
) {
10212 l
= isl_basic_map_alloc_equality(bmap
);
10215 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10216 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10217 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10218 isl_int_set(bmap
->eq
[l
][off
+ k
],
10224 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10225 l
= isl_basic_map_alloc_inequality(bmap
);
10228 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10229 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10230 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10231 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10232 ineq
->row
[i
][pos
]);
10238 isl_space_free(dim
);
10240 isl_mat_free(ineq
);
10244 isl_space_free(dim
);
10246 isl_mat_free(ineq
);
10250 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10251 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10252 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10254 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10255 c1
, c2
, c3
, c4
, isl_dim_in
);
10258 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10259 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10260 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10262 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10263 c1
, c2
, c3
, c4
, isl_dim_in
);
10266 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10267 __isl_take isl_space
*dim
,
10268 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10269 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10271 return (isl_basic_set
*)
10272 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10273 c1
, c2
, c3
, c4
, isl_dim_in
);
10276 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10281 return isl_space_can_zip(bmap
->dim
);
10284 int isl_map_can_zip(__isl_keep isl_map
*map
)
10289 return isl_space_can_zip(map
->dim
);
10292 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10293 * (A -> C) -> (B -> D).
10295 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10304 if (!isl_basic_map_can_zip(bmap
))
10305 isl_die(bmap
->ctx
, isl_error_invalid
,
10306 "basic map cannot be zipped", goto error
);
10307 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10308 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10309 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10310 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10311 bmap
= isl_basic_map_cow(bmap
);
10312 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10315 bmap
->dim
= isl_space_zip(bmap
->dim
);
10320 isl_basic_map_free(bmap
);
10324 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10325 * (A -> C) -> (B -> D).
10327 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10334 if (!isl_map_can_zip(map
))
10335 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10338 map
= isl_map_cow(map
);
10342 for (i
= 0; i
< map
->n
; ++i
) {
10343 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10348 map
->dim
= isl_space_zip(map
->dim
);
10358 /* Can we apply isl_basic_map_curry to "bmap"?
10359 * That is, does it have a nested relation in its domain?
10361 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10366 return isl_space_can_curry(bmap
->dim
);
10369 /* Can we apply isl_map_curry to "map"?
10370 * That is, does it have a nested relation in its domain?
10372 int isl_map_can_curry(__isl_keep isl_map
*map
)
10377 return isl_space_can_curry(map
->dim
);
10380 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10383 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10389 if (!isl_basic_map_can_curry(bmap
))
10390 isl_die(bmap
->ctx
, isl_error_invalid
,
10391 "basic map cannot be curried", goto error
);
10392 bmap
->dim
= isl_space_curry(bmap
->dim
);
10397 isl_basic_map_free(bmap
);
10401 /* Given a map (A -> B) -> C, return the corresponding map
10404 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10411 if (!isl_map_can_curry(map
))
10412 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10415 map
= isl_map_cow(map
);
10419 for (i
= 0; i
< map
->n
; ++i
) {
10420 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10425 map
->dim
= isl_space_curry(map
->dim
);
10435 /* Can we apply isl_basic_map_uncurry to "bmap"?
10436 * That is, does it have a nested relation in its domain?
10438 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10443 return isl_space_can_uncurry(bmap
->dim
);
10446 /* Can we apply isl_map_uncurry to "map"?
10447 * That is, does it have a nested relation in its domain?
10449 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10454 return isl_space_can_uncurry(map
->dim
);
10457 /* Given a basic map A -> (B -> C), return the corresponding basic map
10460 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10466 if (!isl_basic_map_can_uncurry(bmap
))
10467 isl_die(bmap
->ctx
, isl_error_invalid
,
10468 "basic map cannot be uncurried",
10469 return isl_basic_map_free(bmap
));
10470 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10472 return isl_basic_map_free(bmap
);
10476 /* Given a map A -> (B -> C), return the corresponding map
10479 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10486 if (!isl_map_can_uncurry(map
))
10487 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10488 return isl_map_free(map
));
10490 map
= isl_map_cow(map
);
10494 for (i
= 0; i
< map
->n
; ++i
) {
10495 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10497 return isl_map_free(map
);
10500 map
->dim
= isl_space_uncurry(map
->dim
);
10502 return isl_map_free(map
);
10507 /* Construct a basic map mapping the domain of the affine expression
10508 * to a one-dimensional range prescribed by the affine expression.
10510 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10514 isl_local_space
*ls
;
10515 isl_basic_map
*bmap
;
10520 ls
= isl_aff_get_local_space(aff
);
10521 bmap
= isl_basic_map_from_local_space(ls
);
10522 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10523 k
= isl_basic_map_alloc_equality(bmap
);
10527 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10528 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10529 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10530 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10531 aff
->v
->size
- (pos
+ 1));
10534 bmap
= isl_basic_map_finalize(bmap
);
10538 isl_basic_map_free(bmap
);
10542 /* Construct a map mapping the domain of the affine expression
10543 * to a one-dimensional range prescribed by the affine expression.
10545 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10547 isl_basic_map
*bmap
;
10549 bmap
= isl_basic_map_from_aff(aff
);
10550 return isl_map_from_basic_map(bmap
);
10553 /* Construct a basic map mapping the domain the multi-affine expression
10554 * to its range, with each dimension in the range equated to the
10555 * corresponding affine expression.
10557 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10558 __isl_take isl_multi_aff
*maff
)
10562 isl_basic_map
*bmap
;
10567 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10568 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10569 "invalid space", return isl_multi_aff_free(maff
));
10571 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10572 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10574 for (i
= 0; i
< maff
->n
; ++i
) {
10576 isl_basic_map
*bmap_i
;
10578 aff
= isl_aff_copy(maff
->p
[i
]);
10579 bmap_i
= isl_basic_map_from_aff(aff
);
10581 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10584 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10586 isl_multi_aff_free(maff
);
10590 /* Construct a map mapping the domain the multi-affine expression
10591 * to its range, with each dimension in the range equated to the
10592 * corresponding affine expression.
10594 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10596 isl_basic_map
*bmap
;
10598 bmap
= isl_basic_map_from_multi_aff(maff
);
10599 return isl_map_from_basic_map(bmap
);
10602 /* Construct a basic map mapping a domain in the given space to
10603 * to an n-dimensional range, with n the number of elements in the list,
10604 * where each coordinate in the range is prescribed by the
10605 * corresponding affine expression.
10606 * The domains of all affine expressions in the list are assumed to match
10609 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10610 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10614 isl_basic_map
*bmap
;
10619 dim
= isl_space_from_domain(domain_dim
);
10620 bmap
= isl_basic_map_universe(dim
);
10622 for (i
= 0; i
< list
->n
; ++i
) {
10624 isl_basic_map
*bmap_i
;
10626 aff
= isl_aff_copy(list
->p
[i
]);
10627 bmap_i
= isl_basic_map_from_aff(aff
);
10629 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10632 isl_aff_list_free(list
);
10636 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10637 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10639 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10642 /* Construct a basic map where the given dimensions are equal to each other.
10644 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10645 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10647 isl_basic_map
*bmap
= NULL
;
10653 if (pos1
>= isl_space_dim(space
, type1
))
10654 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10655 "index out of bounds", goto error
);
10656 if (pos2
>= isl_space_dim(space
, type2
))
10657 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10658 "index out of bounds", goto error
);
10660 if (type1
== type2
&& pos1
== pos2
)
10661 return isl_basic_map_universe(space
);
10663 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10664 i
= isl_basic_map_alloc_equality(bmap
);
10667 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10668 pos1
+= isl_basic_map_offset(bmap
, type1
);
10669 pos2
+= isl_basic_map_offset(bmap
, type2
);
10670 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10671 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10672 bmap
= isl_basic_map_finalize(bmap
);
10673 isl_space_free(space
);
10676 isl_space_free(space
);
10677 isl_basic_map_free(bmap
);
10681 /* Add a constraint imposing that the given two dimensions are equal.
10683 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10684 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10688 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10690 bmap
= isl_basic_map_intersect(bmap
, eq
);
10695 /* Add a constraint imposing that the given two dimensions are equal.
10697 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10698 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10700 isl_basic_map
*bmap
;
10702 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10704 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10709 /* Add a constraint imposing that the given two dimensions have opposite values.
10711 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10712 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10714 isl_basic_map
*bmap
= NULL
;
10720 if (pos1
>= isl_map_dim(map
, type1
))
10721 isl_die(map
->ctx
, isl_error_invalid
,
10722 "index out of bounds", goto error
);
10723 if (pos2
>= isl_map_dim(map
, type2
))
10724 isl_die(map
->ctx
, isl_error_invalid
,
10725 "index out of bounds", goto error
);
10727 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10728 i
= isl_basic_map_alloc_equality(bmap
);
10731 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10732 pos1
+= isl_basic_map_offset(bmap
, type1
);
10733 pos2
+= isl_basic_map_offset(bmap
, type2
);
10734 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10735 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10736 bmap
= isl_basic_map_finalize(bmap
);
10738 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10742 isl_basic_map_free(bmap
);
10747 /* Add a constraint imposing that the value of the first dimension is
10748 * greater than or equal to that of the second.
10750 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10751 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10754 isl_local_space
*ls
;
10759 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10760 isl_die(bmap
->ctx
, isl_error_invalid
,
10761 "index out of bounds", return isl_basic_map_free(bmap
));
10762 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10763 isl_die(bmap
->ctx
, isl_error_invalid
,
10764 "index out of bounds", return isl_basic_map_free(bmap
));
10766 if (type1
== type2
&& pos1
== pos2
)
10769 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10770 c
= isl_inequality_alloc(ls
);
10771 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10772 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10773 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10778 /* Add a constraint imposing that the value of the first dimension is
10779 * greater than that of the second.
10781 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10782 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10784 isl_basic_map
*bmap
= NULL
;
10790 if (pos1
>= isl_map_dim(map
, type1
))
10791 isl_die(map
->ctx
, isl_error_invalid
,
10792 "index out of bounds", goto error
);
10793 if (pos2
>= isl_map_dim(map
, type2
))
10794 isl_die(map
->ctx
, isl_error_invalid
,
10795 "index out of bounds", goto error
);
10797 if (type1
== type2
&& pos1
== pos2
) {
10798 isl_space
*space
= isl_map_get_space(map
);
10800 return isl_map_empty(space
);
10803 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10804 i
= isl_basic_map_alloc_inequality(bmap
);
10807 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10808 pos1
+= isl_basic_map_offset(bmap
, type1
);
10809 pos2
+= isl_basic_map_offset(bmap
, type2
);
10810 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10811 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10812 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10813 bmap
= isl_basic_map_finalize(bmap
);
10815 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10819 isl_basic_map_free(bmap
);
10824 /* Add a constraint imposing that the value of the first dimension is
10825 * smaller than that of the second.
10827 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
10828 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10830 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
10833 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10837 isl_local_space
*ls
;
10842 if (!isl_basic_map_divs_known(bmap
))
10843 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10844 "some divs are unknown", return NULL
);
10846 ls
= isl_basic_map_get_local_space(bmap
);
10847 div
= isl_local_space_get_div(ls
, pos
);
10848 isl_local_space_free(ls
);
10853 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10856 return isl_basic_map_get_div(bset
, pos
);
10859 /* Plug in "subs" for dimension "type", "pos" of "bset".
10861 * Let i be the dimension to replace and let "subs" be of the form
10865 * Any integer division with a non-zero coefficient for i,
10867 * floor((a i + g)/m)
10871 * floor((a f + d g)/(m d))
10873 * Constraints of the form
10881 * We currently require that "subs" is an integral expression.
10882 * Handling rational expressions may require us to add stride constraints
10883 * as we do in isl_basic_set_preimage_multi_aff.
10885 __isl_give isl_basic_set
*isl_basic_set_substitute(
10886 __isl_take isl_basic_set
*bset
,
10887 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10893 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10896 bset
= isl_basic_set_cow(bset
);
10897 if (!bset
|| !subs
)
10900 ctx
= isl_basic_set_get_ctx(bset
);
10901 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10902 isl_die(ctx
, isl_error_invalid
,
10903 "spaces don't match", goto error
);
10904 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10905 isl_die(ctx
, isl_error_unsupported
,
10906 "cannot handle divs yet", goto error
);
10907 if (!isl_int_is_one(subs
->v
->el
[0]))
10908 isl_die(ctx
, isl_error_invalid
,
10909 "can only substitute integer expressions", goto error
);
10911 pos
+= isl_basic_set_offset(bset
, type
);
10915 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10916 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10918 isl_int_set(v
, bset
->eq
[i
][pos
]);
10919 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10920 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10921 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10924 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10925 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10927 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10928 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10929 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10930 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10933 for (i
= 0; i
< bset
->n_div
; ++i
) {
10934 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10936 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10937 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10938 isl_seq_combine(bset
->div
[i
] + 1,
10939 subs
->v
->el
[0], bset
->div
[i
] + 1,
10940 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10941 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10946 bset
= isl_basic_set_simplify(bset
);
10947 return isl_basic_set_finalize(bset
);
10949 isl_basic_set_free(bset
);
10953 /* Plug in "subs" for dimension "type", "pos" of "set".
10955 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10956 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10960 if (set
&& isl_set_plain_is_empty(set
))
10963 set
= isl_set_cow(set
);
10967 for (i
= set
->n
- 1; i
>= 0; --i
) {
10968 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10969 if (remove_if_empty(set
, i
) < 0)
10979 /* Check if the range of "ma" is compatible with "space".
10980 * Return -1 if anything is wrong.
10982 static int check_space_compatible_range_multi_aff(
10983 __isl_keep isl_space
*space
, __isl_keep isl_multi_aff
*ma
)
10986 isl_space
*ma_space
;
10988 ma_space
= isl_multi_aff_get_space(ma
);
10989 m
= isl_space_is_range_internal(space
, ma_space
);
10990 isl_space_free(ma_space
);
10992 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10993 "spaces don't match", return -1);
10997 /* Check if the range of "ma" is compatible with "bset".
10998 * Return -1 if anything is wrong.
11000 static int check_basic_set_compatible_range_multi_aff(
11001 __isl_keep isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11003 return check_space_compatible_range_multi_aff(bset
->dim
, ma
);
11006 /* Copy the divs from "ma" to "bset", adding zeros for the coefficients
11007 * of the other divs in "bset".
11009 static int set_ma_divs(__isl_keep isl_basic_set
*bset
,
11010 __isl_keep isl_multi_aff
*ma
, int n_div
)
11013 isl_local_space
*ls
;
11018 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11022 for (i
= 0; i
< n_div
; ++i
) {
11023 isl_seq_cpy(bset
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
11024 isl_seq_clr(bset
->div
[i
] + ls
->div
->n_col
, bset
->n_div
- n_div
);
11025 if (isl_basic_set_add_div_constraints(bset
, i
) < 0)
11029 isl_local_space_free(ls
);
11032 isl_local_space_free(ls
);
11036 /* How many stride constraints does "ma" enforce?
11037 * That is, how many of the affine expressions have a denominator
11038 * different from one?
11040 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11045 for (i
= 0; i
< ma
->n
; ++i
)
11046 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11052 /* For each affine expression in ma of the form
11054 * x_i = (f_i y + h_i)/m_i
11056 * with m_i different from one, add a constraint to "bset"
11059 * f_i y + h_i = m_i alpha_i
11061 * with alpha_i an additional existentially quantified variable.
11063 static __isl_give isl_basic_set
*add_ma_strides(
11064 __isl_take isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11070 total
= isl_basic_set_total_dim(bset
);
11071 for (i
= 0; i
< ma
->n
; ++i
) {
11074 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11076 div
= isl_basic_set_alloc_div(bset
);
11077 k
= isl_basic_set_alloc_equality(bset
);
11078 if (div
< 0 || k
< 0)
11080 isl_int_set_si(bset
->div
[div
][0], 0);
11081 len
= ma
->p
[i
]->v
->size
;
11082 isl_seq_cpy(bset
->eq
[k
], ma
->p
[i
]->v
->el
+ 1, len
- 1);
11083 isl_seq_clr(bset
->eq
[k
] + len
- 1, 1 + total
- (len
- 1));
11084 isl_int_neg(bset
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11090 isl_basic_set_free(bset
);
11094 /* Compute the preimage of "bset" under the function represented by "ma".
11095 * In other words, plug in "ma" in "bset". The result is a basic set
11096 * that lives in the domain space of "ma".
11098 * If bset is represented by
11100 * A(p) + B x + C(divs) >= 0
11102 * and ma is represented by
11104 * x = D(p) + F(y) + G(divs')
11106 * then the result is
11108 * A(p) + B D(p) + B F(y) + B G(divs') + C(divs) >= 0
11110 * The divs in the input set are similarly adjusted.
11113 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
11117 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
11119 * If bset is not a rational set and if F(y) involves any denominators
11121 * x_i = (f_i y + h_i)/m_i
11123 * the additional constraints are added to ensure that we only
11124 * map back integer points. That is we enforce
11126 * f_i y + h_i = m_i alpha_i
11128 * with alpha_i an additional existentially quantified variable.
11130 * We first copy over the divs from "ma".
11131 * Then we add the modified constraints and divs from "bset".
11132 * Finally, we add the stride constraints, if needed.
11134 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11135 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11139 isl_basic_set
*res
= NULL
;
11140 int n_div_bset
, n_div_ma
;
11141 isl_int f
, c1
, c2
, g
;
11142 int rational
, strides
;
11149 ma
= isl_multi_aff_align_divs(ma
);
11152 if (check_basic_set_compatible_range_multi_aff(bset
, ma
) < 0)
11155 n_div_bset
= isl_basic_set_dim(bset
, isl_dim_div
);
11156 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11158 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
11159 rational
= isl_basic_set_is_rational(bset
);
11160 strides
= rational
? 0 : multi_aff_strides(ma
);
11161 res
= isl_basic_set_alloc_space(space
, n_div_ma
+ n_div_bset
+ strides
,
11162 bset
->n_eq
+ strides
, bset
->n_ineq
+ 2 * n_div_ma
);
11164 res
= isl_basic_set_set_rational(res
);
11166 for (i
= 0; i
< n_div_ma
+ n_div_bset
; ++i
)
11167 if (isl_basic_set_alloc_div(res
) < 0)
11170 if (set_ma_divs(res
, ma
, n_div_ma
) < 0)
11173 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11174 k
= isl_basic_set_alloc_equality(res
);
11177 isl_seq_preimage(res
->eq
[k
], bset
->eq
[i
], ma
, n_div_ma
,
11178 n_div_bset
, f
, c1
, c2
, g
, 0);
11181 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11182 k
= isl_basic_set_alloc_inequality(res
);
11185 isl_seq_preimage(res
->ineq
[k
], bset
->ineq
[i
], ma
, n_div_ma
,
11186 n_div_bset
, f
, c1
, c2
, g
, 0);
11189 for (i
= 0; i
< bset
->n_div
; ++i
) {
11190 if (isl_int_is_zero(bset
->div
[i
][0])) {
11191 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11194 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bset
->div
[i
],
11195 ma
, n_div_ma
, n_div_bset
, f
, c1
, c2
, g
, 1);
11199 res
= add_ma_strides(res
, ma
);
11205 isl_basic_set_free(bset
);
11206 isl_multi_aff_free(ma
);
11207 res
= isl_basic_set_simplify(res
);
11208 return isl_basic_set_finalize(res
);
11214 isl_basic_set_free(bset
);
11215 isl_multi_aff_free(ma
);
11216 isl_basic_set_free(res
);
11220 /* Check if the range of "ma" is compatible with "set".
11221 * Return -1 if anything is wrong.
11223 static int check_set_compatible_range_multi_aff(
11224 __isl_keep isl_set
*set
, __isl_keep isl_multi_aff
*ma
)
11226 return check_space_compatible_range_multi_aff(set
->dim
, ma
);
11229 /* Compute the preimage of "set" under the function represented by "ma".
11230 * In other words, plug in "ma" in "set. The result is a set
11231 * that lives in the domain space of "ma".
11233 static __isl_give isl_set
*set_preimage_multi_aff(__isl_take isl_set
*set
,
11234 __isl_take isl_multi_aff
*ma
)
11238 set
= isl_set_cow(set
);
11239 ma
= isl_multi_aff_align_divs(ma
);
11242 if (check_set_compatible_range_multi_aff(set
, ma
) < 0)
11245 for (i
= 0; i
< set
->n
; ++i
) {
11246 set
->p
[i
] = isl_basic_set_preimage_multi_aff(set
->p
[i
],
11247 isl_multi_aff_copy(ma
));
11252 isl_space_free(set
->dim
);
11253 set
->dim
= isl_multi_aff_get_domain_space(ma
);
11257 isl_multi_aff_free(ma
);
11259 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
11260 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
11263 isl_multi_aff_free(ma
);
11268 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11269 __isl_take isl_multi_aff
*ma
)
11274 if (isl_space_match(set
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11275 return set_preimage_multi_aff(set
, ma
);
11277 if (!isl_space_has_named_params(set
->dim
) ||
11278 !isl_space_has_named_params(ma
->space
))
11279 isl_die(set
->ctx
, isl_error_invalid
,
11280 "unaligned unnamed parameters", goto error
);
11281 set
= isl_set_align_params(set
, isl_multi_aff_get_space(ma
));
11282 ma
= isl_multi_aff_align_params(ma
, isl_set_get_space(set
));
11284 return set_preimage_multi_aff(set
, ma
);
11286 isl_multi_aff_free(ma
);
11287 return isl_set_free(set
);
11290 /* Compute the preimage of "set" under the function represented by "pma".
11291 * In other words, plug in "pma" in "set. The result is a set
11292 * that lives in the domain space of "pma".
11294 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11295 __isl_take isl_pw_multi_aff
*pma
)
11304 isl_pw_multi_aff_free(pma
);
11305 res
= isl_set_empty(isl_set_get_space(set
));
11310 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11311 isl_multi_aff_copy(pma
->p
[0].maff
));
11312 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11314 for (i
= 1; i
< pma
->n
; ++i
) {
11317 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11318 isl_multi_aff_copy(pma
->p
[i
].maff
));
11319 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11320 res
= isl_set_union(res
, res_i
);
11323 isl_pw_multi_aff_free(pma
);
11327 isl_pw_multi_aff_free(pma
);
11332 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11333 __isl_take isl_pw_multi_aff
*pma
)
11338 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11339 return set_preimage_pw_multi_aff(set
, pma
);
11341 if (!isl_space_has_named_params(set
->dim
) ||
11342 !isl_space_has_named_params(pma
->dim
))
11343 isl_die(set
->ctx
, isl_error_invalid
,
11344 "unaligned unnamed parameters", goto error
);
11345 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11346 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11348 return set_preimage_pw_multi_aff(set
, pma
);
11350 isl_pw_multi_aff_free(pma
);
11351 return isl_set_free(set
);