2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_ctx_private.h>
17 #include <isl_map_private.h>
19 #include "isl_space_private.h"
20 #include "isl_equalities.h"
21 #include <isl_list_private.h>
26 #include "isl_map_piplib.h"
27 #include <isl_reordering.h>
28 #include "isl_sample.h"
31 #include <isl_mat_private.h>
32 #include <isl_dim_map.h>
33 #include <isl_local_space_private.h>
34 #include <isl_aff_private.h>
35 #include <isl_options_private.h>
37 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
40 case isl_dim_param
: return dim
->nparam
;
41 case isl_dim_in
: return dim
->n_in
;
42 case isl_dim_out
: return dim
->n_out
;
43 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
48 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
51 case isl_dim_param
: return 1;
52 case isl_dim_in
: return 1 + dim
->nparam
;
53 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
58 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
59 enum isl_dim_type type
)
64 case isl_dim_cst
: return 1;
67 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
68 case isl_dim_div
: return bmap
->n_div
;
69 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
74 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
76 return map
? n(map
->dim
, type
) : 0;
79 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
81 return set
? n(set
->dim
, type
) : 0;
84 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
85 enum isl_dim_type type
)
87 isl_space
*dim
= bmap
->dim
;
89 case isl_dim_cst
: return 0;
90 case isl_dim_param
: return 1;
91 case isl_dim_in
: return 1 + dim
->nparam
;
92 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
93 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
98 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
99 enum isl_dim_type type
)
101 return isl_basic_map_offset(bset
, type
);
104 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
106 return pos(map
->dim
, type
);
109 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
110 enum isl_dim_type type
)
112 return isl_basic_map_dim(bset
, type
);
115 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
117 return isl_basic_set_dim(bset
, isl_dim_set
);
120 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
122 return isl_basic_set_dim(bset
, isl_dim_param
);
125 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
129 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
132 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
134 return isl_set_dim(set
, isl_dim_set
);
137 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
139 return isl_set_dim(set
, isl_dim_param
);
142 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
144 return bmap
? bmap
->dim
->n_in
: 0;
147 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
149 return bmap
? bmap
->dim
->n_out
: 0;
152 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
154 return bmap
? bmap
->dim
->nparam
: 0;
157 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
159 return bmap
? bmap
->n_div
: 0;
162 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
164 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
167 unsigned isl_map_n_in(const struct isl_map
*map
)
169 return map
? map
->dim
->n_in
: 0;
172 unsigned isl_map_n_out(const struct isl_map
*map
)
174 return map
? map
->dim
->n_out
: 0;
177 unsigned isl_map_n_param(const struct isl_map
*map
)
179 return map
? map
->dim
->nparam
: 0;
182 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
187 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
190 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
193 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
194 struct isl_basic_set
*bset
)
199 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
202 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
205 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
210 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
213 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
216 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
217 struct isl_basic_set
*bset
)
222 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
225 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
228 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
230 return bmap
? bmap
->ctx
: NULL
;
233 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
235 return bset
? bset
->ctx
: NULL
;
238 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
240 return map
? map
->ctx
: NULL
;
243 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
245 return set
? set
->ctx
: NULL
;
248 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
252 return isl_space_copy(bmap
->dim
);
255 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
259 return isl_space_copy(bset
->dim
);
262 /* Extract the divs in "bmap" as a matrix.
264 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
275 ctx
= isl_basic_map_get_ctx(bmap
);
276 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
277 cols
= 1 + 1 + total
+ bmap
->n_div
;
278 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
282 for (i
= 0; i
< bmap
->n_div
; ++i
)
283 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
288 __isl_give isl_local_space
*isl_basic_map_get_local_space(
289 __isl_keep isl_basic_map
*bmap
)
296 div
= isl_basic_map_get_divs(bmap
);
297 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
300 __isl_give isl_local_space
*isl_basic_set_get_local_space(
301 __isl_keep isl_basic_set
*bset
)
303 return isl_basic_map_get_local_space(bset
);
306 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
307 __isl_take isl_local_space
*ls
)
316 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
317 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
318 n_div
, 0, 2 * n_div
);
320 for (i
= 0; i
< n_div
; ++i
)
321 if (isl_basic_map_alloc_div(bmap
) < 0)
324 for (i
= 0; i
< n_div
; ++i
) {
325 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
326 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
330 isl_local_space_free(ls
);
333 isl_local_space_free(ls
);
334 isl_basic_map_free(bmap
);
338 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
339 __isl_take isl_local_space
*ls
)
341 return isl_basic_map_from_local_space(ls
);
344 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
348 return isl_space_copy(map
->dim
);
351 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
355 return isl_space_copy(set
->dim
);
358 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
359 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
361 bmap
= isl_basic_map_cow(bmap
);
364 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
367 bmap
= isl_basic_map_finalize(bmap
);
370 isl_basic_map_free(bmap
);
374 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
375 __isl_take isl_basic_set
*bset
, const char *s
)
377 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
380 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
381 enum isl_dim_type type
)
383 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
386 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
387 enum isl_dim_type type
, const char *s
)
391 map
= isl_map_cow(map
);
395 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
399 for (i
= 0; i
< map
->n
; ++i
) {
400 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
411 /* Does the input or output tuple have a name?
413 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
415 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
418 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
419 enum isl_dim_type type
)
421 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
424 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
427 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
430 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
431 enum isl_dim_type type
, __isl_take isl_id
*id
)
433 map
= isl_map_cow(map
);
435 return isl_id_free(id
);
437 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
439 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
442 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
443 __isl_take isl_id
*id
)
445 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
448 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
449 enum isl_dim_type type
)
451 map
= isl_map_cow(map
);
455 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
457 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
460 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
462 return isl_map_reset_tuple_id(set
, isl_dim_set
);
465 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
467 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
470 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
471 enum isl_dim_type type
)
473 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
476 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
478 return isl_map_has_tuple_id(set
, isl_dim_set
);
481 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
483 return isl_map_get_tuple_id(set
, isl_dim_set
);
486 /* Does the set tuple have a name?
488 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
490 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
494 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
496 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
499 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
501 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
504 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
505 enum isl_dim_type type
, unsigned pos
)
507 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
510 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
511 enum isl_dim_type type
, unsigned pos
)
513 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
516 /* Does the given dimension have a name?
518 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
519 enum isl_dim_type type
, unsigned pos
)
521 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
524 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
525 enum isl_dim_type type
, unsigned pos
)
527 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
530 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
531 enum isl_dim_type type
, unsigned pos
)
533 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
536 /* Does the given dimension have a name?
538 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
539 enum isl_dim_type type
, unsigned pos
)
541 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
544 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
545 __isl_take isl_basic_map
*bmap
,
546 enum isl_dim_type type
, unsigned pos
, const char *s
)
548 bmap
= isl_basic_map_cow(bmap
);
551 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
554 return isl_basic_map_finalize(bmap
);
556 isl_basic_map_free(bmap
);
560 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
561 enum isl_dim_type type
, unsigned pos
, const char *s
)
565 map
= isl_map_cow(map
);
569 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
573 for (i
= 0; i
< map
->n
; ++i
) {
574 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
585 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
586 __isl_take isl_basic_set
*bset
,
587 enum isl_dim_type type
, unsigned pos
, const char *s
)
589 return (isl_basic_set
*)isl_basic_map_set_dim_name(
590 (isl_basic_map
*)bset
, type
, pos
, s
);
593 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
594 enum isl_dim_type type
, unsigned pos
, const char *s
)
596 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
599 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
600 enum isl_dim_type type
, unsigned pos
)
602 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
605 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
606 enum isl_dim_type type
, unsigned pos
)
608 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
611 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
612 enum isl_dim_type type
, unsigned pos
)
614 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
617 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
618 enum isl_dim_type type
, unsigned pos
)
620 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
623 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
624 enum isl_dim_type type
, unsigned pos
)
626 return isl_map_has_dim_id(set
, type
, pos
);
629 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
630 enum isl_dim_type type
, unsigned pos
)
632 return isl_map_get_dim_id(set
, type
, pos
);
635 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
636 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
638 map
= isl_map_cow(map
);
640 return isl_id_free(id
);
642 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
644 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
647 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
648 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
650 return isl_map_set_dim_id(set
, type
, pos
, id
);
653 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
654 __isl_keep isl_id
*id
)
658 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
661 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
662 __isl_keep isl_id
*id
)
664 return isl_map_find_dim_by_id(set
, type
, id
);
667 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
672 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
675 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
678 return isl_map_find_dim_by_name(set
, type
, name
);
681 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
685 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
688 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
690 return isl_basic_map_is_rational(bset
);
693 /* Does "bmap" contain any rational points?
695 * If "bmap" has an equality for each dimension, equating the dimension
696 * to an integer constant, then it has no rational points, even if it
697 * is marked as rational.
699 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
701 int has_rational
= 1;
706 if (isl_basic_map_plain_is_empty(bmap
))
708 if (!isl_basic_map_is_rational(bmap
))
710 bmap
= isl_basic_map_copy(bmap
);
711 bmap
= isl_basic_map_implicit_equalities(bmap
);
714 total
= isl_basic_map_total_dim(bmap
);
715 if (bmap
->n_eq
== total
) {
717 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
718 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
721 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
722 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
724 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
732 isl_basic_map_free(bmap
);
737 /* Does "map" contain any rational points?
739 int isl_map_has_rational(__isl_keep isl_map
*map
)
746 for (i
= 0; i
< map
->n
; ++i
) {
747 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
748 if (has_rational
< 0)
756 /* Does "set" contain any rational points?
758 int isl_set_has_rational(__isl_keep isl_set
*set
)
760 return isl_map_has_rational(set
);
763 /* Is this basic set a parameter domain?
765 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
769 return isl_space_is_params(bset
->dim
);
772 /* Is this set a parameter domain?
774 int isl_set_is_params(__isl_keep isl_set
*set
)
778 return isl_space_is_params(set
->dim
);
781 /* Is this map actually a parameter domain?
782 * Users should never call this function. Outside of isl,
783 * a map can never be a parameter domain.
785 int isl_map_is_params(__isl_keep isl_map
*map
)
789 return isl_space_is_params(map
->dim
);
792 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
793 struct isl_basic_map
*bmap
, unsigned extra
,
794 unsigned n_eq
, unsigned n_ineq
)
797 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
802 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
803 if (isl_blk_is_error(bmap
->block
))
806 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
811 bmap
->block2
= isl_blk_empty();
814 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
815 if (isl_blk_is_error(bmap
->block2
))
818 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
823 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
824 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
826 for (i
= 0; i
< extra
; ++i
)
827 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
831 bmap
->c_size
= n_eq
+ n_ineq
;
832 bmap
->eq
= bmap
->ineq
+ n_ineq
;
841 isl_basic_map_free(bmap
);
845 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
846 unsigned nparam
, unsigned dim
, unsigned extra
,
847 unsigned n_eq
, unsigned n_ineq
)
849 struct isl_basic_map
*bmap
;
852 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
856 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
857 return (struct isl_basic_set
*)bmap
;
860 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
861 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
863 struct isl_basic_map
*bmap
;
866 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
867 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
868 return (struct isl_basic_set
*)bmap
;
874 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
875 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
877 struct isl_basic_map
*bmap
;
881 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
886 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
892 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
893 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
894 unsigned n_eq
, unsigned n_ineq
)
896 struct isl_basic_map
*bmap
;
899 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
903 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
907 static void dup_constraints(
908 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
911 unsigned total
= isl_basic_map_total_dim(src
);
913 for (i
= 0; i
< src
->n_eq
; ++i
) {
914 int j
= isl_basic_map_alloc_equality(dst
);
915 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
918 for (i
= 0; i
< src
->n_ineq
; ++i
) {
919 int j
= isl_basic_map_alloc_inequality(dst
);
920 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
923 for (i
= 0; i
< src
->n_div
; ++i
) {
924 int j
= isl_basic_map_alloc_div(dst
);
925 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
927 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
930 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
932 struct isl_basic_map
*dup
;
936 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
937 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
940 dup_constraints(dup
, bmap
);
941 dup
->flags
= bmap
->flags
;
942 dup
->sample
= isl_vec_copy(bmap
->sample
);
946 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
948 struct isl_basic_map
*dup
;
950 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
951 return (struct isl_basic_set
*)dup
;
954 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
959 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
963 return isl_basic_set_dup(bset
);
966 struct isl_set
*isl_set_copy(struct isl_set
*set
)
975 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
980 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
984 bmap
= isl_basic_map_dup(bmap
);
986 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
990 struct isl_map
*isl_map_copy(struct isl_map
*map
)
999 void *isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1004 if (--bmap
->ref
> 0)
1007 isl_ctx_deref(bmap
->ctx
);
1009 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1011 isl_blk_free(bmap
->ctx
, bmap
->block
);
1012 isl_vec_free(bmap
->sample
);
1013 isl_space_free(bmap
->dim
);
1019 void *isl_basic_set_free(struct isl_basic_set
*bset
)
1021 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1024 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1026 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1029 __isl_give isl_map
*isl_map_align_params_map_map_and(
1030 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1031 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1032 __isl_take isl_map
*map2
))
1036 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1037 return fn(map1
, map2
);
1038 if (!isl_space_has_named_params(map1
->dim
) ||
1039 !isl_space_has_named_params(map2
->dim
))
1040 isl_die(map1
->ctx
, isl_error_invalid
,
1041 "unaligned unnamed parameters", goto error
);
1042 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1043 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1044 return fn(map1
, map2
);
1051 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1052 __isl_keep isl_map
*map2
,
1053 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1059 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1060 return fn(map1
, map2
);
1061 if (!isl_space_has_named_params(map1
->dim
) ||
1062 !isl_space_has_named_params(map2
->dim
))
1063 isl_die(map1
->ctx
, isl_error_invalid
,
1064 "unaligned unnamed parameters", return -1);
1065 map1
= isl_map_copy(map1
);
1066 map2
= isl_map_copy(map2
);
1067 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1068 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1075 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1077 struct isl_ctx
*ctx
;
1081 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1082 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1084 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1085 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1086 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1087 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1088 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1089 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1091 int j
= isl_basic_map_alloc_inequality(bmap
);
1095 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1096 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1103 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1104 bmap
->extra
- bmap
->n_div
);
1105 return bmap
->n_eq
++;
1108 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1110 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1113 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1117 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1122 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1124 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1127 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1132 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1134 if (pos
!= bmap
->n_eq
- 1) {
1136 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1137 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1143 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1145 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1148 void isl_basic_map_inequality_to_equality(
1149 struct isl_basic_map
*bmap
, unsigned pos
)
1153 t
= bmap
->ineq
[pos
];
1154 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1155 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1160 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1161 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1162 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1163 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1166 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1168 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1171 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1173 struct isl_ctx
*ctx
;
1177 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1178 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1179 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1180 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1181 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1182 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1183 1 + isl_basic_map_total_dim(bmap
),
1184 bmap
->extra
- bmap
->n_div
);
1185 return bmap
->n_ineq
++;
1188 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1190 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1193 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1197 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1202 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1204 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1207 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1212 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1214 if (pos
!= bmap
->n_ineq
- 1) {
1215 t
= bmap
->ineq
[pos
];
1216 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1217 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1218 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1224 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1226 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1229 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1234 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1237 k
= isl_basic_map_alloc_equality(bmap
);
1240 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1243 isl_basic_map_free(bmap
);
1247 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1250 return (isl_basic_set
*)
1251 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1254 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1259 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1262 k
= isl_basic_map_alloc_inequality(bmap
);
1265 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1268 isl_basic_map_free(bmap
);
1272 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1275 return (isl_basic_set
*)
1276 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1279 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1283 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1284 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1285 1 + 1 + isl_basic_map_total_dim(bmap
),
1286 bmap
->extra
- bmap
->n_div
);
1287 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1288 return bmap
->n_div
++;
1291 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1293 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1296 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1300 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1305 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1307 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1310 /* Copy constraint from src to dst, putting the vars of src at offset
1311 * dim_off in dst and the divs of src at offset div_off in dst.
1312 * If both sets are actually map, then dim_off applies to the input
1315 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1316 struct isl_basic_map
*src_map
, isl_int
*src
,
1317 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1319 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1320 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1321 unsigned src_in
= isl_basic_map_n_in(src_map
);
1322 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1323 unsigned src_out
= isl_basic_map_n_out(src_map
);
1324 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1325 isl_int_set(dst
[0], src
[0]);
1326 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1327 if (dst_nparam
> src_nparam
)
1328 isl_seq_clr(dst
+1+src_nparam
,
1329 dst_nparam
- src_nparam
);
1330 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1331 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1333 isl_min(dst_in
-in_off
, src_in
));
1334 if (dst_in
-in_off
> src_in
)
1335 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1336 dst_in
- in_off
- src_in
);
1337 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1338 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1339 src
+1+src_nparam
+src_in
,
1340 isl_min(dst_out
-out_off
, src_out
));
1341 if (dst_out
-out_off
> src_out
)
1342 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1343 dst_out
- out_off
- src_out
);
1344 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1345 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1346 src
+1+src_nparam
+src_in
+src_out
,
1347 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1348 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1349 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1350 div_off
+src_map
->n_div
,
1351 dst_map
->n_div
- div_off
- src_map
->n_div
);
1354 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1355 struct isl_basic_map
*src_map
, isl_int
*src
,
1356 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1358 isl_int_set(dst
[0], src
[0]);
1359 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1362 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1363 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1368 if (!bmap1
|| !bmap2
)
1371 div_off
= bmap1
->n_div
;
1373 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1374 int i1
= isl_basic_map_alloc_equality(bmap1
);
1377 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1378 i_pos
, o_pos
, div_off
);
1381 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1382 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1385 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1386 i_pos
, o_pos
, div_off
);
1389 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1390 int i1
= isl_basic_map_alloc_div(bmap1
);
1393 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1394 i_pos
, o_pos
, div_off
);
1397 isl_basic_map_free(bmap2
);
1402 isl_basic_map_free(bmap1
);
1403 isl_basic_map_free(bmap2
);
1407 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1408 struct isl_basic_set
*bset2
, unsigned pos
)
1410 return (struct isl_basic_set
*)
1411 add_constraints((struct isl_basic_map
*)bset1
,
1412 (struct isl_basic_map
*)bset2
, 0, pos
);
1415 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1416 __isl_take isl_space
*dim
, unsigned extra
,
1417 unsigned n_eq
, unsigned n_ineq
)
1419 struct isl_basic_map
*ext
;
1429 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1430 base
->extra
>= base
->n_div
+ extra
;
1432 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1433 room_for_ineq(base
, n_ineq
)) {
1434 isl_space_free(dim
);
1438 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1439 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1440 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1441 extra
+= base
->extra
;
1443 n_ineq
+= base
->n_ineq
;
1445 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1451 ext
->sample
= isl_vec_copy(base
->sample
);
1452 flags
= base
->flags
;
1453 ext
= add_constraints(ext
, base
, 0, 0);
1456 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1462 isl_space_free(dim
);
1463 isl_basic_map_free(base
);
1467 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1468 __isl_take isl_space
*dim
, unsigned extra
,
1469 unsigned n_eq
, unsigned n_ineq
)
1471 return (struct isl_basic_set
*)
1472 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1473 extra
, n_eq
, n_ineq
);
1476 struct isl_basic_map
*isl_basic_map_extend_constraints(
1477 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1481 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1485 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1486 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1487 unsigned n_eq
, unsigned n_ineq
)
1489 struct isl_basic_map
*bmap
;
1494 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1498 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1501 isl_basic_map_free(base
);
1505 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1506 unsigned nparam
, unsigned dim
, unsigned extra
,
1507 unsigned n_eq
, unsigned n_ineq
)
1509 return (struct isl_basic_set
*)
1510 isl_basic_map_extend((struct isl_basic_map
*)base
,
1511 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1514 struct isl_basic_set
*isl_basic_set_extend_constraints(
1515 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1517 return (struct isl_basic_set
*)
1518 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1522 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1524 return (struct isl_basic_set
*)
1525 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1528 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1533 if (bmap
->ref
> 1) {
1535 bmap
= isl_basic_map_dup(bmap
);
1538 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1542 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1550 return isl_set_dup(set
);
1553 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1561 return isl_map_dup(map
);
1564 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1565 unsigned a_len
, unsigned b_len
)
1567 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1568 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1569 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1572 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1573 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1581 isl_assert(bmap
->ctx
,
1582 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1584 if (n1
== 0 || n2
== 0)
1587 bmap
= isl_basic_map_cow(bmap
);
1591 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1592 if (isl_blk_is_error(blk
))
1595 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1597 bmap
->eq
[i
] + pos
, n1
, n2
);
1599 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1601 bmap
->ineq
[i
] + pos
, n1
, n2
);
1603 for (i
= 0; i
< bmap
->n_div
; ++i
)
1605 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1607 isl_blk_free(bmap
->ctx
, blk
);
1609 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1610 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1611 return isl_basic_map_finalize(bmap
);
1613 isl_basic_map_free(bmap
);
1617 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1618 __isl_take isl_basic_set
*bset
, unsigned n
)
1623 nparam
= isl_basic_set_n_param(bset
);
1624 dim
= isl_basic_set_n_dim(bset
);
1625 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1627 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1629 isl_basic_set_free(bset
);
1633 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1639 total
= isl_basic_map_total_dim(bmap
);
1640 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1641 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1643 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1645 i
= isl_basic_map_alloc_equality(bmap
);
1649 isl_int_set_si(bmap
->eq
[i
][0], 1);
1650 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1651 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1652 isl_vec_free(bmap
->sample
);
1653 bmap
->sample
= NULL
;
1654 return isl_basic_map_finalize(bmap
);
1656 isl_basic_map_free(bmap
);
1660 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1662 return (struct isl_basic_set
*)
1663 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1666 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1669 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1670 isl_int
*t
= bmap
->div
[a
];
1671 bmap
->div
[a
] = bmap
->div
[b
];
1674 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1675 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1677 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1678 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1680 for (i
= 0; i
< bmap
->n_div
; ++i
)
1681 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1682 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1685 /* Eliminate the specified n dimensions starting at first from the
1686 * constraints, without removing the dimensions from the space.
1687 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1689 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1690 enum isl_dim_type type
, unsigned first
, unsigned n
)
1699 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1700 isl_die(map
->ctx
, isl_error_invalid
,
1701 "index out of bounds", goto error
);
1703 map
= isl_map_cow(map
);
1707 for (i
= 0; i
< map
->n
; ++i
) {
1708 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1718 /* Eliminate the specified n dimensions starting at first from the
1719 * constraints, without removing the dimensions from the space.
1720 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1722 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1723 enum isl_dim_type type
, unsigned first
, unsigned n
)
1725 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1728 /* Eliminate the specified n dimensions starting at first from the
1729 * constraints, without removing the dimensions from the space.
1730 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1732 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1733 unsigned first
, unsigned n
)
1735 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1738 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1739 __isl_take isl_basic_map
*bmap
)
1743 bmap
= isl_basic_map_eliminate_vars(bmap
,
1744 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1748 return isl_basic_map_finalize(bmap
);
1751 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1752 __isl_take isl_basic_set
*bset
)
1754 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1755 (struct isl_basic_map
*)bset
);
1758 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1767 map
= isl_map_cow(map
);
1771 for (i
= 0; i
< map
->n
; ++i
) {
1772 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1782 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1784 return isl_map_remove_divs(set
);
1787 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1788 enum isl_dim_type type
, unsigned first
, unsigned n
)
1792 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1794 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1796 bmap
= isl_basic_map_eliminate_vars(bmap
,
1797 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1800 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1802 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1805 isl_basic_map_free(bmap
);
1809 /* Return true if the definition of the given div (recursively) involves
1810 * any of the given variables.
1812 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1813 unsigned first
, unsigned n
)
1816 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1818 if (isl_int_is_zero(bmap
->div
[div
][0]))
1820 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1823 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1824 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1826 if (div_involves_vars(bmap
, i
, first
, n
))
1833 /* Try and add a lower and/or upper bound on "div" to "bmap"
1834 * based on inequality "i".
1835 * "total" is the total number of variables (excluding the divs).
1836 * "v" is a temporary object that can be used during the calculations.
1837 * If "lb" is set, then a lower bound should be constructed.
1838 * If "ub" is set, then an upper bound should be constructed.
1840 * The calling function has already checked that the inequality does not
1841 * reference "div", but we still need to check that the inequality is
1842 * of the right form. We'll consider the case where we want to construct
1843 * a lower bound. The construction of upper bounds is similar.
1845 * Let "div" be of the form
1847 * q = floor((a + f(x))/d)
1849 * We essentially check if constraint "i" is of the form
1853 * so that we can use it to derive a lower bound on "div".
1854 * However, we allow a slightly more general form
1858 * with the condition that the coefficients of g(x) - f(x) are all
1860 * Rewriting this constraint as
1864 * adding a + f(x) to both sides and dividing by d, we obtain
1866 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1868 * Taking the floor on both sides, we obtain
1870 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1874 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1876 * In the case of an upper bound, we construct the constraint
1878 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1881 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1882 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1883 unsigned total
, isl_int v
, int lb
, int ub
)
1887 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1889 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1890 bmap
->div
[div
][1 + 1 + j
]);
1891 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1894 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1895 bmap
->div
[div
][1 + 1 + j
]);
1896 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1902 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1904 int k
= isl_basic_map_alloc_inequality(bmap
);
1907 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1908 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1909 bmap
->div
[div
][1 + j
]);
1910 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1911 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1913 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1916 int k
= isl_basic_map_alloc_inequality(bmap
);
1919 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1920 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1921 bmap
->div
[div
][1 + j
]);
1922 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1923 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1925 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1930 isl_basic_map_free(bmap
);
1934 /* This function is called right before "div" is eliminated from "bmap"
1935 * using Fourier-Motzkin.
1936 * Look through the constraints of "bmap" for constraints on the argument
1937 * of the integer division and use them to construct constraints on the
1938 * integer division itself. These constraints can then be combined
1939 * during the Fourier-Motzkin elimination.
1940 * Note that it is only useful to introduce lower bounds on "div"
1941 * if "bmap" already contains upper bounds on "div" as the newly
1942 * introduce lower bounds can then be combined with the pre-existing
1943 * upper bounds. Similarly for upper bounds.
1944 * We therefore first check if "bmap" contains any lower and/or upper bounds
1947 * It is interesting to note that the introduction of these constraints
1948 * can indeed lead to more accurate results, even when compared to
1949 * deriving constraints on the argument of "div" from constraints on "div".
1950 * Consider, for example, the set
1952 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1954 * The second constraint can be rewritten as
1956 * 2 * [(-i-2j+3)/4] + k >= 0
1958 * from which we can derive
1960 * -i - 2j + 3 >= -2k
1966 * Combined with the first constraint, we obtain
1968 * -3 <= 3 + 2k or k >= -3
1970 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1971 * the first constraint, we obtain
1973 * [(i + 2j)/4] >= [-3/4] = -1
1975 * Combining this constraint with the second constraint, we obtain
1979 static __isl_give isl_basic_map
*insert_bounds_on_div(
1980 __isl_take isl_basic_map
*bmap
, int div
)
1983 int check_lb
, check_ub
;
1990 if (isl_int_is_zero(bmap
->div
[div
][0]))
1993 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1997 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
1998 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2005 if (!check_lb
&& !check_ub
)
2010 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2011 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2014 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2015 check_lb
, check_ub
);
2023 /* Remove all divs (recursively) involving any of the given dimensions
2024 * in their definitions.
2026 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2027 __isl_take isl_basic_map
*bmap
,
2028 enum isl_dim_type type
, unsigned first
, unsigned n
)
2034 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2036 first
+= isl_basic_map_offset(bmap
, type
);
2038 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2039 if (!div_involves_vars(bmap
, i
, first
, n
))
2041 bmap
= insert_bounds_on_div(bmap
, i
);
2042 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2050 isl_basic_map_free(bmap
);
2054 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2055 __isl_take isl_basic_set
*bset
,
2056 enum isl_dim_type type
, unsigned first
, unsigned n
)
2058 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2061 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2062 enum isl_dim_type type
, unsigned first
, unsigned n
)
2071 map
= isl_map_cow(map
);
2075 for (i
= 0; i
< map
->n
; ++i
) {
2076 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2087 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2088 enum isl_dim_type type
, unsigned first
, unsigned n
)
2090 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2094 /* Does the desciption of "bmap" depend on the specified dimensions?
2095 * We also check whether the dimensions appear in any of the div definitions.
2096 * In principle there is no need for this check. If the dimensions appear
2097 * in a div definition, they also appear in the defining constraints of that
2100 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2101 enum isl_dim_type type
, unsigned first
, unsigned n
)
2108 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2109 isl_die(bmap
->ctx
, isl_error_invalid
,
2110 "index out of bounds", return -1);
2112 first
+= isl_basic_map_offset(bmap
, type
);
2113 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2114 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2116 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2117 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2119 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2120 if (isl_int_is_zero(bmap
->div
[i
][0]))
2122 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2129 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2130 enum isl_dim_type type
, unsigned first
, unsigned n
)
2137 if (first
+ n
> isl_map_dim(map
, type
))
2138 isl_die(map
->ctx
, isl_error_invalid
,
2139 "index out of bounds", return -1);
2141 for (i
= 0; i
< map
->n
; ++i
) {
2142 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2144 if (involves
< 0 || involves
)
2151 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2152 enum isl_dim_type type
, unsigned first
, unsigned n
)
2154 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2157 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2158 enum isl_dim_type type
, unsigned first
, unsigned n
)
2160 return isl_map_involves_dims(set
, type
, first
, n
);
2163 /* Return true if the definition of the given div is unknown or depends
2166 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2169 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2171 if (isl_int_is_zero(bmap
->div
[div
][0]))
2174 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2175 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2177 if (div_is_unknown(bmap
, i
))
2184 /* Remove all divs that are unknown or defined in terms of unknown divs.
2186 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2187 __isl_take isl_basic_map
*bmap
)
2194 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2195 if (!div_is_unknown(bmap
, i
))
2197 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2206 /* Remove all divs that are unknown or defined in terms of unknown divs.
2208 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2209 __isl_take isl_basic_set
*bset
)
2211 return isl_basic_map_remove_unknown_divs(bset
);
2214 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2223 map
= isl_map_cow(map
);
2227 for (i
= 0; i
< map
->n
; ++i
) {
2228 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2238 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2240 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2243 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2244 __isl_take isl_basic_set
*bset
,
2245 enum isl_dim_type type
, unsigned first
, unsigned n
)
2247 return (isl_basic_set
*)
2248 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2251 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2252 enum isl_dim_type type
, unsigned first
, unsigned n
)
2259 map
= isl_map_cow(map
);
2262 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2264 for (i
= 0; i
< map
->n
; ++i
) {
2265 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2266 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2270 map
= isl_map_drop(map
, type
, first
, n
);
2277 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2278 enum isl_dim_type type
, unsigned first
, unsigned n
)
2280 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2283 /* Project out n inputs starting at first using Fourier-Motzkin */
2284 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2285 unsigned first
, unsigned n
)
2287 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2290 static void dump_term(struct isl_basic_map
*bmap
,
2291 isl_int c
, int pos
, FILE *out
)
2294 unsigned in
= isl_basic_map_n_in(bmap
);
2295 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2296 unsigned nparam
= isl_basic_map_n_param(bmap
);
2298 isl_int_print(out
, c
, 0);
2300 if (!isl_int_is_one(c
))
2301 isl_int_print(out
, c
, 0);
2302 if (pos
< 1 + nparam
) {
2303 name
= isl_space_get_dim_name(bmap
->dim
,
2304 isl_dim_param
, pos
- 1);
2306 fprintf(out
, "%s", name
);
2308 fprintf(out
, "p%d", pos
- 1);
2309 } else if (pos
< 1 + nparam
+ in
)
2310 fprintf(out
, "i%d", pos
- 1 - nparam
);
2311 else if (pos
< 1 + nparam
+ dim
)
2312 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2314 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2318 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2319 int sign
, FILE *out
)
2323 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2327 for (i
= 0, first
= 1; i
< len
; ++i
) {
2328 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2331 fprintf(out
, " + ");
2333 isl_int_abs(v
, c
[i
]);
2334 dump_term(bmap
, v
, i
, out
);
2341 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2342 const char *op
, FILE *out
, int indent
)
2346 fprintf(out
, "%*s", indent
, "");
2348 dump_constraint_sign(bmap
, c
, 1, out
);
2349 fprintf(out
, " %s ", op
);
2350 dump_constraint_sign(bmap
, c
, -1, out
);
2354 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2355 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2357 fprintf(out
, "%*s", indent
, "");
2358 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2363 static void dump_constraints(struct isl_basic_map
*bmap
,
2364 isl_int
**c
, unsigned n
,
2365 const char *op
, FILE *out
, int indent
)
2369 for (i
= 0; i
< n
; ++i
)
2370 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2373 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2377 unsigned total
= isl_basic_map_total_dim(bmap
);
2379 for (j
= 0; j
< 1 + total
; ++j
) {
2380 if (isl_int_is_zero(exp
[j
]))
2382 if (!first
&& isl_int_is_pos(exp
[j
]))
2384 dump_term(bmap
, exp
[j
], j
, out
);
2389 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2393 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2394 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2396 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2397 fprintf(out
, "%*s", indent
, "");
2398 fprintf(out
, "e%d = [(", i
);
2399 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2401 isl_int_print(out
, bmap
->div
[i
][0], 0);
2402 fprintf(out
, "]\n");
2406 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2407 FILE *out
, int indent
)
2410 fprintf(out
, "null basic set\n");
2414 fprintf(out
, "%*s", indent
, "");
2415 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2416 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2417 bset
->extra
, bset
->flags
);
2418 dump((struct isl_basic_map
*)bset
, out
, indent
);
2421 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2422 FILE *out
, int indent
)
2425 fprintf(out
, "null basic map\n");
2429 fprintf(out
, "%*s", indent
, "");
2430 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2431 "flags: %x, n_name: %d\n",
2433 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2434 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2435 dump(bmap
, out
, indent
);
2438 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2443 total
= isl_basic_map_total_dim(bmap
);
2444 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2445 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2446 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2447 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2451 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2454 struct isl_set
*set
;
2458 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2459 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2460 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2461 sizeof(struct isl_set
) +
2462 (n
- 1) * sizeof(struct isl_basic_set
*));
2466 set
->ctx
= dim
->ctx
;
2467 isl_ctx_ref(set
->ctx
);
2475 isl_space_free(dim
);
2479 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2480 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2482 struct isl_set
*set
;
2485 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2489 set
= isl_set_alloc_space(dims
, n
, flags
);
2493 /* Make sure "map" has room for at least "n" more basic maps.
2495 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2498 struct isl_map
*grown
= NULL
;
2502 isl_assert(map
->ctx
, n
>= 0, goto error
);
2503 if (map
->n
+ n
<= map
->size
)
2505 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2508 for (i
= 0; i
< map
->n
; ++i
) {
2509 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2517 isl_map_free(grown
);
2522 /* Make sure "set" has room for at least "n" more basic sets.
2524 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2526 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2529 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2532 struct isl_set
*dup
;
2537 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2540 for (i
= 0; i
< set
->n
; ++i
)
2541 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2545 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2547 return isl_map_from_basic_map(bset
);
2550 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2552 struct isl_map
*map
;
2557 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2558 return isl_map_add_basic_map(map
, bmap
);
2561 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2562 __isl_take isl_basic_set
*bset
)
2564 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2565 (struct isl_basic_map
*)bset
);
2568 void *isl_set_free(__isl_take isl_set
*set
)
2578 isl_ctx_deref(set
->ctx
);
2579 for (i
= 0; i
< set
->n
; ++i
)
2580 isl_basic_set_free(set
->p
[i
]);
2581 isl_space_free(set
->dim
);
2587 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2592 fprintf(out
, "null set\n");
2596 fprintf(out
, "%*s", indent
, "");
2597 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2598 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2600 for (i
= 0; i
< set
->n
; ++i
) {
2601 fprintf(out
, "%*s", indent
, "");
2602 fprintf(out
, "basic set %d:\n", i
);
2603 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2607 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2612 fprintf(out
, "null map\n");
2616 fprintf(out
, "%*s", indent
, "");
2617 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2618 "flags: %x, n_name: %d\n",
2619 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2620 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2621 for (i
= 0; i
< map
->n
; ++i
) {
2622 fprintf(out
, "%*s", indent
, "");
2623 fprintf(out
, "basic map %d:\n", i
);
2624 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2628 struct isl_basic_map
*isl_basic_map_intersect_domain(
2629 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2631 struct isl_basic_map
*bmap_domain
;
2636 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2637 bset
->dim
, isl_dim_param
), goto error
);
2639 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2640 isl_assert(bset
->ctx
,
2641 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2643 bmap
= isl_basic_map_cow(bmap
);
2646 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2647 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2648 bmap_domain
= isl_basic_map_from_domain(bset
);
2649 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2651 bmap
= isl_basic_map_simplify(bmap
);
2652 return isl_basic_map_finalize(bmap
);
2654 isl_basic_map_free(bmap
);
2655 isl_basic_set_free(bset
);
2659 struct isl_basic_map
*isl_basic_map_intersect_range(
2660 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2662 struct isl_basic_map
*bmap_range
;
2667 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2668 bset
->dim
, isl_dim_param
), goto error
);
2670 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2671 isl_assert(bset
->ctx
,
2672 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2674 if (isl_basic_set_is_universe(bset
)) {
2675 isl_basic_set_free(bset
);
2679 bmap
= isl_basic_map_cow(bmap
);
2682 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2683 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2684 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2685 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2687 bmap
= isl_basic_map_simplify(bmap
);
2688 return isl_basic_map_finalize(bmap
);
2690 isl_basic_map_free(bmap
);
2691 isl_basic_set_free(bset
);
2695 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2701 total
= 1 + isl_basic_map_total_dim(bmap
);
2702 if (total
!= vec
->size
)
2707 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2708 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2709 if (!isl_int_is_zero(s
)) {
2715 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2716 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2717 if (isl_int_is_neg(s
)) {
2728 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2730 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2733 struct isl_basic_map
*isl_basic_map_intersect(
2734 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2736 struct isl_vec
*sample
= NULL
;
2738 if (!bmap1
|| !bmap2
)
2741 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2742 bmap2
->dim
, isl_dim_param
), goto error
);
2743 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2744 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2745 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2746 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2747 return isl_basic_map_intersect(bmap2
, bmap1
);
2749 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2750 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2751 isl_assert(bmap1
->ctx
,
2752 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2754 if (bmap1
->sample
&&
2755 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2756 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2757 sample
= isl_vec_copy(bmap1
->sample
);
2758 else if (bmap2
->sample
&&
2759 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2760 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2761 sample
= isl_vec_copy(bmap2
->sample
);
2763 bmap1
= isl_basic_map_cow(bmap1
);
2766 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2767 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2768 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2771 isl_vec_free(sample
);
2773 isl_vec_free(bmap1
->sample
);
2774 bmap1
->sample
= sample
;
2777 bmap1
= isl_basic_map_simplify(bmap1
);
2778 return isl_basic_map_finalize(bmap1
);
2781 isl_vec_free(sample
);
2782 isl_basic_map_free(bmap1
);
2783 isl_basic_map_free(bmap2
);
2787 struct isl_basic_set
*isl_basic_set_intersect(
2788 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2790 return (struct isl_basic_set
*)
2791 isl_basic_map_intersect(
2792 (struct isl_basic_map
*)bset1
,
2793 (struct isl_basic_map
*)bset2
);
2796 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2797 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2799 return isl_basic_set_intersect(bset1
, bset2
);
2802 /* Special case of isl_map_intersect, where both map1 and map2
2803 * are convex, without any divs and such that either map1 or map2
2804 * contains a single constraint. This constraint is then simply
2805 * added to the other map.
2807 static __isl_give isl_map
*map_intersect_add_constraint(
2808 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2810 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2811 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2812 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2813 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2815 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2816 return isl_map_intersect(map2
, map1
);
2818 isl_assert(map2
->ctx
,
2819 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2821 map1
= isl_map_cow(map1
);
2824 if (isl_map_plain_is_empty(map1
)) {
2828 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2829 if (map2
->p
[0]->n_eq
== 1)
2830 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2832 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2833 map2
->p
[0]->ineq
[0]);
2835 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2836 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2840 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2841 isl_basic_map_free(map1
->p
[0]);
2854 /* map2 may be either a parameter domain or a map living in the same
2857 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2858 __isl_take isl_map
*map2
)
2861 struct isl_map
*result
;
2867 if ((isl_map_plain_is_empty(map1
) ||
2868 isl_map_plain_is_universe(map2
)) &&
2869 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2873 if ((isl_map_plain_is_empty(map2
) ||
2874 isl_map_plain_is_universe(map1
)) &&
2875 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2880 if (map1
->n
== 1 && map2
->n
== 1 &&
2881 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2882 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2883 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2884 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2885 return map_intersect_add_constraint(map1
, map2
);
2887 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2888 isl_space_dim(map2
->dim
, isl_dim_param
))
2889 isl_assert(map1
->ctx
,
2890 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2892 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2893 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2894 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2896 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2897 map1
->n
* map2
->n
, flags
);
2900 for (i
= 0; i
< map1
->n
; ++i
)
2901 for (j
= 0; j
< map2
->n
; ++j
) {
2902 struct isl_basic_map
*part
;
2903 part
= isl_basic_map_intersect(
2904 isl_basic_map_copy(map1
->p
[i
]),
2905 isl_basic_map_copy(map2
->p
[j
]));
2906 if (isl_basic_map_is_empty(part
) < 0)
2908 result
= isl_map_add_basic_map(result
, part
);
2921 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2922 __isl_take isl_map
*map2
)
2926 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2927 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2928 "spaces don't match", goto error
);
2929 return map_intersect_internal(map1
, map2
);
2936 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2937 __isl_take isl_map
*map2
)
2939 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2942 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2944 return (struct isl_set
*)
2945 isl_map_intersect((struct isl_map
*)set1
,
2946 (struct isl_map
*)set2
);
2949 /* map_intersect_internal accepts intersections
2950 * with parameter domains, so we can just call that function.
2952 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2953 __isl_take isl_set
*params
)
2955 return map_intersect_internal(map
, params
);
2958 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2959 __isl_take isl_map
*map2
)
2961 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2964 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2965 __isl_take isl_set
*params
)
2967 return isl_map_intersect_params(set
, params
);
2970 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2973 struct isl_basic_set
*bset
;
2978 bmap
= isl_basic_map_cow(bmap
);
2981 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2982 in
= isl_basic_map_n_in(bmap
);
2983 bset
= isl_basic_set_from_basic_map(bmap
);
2984 bset
= isl_basic_set_swap_vars(bset
, in
);
2985 return isl_basic_map_from_basic_set(bset
, dim
);
2988 static __isl_give isl_basic_map
*basic_map_space_reset(
2989 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2993 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
2996 space
= isl_basic_map_get_space(bmap
);
2997 space
= isl_space_reset(space
, type
);
2998 bmap
= isl_basic_map_reset_space(bmap
, space
);
3002 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3003 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3004 unsigned pos
, unsigned n
)
3007 struct isl_basic_map
*res
;
3008 struct isl_dim_map
*dim_map
;
3009 unsigned total
, off
;
3010 enum isl_dim_type t
;
3013 return basic_map_space_reset(bmap
, type
);
3018 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3020 total
= isl_basic_map_total_dim(bmap
) + n
;
3021 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3023 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3025 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3027 unsigned size
= isl_basic_map_dim(bmap
, t
);
3028 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3030 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3031 pos
, size
- pos
, off
+ pos
+ n
);
3033 off
+= isl_space_dim(res_dim
, t
);
3035 isl_dim_map_div(dim_map
, bmap
, off
);
3037 res
= isl_basic_map_alloc_space(res_dim
,
3038 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3039 if (isl_basic_map_is_rational(bmap
))
3040 res
= isl_basic_map_set_rational(res
);
3041 if (isl_basic_map_plain_is_empty(bmap
)) {
3042 isl_basic_map_free(bmap
);
3043 return isl_basic_map_set_to_empty(res
);
3045 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3046 return isl_basic_map_finalize(res
);
3049 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3050 __isl_take isl_basic_set
*bset
,
3051 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3053 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3056 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3057 enum isl_dim_type type
, unsigned n
)
3061 return isl_basic_map_insert_dims(bmap
, type
,
3062 isl_basic_map_dim(bmap
, type
), n
);
3065 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
3066 enum isl_dim_type type
, unsigned n
)
3070 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3071 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3073 isl_basic_set_free(bset
);
3077 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3078 enum isl_dim_type type
)
3082 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3085 space
= isl_map_get_space(map
);
3086 space
= isl_space_reset(space
, type
);
3087 map
= isl_map_reset_space(map
, space
);
3091 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3092 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3097 return map_space_reset(map
, type
);
3099 map
= isl_map_cow(map
);
3103 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3107 for (i
= 0; i
< map
->n
; ++i
) {
3108 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3119 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3120 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3122 return isl_map_insert_dims(set
, type
, pos
, n
);
3125 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3126 enum isl_dim_type type
, unsigned n
)
3130 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3133 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3134 enum isl_dim_type type
, unsigned n
)
3138 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3139 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3145 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3146 __isl_take isl_basic_map
*bmap
,
3147 enum isl_dim_type dst_type
, unsigned dst_pos
,
3148 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3150 struct isl_dim_map
*dim_map
;
3151 struct isl_basic_map
*res
;
3152 enum isl_dim_type t
;
3153 unsigned total
, off
;
3160 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3163 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3166 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3168 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3169 pos(bmap
->dim
, src_type
) + src_pos
+
3170 ((src_type
< dst_type
) ? n
: 0)) {
3171 bmap
= isl_basic_map_cow(bmap
);
3175 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3176 src_type
, src_pos
, n
);
3180 bmap
= isl_basic_map_finalize(bmap
);
3185 total
= isl_basic_map_total_dim(bmap
);
3186 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3189 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3190 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3191 if (t
== dst_type
) {
3192 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3195 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3198 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3199 dst_pos
, size
- dst_pos
, off
);
3200 off
+= size
- dst_pos
;
3201 } else if (t
== src_type
) {
3202 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3205 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3206 src_pos
+ n
, size
- src_pos
- n
, off
);
3207 off
+= size
- src_pos
- n
;
3209 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3213 isl_dim_map_div(dim_map
, bmap
, off
);
3215 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3216 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3217 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3219 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3220 src_type
, src_pos
, n
);
3224 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3225 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3226 bmap
= isl_basic_map_finalize(bmap
);
3230 isl_basic_map_free(bmap
);
3234 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3235 enum isl_dim_type dst_type
, unsigned dst_pos
,
3236 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3238 return (isl_basic_set
*)isl_basic_map_move_dims(
3239 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3242 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3243 enum isl_dim_type dst_type
, unsigned dst_pos
,
3244 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3248 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3249 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3250 src_type
, src_pos
, n
);
3256 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3257 enum isl_dim_type dst_type
, unsigned dst_pos
,
3258 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3267 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3270 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3273 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3275 map
= isl_map_cow(map
);
3279 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3283 for (i
= 0; i
< map
->n
; ++i
) {
3284 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3286 src_type
, src_pos
, n
);
3297 /* Move the specified dimensions to the last columns right before
3298 * the divs. Don't change the dimension specification of bmap.
3299 * That's the responsibility of the caller.
3301 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3302 enum isl_dim_type type
, unsigned first
, unsigned n
)
3304 struct isl_dim_map
*dim_map
;
3305 struct isl_basic_map
*res
;
3306 enum isl_dim_type t
;
3307 unsigned total
, off
;
3311 if (pos(bmap
->dim
, type
) + first
+ n
==
3312 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3315 total
= isl_basic_map_total_dim(bmap
);
3316 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3319 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3320 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3322 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3325 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3326 first
, n
, total
- bmap
->n_div
- n
);
3327 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3328 first
+ n
, size
- (first
+ n
), off
);
3329 off
+= size
- (first
+ n
);
3331 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3335 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3337 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3338 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3339 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3343 /* Turn the n dimensions of type type, starting at first
3344 * into existentially quantified variables.
3346 __isl_give isl_basic_map
*isl_basic_map_project_out(
3347 __isl_take isl_basic_map
*bmap
,
3348 enum isl_dim_type type
, unsigned first
, unsigned n
)
3356 return basic_map_space_reset(bmap
, type
);
3361 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3362 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3364 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3367 bmap
= move_last(bmap
, type
, first
, n
);
3368 bmap
= isl_basic_map_cow(bmap
);
3372 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3373 old
= bmap
->block2
.data
;
3374 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3375 (bmap
->extra
+ n
) * (1 + row_size
));
3376 if (!bmap
->block2
.data
)
3378 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3381 for (i
= 0; i
< n
; ++i
) {
3382 new_div
[i
] = bmap
->block2
.data
+
3383 (bmap
->extra
+ i
) * (1 + row_size
);
3384 isl_seq_clr(new_div
[i
], 1 + row_size
);
3386 for (i
= 0; i
< bmap
->extra
; ++i
)
3387 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3389 bmap
->div
= new_div
;
3393 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3396 bmap
= isl_basic_map_simplify(bmap
);
3397 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3398 return isl_basic_map_finalize(bmap
);
3400 isl_basic_map_free(bmap
);
3404 /* Turn the n dimensions of type type, starting at first
3405 * into existentially quantified variables.
3407 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3408 enum isl_dim_type type
, unsigned first
, unsigned n
)
3410 return (isl_basic_set
*)isl_basic_map_project_out(
3411 (isl_basic_map
*)bset
, type
, first
, n
);
3414 /* Turn the n dimensions of type type, starting at first
3415 * into existentially quantified variables.
3417 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3418 enum isl_dim_type type
, unsigned first
, unsigned n
)
3426 return map_space_reset(map
, type
);
3428 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3430 map
= isl_map_cow(map
);
3434 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3438 for (i
= 0; i
< map
->n
; ++i
) {
3439 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3450 /* Turn the n dimensions of type type, starting at first
3451 * into existentially quantified variables.
3453 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3454 enum isl_dim_type type
, unsigned first
, unsigned n
)
3456 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3459 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3463 for (i
= 0; i
< n
; ++i
) {
3464 j
= isl_basic_map_alloc_div(bmap
);
3467 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3471 isl_basic_map_free(bmap
);
3475 struct isl_basic_map
*isl_basic_map_apply_range(
3476 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3478 isl_space
*dim_result
= NULL
;
3479 struct isl_basic_map
*bmap
;
3480 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3481 struct isl_dim_map
*dim_map1
, *dim_map2
;
3483 if (!bmap1
|| !bmap2
)
3486 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3487 isl_space_copy(bmap2
->dim
));
3489 n_in
= isl_basic_map_n_in(bmap1
);
3490 n_out
= isl_basic_map_n_out(bmap2
);
3491 n
= isl_basic_map_n_out(bmap1
);
3492 nparam
= isl_basic_map_n_param(bmap1
);
3494 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3495 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3496 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3497 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3498 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3499 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3500 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3501 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3502 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3503 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3504 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3506 bmap
= isl_basic_map_alloc_space(dim_result
,
3507 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3508 bmap1
->n_eq
+ bmap2
->n_eq
,
3509 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3510 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3511 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3512 bmap
= add_divs(bmap
, n
);
3513 bmap
= isl_basic_map_simplify(bmap
);
3514 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3515 return isl_basic_map_finalize(bmap
);
3517 isl_basic_map_free(bmap1
);
3518 isl_basic_map_free(bmap2
);
3522 struct isl_basic_set
*isl_basic_set_apply(
3523 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3528 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3531 return (struct isl_basic_set
*)
3532 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3534 isl_basic_set_free(bset
);
3535 isl_basic_map_free(bmap
);
3539 struct isl_basic_map
*isl_basic_map_apply_domain(
3540 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3542 if (!bmap1
|| !bmap2
)
3545 isl_assert(bmap1
->ctx
,
3546 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3547 isl_assert(bmap1
->ctx
,
3548 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3551 bmap1
= isl_basic_map_reverse(bmap1
);
3552 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3553 return isl_basic_map_reverse(bmap1
);
3555 isl_basic_map_free(bmap1
);
3556 isl_basic_map_free(bmap2
);
3560 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3561 * A \cap B -> f(A) + f(B)
3563 struct isl_basic_map
*isl_basic_map_sum(
3564 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3566 unsigned n_in
, n_out
, nparam
, total
, pos
;
3567 struct isl_basic_map
*bmap
= NULL
;
3568 struct isl_dim_map
*dim_map1
, *dim_map2
;
3571 if (!bmap1
|| !bmap2
)
3574 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3577 nparam
= isl_basic_map_n_param(bmap1
);
3578 n_in
= isl_basic_map_n_in(bmap1
);
3579 n_out
= isl_basic_map_n_out(bmap1
);
3581 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3582 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3583 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3584 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3585 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3586 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3587 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3588 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3589 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3590 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3591 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3593 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3594 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3595 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3596 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3597 for (i
= 0; i
< n_out
; ++i
) {
3598 int j
= isl_basic_map_alloc_equality(bmap
);
3601 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3602 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3603 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3604 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3606 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3607 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3608 bmap
= add_divs(bmap
, 2 * n_out
);
3610 bmap
= isl_basic_map_simplify(bmap
);
3611 return isl_basic_map_finalize(bmap
);
3613 isl_basic_map_free(bmap
);
3614 isl_basic_map_free(bmap1
);
3615 isl_basic_map_free(bmap2
);
3619 /* Given two maps A -> f(A) and B -> g(B), construct a map
3620 * A \cap B -> f(A) + f(B)
3622 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3624 struct isl_map
*result
;
3630 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3632 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3633 map1
->n
* map2
->n
, 0);
3636 for (i
= 0; i
< map1
->n
; ++i
)
3637 for (j
= 0; j
< map2
->n
; ++j
) {
3638 struct isl_basic_map
*part
;
3639 part
= isl_basic_map_sum(
3640 isl_basic_map_copy(map1
->p
[i
]),
3641 isl_basic_map_copy(map2
->p
[j
]));
3642 if (isl_basic_map_is_empty(part
))
3643 isl_basic_map_free(part
);
3645 result
= isl_map_add_basic_map(result
, part
);
3658 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3659 __isl_take isl_set
*set2
)
3661 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3664 /* Given a basic map A -> f(A), construct A -> -f(A).
3666 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3671 bmap
= isl_basic_map_cow(bmap
);
3675 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3676 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3677 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3678 for (j
= 0; j
< n
; ++j
)
3679 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3680 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3681 for (j
= 0; j
< n
; ++j
)
3682 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3683 for (i
= 0; i
< bmap
->n_div
; ++i
)
3684 for (j
= 0; j
< n
; ++j
)
3685 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3686 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3687 return isl_basic_map_finalize(bmap
);
3690 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3692 return isl_basic_map_neg(bset
);
3695 /* Given a map A -> f(A), construct A -> -f(A).
3697 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3701 map
= isl_map_cow(map
);
3705 for (i
= 0; i
< map
->n
; ++i
) {
3706 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3717 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3719 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3722 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3723 * A -> floor(f(A)/d).
3725 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3728 unsigned n_in
, n_out
, nparam
, total
, pos
;
3729 struct isl_basic_map
*result
= NULL
;
3730 struct isl_dim_map
*dim_map
;
3736 nparam
= isl_basic_map_n_param(bmap
);
3737 n_in
= isl_basic_map_n_in(bmap
);
3738 n_out
= isl_basic_map_n_out(bmap
);
3740 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3741 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3742 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3743 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3744 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3745 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3747 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3748 bmap
->n_div
+ n_out
,
3749 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3750 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3751 result
= add_divs(result
, n_out
);
3752 for (i
= 0; i
< n_out
; ++i
) {
3754 j
= isl_basic_map_alloc_inequality(result
);
3757 isl_seq_clr(result
->ineq
[j
], 1+total
);
3758 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3759 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3760 j
= isl_basic_map_alloc_inequality(result
);
3763 isl_seq_clr(result
->ineq
[j
], 1+total
);
3764 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3765 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3766 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3769 result
= isl_basic_map_simplify(result
);
3770 return isl_basic_map_finalize(result
);
3772 isl_basic_map_free(result
);
3776 /* Given a map A -> f(A) and an integer d, construct a map
3777 * A -> floor(f(A)/d).
3779 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3783 map
= isl_map_cow(map
);
3787 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3788 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3789 for (i
= 0; i
< map
->n
; ++i
) {
3790 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3801 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3807 i
= isl_basic_map_alloc_equality(bmap
);
3810 nparam
= isl_basic_map_n_param(bmap
);
3811 n_in
= isl_basic_map_n_in(bmap
);
3812 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3813 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3814 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3815 return isl_basic_map_finalize(bmap
);
3817 isl_basic_map_free(bmap
);
3821 /* Add a constraints to "bmap" expressing i_pos < o_pos
3823 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3829 i
= isl_basic_map_alloc_inequality(bmap
);
3832 nparam
= isl_basic_map_n_param(bmap
);
3833 n_in
= isl_basic_map_n_in(bmap
);
3834 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3835 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3836 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3837 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3838 return isl_basic_map_finalize(bmap
);
3840 isl_basic_map_free(bmap
);
3844 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3846 static __isl_give isl_basic_map
*var_less_or_equal(
3847 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3853 i
= isl_basic_map_alloc_inequality(bmap
);
3856 nparam
= isl_basic_map_n_param(bmap
);
3857 n_in
= isl_basic_map_n_in(bmap
);
3858 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3859 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3860 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3861 return isl_basic_map_finalize(bmap
);
3863 isl_basic_map_free(bmap
);
3867 /* Add a constraints to "bmap" expressing i_pos > o_pos
3869 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3875 i
= isl_basic_map_alloc_inequality(bmap
);
3878 nparam
= isl_basic_map_n_param(bmap
);
3879 n_in
= isl_basic_map_n_in(bmap
);
3880 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3881 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3882 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3883 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3884 return isl_basic_map_finalize(bmap
);
3886 isl_basic_map_free(bmap
);
3890 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3892 static __isl_give isl_basic_map
*var_more_or_equal(
3893 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3899 i
= isl_basic_map_alloc_inequality(bmap
);
3902 nparam
= isl_basic_map_n_param(bmap
);
3903 n_in
= isl_basic_map_n_in(bmap
);
3904 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3905 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3906 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3907 return isl_basic_map_finalize(bmap
);
3909 isl_basic_map_free(bmap
);
3913 __isl_give isl_basic_map
*isl_basic_map_equal(
3914 __isl_take isl_space
*dim
, unsigned n_equal
)
3917 struct isl_basic_map
*bmap
;
3918 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3921 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3922 bmap
= var_equal(bmap
, i
);
3923 return isl_basic_map_finalize(bmap
);
3926 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3928 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3932 struct isl_basic_map
*bmap
;
3933 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3936 for (i
= 0; i
< pos
&& bmap
; ++i
)
3937 bmap
= var_equal(bmap
, i
);
3939 bmap
= var_less(bmap
, pos
);
3940 return isl_basic_map_finalize(bmap
);
3943 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3945 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3946 __isl_take isl_space
*dim
, unsigned pos
)
3949 isl_basic_map
*bmap
;
3951 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3952 for (i
= 0; i
< pos
; ++i
)
3953 bmap
= var_equal(bmap
, i
);
3954 bmap
= var_less_or_equal(bmap
, pos
);
3955 return isl_basic_map_finalize(bmap
);
3958 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3960 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3964 struct isl_basic_map
*bmap
;
3965 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3968 for (i
= 0; i
< pos
&& bmap
; ++i
)
3969 bmap
= var_equal(bmap
, i
);
3971 bmap
= var_more(bmap
, pos
);
3972 return isl_basic_map_finalize(bmap
);
3975 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3977 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3978 __isl_take isl_space
*dim
, unsigned pos
)
3981 isl_basic_map
*bmap
;
3983 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3984 for (i
= 0; i
< pos
; ++i
)
3985 bmap
= var_equal(bmap
, i
);
3986 bmap
= var_more_or_equal(bmap
, pos
);
3987 return isl_basic_map_finalize(bmap
);
3990 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3991 unsigned n
, int equal
)
3993 struct isl_map
*map
;
3996 if (n
== 0 && equal
)
3997 return isl_map_universe(dims
);
3999 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4001 for (i
= 0; i
+ 1 < n
; ++i
)
4002 map
= isl_map_add_basic_map(map
,
4003 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4006 map
= isl_map_add_basic_map(map
,
4007 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4009 map
= isl_map_add_basic_map(map
,
4010 isl_basic_map_less_at(dims
, n
- 1));
4012 isl_space_free(dims
);
4017 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4021 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4024 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4026 return map_lex_lte_first(dim
, n
, 0);
4029 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4031 return map_lex_lte_first(dim
, n
, 1);
4034 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4036 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4039 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4041 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4044 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4045 unsigned n
, int equal
)
4047 struct isl_map
*map
;
4050 if (n
== 0 && equal
)
4051 return isl_map_universe(dims
);
4053 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4055 for (i
= 0; i
+ 1 < n
; ++i
)
4056 map
= isl_map_add_basic_map(map
,
4057 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4060 map
= isl_map_add_basic_map(map
,
4061 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4063 map
= isl_map_add_basic_map(map
,
4064 isl_basic_map_more_at(dims
, n
- 1));
4066 isl_space_free(dims
);
4071 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4075 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4078 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4080 return map_lex_gte_first(dim
, n
, 0);
4083 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4085 return map_lex_gte_first(dim
, n
, 1);
4088 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4090 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4093 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4095 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4098 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4099 __isl_take isl_set
*set2
)
4102 map
= isl_map_lex_le(isl_set_get_space(set1
));
4103 map
= isl_map_intersect_domain(map
, set1
);
4104 map
= isl_map_intersect_range(map
, set2
);
4108 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4109 __isl_take isl_set
*set2
)
4112 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4113 map
= isl_map_intersect_domain(map
, set1
);
4114 map
= isl_map_intersect_range(map
, set2
);
4118 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4119 __isl_take isl_set
*set2
)
4122 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4123 map
= isl_map_intersect_domain(map
, set1
);
4124 map
= isl_map_intersect_range(map
, set2
);
4128 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4129 __isl_take isl_set
*set2
)
4132 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4133 map
= isl_map_intersect_domain(map
, set1
);
4134 map
= isl_map_intersect_range(map
, set2
);
4138 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4139 __isl_take isl_map
*map2
)
4142 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4143 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4144 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4148 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4149 __isl_take isl_map
*map2
)
4152 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4153 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4154 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4158 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4159 __isl_take isl_map
*map2
)
4162 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4163 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4164 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4168 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4169 __isl_take isl_map
*map2
)
4172 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4173 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4174 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4178 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4179 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4181 struct isl_basic_map
*bmap
;
4183 bset
= isl_basic_set_cow(bset
);
4187 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4188 isl_space_free(bset
->dim
);
4189 bmap
= (struct isl_basic_map
*) bset
;
4191 return isl_basic_map_finalize(bmap
);
4193 isl_basic_set_free(bset
);
4194 isl_space_free(dim
);
4198 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4202 if (bmap
->dim
->n_in
== 0)
4203 return (struct isl_basic_set
*)bmap
;
4204 bmap
= isl_basic_map_cow(bmap
);
4207 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4210 bmap
= isl_basic_map_finalize(bmap
);
4211 return (struct isl_basic_set
*)bmap
;
4213 isl_basic_map_free(bmap
);
4217 /* For a div d = floor(f/m), add the constraints
4220 * -(f-(n-1)) + m d >= 0
4222 * Note that the second constraint is the negation of
4226 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4227 unsigned pos
, isl_int
*div
)
4230 unsigned total
= isl_basic_map_total_dim(bmap
);
4232 i
= isl_basic_map_alloc_inequality(bmap
);
4235 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4236 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4238 j
= isl_basic_map_alloc_inequality(bmap
);
4241 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4242 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4243 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4247 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4248 unsigned pos
, isl_int
*div
)
4250 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4254 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4256 unsigned total
= isl_basic_map_total_dim(bmap
);
4257 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4259 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4263 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4265 return isl_basic_map_add_div_constraints(bset
, div
);
4268 struct isl_basic_set
*isl_basic_map_underlying_set(
4269 struct isl_basic_map
*bmap
)
4273 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4275 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4276 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4277 return (struct isl_basic_set
*)bmap
;
4278 bmap
= isl_basic_map_cow(bmap
);
4281 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4284 bmap
->extra
-= bmap
->n_div
;
4286 bmap
= isl_basic_map_finalize(bmap
);
4287 return (struct isl_basic_set
*)bmap
;
4292 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4293 __isl_take isl_basic_set
*bset
)
4295 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4298 struct isl_basic_map
*isl_basic_map_overlying_set(
4299 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4301 struct isl_basic_map
*bmap
;
4302 struct isl_ctx
*ctx
;
4309 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4310 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4311 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4313 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4314 isl_basic_map_free(like
);
4315 return (struct isl_basic_map
*)bset
;
4317 bset
= isl_basic_set_cow(bset
);
4320 total
= bset
->dim
->n_out
+ bset
->extra
;
4321 bmap
= (struct isl_basic_map
*)bset
;
4322 isl_space_free(bmap
->dim
);
4323 bmap
->dim
= isl_space_copy(like
->dim
);
4326 bmap
->n_div
= like
->n_div
;
4327 bmap
->extra
+= like
->n_div
;
4331 ltotal
= total
- bmap
->extra
+ like
->extra
;
4334 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4335 bmap
->extra
* (1 + 1 + total
));
4336 if (isl_blk_is_error(bmap
->block2
))
4338 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4342 for (i
= 0; i
< bmap
->extra
; ++i
)
4343 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4344 for (i
= 0; i
< like
->n_div
; ++i
) {
4345 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4346 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4348 bmap
= isl_basic_map_extend_constraints(bmap
,
4349 0, 2 * like
->n_div
);
4350 for (i
= 0; i
< like
->n_div
; ++i
) {
4351 if (isl_int_is_zero(bmap
->div
[i
][0]))
4353 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4357 isl_basic_map_free(like
);
4358 bmap
= isl_basic_map_simplify(bmap
);
4359 bmap
= isl_basic_map_finalize(bmap
);
4362 isl_basic_map_free(like
);
4363 isl_basic_set_free(bset
);
4367 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4368 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4370 return (struct isl_basic_set
*)
4371 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4374 struct isl_set
*isl_set_from_underlying_set(
4375 struct isl_set
*set
, struct isl_basic_set
*like
)
4381 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4383 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4384 isl_basic_set_free(like
);
4387 set
= isl_set_cow(set
);
4390 for (i
= 0; i
< set
->n
; ++i
) {
4391 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4392 isl_basic_set_copy(like
));
4396 isl_space_free(set
->dim
);
4397 set
->dim
= isl_space_copy(like
->dim
);
4400 isl_basic_set_free(like
);
4403 isl_basic_set_free(like
);
4408 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4412 map
= isl_map_cow(map
);
4415 map
->dim
= isl_space_cow(map
->dim
);
4419 for (i
= 1; i
< map
->n
; ++i
)
4420 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4422 for (i
= 0; i
< map
->n
; ++i
) {
4423 map
->p
[i
] = (struct isl_basic_map
*)
4424 isl_basic_map_underlying_set(map
->p
[i
]);
4429 map
->dim
= isl_space_underlying(map
->dim
, 0);
4431 isl_space_free(map
->dim
);
4432 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4436 return (struct isl_set
*)map
;
4442 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4444 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4447 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4448 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4450 bmap
= isl_basic_map_cow(bmap
);
4454 isl_space_free(bmap
->dim
);
4457 bmap
= isl_basic_map_finalize(bmap
);
4461 isl_basic_map_free(bmap
);
4462 isl_space_free(dim
);
4466 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4467 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4469 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4473 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4474 __isl_take isl_space
*dim
)
4478 map
= isl_map_cow(map
);
4482 for (i
= 0; i
< map
->n
; ++i
) {
4483 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4484 isl_space_copy(dim
));
4488 isl_space_free(map
->dim
);
4494 isl_space_free(dim
);
4498 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4499 __isl_take isl_space
*dim
)
4501 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4504 /* Compute the parameter domain of the given basic set.
4506 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4511 if (isl_basic_set_is_params(bset
))
4514 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4515 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4516 space
= isl_basic_set_get_space(bset
);
4517 space
= isl_space_params(space
);
4518 bset
= isl_basic_set_reset_space(bset
, space
);
4522 /* Compute the parameter domain of the given set.
4524 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4529 if (isl_set_is_params(set
))
4532 n
= isl_set_dim(set
, isl_dim_set
);
4533 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4534 space
= isl_set_get_space(set
);
4535 space
= isl_space_params(space
);
4536 set
= isl_set_reset_space(set
, space
);
4540 /* Construct a zero-dimensional set with the given parameter domain.
4542 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4545 space
= isl_set_get_space(set
);
4546 space
= isl_space_set_from_params(space
);
4547 set
= isl_set_reset_space(set
, space
);
4551 /* Compute the parameter domain of the given map.
4553 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4558 n
= isl_map_dim(map
, isl_dim_in
);
4559 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4560 n
= isl_map_dim(map
, isl_dim_out
);
4561 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4562 space
= isl_map_get_space(map
);
4563 space
= isl_space_params(space
);
4564 map
= isl_map_reset_space(map
, space
);
4568 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4571 struct isl_basic_set
*domain
;
4577 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4579 n_in
= isl_basic_map_n_in(bmap
);
4580 n_out
= isl_basic_map_n_out(bmap
);
4581 domain
= isl_basic_set_from_basic_map(bmap
);
4582 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4584 domain
= isl_basic_set_reset_space(domain
, dim
);
4589 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4593 return isl_space_may_be_set(bmap
->dim
);
4596 /* Is this basic map actually a set?
4597 * Users should never call this function. Outside of isl,
4598 * the type should indicate whether something is a set or a map.
4600 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4604 return isl_space_is_set(bmap
->dim
);
4607 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4611 if (isl_basic_map_is_set(bmap
))
4613 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4616 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4617 __isl_take isl_basic_map
*bmap
)
4621 isl_basic_map
*domain
;
4622 int nparam
, n_in
, n_out
;
4625 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4626 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4627 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4629 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4630 domain
= isl_basic_map_universe(dim
);
4632 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4633 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4634 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4636 total
= isl_basic_map_total_dim(bmap
);
4638 for (i
= 0; i
< n_in
; ++i
) {
4639 k
= isl_basic_map_alloc_equality(bmap
);
4642 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4643 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4644 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4647 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4648 return isl_basic_map_finalize(bmap
);
4650 isl_basic_map_free(bmap
);
4654 __isl_give isl_basic_map
*isl_basic_map_range_map(
4655 __isl_take isl_basic_map
*bmap
)
4659 isl_basic_map
*range
;
4660 int nparam
, n_in
, n_out
;
4663 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4664 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4665 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4667 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4668 range
= isl_basic_map_universe(dim
);
4670 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4671 bmap
= isl_basic_map_apply_range(bmap
, range
);
4672 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4674 total
= isl_basic_map_total_dim(bmap
);
4676 for (i
= 0; i
< n_out
; ++i
) {
4677 k
= isl_basic_map_alloc_equality(bmap
);
4680 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4681 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4682 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4685 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4686 return isl_basic_map_finalize(bmap
);
4688 isl_basic_map_free(bmap
);
4692 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4696 return isl_space_may_be_set(map
->dim
);
4699 /* Is this map actually a set?
4700 * Users should never call this function. Outside of isl,
4701 * the type should indicate whether something is a set or a map.
4703 int isl_map_is_set(__isl_keep isl_map
*map
)
4707 return isl_space_is_set(map
->dim
);
4710 struct isl_set
*isl_map_range(struct isl_map
*map
)
4713 struct isl_set
*set
;
4717 if (isl_map_is_set(map
))
4718 return (isl_set
*)map
;
4720 map
= isl_map_cow(map
);
4724 set
= (struct isl_set
*) map
;
4725 set
->dim
= isl_space_range(set
->dim
);
4728 for (i
= 0; i
< map
->n
; ++i
) {
4729 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4733 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4734 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4741 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4744 isl_space
*domain_dim
;
4746 map
= isl_map_cow(map
);
4750 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4751 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4752 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4755 for (i
= 0; i
< map
->n
; ++i
) {
4756 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4760 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4761 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4768 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4771 isl_space
*range_dim
;
4773 map
= isl_map_cow(map
);
4777 range_dim
= isl_space_range(isl_map_get_space(map
));
4778 range_dim
= isl_space_from_range(range_dim
);
4779 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4780 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4783 for (i
= 0; i
< map
->n
; ++i
) {
4784 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4788 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4789 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4796 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4797 __isl_take isl_space
*dim
)
4800 struct isl_map
*map
= NULL
;
4802 set
= isl_set_cow(set
);
4805 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4806 map
= (struct isl_map
*)set
;
4807 for (i
= 0; i
< set
->n
; ++i
) {
4808 map
->p
[i
] = isl_basic_map_from_basic_set(
4809 set
->p
[i
], isl_space_copy(dim
));
4813 isl_space_free(map
->dim
);
4817 isl_space_free(dim
);
4822 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4823 __isl_take isl_basic_set
*bset
)
4825 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4828 __isl_give isl_basic_map
*isl_basic_map_from_range(
4829 __isl_take isl_basic_set
*bset
)
4832 space
= isl_basic_set_get_space(bset
);
4833 space
= isl_space_from_range(space
);
4834 bset
= isl_basic_set_reset_space(bset
, space
);
4835 return (isl_basic_map
*)bset
;
4838 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4841 space
= isl_set_get_space(set
);
4842 space
= isl_space_from_range(space
);
4843 set
= isl_set_reset_space(set
, space
);
4844 return (struct isl_map
*)set
;
4847 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4849 return isl_map_reverse(isl_map_from_range(set
));
4852 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4853 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4855 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4858 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4859 __isl_take isl_set
*range
)
4861 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4864 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4867 struct isl_set
*set
= NULL
;
4871 map
= isl_map_cow(map
);
4874 map
->dim
= isl_space_as_set_space(map
->dim
);
4877 set
= (struct isl_set
*)map
;
4878 for (i
= 0; i
< map
->n
; ++i
) {
4879 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4889 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4892 struct isl_map
*map
;
4897 isl_die(dim
->ctx
, isl_error_internal
,
4898 "negative number of basic maps", goto error
);
4899 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4900 sizeof(struct isl_map
) +
4901 (n
- 1) * sizeof(struct isl_basic_map
*));
4905 map
->ctx
= dim
->ctx
;
4906 isl_ctx_ref(map
->ctx
);
4914 isl_space_free(dim
);
4918 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4919 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4922 struct isl_map
*map
;
4925 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4929 map
= isl_map_alloc_space(dims
, n
, flags
);
4933 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4935 struct isl_basic_map
*bmap
;
4936 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4937 bmap
= isl_basic_map_set_to_empty(bmap
);
4941 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4943 struct isl_basic_set
*bset
;
4944 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4945 bset
= isl_basic_set_set_to_empty(bset
);
4949 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4951 struct isl_basic_map
*bmap
;
4954 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4955 bmap
= isl_basic_map_set_to_empty(bmap
);
4959 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4961 struct isl_basic_map
*bmap
;
4964 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4965 bmap
= isl_basic_map_set_to_empty(bmap
);
4969 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4971 struct isl_basic_set
*bset
;
4974 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4975 bset
= isl_basic_set_set_to_empty(bset
);
4979 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
4981 struct isl_basic_map
*bmap
;
4982 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
4983 bmap
= isl_basic_map_finalize(bmap
);
4987 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
4989 struct isl_basic_set
*bset
;
4990 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
4991 bset
= isl_basic_set_finalize(bset
);
4995 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
4998 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
4999 isl_basic_map
*bmap
;
5001 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5002 for (i
= 0; i
< total
; ++i
) {
5003 int k
= isl_basic_map_alloc_inequality(bmap
);
5006 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5007 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5011 isl_basic_map_free(bmap
);
5015 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5017 return isl_basic_map_nat_universe(dim
);
5020 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5022 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5025 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5027 return isl_map_nat_universe(dim
);
5030 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5031 __isl_keep isl_basic_map
*model
)
5035 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5038 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5042 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5045 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5046 __isl_keep isl_set
*model
)
5050 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5053 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5055 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5058 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5062 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5065 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5069 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5072 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5074 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5077 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5081 return isl_set_empty(isl_space_copy(model
->dim
));
5084 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5086 struct isl_map
*map
;
5089 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5090 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5094 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5096 struct isl_set
*set
;
5099 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5100 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5104 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5108 return isl_set_universe(isl_space_copy(model
->dim
));
5111 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5114 struct isl_map
*dup
;
5118 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5119 for (i
= 0; i
< map
->n
; ++i
)
5120 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5124 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5125 __isl_take isl_basic_map
*bmap
)
5129 if (isl_basic_map_plain_is_empty(bmap
)) {
5130 isl_basic_map_free(bmap
);
5133 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5134 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5135 map
->p
[map
->n
] = bmap
;
5137 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5143 isl_basic_map_free(bmap
);
5147 void *isl_map_free(struct isl_map
*map
)
5157 isl_ctx_deref(map
->ctx
);
5158 for (i
= 0; i
< map
->n
; ++i
)
5159 isl_basic_map_free(map
->p
[i
]);
5160 isl_space_free(map
->dim
);
5166 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5167 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5171 base
= isl_map_cow(base
);
5175 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5178 for (i
= 0; i
< base
->n
; ++i
) {
5179 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5180 isl_space_copy(base
->dim
), 0, 0, 0);
5190 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5191 unsigned nparam
, unsigned dim
)
5193 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5197 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5198 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5202 bmap
= isl_basic_map_cow(bmap
);
5203 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5204 j
= isl_basic_map_alloc_equality(bmap
);
5207 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5208 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5209 isl_int_set_si(bmap
->eq
[j
][0], value
);
5210 bmap
= isl_basic_map_simplify(bmap
);
5211 return isl_basic_map_finalize(bmap
);
5213 isl_basic_map_free(bmap
);
5217 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5218 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5222 bmap
= isl_basic_map_cow(bmap
);
5223 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5224 j
= isl_basic_map_alloc_equality(bmap
);
5227 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5228 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5229 isl_int_set(bmap
->eq
[j
][0], value
);
5230 bmap
= isl_basic_map_simplify(bmap
);
5231 return isl_basic_map_finalize(bmap
);
5233 isl_basic_map_free(bmap
);
5237 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5238 enum isl_dim_type type
, unsigned pos
, int value
)
5242 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5243 return isl_basic_map_fix_pos_si(bmap
,
5244 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5246 isl_basic_map_free(bmap
);
5250 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5251 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5255 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5256 return isl_basic_map_fix_pos(bmap
,
5257 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5259 isl_basic_map_free(bmap
);
5263 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5264 enum isl_dim_type type
, unsigned pos
, int value
)
5266 return (struct isl_basic_set
*)
5267 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5271 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5272 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5274 return (struct isl_basic_set
*)
5275 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5279 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5280 unsigned input
, int value
)
5282 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5285 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5286 unsigned dim
, int value
)
5288 return (struct isl_basic_set
*)
5289 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5290 isl_dim_set
, dim
, value
);
5293 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5295 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5302 isl_basic_map_free(map
->p
[i
]);
5303 if (i
!= map
->n
- 1) {
5304 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5305 map
->p
[i
] = map
->p
[map
->n
- 1];
5312 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5313 enum isl_dim_type type
, unsigned pos
, int value
)
5317 map
= isl_map_cow(map
);
5321 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5322 for (i
= map
->n
- 1; i
>= 0; --i
) {
5323 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5324 if (remove_if_empty(map
, i
) < 0)
5327 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5334 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5335 enum isl_dim_type type
, unsigned pos
, int value
)
5337 return (struct isl_set
*)
5338 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5341 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5342 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5346 map
= isl_map_cow(map
);
5350 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5351 for (i
= 0; i
< map
->n
; ++i
) {
5352 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5356 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5363 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5364 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5366 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5369 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5370 unsigned input
, int value
)
5372 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5375 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5377 return (struct isl_set
*)
5378 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5381 static __isl_give isl_basic_map
*basic_map_bound_si(
5382 __isl_take isl_basic_map
*bmap
,
5383 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5389 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5390 pos
+= isl_basic_map_offset(bmap
, type
);
5391 bmap
= isl_basic_map_cow(bmap
);
5392 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5393 j
= isl_basic_map_alloc_inequality(bmap
);
5396 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5398 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5399 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5401 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5402 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5404 bmap
= isl_basic_map_simplify(bmap
);
5405 return isl_basic_map_finalize(bmap
);
5407 isl_basic_map_free(bmap
);
5411 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5412 __isl_take isl_basic_map
*bmap
,
5413 enum isl_dim_type type
, unsigned pos
, int value
)
5415 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5418 /* Constrain the values of the given dimension to be no greater than "value".
5420 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5421 __isl_take isl_basic_map
*bmap
,
5422 enum isl_dim_type type
, unsigned pos
, int value
)
5424 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5427 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5428 unsigned dim
, isl_int value
)
5432 bset
= isl_basic_set_cow(bset
);
5433 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5434 j
= isl_basic_set_alloc_inequality(bset
);
5437 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5438 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5439 isl_int_neg(bset
->ineq
[j
][0], value
);
5440 bset
= isl_basic_set_simplify(bset
);
5441 return isl_basic_set_finalize(bset
);
5443 isl_basic_set_free(bset
);
5447 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5448 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5452 map
= isl_map_cow(map
);
5456 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5457 for (i
= 0; i
< map
->n
; ++i
) {
5458 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5459 type
, pos
, value
, upper
);
5463 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5470 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5471 enum isl_dim_type type
, unsigned pos
, int value
)
5473 return map_bound_si(map
, type
, pos
, value
, 0);
5476 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5477 enum isl_dim_type type
, unsigned pos
, int value
)
5479 return map_bound_si(map
, type
, pos
, value
, 1);
5482 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5483 enum isl_dim_type type
, unsigned pos
, int value
)
5485 return (struct isl_set
*)
5486 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5489 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5490 enum isl_dim_type type
, unsigned pos
, int value
)
5492 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5495 /* Bound the given variable of "bmap" from below (or above is "upper"
5496 * is set) to "value".
5498 static __isl_give isl_basic_map
*basic_map_bound(
5499 __isl_take isl_basic_map
*bmap
,
5500 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5506 if (pos
>= isl_basic_map_dim(bmap
, type
))
5507 isl_die(bmap
->ctx
, isl_error_invalid
,
5508 "index out of bounds", goto error
);
5509 pos
+= isl_basic_map_offset(bmap
, type
);
5510 bmap
= isl_basic_map_cow(bmap
);
5511 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5512 j
= isl_basic_map_alloc_inequality(bmap
);
5515 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5517 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5518 isl_int_set(bmap
->ineq
[j
][0], value
);
5520 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5521 isl_int_neg(bmap
->ineq
[j
][0], value
);
5523 bmap
= isl_basic_map_simplify(bmap
);
5524 return isl_basic_map_finalize(bmap
);
5526 isl_basic_map_free(bmap
);
5530 /* Bound the given variable of "map" from below (or above is "upper"
5531 * is set) to "value".
5533 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5534 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5538 map
= isl_map_cow(map
);
5542 if (pos
>= isl_map_dim(map
, type
))
5543 isl_die(map
->ctx
, isl_error_invalid
,
5544 "index out of bounds", goto error
);
5545 for (i
= map
->n
- 1; i
>= 0; --i
) {
5546 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5547 if (remove_if_empty(map
, i
) < 0)
5550 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5557 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5558 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5560 return map_bound(map
, type
, pos
, value
, 0);
5563 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5564 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5566 return map_bound(map
, type
, pos
, value
, 1);
5569 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5570 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5572 return isl_map_lower_bound(set
, type
, pos
, value
);
5575 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5576 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5578 return isl_map_upper_bound(set
, type
, pos
, value
);
5581 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5586 set
= isl_set_cow(set
);
5590 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5591 for (i
= 0; i
< set
->n
; ++i
) {
5592 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5602 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5606 map
= isl_map_cow(map
);
5610 map
->dim
= isl_space_reverse(map
->dim
);
5613 for (i
= 0; i
< map
->n
; ++i
) {
5614 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5618 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5625 static struct isl_map
*isl_basic_map_partial_lexopt(
5626 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5627 struct isl_set
**empty
, int max
)
5631 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5632 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5634 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5636 isl_basic_map_free(bmap
);
5637 isl_basic_set_free(dom
);
5643 struct isl_map
*isl_basic_map_partial_lexmax(
5644 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5645 struct isl_set
**empty
)
5647 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5650 struct isl_map
*isl_basic_map_partial_lexmin(
5651 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5652 struct isl_set
**empty
)
5654 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5657 struct isl_set
*isl_basic_set_partial_lexmin(
5658 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5659 struct isl_set
**empty
)
5661 return (struct isl_set
*)
5662 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5666 struct isl_set
*isl_basic_set_partial_lexmax(
5667 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5668 struct isl_set
**empty
)
5670 return (struct isl_set
*)
5671 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5675 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5676 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5677 __isl_give isl_set
**empty
)
5679 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5682 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5683 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5684 __isl_give isl_set
**empty
)
5686 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5689 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5690 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5691 __isl_give isl_set
**empty
)
5693 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5696 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5697 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5698 __isl_give isl_set
**empty
)
5700 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5703 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5704 __isl_take isl_basic_map
*bmap
, int max
)
5706 isl_basic_set
*dom
= NULL
;
5707 isl_space
*dom_space
;
5711 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5712 dom
= isl_basic_set_universe(dom_space
);
5713 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5715 isl_basic_map_free(bmap
);
5719 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5720 __isl_take isl_basic_map
*bmap
)
5722 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5726 #define TYPE isl_pw_multi_aff
5728 #define SUFFIX _pw_multi_aff
5730 #define EMPTY isl_pw_multi_aff_empty
5732 #define ADD isl_pw_multi_aff_union_add
5733 #include "isl_map_lexopt_templ.c"
5735 /* Given a map "map", compute the lexicographically minimal
5736 * (or maximal) image element for each domain element in dom,
5737 * in the form of an isl_pw_multi_aff.
5738 * Set *empty to those elements in dom that do not have an image element.
5740 * We first compute the lexicographically minimal or maximal element
5741 * in the first basic map. This results in a partial solution "res"
5742 * and a subset "todo" of dom that still need to be handled.
5743 * We then consider each of the remaining maps in "map" and successively
5744 * update both "res" and "todo".
5746 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5747 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5748 __isl_give isl_set
**empty
, int max
)
5751 isl_pw_multi_aff
*res
;
5757 if (isl_map_plain_is_empty(map
)) {
5762 return isl_pw_multi_aff_from_map(map
);
5765 res
= basic_map_partial_lexopt_pw_multi_aff(
5766 isl_basic_map_copy(map
->p
[0]),
5767 isl_set_copy(dom
), &todo
, max
);
5769 for (i
= 1; i
< map
->n
; ++i
) {
5770 isl_pw_multi_aff
*res_i
;
5773 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5774 isl_basic_map_copy(map
->p
[i
]),
5775 isl_set_copy(dom
), &todo_i
, max
);
5778 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5780 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5782 todo
= isl_set_intersect(todo
, todo_i
);
5803 #define TYPE isl_map
5807 #define EMPTY isl_map_empty
5809 #define ADD isl_map_union_disjoint
5810 #include "isl_map_lexopt_templ.c"
5812 /* Given a map "map", compute the lexicographically minimal
5813 * (or maximal) image element for each domain element in dom.
5814 * Set *empty to those elements in dom that do not have an image element.
5816 * We first compute the lexicographically minimal or maximal element
5817 * in the first basic map. This results in a partial solution "res"
5818 * and a subset "todo" of dom that still need to be handled.
5819 * We then consider each of the remaining maps in "map" and successively
5820 * update both "res" and "todo".
5822 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5823 * Assume we are computing the lexicographical maximum.
5824 * We first compute the lexicographically maximal element in basic map i.
5825 * This results in a partial solution res_i and a subset todo_i.
5826 * Then we combine these results with those obtain for the first k basic maps
5827 * to obtain a result that is valid for the first k+1 basic maps.
5828 * In particular, the set where there is no solution is the set where
5829 * there is no solution for the first k basic maps and also no solution
5830 * for the ith basic map, i.e.,
5832 * todo^i = todo^k * todo_i
5834 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5835 * solutions, arbitrarily breaking ties in favor of res^k.
5836 * That is, when res^k(a) >= res_i(a), we pick res^k and
5837 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5838 * the lexicographic order.)
5839 * In practice, we compute
5841 * res^k * (res_i . "<=")
5845 * res_i * (res^k . "<")
5847 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5848 * where only one of res^k and res_i provides a solution and we simply pick
5855 * Note that we only compute these intersections when dom(res^k) intersects
5856 * dom(res_i). Otherwise, the only effect of these intersections is to
5857 * potentially break up res^k and res_i into smaller pieces.
5858 * We want to avoid such splintering as much as possible.
5859 * In fact, an earlier implementation of this function would look for
5860 * better results in the domain of res^k and for extra results in todo^k,
5861 * but this would always result in a splintering according to todo^k,
5862 * even when the domain of basic map i is disjoint from the domains of
5863 * the previous basic maps.
5865 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5866 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5867 __isl_give isl_set
**empty
, int max
)
5870 struct isl_map
*res
;
5871 struct isl_set
*todo
;
5876 if (isl_map_plain_is_empty(map
)) {
5884 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5885 isl_set_copy(dom
), &todo
, max
);
5887 for (i
= 1; i
< map
->n
; ++i
) {
5891 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5893 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5894 isl_set_copy(dom
), &todo_i
, max
);
5897 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5898 le
= isl_map_lex_le(dim
);
5900 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5901 le
= isl_map_lex_ge(dim
);
5903 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5904 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5905 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5906 le
= isl_map_intersect(le
, isl_map_copy(res
));
5908 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5909 res
= isl_map_intersect_domain(res
,
5910 isl_set_copy(todo_i
));
5911 res_i
= isl_map_intersect_domain(res_i
,
5912 isl_set_copy(todo
));
5915 res
= isl_map_union_disjoint(res
, res_i
);
5916 res
= isl_map_union_disjoint(res
, lt
);
5917 res
= isl_map_union_disjoint(res
, le
);
5919 todo
= isl_set_intersect(todo
, todo_i
);
5939 __isl_give isl_map
*isl_map_partial_lexmax(
5940 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5941 __isl_give isl_set
**empty
)
5943 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5946 __isl_give isl_map
*isl_map_partial_lexmin(
5947 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5948 __isl_give isl_set
**empty
)
5950 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5953 __isl_give isl_set
*isl_set_partial_lexmin(
5954 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5955 __isl_give isl_set
**empty
)
5957 return (struct isl_set
*)
5958 isl_map_partial_lexmin((struct isl_map
*)set
,
5962 __isl_give isl_set
*isl_set_partial_lexmax(
5963 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5964 __isl_give isl_set
**empty
)
5966 return (struct isl_set
*)
5967 isl_map_partial_lexmax((struct isl_map
*)set
,
5971 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5973 struct isl_basic_set
*dom
= NULL
;
5978 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
5979 dom
= isl_basic_set_universe(dom_dim
);
5980 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5982 isl_basic_map_free(bmap
);
5986 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
5988 return isl_basic_map_lexopt(bmap
, 0);
5991 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
5993 return isl_basic_map_lexopt(bmap
, 1);
5996 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
5998 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6001 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6003 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6006 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
6008 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
6011 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
6013 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
6016 /* Extract the first and only affine expression from list
6017 * and then add it to *pwaff with the given dom.
6018 * This domain is known to be disjoint from other domains
6019 * because of the way isl_basic_map_foreach_lexmax works.
6021 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6022 __isl_take isl_aff_list
*list
, void *user
)
6024 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6026 isl_pw_aff
**pwaff
= user
;
6027 isl_pw_aff
*pwaff_i
;
6029 if (isl_aff_list_n_aff(list
) != 1)
6030 isl_die(ctx
, isl_error_internal
,
6031 "expecting single element list", goto error
);
6033 aff
= isl_aff_list_get_aff(list
, 0);
6034 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6036 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6038 isl_aff_list_free(list
);
6042 isl_basic_set_free(dom
);
6043 isl_aff_list_free(list
);
6047 /* Given a basic map with one output dimension, compute the minimum or
6048 * maximum of that dimension as an isl_pw_aff.
6050 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6051 * call update_dim_opt on each leaf of the result.
6053 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6056 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6060 dim
= isl_space_from_domain(isl_space_domain(dim
));
6061 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6062 pwaff
= isl_pw_aff_empty(dim
);
6064 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6066 return isl_pw_aff_free(pwaff
);
6071 /* Compute the minimum or maximum of the given output dimension
6072 * as a function of the parameters and the input dimensions,
6073 * but independently of the other output dimensions.
6075 * We first project out the other output dimension and then compute
6076 * the "lexicographic" maximum in each basic map, combining the results
6077 * using isl_pw_aff_union_max.
6079 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6086 n_out
= isl_map_dim(map
, isl_dim_out
);
6087 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6088 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6093 isl_space
*dim
= isl_map_get_space(map
);
6094 dim
= isl_space_domain(isl_space_from_range(dim
));
6096 return isl_pw_aff_empty(dim
);
6099 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6100 for (i
= 1; i
< map
->n
; ++i
) {
6101 isl_pw_aff
*pwaff_i
;
6103 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6104 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6112 /* Compute the maximum of the given output dimension as a function of the
6113 * parameters and input dimensions, but independently of
6114 * the other output dimensions.
6116 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6118 return map_dim_opt(map
, pos
, 1);
6121 /* Compute the minimum or maximum of the given set dimension
6122 * as a function of the parameters,
6123 * but independently of the other set dimensions.
6125 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6128 return map_dim_opt(set
, pos
, max
);
6131 /* Compute the maximum of the given set dimension as a function of the
6132 * parameters, but independently of the other set dimensions.
6134 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6136 return set_dim_opt(set
, pos
, 1);
6139 /* Compute the minimum of the given set dimension as a function of the
6140 * parameters, but independently of the other set dimensions.
6142 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6144 return set_dim_opt(set
, pos
, 0);
6147 /* Apply a preimage specified by "mat" on the parameters of "bset".
6148 * bset is assumed to have only parameters and divs.
6150 static struct isl_basic_set
*basic_set_parameter_preimage(
6151 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6158 bset
->dim
= isl_space_cow(bset
->dim
);
6162 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6164 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6166 bset
->dim
->nparam
= 0;
6167 bset
->dim
->n_out
= nparam
;
6168 bset
= isl_basic_set_preimage(bset
, mat
);
6170 bset
->dim
->nparam
= bset
->dim
->n_out
;
6171 bset
->dim
->n_out
= 0;
6176 isl_basic_set_free(bset
);
6180 /* Apply a preimage specified by "mat" on the parameters of "set".
6181 * set is assumed to have only parameters and divs.
6183 static struct isl_set
*set_parameter_preimage(
6184 struct isl_set
*set
, struct isl_mat
*mat
)
6186 isl_space
*dim
= NULL
;
6192 dim
= isl_space_copy(set
->dim
);
6193 dim
= isl_space_cow(dim
);
6197 nparam
= isl_set_dim(set
, isl_dim_param
);
6199 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6202 dim
->n_out
= nparam
;
6203 isl_set_reset_space(set
, dim
);
6204 set
= isl_set_preimage(set
, mat
);
6207 dim
= isl_space_copy(set
->dim
);
6208 dim
= isl_space_cow(dim
);
6211 dim
->nparam
= dim
->n_out
;
6213 isl_set_reset_space(set
, dim
);
6216 isl_space_free(dim
);
6223 /* Intersect the basic set "bset" with the affine space specified by the
6224 * equalities in "eq".
6226 static struct isl_basic_set
*basic_set_append_equalities(
6227 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6235 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6240 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6241 for (i
= 0; i
< eq
->n_row
; ++i
) {
6242 k
= isl_basic_set_alloc_equality(bset
);
6245 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6246 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6250 bset
= isl_basic_set_gauss(bset
, NULL
);
6251 bset
= isl_basic_set_finalize(bset
);
6256 isl_basic_set_free(bset
);
6260 /* Intersect the set "set" with the affine space specified by the
6261 * equalities in "eq".
6263 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6271 for (i
= 0; i
< set
->n
; ++i
) {
6272 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6285 /* Project the given basic set onto its parameter domain, possibly introducing
6286 * new, explicit, existential variables in the constraints.
6287 * The input has parameters and (possibly implicit) existential variables.
6288 * The output has the same parameters, but only
6289 * explicit existentially quantified variables.
6291 * The actual projection is performed by pip, but pip doesn't seem
6292 * to like equalities very much, so we first remove the equalities
6293 * among the parameters by performing a variable compression on
6294 * the parameters. Afterward, an inverse transformation is performed
6295 * and the equalities among the parameters are inserted back in.
6297 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6301 struct isl_mat
*T
, *T2
;
6302 struct isl_set
*set
;
6303 unsigned nparam
, n_div
;
6305 bset
= isl_basic_set_cow(bset
);
6309 if (bset
->n_eq
== 0)
6310 return isl_basic_set_lexmin(bset
);
6312 isl_basic_set_gauss(bset
, NULL
);
6314 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6315 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6317 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6318 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6321 if (i
== bset
->n_eq
)
6322 return isl_basic_set_lexmin(bset
);
6324 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6326 eq
= isl_mat_cow(eq
);
6327 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6328 if (T
&& T
->n_col
== 0) {
6332 bset
= isl_basic_set_set_to_empty(bset
);
6333 return isl_set_from_basic_set(bset
);
6335 bset
= basic_set_parameter_preimage(bset
, T
);
6337 set
= isl_basic_set_lexmin(bset
);
6338 set
= set_parameter_preimage(set
, T2
);
6339 set
= set_append_equalities(set
, eq
);
6343 /* Compute an explicit representation for all the existentially
6344 * quantified variables.
6345 * The input and output dimensions are first turned into parameters.
6346 * compute_divs then returns a map with the same parameters and
6347 * no input or output dimensions and the dimension specification
6348 * is reset to that of the input.
6350 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6352 struct isl_basic_set
*bset
;
6353 struct isl_set
*set
;
6354 struct isl_map
*map
;
6355 isl_space
*dim
, *orig_dim
= NULL
;
6360 bmap
= isl_basic_map_cow(bmap
);
6364 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6365 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6366 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6367 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6371 orig_dim
= bmap
->dim
;
6373 bset
= (struct isl_basic_set
*)bmap
;
6375 set
= parameter_compute_divs(bset
);
6376 map
= (struct isl_map
*)set
;
6377 map
= isl_map_reset_space(map
, orig_dim
);
6381 isl_basic_map_free(bmap
);
6385 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6393 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6394 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6395 if (isl_int_is_zero(bmap
->div
[i
][0]))
6397 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6403 static int map_divs_known(__isl_keep isl_map
*map
)
6410 for (i
= 0; i
< map
->n
; ++i
) {
6411 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6419 /* If bmap contains any unknown divs, then compute explicit
6420 * expressions for them. However, this computation may be
6421 * quite expensive, so first try to remove divs that aren't
6424 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6427 struct isl_map
*map
;
6429 known
= isl_basic_map_divs_known(bmap
);
6433 return isl_map_from_basic_map(bmap
);
6435 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6437 known
= isl_basic_map_divs_known(bmap
);
6441 return isl_map_from_basic_map(bmap
);
6443 map
= compute_divs(bmap
);
6446 isl_basic_map_free(bmap
);
6450 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6454 struct isl_map
*res
;
6461 known
= map_divs_known(map
);
6469 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6470 for (i
= 1 ; i
< map
->n
; ++i
) {
6472 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6473 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6474 res
= isl_map_union_disjoint(res
, r2
);
6476 res
= isl_map_union(res
, r2
);
6483 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6485 return (struct isl_set
*)
6486 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6489 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6491 return (struct isl_set
*)
6492 isl_map_compute_divs((struct isl_map
*)set
);
6495 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6498 struct isl_set
*set
;
6503 map
= isl_map_cow(map
);
6507 set
= (struct isl_set
*)map
;
6508 set
->dim
= isl_space_domain(set
->dim
);
6511 for (i
= 0; i
< map
->n
; ++i
) {
6512 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6516 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6517 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6524 /* Return the union of "map1" and "map2", where we assume for now that
6525 * "map1" and "map2" are disjoint. Note that the basic maps inside
6526 * "map1" or "map2" may not be disjoint from each other.
6527 * Also note that this function is also called from isl_map_union,
6528 * which takes care of handling the situation where "map1" and "map2"
6529 * may not be disjoint.
6531 * If one of the inputs is empty, we can simply return the other input.
6532 * Similarly, if one of the inputs is universal, then it is equal to the union.
6534 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6535 __isl_take isl_map
*map2
)
6539 struct isl_map
*map
= NULL
;
6554 is_universe
= isl_map_plain_is_universe(map1
);
6555 if (is_universe
< 0)
6562 is_universe
= isl_map_plain_is_universe(map2
);
6563 if (is_universe
< 0)
6570 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6572 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6573 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6574 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6576 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6577 map1
->n
+ map2
->n
, flags
);
6580 for (i
= 0; i
< map1
->n
; ++i
) {
6581 map
= isl_map_add_basic_map(map
,
6582 isl_basic_map_copy(map1
->p
[i
]));
6586 for (i
= 0; i
< map2
->n
; ++i
) {
6587 map
= isl_map_add_basic_map(map
,
6588 isl_basic_map_copy(map2
->p
[i
]));
6602 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6603 __isl_take isl_map
*map2
)
6605 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6608 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6610 map1
= isl_map_union_disjoint(map1
, map2
);
6614 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6618 struct isl_set
*isl_set_union_disjoint(
6619 struct isl_set
*set1
, struct isl_set
*set2
)
6621 return (struct isl_set
*)
6622 isl_map_union_disjoint(
6623 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6626 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6628 return (struct isl_set
*)
6629 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6632 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6635 * "map" and "set" are assumed to be compatible and non-NULL.
6637 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6638 __isl_take isl_set
*set
,
6639 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6640 __isl_take isl_basic_set
*bset
))
6643 struct isl_map
*result
;
6646 if (isl_set_plain_is_universe(set
)) {
6651 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6652 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6653 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6655 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6656 map
->n
* set
->n
, flags
);
6657 for (i
= 0; result
&& i
< map
->n
; ++i
)
6658 for (j
= 0; j
< set
->n
; ++j
) {
6659 result
= isl_map_add_basic_map(result
,
6660 fn(isl_basic_map_copy(map
->p
[i
]),
6661 isl_basic_set_copy(set
->p
[j
])));
6671 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6672 __isl_take isl_set
*set
)
6677 if (!isl_map_compatible_range(map
, set
))
6678 isl_die(set
->ctx
, isl_error_invalid
,
6679 "incompatible spaces", goto error
);
6681 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6688 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6689 __isl_take isl_set
*set
)
6691 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6694 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
6695 __isl_take isl_set
*set
)
6700 if (!isl_map_compatible_domain(map
, set
))
6701 isl_die(set
->ctx
, isl_error_invalid
,
6702 "incompatible spaces", goto error
);
6704 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
6711 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
6712 __isl_take isl_set
*set
)
6714 return isl_map_align_params_map_map_and(map
, set
,
6715 &map_intersect_domain
);
6718 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6719 __isl_take isl_map
*map2
)
6723 map1
= isl_map_reverse(map1
);
6724 map1
= isl_map_apply_range(map1
, map2
);
6725 return isl_map_reverse(map1
);
6732 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6733 __isl_take isl_map
*map2
)
6735 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6738 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6739 __isl_take isl_map
*map2
)
6741 isl_space
*dim_result
;
6742 struct isl_map
*result
;
6748 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6749 isl_space_copy(map2
->dim
));
6751 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6754 for (i
= 0; i
< map1
->n
; ++i
)
6755 for (j
= 0; j
< map2
->n
; ++j
) {
6756 result
= isl_map_add_basic_map(result
,
6757 isl_basic_map_apply_range(
6758 isl_basic_map_copy(map1
->p
[i
]),
6759 isl_basic_map_copy(map2
->p
[j
])));
6765 if (result
&& result
->n
<= 1)
6766 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6774 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6775 __isl_take isl_map
*map2
)
6777 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6781 * returns range - domain
6783 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6785 isl_space
*dims
, *target_dim
;
6786 struct isl_basic_set
*bset
;
6793 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6794 bmap
->dim
, isl_dim_out
),
6796 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6797 dim
= isl_basic_map_n_in(bmap
);
6798 nparam
= isl_basic_map_n_param(bmap
);
6799 bset
= isl_basic_set_from_basic_map(bmap
);
6800 bset
= isl_basic_set_cow(bset
);
6801 dims
= isl_basic_set_get_space(bset
);
6802 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6803 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6804 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6805 for (i
= 0; i
< dim
; ++i
) {
6806 int j
= isl_basic_map_alloc_equality(
6807 (struct isl_basic_map
*)bset
);
6810 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6811 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6812 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6813 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6815 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6816 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6819 isl_basic_map_free(bmap
);
6824 * returns range - domain
6826 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6830 struct isl_set
*result
;
6835 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6836 map
->dim
, isl_dim_out
),
6838 dim
= isl_map_get_space(map
);
6839 dim
= isl_space_domain(dim
);
6840 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6843 for (i
= 0; i
< map
->n
; ++i
)
6844 result
= isl_set_add_basic_set(result
,
6845 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6854 * returns [domain -> range] -> range - domain
6856 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6857 __isl_take isl_basic_map
*bmap
)
6861 isl_basic_map
*domain
;
6865 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6866 isl_die(bmap
->ctx
, isl_error_invalid
,
6867 "domain and range don't match", goto error
);
6869 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6870 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6872 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6873 domain
= isl_basic_map_universe(dim
);
6875 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6876 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6877 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6879 total
= isl_basic_map_total_dim(bmap
);
6881 for (i
= 0; i
< n
; ++i
) {
6882 k
= isl_basic_map_alloc_equality(bmap
);
6885 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6886 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6887 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6888 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6891 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6892 return isl_basic_map_finalize(bmap
);
6894 isl_basic_map_free(bmap
);
6899 * returns [domain -> range] -> range - domain
6901 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6904 isl_space
*domain_dim
;
6909 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6910 isl_die(map
->ctx
, isl_error_invalid
,
6911 "domain and range don't match", goto error
);
6913 map
= isl_map_cow(map
);
6917 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6918 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6919 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6922 for (i
= 0; i
< map
->n
; ++i
) {
6923 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6927 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6934 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6936 struct isl_basic_map
*bmap
;
6944 nparam
= dims
->nparam
;
6946 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6950 for (i
= 0; i
< dim
; ++i
) {
6951 int j
= isl_basic_map_alloc_equality(bmap
);
6954 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6955 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6956 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6958 return isl_basic_map_finalize(bmap
);
6960 isl_basic_map_free(bmap
);
6964 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6968 if (dim
->n_in
!= dim
->n_out
)
6969 isl_die(dim
->ctx
, isl_error_invalid
,
6970 "number of input and output dimensions needs to be "
6971 "the same", goto error
);
6972 return basic_map_identity(dim
);
6974 isl_space_free(dim
);
6978 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6980 if (!model
|| !model
->dim
)
6982 return isl_basic_map_identity(isl_space_copy(model
->dim
));
6985 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
6987 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
6990 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
6992 if (!model
|| !model
->dim
)
6994 return isl_map_identity(isl_space_copy(model
->dim
));
6997 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
6999 if (!model
|| !model
->dim
)
7001 return isl_map_identity(isl_space_copy(model
->dim
));
7004 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7006 isl_space
*dim
= isl_set_get_space(set
);
7008 id
= isl_map_identity(isl_space_map_from_set(dim
));
7009 return isl_map_intersect_range(id
, set
);
7012 /* Construct a basic set with all set dimensions having only non-negative
7015 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7016 __isl_take isl_space
*space
)
7021 struct isl_basic_set
*bset
;
7025 nparam
= space
->nparam
;
7027 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7030 for (i
= 0; i
< dim
; ++i
) {
7031 int k
= isl_basic_set_alloc_inequality(bset
);
7034 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7035 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7039 isl_basic_set_free(bset
);
7043 /* Construct the half-space x_pos >= 0.
7045 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7049 isl_basic_set
*nonneg
;
7051 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7052 k
= isl_basic_set_alloc_inequality(nonneg
);
7055 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7056 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7058 return isl_basic_set_finalize(nonneg
);
7060 isl_basic_set_free(nonneg
);
7064 /* Construct the half-space x_pos <= -1.
7066 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7071 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7072 k
= isl_basic_set_alloc_inequality(neg
);
7075 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7076 isl_int_set_si(neg
->ineq
[k
][0], -1);
7077 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7079 return isl_basic_set_finalize(neg
);
7081 isl_basic_set_free(neg
);
7085 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7086 enum isl_dim_type type
, unsigned first
, unsigned n
)
7089 isl_basic_set
*nonneg
;
7097 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7099 for (i
= 0; i
< n
; ++i
) {
7100 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7101 pos(set
->dim
, type
) + first
+ i
);
7102 neg
= neg_halfspace(isl_set_get_space(set
),
7103 pos(set
->dim
, type
) + first
+ i
);
7105 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7114 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7115 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7122 if (isl_set_plain_is_empty(set
)) {
7127 return fn(set
, signs
, user
);
7130 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7132 half
= isl_set_intersect(half
, isl_set_copy(set
));
7133 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7137 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7139 half
= isl_set_intersect(half
, set
);
7140 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7146 /* Call "fn" on the intersections of "set" with each of the orthants
7147 * (except for obviously empty intersections). The orthant is identified
7148 * by the signs array, with each entry having value 1 or -1 according
7149 * to the sign of the corresponding variable.
7151 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7152 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7162 if (isl_set_plain_is_empty(set
))
7165 nparam
= isl_set_dim(set
, isl_dim_param
);
7166 nvar
= isl_set_dim(set
, isl_dim_set
);
7168 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7170 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7178 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7180 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7183 int isl_basic_map_is_subset(
7184 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7187 struct isl_map
*map1
;
7188 struct isl_map
*map2
;
7190 if (!bmap1
|| !bmap2
)
7193 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7194 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7196 is_subset
= isl_map_is_subset(map1
, map2
);
7204 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7205 __isl_keep isl_basic_set
*bset2
)
7207 return isl_basic_map_is_subset(bset1
, bset2
);
7210 int isl_basic_map_is_equal(
7211 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7215 if (!bmap1
|| !bmap2
)
7217 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7220 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7224 int isl_basic_set_is_equal(
7225 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7227 return isl_basic_map_is_equal(
7228 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7231 int isl_map_is_empty(struct isl_map
*map
)
7238 for (i
= 0; i
< map
->n
; ++i
) {
7239 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7248 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7250 return map
? map
->n
== 0 : -1;
7253 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7255 return isl_map_plain_is_empty(map
);
7258 int isl_set_plain_is_empty(struct isl_set
*set
)
7260 return set
? set
->n
== 0 : -1;
7263 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7265 return isl_set_plain_is_empty(set
);
7268 int isl_set_is_empty(struct isl_set
*set
)
7270 return isl_map_is_empty((struct isl_map
*)set
);
7273 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7278 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7281 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7286 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7289 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7295 is_subset
= isl_map_is_subset(map1
, map2
);
7298 is_subset
= isl_map_is_subset(map2
, map1
);
7302 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7304 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7307 int isl_basic_map_is_strict_subset(
7308 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7312 if (!bmap1
|| !bmap2
)
7314 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7317 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7318 if (is_subset
== -1)
7323 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7329 is_subset
= isl_map_is_subset(map1
, map2
);
7332 is_subset
= isl_map_is_subset(map2
, map1
);
7333 if (is_subset
== -1)
7338 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7340 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7343 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7347 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7350 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7354 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7357 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7364 for (i
= 0; i
< map
->n
; ++i
) {
7365 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7373 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7375 return isl_map_plain_is_universe((isl_map
*) set
);
7378 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7380 return isl_set_plain_is_universe(set
);
7383 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7385 struct isl_basic_set
*bset
= NULL
;
7386 struct isl_vec
*sample
= NULL
;
7393 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7396 if (isl_basic_map_is_universe(bmap
))
7399 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7400 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7401 copy
= isl_basic_map_remove_redundancies(copy
);
7402 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
7403 isl_basic_map_free(copy
);
7407 total
= 1 + isl_basic_map_total_dim(bmap
);
7408 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7409 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7415 isl_vec_free(bmap
->sample
);
7416 bmap
->sample
= NULL
;
7417 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7420 sample
= isl_basic_set_sample_vec(bset
);
7423 empty
= sample
->size
== 0;
7424 isl_vec_free(bmap
->sample
);
7425 bmap
->sample
= sample
;
7427 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7432 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7436 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7439 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7441 return isl_basic_map_plain_is_empty(bmap
);
7444 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7448 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7451 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7453 return isl_basic_set_plain_is_empty(bset
);
7456 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7458 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7461 struct isl_map
*isl_basic_map_union(
7462 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7464 struct isl_map
*map
;
7465 if (!bmap1
|| !bmap2
)
7468 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7470 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7473 map
= isl_map_add_basic_map(map
, bmap1
);
7474 map
= isl_map_add_basic_map(map
, bmap2
);
7477 isl_basic_map_free(bmap1
);
7478 isl_basic_map_free(bmap2
);
7482 struct isl_set
*isl_basic_set_union(
7483 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7485 return (struct isl_set
*)isl_basic_map_union(
7486 (struct isl_basic_map
*)bset1
,
7487 (struct isl_basic_map
*)bset2
);
7490 /* Order divs such that any div only depends on previous divs */
7491 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7499 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7501 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7503 if (isl_int_is_zero(bmap
->div
[i
][0]))
7505 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7509 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7515 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7517 return (struct isl_basic_set
*)
7518 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7521 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7528 for (i
= 0; i
< map
->n
; ++i
) {
7529 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7540 /* Apply the expansion computed by isl_merge_divs.
7541 * The expansion itself is given by "exp" while the resulting
7542 * list of divs is given by "div".
7544 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7545 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7550 bset
= isl_basic_set_cow(bset
);
7554 if (div
->n_row
< bset
->n_div
)
7555 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7556 "not an expansion", goto error
);
7558 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7559 div
->n_row
- bset
->n_div
, 0,
7560 2 * (div
->n_row
- bset
->n_div
));
7562 n_div
= bset
->n_div
;
7563 for (i
= n_div
; i
< div
->n_row
; ++i
)
7564 if (isl_basic_set_alloc_div(bset
) < 0)
7568 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7569 if (j
>= 0 && exp
[j
] == i
) {
7571 isl_basic_map_swap_div(bset
, i
, j
);
7574 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7575 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7583 isl_basic_set_free(bset
);
7588 /* Look for a div in dst that corresponds to the div "div" in src.
7589 * The divs before "div" in src and dst are assumed to be the same.
7591 * Returns -1 if no corresponding div was found and the position
7592 * of the corresponding div in dst otherwise.
7594 static int find_div(struct isl_basic_map
*dst
,
7595 struct isl_basic_map
*src
, unsigned div
)
7599 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7601 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7602 for (i
= div
; i
< dst
->n_div
; ++i
)
7603 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7604 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7605 dst
->n_div
- div
) == -1)
7610 struct isl_basic_map
*isl_basic_map_align_divs(
7611 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7614 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7619 if (src
->n_div
== 0)
7622 for (i
= 0; i
< src
->n_div
; ++i
)
7623 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7625 src
= isl_basic_map_order_divs(src
);
7626 dst
= isl_basic_map_cow(dst
);
7627 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7628 src
->n_div
, 0, 2 * src
->n_div
);
7631 for (i
= 0; i
< src
->n_div
; ++i
) {
7632 int j
= find_div(dst
, src
, i
);
7634 j
= isl_basic_map_alloc_div(dst
);
7637 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7638 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7639 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7643 isl_basic_map_swap_div(dst
, i
, j
);
7647 isl_basic_map_free(dst
);
7651 struct isl_basic_set
*isl_basic_set_align_divs(
7652 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7654 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7655 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7658 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7666 map
= isl_map_compute_divs(map
);
7667 map
= isl_map_cow(map
);
7671 for (i
= 1; i
< map
->n
; ++i
)
7672 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7673 for (i
= 1; i
< map
->n
; ++i
)
7674 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7676 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7680 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7682 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7685 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7686 __isl_take isl_map
*map
)
7690 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7691 map
= isl_map_intersect_domain(map
, set
);
7692 set
= isl_map_range(map
);
7700 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7701 __isl_take isl_map
*map
)
7703 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7706 /* There is no need to cow as removing empty parts doesn't change
7707 * the meaning of the set.
7709 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7716 for (i
= map
->n
- 1; i
>= 0; --i
)
7717 remove_if_empty(map
, i
);
7722 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7724 return (struct isl_set
*)
7725 isl_map_remove_empty_parts((struct isl_map
*)set
);
7728 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7730 struct isl_basic_map
*bmap
;
7731 if (!map
|| map
->n
== 0)
7733 bmap
= map
->p
[map
->n
-1];
7734 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7735 return isl_basic_map_copy(bmap
);
7738 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7740 return (struct isl_basic_set
*)
7741 isl_map_copy_basic_map((struct isl_map
*)set
);
7744 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7745 __isl_keep isl_basic_map
*bmap
)
7751 for (i
= map
->n
-1; i
>= 0; --i
) {
7752 if (map
->p
[i
] != bmap
)
7754 map
= isl_map_cow(map
);
7757 isl_basic_map_free(map
->p
[i
]);
7758 if (i
!= map
->n
-1) {
7759 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7760 map
->p
[i
] = map
->p
[map
->n
-1];
7771 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7772 struct isl_basic_set
*bset
)
7774 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7775 (struct isl_basic_map
*)bset
);
7778 /* Given two basic sets bset1 and bset2, compute the maximal difference
7779 * between the values of dimension pos in bset1 and those in bset2
7780 * for any common value of the parameters and dimensions preceding pos.
7782 static enum isl_lp_result
basic_set_maximal_difference_at(
7783 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7784 int pos
, isl_int
*opt
)
7787 struct isl_basic_map
*bmap1
= NULL
;
7788 struct isl_basic_map
*bmap2
= NULL
;
7789 struct isl_ctx
*ctx
;
7790 struct isl_vec
*obj
;
7793 unsigned dim1
, dim2
;
7794 enum isl_lp_result res
;
7796 if (!bset1
|| !bset2
)
7797 return isl_lp_error
;
7799 nparam
= isl_basic_set_n_param(bset1
);
7800 dim1
= isl_basic_set_n_dim(bset1
);
7801 dim2
= isl_basic_set_n_dim(bset2
);
7802 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7803 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7804 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7805 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7806 if (!bmap1
|| !bmap2
)
7808 bmap1
= isl_basic_map_cow(bmap1
);
7809 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7810 pos
, (dim1
- pos
) + (dim2
- pos
),
7811 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7812 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7815 total
= isl_basic_map_total_dim(bmap1
);
7817 obj
= isl_vec_alloc(ctx
, 1 + total
);
7818 isl_seq_clr(obj
->block
.data
, 1 + total
);
7819 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7820 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7823 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7825 isl_basic_map_free(bmap1
);
7829 isl_basic_map_free(bmap1
);
7830 isl_basic_map_free(bmap2
);
7831 return isl_lp_error
;
7834 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7835 * for any common value of the parameters and dimensions preceding pos
7836 * in both basic sets, the values of dimension pos in bset1 are
7837 * smaller or larger than those in bset2.
7840 * 1 if bset1 follows bset2
7841 * -1 if bset1 precedes bset2
7842 * 0 if bset1 and bset2 are incomparable
7843 * -2 if some error occurred.
7845 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7846 struct isl_basic_set
*bset2
, int pos
)
7849 enum isl_lp_result res
;
7854 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7856 if (res
== isl_lp_empty
)
7858 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7859 res
== isl_lp_unbounded
)
7861 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7870 /* Given two basic sets bset1 and bset2, check whether
7871 * for any common value of the parameters and dimensions preceding pos
7872 * there is a value of dimension pos in bset1 that is larger
7873 * than a value of the same dimension in bset2.
7876 * 1 if there exists such a pair
7877 * 0 if there is no such pair, but there is a pair of equal values
7879 * -2 if some error occurred.
7881 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7882 __isl_keep isl_basic_set
*bset2
, int pos
)
7885 enum isl_lp_result res
;
7890 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7892 if (res
== isl_lp_empty
)
7894 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7895 res
== isl_lp_unbounded
)
7897 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7899 else if (res
== isl_lp_ok
)
7908 /* Given two sets set1 and set2, check whether
7909 * for any common value of the parameters and dimensions preceding pos
7910 * there is a value of dimension pos in set1 that is larger
7911 * than a value of the same dimension in set2.
7914 * 1 if there exists such a pair
7915 * 0 if there is no such pair, but there is a pair of equal values
7917 * -2 if some error occurred.
7919 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7920 __isl_keep isl_set
*set2
, int pos
)
7928 for (i
= 0; i
< set1
->n
; ++i
)
7929 for (j
= 0; j
< set2
->n
; ++j
) {
7931 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7932 if (f
== 1 || f
== -2)
7941 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7942 unsigned pos
, isl_int
*val
)
7950 total
= isl_basic_map_total_dim(bmap
);
7951 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7952 for (; d
+1 > pos
; --d
)
7953 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7957 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7959 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7961 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7964 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7970 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7971 unsigned pos
, isl_int
*val
)
7983 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
7986 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
7987 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
7988 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
7989 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7993 isl_int_set(*val
, v
);
7999 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8000 unsigned pos
, isl_int
*val
)
8002 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8006 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8009 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8012 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8013 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8015 if (pos
>= isl_basic_map_dim(bmap
, type
))
8017 return isl_basic_map_plain_has_fixed_var(bmap
,
8018 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8021 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8022 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8024 if (pos
>= isl_map_dim(map
, type
))
8026 return isl_map_plain_has_fixed_var(map
,
8027 map_offset(map
, type
) - 1 + pos
, val
);
8030 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8031 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8033 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8036 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8037 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8039 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8042 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8043 * then return this fixed value in *val.
8045 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8046 unsigned dim
, isl_int
*val
)
8048 return isl_basic_set_plain_has_fixed_var(bset
,
8049 isl_basic_set_n_param(bset
) + dim
, val
);
8052 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8053 * then return this fixed value in *val.
8055 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8056 unsigned dim
, isl_int
*val
)
8058 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8061 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8062 unsigned dim
, isl_int
*val
)
8064 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8067 /* Check if input variable in has fixed value and if so and if val is not NULL,
8068 * then return this fixed value in *val.
8070 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8071 unsigned in
, isl_int
*val
)
8073 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8076 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8077 * and if val is not NULL, then return this lower bound in *val.
8079 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8080 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8082 int i
, i_eq
= -1, i_ineq
= -1;
8089 total
= isl_basic_set_total_dim(bset
);
8090 nparam
= isl_basic_set_n_param(bset
);
8091 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8092 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8098 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8099 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8101 if (i_eq
!= -1 || i_ineq
!= -1)
8105 if (i_eq
== -1 && i_ineq
== -1)
8107 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8108 /* The coefficient should always be one due to normalization. */
8109 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8111 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8113 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8114 total
- nparam
- dim
- 1) != -1)
8117 isl_int_neg(*val
, c
[0]);
8121 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8122 unsigned dim
, isl_int
*val
)
8134 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8138 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8140 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8141 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8143 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8147 isl_int_set(*val
, v
);
8158 /* uset_gist depends on constraints without existentially quantified
8159 * variables sorting first.
8161 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8163 const struct constraint
*c1
= (const struct constraint
*)p1
;
8164 const struct constraint
*c2
= (const struct constraint
*)p2
;
8166 unsigned size
= isl_min(c1
->size
, c2
->size
);
8168 l1
= isl_seq_last_non_zero(c1
->c
, size
);
8169 l2
= isl_seq_last_non_zero(c2
->c
, size
);
8174 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
8177 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8178 struct isl_basic_map
*bmap
)
8181 struct constraint
*c
;
8186 total
= isl_basic_map_total_dim(bmap
);
8187 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8190 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8192 c
[i
].c
= bmap
->ineq
[i
];
8194 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8195 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8196 bmap
->ineq
[i
] = c
[i
].c
;
8200 isl_basic_map_free(bmap
);
8204 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8205 __isl_take isl_basic_set
*bset
)
8207 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8208 (struct isl_basic_map
*)bset
);
8211 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8215 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8217 bmap
= isl_basic_map_remove_redundancies(bmap
);
8218 bmap
= isl_basic_map_sort_constraints(bmap
);
8219 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8223 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8225 return (struct isl_basic_set
*)isl_basic_map_normalize(
8226 (struct isl_basic_map
*)bset
);
8229 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8230 const __isl_keep isl_basic_map
*bmap2
)
8237 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8238 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8239 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8240 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8241 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8242 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8243 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8244 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8245 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8246 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8247 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8249 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8251 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8253 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8254 return bmap1
->n_eq
- bmap2
->n_eq
;
8255 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8256 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8257 if (bmap1
->n_div
!= bmap2
->n_div
)
8258 return bmap1
->n_div
- bmap2
->n_div
;
8259 total
= isl_basic_map_total_dim(bmap1
);
8260 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8261 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8265 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8266 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8270 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8271 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8278 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8279 const __isl_keep isl_basic_set
*bset2
)
8281 return isl_basic_map_plain_cmp(bset1
, bset2
);
8284 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8290 if (set1
->n
!= set2
->n
)
8291 return set1
->n
- set2
->n
;
8293 for (i
= 0; i
< set1
->n
; ++i
) {
8294 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8302 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8303 __isl_keep isl_basic_map
*bmap2
)
8305 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8308 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8309 __isl_keep isl_basic_set
*bset2
)
8311 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8312 (isl_basic_map
*)bset2
);
8315 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8317 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8318 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8320 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8323 /* We normalize in place, but if anything goes wrong we need
8324 * to return NULL, so we need to make sure we don't change the
8325 * meaning of any possible other copies of map.
8327 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8330 struct isl_basic_map
*bmap
;
8334 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8336 for (i
= 0; i
< map
->n
; ++i
) {
8337 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8340 isl_basic_map_free(map
->p
[i
]);
8343 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8344 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8345 map
= isl_map_remove_empty_parts(map
);
8348 for (i
= map
->n
- 1; i
>= 1; --i
) {
8349 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8351 isl_basic_map_free(map
->p
[i
-1]);
8352 for (j
= i
; j
< map
->n
; ++j
)
8353 map
->p
[j
-1] = map
->p
[j
];
8363 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8365 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8368 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8378 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8381 map1
= isl_map_copy(map1
);
8382 map2
= isl_map_copy(map2
);
8383 map1
= isl_map_normalize(map1
);
8384 map2
= isl_map_normalize(map2
);
8387 equal
= map1
->n
== map2
->n
;
8388 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8389 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8402 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8404 return isl_map_plain_is_equal(map1
, map2
);
8407 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8409 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8410 (struct isl_map
*)set2
);
8413 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8415 return isl_set_plain_is_equal(set1
, set2
);
8418 /* Return an interval that ranges from min to max (inclusive)
8420 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8421 isl_int min
, isl_int max
)
8424 struct isl_basic_set
*bset
= NULL
;
8426 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8430 k
= isl_basic_set_alloc_inequality(bset
);
8433 isl_int_set_si(bset
->ineq
[k
][1], 1);
8434 isl_int_neg(bset
->ineq
[k
][0], min
);
8436 k
= isl_basic_set_alloc_inequality(bset
);
8439 isl_int_set_si(bset
->ineq
[k
][1], -1);
8440 isl_int_set(bset
->ineq
[k
][0], max
);
8444 isl_basic_set_free(bset
);
8448 /* Return the Cartesian product of the basic sets in list (in the given order).
8450 __isl_give isl_basic_set
*isl_basic_set_list_product(
8451 __isl_take
struct isl_basic_set_list
*list
)
8459 struct isl_basic_set
*product
= NULL
;
8463 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8464 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8465 nparam
= isl_basic_set_n_param(list
->p
[0]);
8466 dim
= isl_basic_set_n_dim(list
->p
[0]);
8467 extra
= list
->p
[0]->n_div
;
8468 n_eq
= list
->p
[0]->n_eq
;
8469 n_ineq
= list
->p
[0]->n_ineq
;
8470 for (i
= 1; i
< list
->n
; ++i
) {
8471 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8472 isl_assert(list
->ctx
,
8473 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8474 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8475 extra
+= list
->p
[i
]->n_div
;
8476 n_eq
+= list
->p
[i
]->n_eq
;
8477 n_ineq
+= list
->p
[i
]->n_ineq
;
8479 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8484 for (i
= 0; i
< list
->n
; ++i
) {
8485 isl_basic_set_add_constraints(product
,
8486 isl_basic_set_copy(list
->p
[i
]), dim
);
8487 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8489 isl_basic_set_list_free(list
);
8492 isl_basic_set_free(product
);
8493 isl_basic_set_list_free(list
);
8497 struct isl_basic_map
*isl_basic_map_product(
8498 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8500 isl_space
*dim_result
= NULL
;
8501 struct isl_basic_map
*bmap
;
8502 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8503 struct isl_dim_map
*dim_map1
, *dim_map2
;
8505 if (!bmap1
|| !bmap2
)
8508 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8509 bmap2
->dim
, isl_dim_param
), goto error
);
8510 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8511 isl_space_copy(bmap2
->dim
));
8513 in1
= isl_basic_map_n_in(bmap1
);
8514 in2
= isl_basic_map_n_in(bmap2
);
8515 out1
= isl_basic_map_n_out(bmap1
);
8516 out2
= isl_basic_map_n_out(bmap2
);
8517 nparam
= isl_basic_map_n_param(bmap1
);
8519 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8520 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8521 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8522 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8523 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8524 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8525 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8526 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8527 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8528 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8529 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8531 bmap
= isl_basic_map_alloc_space(dim_result
,
8532 bmap1
->n_div
+ bmap2
->n_div
,
8533 bmap1
->n_eq
+ bmap2
->n_eq
,
8534 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8535 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8536 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8537 bmap
= isl_basic_map_simplify(bmap
);
8538 return isl_basic_map_finalize(bmap
);
8540 isl_basic_map_free(bmap1
);
8541 isl_basic_map_free(bmap2
);
8545 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8546 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8548 isl_basic_map
*prod
;
8550 prod
= isl_basic_map_product(bmap1
, bmap2
);
8551 prod
= isl_basic_map_flatten(prod
);
8555 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8556 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8558 return isl_basic_map_flat_range_product(bset1
, bset2
);
8561 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8562 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8564 isl_space
*space_result
= NULL
;
8565 isl_basic_map
*bmap
;
8566 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8567 struct isl_dim_map
*dim_map1
, *dim_map2
;
8569 if (!bmap1
|| !bmap2
)
8572 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8573 isl_space_copy(bmap2
->dim
));
8575 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8576 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8577 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8578 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8580 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8581 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8582 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8583 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8584 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8585 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8586 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8587 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8588 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8589 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8590 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8592 bmap
= isl_basic_map_alloc_space(space_result
,
8593 bmap1
->n_div
+ bmap2
->n_div
,
8594 bmap1
->n_eq
+ bmap2
->n_eq
,
8595 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8596 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8597 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8598 bmap
= isl_basic_map_simplify(bmap
);
8599 return isl_basic_map_finalize(bmap
);
8601 isl_basic_map_free(bmap1
);
8602 isl_basic_map_free(bmap2
);
8606 __isl_give isl_basic_map
*isl_basic_map_range_product(
8607 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8609 isl_space
*dim_result
= NULL
;
8610 isl_basic_map
*bmap
;
8611 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8612 struct isl_dim_map
*dim_map1
, *dim_map2
;
8614 if (!bmap1
|| !bmap2
)
8617 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8618 bmap2
->dim
, isl_dim_param
))
8619 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8620 "parameters don't match", goto error
);
8622 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8623 isl_space_copy(bmap2
->dim
));
8625 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8626 out1
= isl_basic_map_n_out(bmap1
);
8627 out2
= isl_basic_map_n_out(bmap2
);
8628 nparam
= isl_basic_map_n_param(bmap1
);
8630 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8631 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8632 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8633 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8634 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8635 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8636 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8637 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8638 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8639 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8640 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8642 bmap
= isl_basic_map_alloc_space(dim_result
,
8643 bmap1
->n_div
+ bmap2
->n_div
,
8644 bmap1
->n_eq
+ bmap2
->n_eq
,
8645 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8646 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8647 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8648 bmap
= isl_basic_map_simplify(bmap
);
8649 return isl_basic_map_finalize(bmap
);
8651 isl_basic_map_free(bmap1
);
8652 isl_basic_map_free(bmap2
);
8656 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8657 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8659 isl_basic_map
*prod
;
8661 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8662 prod
= isl_basic_map_flatten_range(prod
);
8666 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8667 __isl_take isl_map
*map2
,
8668 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8669 __isl_take isl_space
*right
),
8670 __isl_give isl_basic_map
*(*basic_map_product
)(
8671 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8674 struct isl_map
*result
;
8680 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8681 map2
->dim
, isl_dim_param
), goto error
);
8683 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8684 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8685 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8687 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8688 isl_space_copy(map2
->dim
)),
8689 map1
->n
* map2
->n
, flags
);
8692 for (i
= 0; i
< map1
->n
; ++i
)
8693 for (j
= 0; j
< map2
->n
; ++j
) {
8694 struct isl_basic_map
*part
;
8695 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8696 isl_basic_map_copy(map2
->p
[j
]));
8697 if (isl_basic_map_is_empty(part
))
8698 isl_basic_map_free(part
);
8700 result
= isl_map_add_basic_map(result
, part
);
8713 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8715 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8716 __isl_take isl_map
*map2
)
8718 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8721 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8722 __isl_take isl_map
*map2
)
8724 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8727 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8729 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8730 __isl_take isl_map
*map2
)
8734 prod
= isl_map_product(map1
, map2
);
8735 prod
= isl_map_flatten(prod
);
8739 /* Given two set A and B, construct its Cartesian product A x B.
8741 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8743 return isl_map_range_product(set1
, set2
);
8746 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8747 __isl_take isl_set
*set2
)
8749 return isl_map_flat_range_product(set1
, set2
);
8752 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8754 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8755 __isl_take isl_map
*map2
)
8757 return map_product(map1
, map2
, &isl_space_domain_product
,
8758 &isl_basic_map_domain_product
);
8761 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8763 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8764 __isl_take isl_map
*map2
)
8766 return map_product(map1
, map2
, &isl_space_range_product
,
8767 &isl_basic_map_range_product
);
8770 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8771 __isl_take isl_map
*map2
)
8773 return isl_map_align_params_map_map_and(map1
, map2
,
8774 &map_domain_product_aligned
);
8777 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8778 __isl_take isl_map
*map2
)
8780 return isl_map_align_params_map_map_and(map1
, map2
,
8781 &map_range_product_aligned
);
8784 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8786 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8787 __isl_take isl_map
*map2
)
8791 prod
= isl_map_domain_product(map1
, map2
);
8792 prod
= isl_map_flatten_domain(prod
);
8796 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8798 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8799 __isl_take isl_map
*map2
)
8803 prod
= isl_map_range_product(map1
, map2
);
8804 prod
= isl_map_flatten_range(prod
);
8808 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8811 uint32_t hash
= isl_hash_init();
8816 bmap
= isl_basic_map_copy(bmap
);
8817 bmap
= isl_basic_map_normalize(bmap
);
8820 total
= isl_basic_map_total_dim(bmap
);
8821 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8822 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8824 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8825 isl_hash_hash(hash
, c_hash
);
8827 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8828 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8830 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8831 isl_hash_hash(hash
, c_hash
);
8833 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8834 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8836 if (isl_int_is_zero(bmap
->div
[i
][0]))
8838 isl_hash_byte(hash
, i
& 0xFF);
8839 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8840 isl_hash_hash(hash
, c_hash
);
8842 isl_basic_map_free(bmap
);
8846 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8848 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8851 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8858 map
= isl_map_copy(map
);
8859 map
= isl_map_normalize(map
);
8863 hash
= isl_hash_init();
8864 for (i
= 0; i
< map
->n
; ++i
) {
8866 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8867 isl_hash_hash(hash
, bmap_hash
);
8875 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8877 return isl_map_get_hash((isl_map
*)set
);
8880 /* Check if the value for dimension dim is completely determined
8881 * by the values of the other parameters and variables.
8882 * That is, check if dimension dim is involved in an equality.
8884 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8891 nparam
= isl_basic_set_n_param(bset
);
8892 for (i
= 0; i
< bset
->n_eq
; ++i
)
8893 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8898 /* Check if the value for dimension dim is completely determined
8899 * by the values of the other parameters and variables.
8900 * That is, check if dimension dim is involved in an equality
8901 * for each of the subsets.
8903 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8909 for (i
= 0; i
< set
->n
; ++i
) {
8911 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8918 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8920 return set
? set
->n
: 0;
8923 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8924 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8931 for (i
= 0; i
< map
->n
; ++i
)
8932 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8938 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8939 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8946 for (i
= 0; i
< set
->n
; ++i
)
8947 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8953 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8960 bset
= isl_basic_set_cow(bset
);
8964 dim
= isl_basic_set_get_space(bset
);
8965 dim
= isl_space_lift(dim
, bset
->n_div
);
8968 isl_space_free(bset
->dim
);
8970 bset
->extra
-= bset
->n_div
;
8973 bset
= isl_basic_set_finalize(bset
);
8977 isl_basic_set_free(bset
);
8981 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
8987 set
= isl_set_align_divs(set
);
8992 set
= isl_set_cow(set
);
8996 n_div
= set
->p
[0]->n_div
;
8997 dim
= isl_set_get_space(set
);
8998 dim
= isl_space_lift(dim
, n_div
);
9001 isl_space_free(set
->dim
);
9004 for (i
= 0; i
< set
->n
; ++i
) {
9005 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9016 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9019 struct isl_basic_map
*bmap
;
9026 set
= isl_set_align_divs(set
);
9031 dim
= isl_set_get_space(set
);
9032 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9034 return isl_map_identity(isl_space_map_from_set(dim
));
9037 n_div
= set
->p
[0]->n_div
;
9038 dim
= isl_space_map_from_set(dim
);
9039 n_param
= isl_space_dim(dim
, isl_dim_param
);
9040 n_set
= isl_space_dim(dim
, isl_dim_in
);
9041 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9042 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9043 for (i
= 0; i
< n_set
; ++i
)
9044 bmap
= var_equal(bmap
, i
);
9046 total
= n_param
+ n_set
+ n_set
+ n_div
;
9047 for (i
= 0; i
< n_div
; ++i
) {
9048 k
= isl_basic_map_alloc_inequality(bmap
);
9051 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9052 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9053 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9054 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9055 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9056 set
->p
[0]->div
[i
][0]);
9058 l
= isl_basic_map_alloc_inequality(bmap
);
9061 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9062 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9063 set
->p
[0]->div
[i
][0]);
9064 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9068 bmap
= isl_basic_map_simplify(bmap
);
9069 bmap
= isl_basic_map_finalize(bmap
);
9070 return isl_map_from_basic_map(bmap
);
9073 isl_basic_map_free(bmap
);
9077 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9085 dim
= isl_basic_set_total_dim(bset
);
9086 size
+= bset
->n_eq
* (1 + dim
);
9087 size
+= bset
->n_ineq
* (1 + dim
);
9088 size
+= bset
->n_div
* (2 + dim
);
9093 int isl_set_size(__isl_keep isl_set
*set
)
9101 for (i
= 0; i
< set
->n
; ++i
)
9102 size
+= isl_basic_set_size(set
->p
[i
]);
9107 /* Check if there is any lower bound (if lower == 0) and/or upper
9108 * bound (if upper == 0) on the specified dim.
9110 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9111 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9118 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9120 pos
+= isl_basic_map_offset(bmap
, type
);
9122 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9123 if (isl_int_is_zero(bmap
->div
[i
][0]))
9125 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9129 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9130 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9133 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9134 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9141 return lower
&& upper
;
9144 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9145 enum isl_dim_type type
, unsigned pos
)
9147 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9150 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9151 enum isl_dim_type type
, unsigned pos
)
9153 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9156 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9157 enum isl_dim_type type
, unsigned pos
)
9159 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9162 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9163 enum isl_dim_type type
, unsigned pos
)
9170 for (i
= 0; i
< map
->n
; ++i
) {
9172 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9173 if (bounded
< 0 || !bounded
)
9180 /* Return 1 if the specified dim is involved in both an upper bound
9181 * and a lower bound.
9183 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9184 enum isl_dim_type type
, unsigned pos
)
9186 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9189 static int has_any_bound(__isl_keep isl_map
*map
,
9190 enum isl_dim_type type
, unsigned pos
,
9191 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9192 enum isl_dim_type type
, unsigned pos
))
9199 for (i
= 0; i
< map
->n
; ++i
) {
9201 bounded
= fn(map
->p
[i
], type
, pos
);
9202 if (bounded
< 0 || bounded
)
9209 /* Return 1 if the specified dim is involved in any lower bound.
9211 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9212 enum isl_dim_type type
, unsigned pos
)
9214 return has_any_bound(set
, type
, pos
,
9215 &isl_basic_map_dim_has_lower_bound
);
9218 /* Return 1 if the specified dim is involved in any upper bound.
9220 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9221 enum isl_dim_type type
, unsigned pos
)
9223 return has_any_bound(set
, type
, pos
,
9224 &isl_basic_map_dim_has_upper_bound
);
9227 /* For each of the "n" variables starting at "first", determine
9228 * the sign of the variable and put the results in the first "n"
9229 * elements of the array "signs".
9231 * 1 means that the variable is non-negative
9232 * -1 means that the variable is non-positive
9233 * 0 means the variable attains both positive and negative values.
9235 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9236 unsigned first
, unsigned n
, int *signs
)
9238 isl_vec
*bound
= NULL
;
9239 struct isl_tab
*tab
= NULL
;
9240 struct isl_tab_undo
*snap
;
9243 if (!bset
|| !signs
)
9246 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9247 tab
= isl_tab_from_basic_set(bset
, 0);
9251 isl_seq_clr(bound
->el
, bound
->size
);
9252 isl_int_set_si(bound
->el
[0], -1);
9254 snap
= isl_tab_snap(tab
);
9255 for (i
= 0; i
< n
; ++i
) {
9258 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9259 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9262 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9263 if (isl_tab_rollback(tab
, snap
) < 0)
9271 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9272 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9275 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9276 if (isl_tab_rollback(tab
, snap
) < 0)
9279 signs
[i
] = empty
? -1 : 0;
9283 isl_vec_free(bound
);
9287 isl_vec_free(bound
);
9291 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9292 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9294 if (!bset
|| !signs
)
9296 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9299 first
+= pos(bset
->dim
, type
) - 1;
9300 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9303 /* Check if the given basic map is obviously single-valued.
9304 * In particular, for each output dimension, check that there is
9305 * an equality that defines the output dimension in terms of
9306 * earlier dimensions.
9308 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9318 total
= 1 + isl_basic_map_total_dim(bmap
);
9319 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9320 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9322 for (i
= 0; i
< n_out
; ++i
) {
9323 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9324 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9326 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9327 total
- (o_out
+ i
+ 1)) == -1)
9330 if (j
>= bmap
->n_eq
)
9337 /* Check if the given basic map is single-valued.
9342 * and check if the result is a subset of the identity mapping.
9344 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9347 isl_basic_map
*test
;
9351 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9355 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9356 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9358 space
= isl_basic_map_get_space(bmap
);
9359 space
= isl_space_map_from_set(isl_space_range(space
));
9360 id
= isl_basic_map_identity(space
);
9362 sv
= isl_basic_map_is_subset(test
, id
);
9364 isl_basic_map_free(test
);
9365 isl_basic_map_free(id
);
9370 /* Check if the given map is obviously single-valued.
9372 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9381 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9384 /* Check if the given map is single-valued.
9389 * and check if the result is a subset of the identity mapping.
9391 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9398 sv
= isl_map_plain_is_single_valued(map
);
9402 test
= isl_map_reverse(isl_map_copy(map
));
9403 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9405 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9406 id
= isl_map_identity(dim
);
9408 sv
= isl_map_is_subset(test
, id
);
9416 int isl_map_is_injective(__isl_keep isl_map
*map
)
9420 map
= isl_map_copy(map
);
9421 map
= isl_map_reverse(map
);
9422 in
= isl_map_is_single_valued(map
);
9428 /* Check if the given map is obviously injective.
9430 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9434 map
= isl_map_copy(map
);
9435 map
= isl_map_reverse(map
);
9436 in
= isl_map_plain_is_single_valued(map
);
9442 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9446 sv
= isl_map_is_single_valued(map
);
9450 return isl_map_is_injective(map
);
9453 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9455 return isl_map_is_single_valued((isl_map
*)set
);
9458 int isl_map_is_translation(__isl_keep isl_map
*map
)
9463 delta
= isl_map_deltas(isl_map_copy(map
));
9464 ok
= isl_set_is_singleton(delta
);
9465 isl_set_free(delta
);
9470 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9472 if (isl_seq_first_non_zero(p
, pos
) != -1)
9474 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9479 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9488 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9491 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9492 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9493 for (j
= 0; j
< nvar
; ++j
) {
9494 int lower
= 0, upper
= 0;
9495 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9496 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9498 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9504 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9505 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9507 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9509 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9514 if (!lower
|| !upper
)
9521 int isl_set_is_box(__isl_keep isl_set
*set
)
9528 return isl_basic_set_is_box(set
->p
[0]);
9531 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9536 return isl_space_is_wrapping(bset
->dim
);
9539 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9544 return isl_space_is_wrapping(set
->dim
);
9547 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9549 bmap
= isl_basic_map_cow(bmap
);
9553 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9557 bmap
= isl_basic_map_finalize(bmap
);
9559 return (isl_basic_set
*)bmap
;
9561 isl_basic_map_free(bmap
);
9565 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9569 map
= isl_map_cow(map
);
9573 for (i
= 0; i
< map
->n
; ++i
) {
9574 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9578 map
->dim
= isl_space_wrap(map
->dim
);
9582 return (isl_set
*)map
;
9588 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9590 bset
= isl_basic_set_cow(bset
);
9594 bset
->dim
= isl_space_unwrap(bset
->dim
);
9598 bset
= isl_basic_set_finalize(bset
);
9600 return (isl_basic_map
*)bset
;
9602 isl_basic_set_free(bset
);
9606 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9613 if (!isl_set_is_wrapping(set
))
9614 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9617 set
= isl_set_cow(set
);
9621 for (i
= 0; i
< set
->n
; ++i
) {
9622 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9627 set
->dim
= isl_space_unwrap(set
->dim
);
9631 return (isl_map
*)set
;
9637 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9638 enum isl_dim_type type
)
9643 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9646 bmap
= isl_basic_map_cow(bmap
);
9650 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9654 bmap
= isl_basic_map_finalize(bmap
);
9658 isl_basic_map_free(bmap
);
9662 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9663 enum isl_dim_type type
)
9670 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9673 map
= isl_map_cow(map
);
9677 for (i
= 0; i
< map
->n
; ++i
) {
9678 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9682 map
->dim
= isl_space_reset(map
->dim
, type
);
9692 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9697 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9700 bmap
= isl_basic_map_cow(bmap
);
9704 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9708 bmap
= isl_basic_map_finalize(bmap
);
9712 isl_basic_map_free(bmap
);
9716 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9718 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9721 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9722 __isl_take isl_basic_map
*bmap
)
9727 if (!bmap
->dim
->nested
[0])
9730 bmap
= isl_basic_map_cow(bmap
);
9734 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9738 bmap
= isl_basic_map_finalize(bmap
);
9742 isl_basic_map_free(bmap
);
9746 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9747 __isl_take isl_basic_map
*bmap
)
9752 if (!bmap
->dim
->nested
[1])
9755 bmap
= isl_basic_map_cow(bmap
);
9759 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9763 bmap
= isl_basic_map_finalize(bmap
);
9767 isl_basic_map_free(bmap
);
9771 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9778 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9781 map
= isl_map_cow(map
);
9785 for (i
= 0; i
< map
->n
; ++i
) {
9786 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9790 map
->dim
= isl_space_flatten(map
->dim
);
9800 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9802 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9805 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9807 isl_space
*dim
, *flat_dim
;
9810 dim
= isl_set_get_space(set
);
9811 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9812 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9813 map
= isl_map_intersect_domain(map
, set
);
9818 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9825 if (!map
->dim
->nested
[0])
9828 map
= isl_map_cow(map
);
9832 for (i
= 0; i
< map
->n
; ++i
) {
9833 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9837 map
->dim
= isl_space_flatten_domain(map
->dim
);
9847 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9854 if (!map
->dim
->nested
[1])
9857 map
= isl_map_cow(map
);
9861 for (i
= 0; i
< map
->n
; ++i
) {
9862 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9866 map
->dim
= isl_space_flatten_range(map
->dim
);
9876 /* Reorder the dimensions of "bmap" according to the given dim_map
9877 * and set the dimension specification to "dim".
9879 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9880 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9885 bmap
= isl_basic_map_cow(bmap
);
9886 if (!bmap
|| !dim
|| !dim_map
)
9889 flags
= bmap
->flags
;
9890 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9891 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9892 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9893 res
= isl_basic_map_alloc_space(dim
,
9894 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9895 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9898 res
= isl_basic_map_finalize(res
);
9902 isl_basic_map_free(bmap
);
9903 isl_space_free(dim
);
9907 /* Reorder the dimensions of "map" according to given reordering.
9909 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9910 __isl_take isl_reordering
*r
)
9913 struct isl_dim_map
*dim_map
;
9915 map
= isl_map_cow(map
);
9916 dim_map
= isl_dim_map_from_reordering(r
);
9917 if (!map
|| !r
|| !dim_map
)
9920 for (i
= 0; i
< map
->n
; ++i
) {
9921 struct isl_dim_map
*dim_map_i
;
9923 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9925 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9926 isl_space_copy(r
->dim
), dim_map_i
);
9932 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
9934 isl_reordering_free(r
);
9940 isl_reordering_free(r
);
9944 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
9945 __isl_take isl_reordering
*r
)
9947 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
9950 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
9951 __isl_take isl_space
*model
)
9958 ctx
= isl_space_get_ctx(model
);
9959 if (!isl_space_has_named_params(model
))
9960 isl_die(ctx
, isl_error_invalid
,
9961 "model has unnamed parameters", goto error
);
9962 if (!isl_space_has_named_params(map
->dim
))
9963 isl_die(ctx
, isl_error_invalid
,
9964 "relation has unnamed parameters", goto error
);
9965 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
9966 isl_reordering
*exp
;
9968 model
= isl_space_drop_dims(model
, isl_dim_in
,
9969 0, isl_space_dim(model
, isl_dim_in
));
9970 model
= isl_space_drop_dims(model
, isl_dim_out
,
9971 0, isl_space_dim(model
, isl_dim_out
));
9972 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
9973 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
9974 map
= isl_map_realign(map
, exp
);
9977 isl_space_free(model
);
9980 isl_space_free(model
);
9985 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
9986 __isl_take isl_space
*model
)
9988 return isl_map_align_params(set
, model
);
9991 /* Align the parameters of "bmap" to those of "model", introducing
9992 * additional parameters if needed.
9994 __isl_give isl_basic_map
*isl_basic_map_align_params(
9995 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
9999 if (!bmap
|| !model
)
10002 ctx
= isl_space_get_ctx(model
);
10003 if (!isl_space_has_named_params(model
))
10004 isl_die(ctx
, isl_error_invalid
,
10005 "model has unnamed parameters", goto error
);
10006 if (!isl_space_has_named_params(bmap
->dim
))
10007 isl_die(ctx
, isl_error_invalid
,
10008 "relation has unnamed parameters", goto error
);
10009 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10010 isl_reordering
*exp
;
10011 struct isl_dim_map
*dim_map
;
10013 model
= isl_space_drop_dims(model
, isl_dim_in
,
10014 0, isl_space_dim(model
, isl_dim_in
));
10015 model
= isl_space_drop_dims(model
, isl_dim_out
,
10016 0, isl_space_dim(model
, isl_dim_out
));
10017 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10018 exp
= isl_reordering_extend_space(exp
,
10019 isl_basic_map_get_space(bmap
));
10020 dim_map
= isl_dim_map_from_reordering(exp
);
10021 bmap
= isl_basic_map_realign(bmap
,
10022 exp
? isl_space_copy(exp
->dim
) : NULL
,
10023 isl_dim_map_extend(dim_map
, bmap
));
10024 isl_reordering_free(exp
);
10028 isl_space_free(model
);
10031 isl_space_free(model
);
10032 isl_basic_map_free(bmap
);
10036 /* Align the parameters of "bset" to those of "model", introducing
10037 * additional parameters if needed.
10039 __isl_give isl_basic_set
*isl_basic_set_align_params(
10040 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10042 return isl_basic_map_align_params(bset
, model
);
10045 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10046 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10047 enum isl_dim_type c2
, enum isl_dim_type c3
,
10048 enum isl_dim_type c4
, enum isl_dim_type c5
)
10050 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10051 struct isl_mat
*mat
;
10057 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10058 isl_basic_map_total_dim(bmap
) + 1);
10061 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10062 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10063 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10064 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10065 isl_int_set(mat
->row
[i
][pos
],
10066 bmap
->eq
[i
][off
+ k
]);
10074 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10075 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10076 enum isl_dim_type c2
, enum isl_dim_type c3
,
10077 enum isl_dim_type c4
, enum isl_dim_type c5
)
10079 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10080 struct isl_mat
*mat
;
10086 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10087 isl_basic_map_total_dim(bmap
) + 1);
10090 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10091 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10092 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10093 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10094 isl_int_set(mat
->row
[i
][pos
],
10095 bmap
->ineq
[i
][off
+ k
]);
10103 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10104 __isl_take isl_space
*dim
,
10105 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10106 enum isl_dim_type c2
, enum isl_dim_type c3
,
10107 enum isl_dim_type c4
, enum isl_dim_type c5
)
10109 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10110 isl_basic_map
*bmap
;
10116 if (!dim
|| !eq
|| !ineq
)
10119 if (eq
->n_col
!= ineq
->n_col
)
10120 isl_die(dim
->ctx
, isl_error_invalid
,
10121 "equalities and inequalities matrices should have "
10122 "same number of columns", goto error
);
10124 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10126 if (eq
->n_col
< total
)
10127 isl_die(dim
->ctx
, isl_error_invalid
,
10128 "number of columns too small", goto error
);
10130 extra
= eq
->n_col
- total
;
10132 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10133 eq
->n_row
, ineq
->n_row
);
10136 for (i
= 0; i
< extra
; ++i
) {
10137 k
= isl_basic_map_alloc_div(bmap
);
10140 isl_int_set_si(bmap
->div
[k
][0], 0);
10142 for (i
= 0; i
< eq
->n_row
; ++i
) {
10143 l
= isl_basic_map_alloc_equality(bmap
);
10146 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10147 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10148 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10149 isl_int_set(bmap
->eq
[l
][off
+ k
],
10155 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10156 l
= isl_basic_map_alloc_inequality(bmap
);
10159 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10160 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10161 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10162 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10163 ineq
->row
[i
][pos
]);
10169 isl_space_free(dim
);
10171 isl_mat_free(ineq
);
10175 isl_space_free(dim
);
10177 isl_mat_free(ineq
);
10181 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10182 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10183 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10185 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10186 c1
, c2
, c3
, c4
, isl_dim_in
);
10189 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10190 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10191 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10193 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10194 c1
, c2
, c3
, c4
, isl_dim_in
);
10197 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10198 __isl_take isl_space
*dim
,
10199 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10200 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10202 return (isl_basic_set
*)
10203 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10204 c1
, c2
, c3
, c4
, isl_dim_in
);
10207 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10212 return isl_space_can_zip(bmap
->dim
);
10215 int isl_map_can_zip(__isl_keep isl_map
*map
)
10220 return isl_space_can_zip(map
->dim
);
10223 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10224 * (A -> C) -> (B -> D).
10226 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10235 if (!isl_basic_map_can_zip(bmap
))
10236 isl_die(bmap
->ctx
, isl_error_invalid
,
10237 "basic map cannot be zipped", goto error
);
10238 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10239 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10240 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10241 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10242 bmap
= isl_basic_map_cow(bmap
);
10243 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10246 bmap
->dim
= isl_space_zip(bmap
->dim
);
10251 isl_basic_map_free(bmap
);
10255 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10256 * (A -> C) -> (B -> D).
10258 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10265 if (!isl_map_can_zip(map
))
10266 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10269 map
= isl_map_cow(map
);
10273 for (i
= 0; i
< map
->n
; ++i
) {
10274 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10279 map
->dim
= isl_space_zip(map
->dim
);
10289 /* Can we apply isl_basic_map_curry to "bmap"?
10290 * That is, does it have a nested relation in its domain?
10292 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10297 return isl_space_can_curry(bmap
->dim
);
10300 /* Can we apply isl_map_curry to "map"?
10301 * That is, does it have a nested relation in its domain?
10303 int isl_map_can_curry(__isl_keep isl_map
*map
)
10308 return isl_space_can_curry(map
->dim
);
10311 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10314 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10320 if (!isl_basic_map_can_curry(bmap
))
10321 isl_die(bmap
->ctx
, isl_error_invalid
,
10322 "basic map cannot be curried", goto error
);
10323 bmap
->dim
= isl_space_curry(bmap
->dim
);
10328 isl_basic_map_free(bmap
);
10332 /* Given a map (A -> B) -> C, return the corresponding map
10335 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10342 if (!isl_map_can_curry(map
))
10343 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10346 map
= isl_map_cow(map
);
10350 for (i
= 0; i
< map
->n
; ++i
) {
10351 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10356 map
->dim
= isl_space_curry(map
->dim
);
10366 /* Can we apply isl_basic_map_uncurry to "bmap"?
10367 * That is, does it have a nested relation in its domain?
10369 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10374 return isl_space_can_uncurry(bmap
->dim
);
10377 /* Can we apply isl_map_uncurry to "map"?
10378 * That is, does it have a nested relation in its domain?
10380 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10385 return isl_space_can_uncurry(map
->dim
);
10388 /* Given a basic map A -> (B -> C), return the corresponding basic map
10391 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10397 if (!isl_basic_map_can_uncurry(bmap
))
10398 isl_die(bmap
->ctx
, isl_error_invalid
,
10399 "basic map cannot be uncurried",
10400 return isl_basic_map_free(bmap
));
10401 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10403 return isl_basic_map_free(bmap
);
10407 /* Given a map A -> (B -> C), return the corresponding map
10410 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10417 if (!isl_map_can_uncurry(map
))
10418 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10419 return isl_map_free(map
));
10421 map
= isl_map_cow(map
);
10425 for (i
= 0; i
< map
->n
; ++i
) {
10426 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10428 return isl_map_free(map
);
10431 map
->dim
= isl_space_uncurry(map
->dim
);
10433 return isl_map_free(map
);
10438 /* Construct a basic map mapping the domain of the affine expression
10439 * to a one-dimensional range prescribed by the affine expression.
10441 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10445 isl_local_space
*ls
;
10446 isl_basic_map
*bmap
;
10451 ls
= isl_aff_get_local_space(aff
);
10452 bmap
= isl_basic_map_from_local_space(ls
);
10453 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10454 k
= isl_basic_map_alloc_equality(bmap
);
10458 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10459 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10460 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10461 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10462 aff
->v
->size
- (pos
+ 1));
10465 bmap
= isl_basic_map_finalize(bmap
);
10469 isl_basic_map_free(bmap
);
10473 /* Construct a map mapping the domain of the affine expression
10474 * to a one-dimensional range prescribed by the affine expression.
10476 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10478 isl_basic_map
*bmap
;
10480 bmap
= isl_basic_map_from_aff(aff
);
10481 return isl_map_from_basic_map(bmap
);
10484 /* Construct a basic map mapping the domain the multi-affine expression
10485 * to its range, with each dimension in the range equated to the
10486 * corresponding affine expression.
10488 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10489 __isl_take isl_multi_aff
*maff
)
10493 isl_basic_map
*bmap
;
10498 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10499 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10500 "invalid space", return isl_multi_aff_free(maff
));
10502 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10503 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10505 for (i
= 0; i
< maff
->n
; ++i
) {
10507 isl_basic_map
*bmap_i
;
10509 aff
= isl_aff_copy(maff
->p
[i
]);
10510 bmap_i
= isl_basic_map_from_aff(aff
);
10512 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10515 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10517 isl_multi_aff_free(maff
);
10521 /* Construct a map mapping the domain the multi-affine expression
10522 * to its range, with each dimension in the range equated to the
10523 * corresponding affine expression.
10525 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10527 isl_basic_map
*bmap
;
10529 bmap
= isl_basic_map_from_multi_aff(maff
);
10530 return isl_map_from_basic_map(bmap
);
10533 /* Construct a basic map mapping a domain in the given space to
10534 * to an n-dimensional range, with n the number of elements in the list,
10535 * where each coordinate in the range is prescribed by the
10536 * corresponding affine expression.
10537 * The domains of all affine expressions in the list are assumed to match
10540 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10541 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10545 isl_basic_map
*bmap
;
10550 dim
= isl_space_from_domain(domain_dim
);
10551 bmap
= isl_basic_map_universe(dim
);
10553 for (i
= 0; i
< list
->n
; ++i
) {
10555 isl_basic_map
*bmap_i
;
10557 aff
= isl_aff_copy(list
->p
[i
]);
10558 bmap_i
= isl_basic_map_from_aff(aff
);
10560 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10563 isl_aff_list_free(list
);
10567 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10568 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10570 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10573 /* Construct a basic map where the given dimensions are equal to each other.
10575 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10576 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10578 isl_basic_map
*bmap
= NULL
;
10584 if (pos1
>= isl_space_dim(space
, type1
))
10585 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10586 "index out of bounds", goto error
);
10587 if (pos2
>= isl_space_dim(space
, type2
))
10588 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10589 "index out of bounds", goto error
);
10591 if (type1
== type2
&& pos1
== pos2
)
10592 return isl_basic_map_universe(space
);
10594 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10595 i
= isl_basic_map_alloc_equality(bmap
);
10598 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10599 pos1
+= isl_basic_map_offset(bmap
, type1
);
10600 pos2
+= isl_basic_map_offset(bmap
, type2
);
10601 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10602 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10603 bmap
= isl_basic_map_finalize(bmap
);
10604 isl_space_free(space
);
10607 isl_space_free(space
);
10608 isl_basic_map_free(bmap
);
10612 /* Add a constraint imposing that the given two dimensions are equal.
10614 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10615 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10619 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10621 bmap
= isl_basic_map_intersect(bmap
, eq
);
10626 /* Add a constraint imposing that the given two dimensions are equal.
10628 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10629 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10631 isl_basic_map
*bmap
;
10633 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10635 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10640 /* Add a constraint imposing that the given two dimensions have opposite values.
10642 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10643 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10645 isl_basic_map
*bmap
= NULL
;
10651 if (pos1
>= isl_map_dim(map
, type1
))
10652 isl_die(map
->ctx
, isl_error_invalid
,
10653 "index out of bounds", goto error
);
10654 if (pos2
>= isl_map_dim(map
, type2
))
10655 isl_die(map
->ctx
, isl_error_invalid
,
10656 "index out of bounds", goto error
);
10658 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10659 i
= isl_basic_map_alloc_equality(bmap
);
10662 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10663 pos1
+= isl_basic_map_offset(bmap
, type1
);
10664 pos2
+= isl_basic_map_offset(bmap
, type2
);
10665 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10666 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10667 bmap
= isl_basic_map_finalize(bmap
);
10669 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10673 isl_basic_map_free(bmap
);
10678 /* Add a constraint imposing that the value of the first dimension is
10679 * greater than or equal to that of the second.
10681 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10682 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10685 isl_local_space
*ls
;
10690 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10691 isl_die(bmap
->ctx
, isl_error_invalid
,
10692 "index out of bounds", return isl_basic_map_free(bmap
));
10693 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10694 isl_die(bmap
->ctx
, isl_error_invalid
,
10695 "index out of bounds", return isl_basic_map_free(bmap
));
10697 if (type1
== type2
&& pos1
== pos2
)
10700 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10701 c
= isl_inequality_alloc(ls
);
10702 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10703 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10704 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10709 /* Add a constraint imposing that the value of the first dimension is
10710 * greater than that of the second.
10712 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10713 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10715 isl_basic_map
*bmap
= NULL
;
10721 if (pos1
>= isl_map_dim(map
, type1
))
10722 isl_die(map
->ctx
, isl_error_invalid
,
10723 "index out of bounds", goto error
);
10724 if (pos2
>= isl_map_dim(map
, type2
))
10725 isl_die(map
->ctx
, isl_error_invalid
,
10726 "index out of bounds", goto error
);
10728 if (type1
== type2
&& pos1
== pos2
) {
10729 isl_space
*space
= isl_map_get_space(map
);
10731 return isl_map_empty(space
);
10734 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10735 i
= isl_basic_map_alloc_inequality(bmap
);
10738 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10739 pos1
+= isl_basic_map_offset(bmap
, type1
);
10740 pos2
+= isl_basic_map_offset(bmap
, type2
);
10741 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10742 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10743 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10744 bmap
= isl_basic_map_finalize(bmap
);
10746 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10750 isl_basic_map_free(bmap
);
10755 /* Add a constraint imposing that the value of the first dimension is
10756 * smaller than that of the second.
10758 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
10759 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10761 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
10764 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10768 isl_local_space
*ls
;
10773 if (!isl_basic_map_divs_known(bmap
))
10774 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10775 "some divs are unknown", return NULL
);
10777 ls
= isl_basic_map_get_local_space(bmap
);
10778 div
= isl_local_space_get_div(ls
, pos
);
10779 isl_local_space_free(ls
);
10784 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10787 return isl_basic_map_get_div(bset
, pos
);
10790 /* Plug in "subs" for dimension "type", "pos" of "bset".
10792 * Let i be the dimension to replace and let "subs" be of the form
10796 * Any integer division with a non-zero coefficient for i,
10798 * floor((a i + g)/m)
10802 * floor((a f + d g)/(m d))
10804 * Constraints of the form
10812 __isl_give isl_basic_set
*isl_basic_set_substitute(
10813 __isl_take isl_basic_set
*bset
,
10814 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10820 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10823 bset
= isl_basic_set_cow(bset
);
10824 if (!bset
|| !subs
)
10827 ctx
= isl_basic_set_get_ctx(bset
);
10828 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10829 isl_die(ctx
, isl_error_invalid
,
10830 "spaces don't match", goto error
);
10831 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10832 isl_die(ctx
, isl_error_unsupported
,
10833 "cannot handle divs yet", goto error
);
10835 pos
+= isl_basic_set_offset(bset
, type
);
10839 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10840 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10842 isl_int_set(v
, bset
->eq
[i
][pos
]);
10843 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10844 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10845 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10848 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10849 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10851 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10852 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10853 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10854 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10857 for (i
= 0; i
< bset
->n_div
; ++i
) {
10858 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10860 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10861 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10862 isl_seq_combine(bset
->div
[i
] + 1,
10863 subs
->v
->el
[0], bset
->div
[i
] + 1,
10864 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10865 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10870 bset
= isl_basic_set_simplify(bset
);
10871 return isl_basic_set_finalize(bset
);
10873 isl_basic_set_free(bset
);
10877 /* Plug in "subs" for dimension "type", "pos" of "set".
10879 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10880 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10884 if (set
&& isl_set_plain_is_empty(set
))
10887 set
= isl_set_cow(set
);
10891 for (i
= set
->n
- 1; i
>= 0; --i
) {
10892 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10893 if (remove_if_empty(set
, i
) < 0)
10903 /* Check if the range of "ma" is compatible with "space".
10904 * Return -1 if anything is wrong.
10906 static int check_space_compatible_range_multi_aff(
10907 __isl_keep isl_space
*space
, __isl_keep isl_multi_aff
*ma
)
10910 isl_space
*ma_space
;
10912 ma_space
= isl_multi_aff_get_space(ma
);
10913 m
= isl_space_is_range_internal(space
, ma_space
);
10914 isl_space_free(ma_space
);
10916 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10917 "spaces don't match", return -1);
10921 /* Check if the range of "ma" is compatible with "bset".
10922 * Return -1 if anything is wrong.
10924 static int check_basic_set_compatible_range_multi_aff(
10925 __isl_keep isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
10927 return check_space_compatible_range_multi_aff(bset
->dim
, ma
);
10930 /* Copy the divs from "ma" to "bset", adding zeros for the coefficients
10931 * of the other divs in "bset".
10933 static int set_ma_divs(__isl_keep isl_basic_set
*bset
,
10934 __isl_keep isl_multi_aff
*ma
, int n_div
)
10937 isl_local_space
*ls
;
10942 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
10946 for (i
= 0; i
< n_div
; ++i
) {
10947 isl_seq_cpy(bset
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
10948 isl_seq_clr(bset
->div
[i
] + ls
->div
->n_col
, bset
->n_div
- n_div
);
10949 if (isl_basic_set_add_div_constraints(bset
, i
) < 0)
10953 isl_local_space_free(ls
);
10956 isl_local_space_free(ls
);
10960 /* How many stride constraints does "ma" enforce?
10961 * That is, how many of the affine expressions have a denominator
10962 * different from one?
10964 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
10969 for (i
= 0; i
< ma
->n
; ++i
)
10970 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
10976 /* For each affine expression in ma of the form
10978 * x_i = (f_i y + h_i)/m_i
10980 * with m_i different from one, add a constraint to "bset"
10983 * f_i y + h_i = m_i alpha_i
10985 * with alpha_i an additional existentially quantified variable.
10987 static __isl_give isl_basic_set
*add_ma_strides(
10988 __isl_take isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
10994 total
= isl_basic_set_total_dim(bset
);
10995 for (i
= 0; i
< ma
->n
; ++i
) {
10998 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11000 div
= isl_basic_set_alloc_div(bset
);
11001 k
= isl_basic_set_alloc_equality(bset
);
11002 if (div
< 0 || k
< 0)
11004 isl_int_set_si(bset
->div
[div
][0], 0);
11005 len
= ma
->p
[i
]->v
->size
;
11006 isl_seq_cpy(bset
->eq
[k
], ma
->p
[i
]->v
->el
+ 1, len
- 1);
11007 isl_seq_clr(bset
->eq
[k
] + len
- 1, 1 + total
- (len
- 1));
11008 isl_int_neg(bset
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11014 isl_basic_set_free(bset
);
11018 /* Compute the preimage of "bset" under the function represented by "ma".
11019 * In other words, plug in "ma" in "bset". The result is a basic set
11020 * that lives in the domain space of "ma".
11022 * If bset is represented by
11024 * A(p) + B x + C(divs) >= 0
11026 * and ma is represented by
11028 * x = D(p) + F(y) + G(divs')
11030 * then the result is
11032 * A(p) + B D(p) + B F(y) + B G(divs') + C(divs) >= 0
11034 * The divs in the input set are similarly adjusted.
11037 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
11041 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
11043 * If bset is not a rational set and if F(y) involves any denominators
11045 * x_i = (f_i y + h_i)/m_i
11047 * the additional constraints are added to ensure that we only
11048 * map back integer points. That is we enforce
11050 * f_i y + h_i = m_i alpha_i
11052 * with alpha_i an additional existentially quantified variable.
11054 * We first copy over the divs from "ma".
11055 * Then we add the modified constraints and divs from "bset".
11056 * Finally, we add the stride constraints, if needed.
11058 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11059 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11063 isl_basic_set
*res
= NULL
;
11064 int n_div_bset
, n_div_ma
;
11065 isl_int f
, c1
, c2
, g
;
11066 int rational
, strides
;
11073 ma
= isl_multi_aff_align_divs(ma
);
11076 if (check_basic_set_compatible_range_multi_aff(bset
, ma
) < 0)
11079 n_div_bset
= isl_basic_set_dim(bset
, isl_dim_div
);
11080 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11082 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
11083 rational
= isl_basic_set_is_rational(bset
);
11084 strides
= rational
? 0 : multi_aff_strides(ma
);
11085 res
= isl_basic_set_alloc_space(space
, n_div_ma
+ n_div_bset
+ strides
,
11086 bset
->n_eq
+ strides
, bset
->n_ineq
+ 2 * n_div_ma
);
11088 res
= isl_basic_set_set_rational(res
);
11090 for (i
= 0; i
< n_div_ma
+ n_div_bset
; ++i
)
11091 if (isl_basic_set_alloc_div(res
) < 0)
11094 if (set_ma_divs(res
, ma
, n_div_ma
) < 0)
11097 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11098 k
= isl_basic_set_alloc_equality(res
);
11101 isl_seq_preimage(res
->eq
[k
], bset
->eq
[i
], ma
, n_div_ma
,
11102 n_div_bset
, f
, c1
, c2
, g
, 0);
11105 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11106 k
= isl_basic_set_alloc_inequality(res
);
11109 isl_seq_preimage(res
->ineq
[k
], bset
->ineq
[i
], ma
, n_div_ma
,
11110 n_div_bset
, f
, c1
, c2
, g
, 0);
11113 for (i
= 0; i
< bset
->n_div
; ++i
) {
11114 if (isl_int_is_zero(bset
->div
[i
][0])) {
11115 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11118 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bset
->div
[i
],
11119 ma
, n_div_ma
, n_div_bset
, f
, c1
, c2
, g
, 1);
11123 res
= add_ma_strides(res
, ma
);
11129 isl_basic_set_free(bset
);
11130 isl_multi_aff_free(ma
);
11131 res
= isl_basic_set_simplify(res
);
11132 return isl_basic_set_finalize(res
);
11138 isl_basic_set_free(bset
);
11139 isl_multi_aff_free(ma
);
11140 isl_basic_set_free(res
);
11144 /* Check if the range of "ma" is compatible with "set".
11145 * Return -1 if anything is wrong.
11147 static int check_set_compatible_range_multi_aff(
11148 __isl_keep isl_set
*set
, __isl_keep isl_multi_aff
*ma
)
11150 return check_space_compatible_range_multi_aff(set
->dim
, ma
);
11153 /* Compute the preimage of "set" under the function represented by "ma".
11154 * In other words, plug in "ma" in "set. The result is a set
11155 * that lives in the domain space of "ma".
11157 static __isl_give isl_set
*set_preimage_multi_aff(__isl_take isl_set
*set
,
11158 __isl_take isl_multi_aff
*ma
)
11162 set
= isl_set_cow(set
);
11163 ma
= isl_multi_aff_align_divs(ma
);
11166 if (check_set_compatible_range_multi_aff(set
, ma
) < 0)
11169 for (i
= 0; i
< set
->n
; ++i
) {
11170 set
->p
[i
] = isl_basic_set_preimage_multi_aff(set
->p
[i
],
11171 isl_multi_aff_copy(ma
));
11176 isl_space_free(set
->dim
);
11177 set
->dim
= isl_multi_aff_get_domain_space(ma
);
11181 isl_multi_aff_free(ma
);
11183 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
11184 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
11187 isl_multi_aff_free(ma
);
11192 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11193 __isl_take isl_multi_aff
*ma
)
11198 if (isl_space_match(set
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11199 return set_preimage_multi_aff(set
, ma
);
11201 if (!isl_space_has_named_params(set
->dim
) ||
11202 !isl_space_has_named_params(ma
->space
))
11203 isl_die(set
->ctx
, isl_error_invalid
,
11204 "unaligned unnamed parameters", goto error
);
11205 set
= isl_set_align_params(set
, isl_multi_aff_get_space(ma
));
11206 ma
= isl_multi_aff_align_params(ma
, isl_set_get_space(set
));
11208 return set_preimage_multi_aff(set
, ma
);
11210 isl_multi_aff_free(ma
);
11211 return isl_set_free(set
);
11214 /* Compute the preimage of "set" under the function represented by "pma".
11215 * In other words, plug in "pma" in "set. The result is a set
11216 * that lives in the domain space of "pma".
11218 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11219 __isl_take isl_pw_multi_aff
*pma
)
11228 isl_pw_multi_aff_free(pma
);
11229 res
= isl_set_empty(isl_set_get_space(set
));
11234 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11235 isl_multi_aff_copy(pma
->p
[0].maff
));
11236 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11238 for (i
= 1; i
< pma
->n
; ++i
) {
11241 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11242 isl_multi_aff_copy(pma
->p
[i
].maff
));
11243 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11244 res
= isl_set_union(res
, res_i
);
11247 isl_pw_multi_aff_free(pma
);
11251 isl_pw_multi_aff_free(pma
);
11256 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11257 __isl_take isl_pw_multi_aff
*pma
)
11262 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11263 return set_preimage_pw_multi_aff(set
, pma
);
11265 if (!isl_space_has_named_params(set
->dim
) ||
11266 !isl_space_has_named_params(pma
->dim
))
11267 isl_die(set
->ctx
, isl_error_invalid
,
11268 "unaligned unnamed parameters", goto error
);
11269 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11270 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11272 return set_preimage_pw_multi_aff(set
, pma
);
11274 isl_pw_multi_aff_free(pma
);
11275 return isl_set_free(set
);