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 /* Turn inequality "pos" of "bmap" into an equality.
1150 * In particular, we move the inequality in front of the equalities
1151 * and move the last inequality in the position of the moved inequality.
1152 * Note that isl_tab_make_equalities_explicit depends on this particular
1153 * change in the ordering of the constraints.
1155 void isl_basic_map_inequality_to_equality(
1156 struct isl_basic_map
*bmap
, unsigned pos
)
1160 t
= bmap
->ineq
[pos
];
1161 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1162 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1167 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1168 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1169 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1170 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1173 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1175 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1178 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1180 struct isl_ctx
*ctx
;
1184 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1185 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1186 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1187 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1188 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1189 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1190 1 + isl_basic_map_total_dim(bmap
),
1191 bmap
->extra
- bmap
->n_div
);
1192 return bmap
->n_ineq
++;
1195 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1197 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1200 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1204 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1209 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1211 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1214 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1219 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1221 if (pos
!= bmap
->n_ineq
- 1) {
1222 t
= bmap
->ineq
[pos
];
1223 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1224 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1225 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1231 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1233 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1236 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1241 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1244 k
= isl_basic_map_alloc_equality(bmap
);
1247 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1250 isl_basic_map_free(bmap
);
1254 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1257 return (isl_basic_set
*)
1258 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1261 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1266 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1269 k
= isl_basic_map_alloc_inequality(bmap
);
1272 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1275 isl_basic_map_free(bmap
);
1279 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1282 return (isl_basic_set
*)
1283 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1286 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1290 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1291 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1292 1 + 1 + isl_basic_map_total_dim(bmap
),
1293 bmap
->extra
- bmap
->n_div
);
1294 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1295 return bmap
->n_div
++;
1298 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1300 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1303 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1307 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1312 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1314 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1317 /* Copy constraint from src to dst, putting the vars of src at offset
1318 * dim_off in dst and the divs of src at offset div_off in dst.
1319 * If both sets are actually map, then dim_off applies to the input
1322 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1323 struct isl_basic_map
*src_map
, isl_int
*src
,
1324 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1326 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1327 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1328 unsigned src_in
= isl_basic_map_n_in(src_map
);
1329 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1330 unsigned src_out
= isl_basic_map_n_out(src_map
);
1331 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1332 isl_int_set(dst
[0], src
[0]);
1333 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1334 if (dst_nparam
> src_nparam
)
1335 isl_seq_clr(dst
+1+src_nparam
,
1336 dst_nparam
- src_nparam
);
1337 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1338 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1340 isl_min(dst_in
-in_off
, src_in
));
1341 if (dst_in
-in_off
> src_in
)
1342 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1343 dst_in
- in_off
- src_in
);
1344 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1345 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1346 src
+1+src_nparam
+src_in
,
1347 isl_min(dst_out
-out_off
, src_out
));
1348 if (dst_out
-out_off
> src_out
)
1349 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1350 dst_out
- out_off
- src_out
);
1351 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1352 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1353 src
+1+src_nparam
+src_in
+src_out
,
1354 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1355 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1356 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1357 div_off
+src_map
->n_div
,
1358 dst_map
->n_div
- div_off
- src_map
->n_div
);
1361 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1362 struct isl_basic_map
*src_map
, isl_int
*src
,
1363 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1365 isl_int_set(dst
[0], src
[0]);
1366 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1369 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1370 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1375 if (!bmap1
|| !bmap2
)
1378 div_off
= bmap1
->n_div
;
1380 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1381 int i1
= isl_basic_map_alloc_equality(bmap1
);
1384 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1385 i_pos
, o_pos
, div_off
);
1388 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1389 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1392 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1393 i_pos
, o_pos
, div_off
);
1396 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1397 int i1
= isl_basic_map_alloc_div(bmap1
);
1400 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1401 i_pos
, o_pos
, div_off
);
1404 isl_basic_map_free(bmap2
);
1409 isl_basic_map_free(bmap1
);
1410 isl_basic_map_free(bmap2
);
1414 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1415 struct isl_basic_set
*bset2
, unsigned pos
)
1417 return (struct isl_basic_set
*)
1418 add_constraints((struct isl_basic_map
*)bset1
,
1419 (struct isl_basic_map
*)bset2
, 0, pos
);
1422 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1423 __isl_take isl_space
*dim
, unsigned extra
,
1424 unsigned n_eq
, unsigned n_ineq
)
1426 struct isl_basic_map
*ext
;
1436 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1437 base
->extra
>= base
->n_div
+ extra
;
1439 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1440 room_for_ineq(base
, n_ineq
)) {
1441 isl_space_free(dim
);
1445 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1446 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1447 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1448 extra
+= base
->extra
;
1450 n_ineq
+= base
->n_ineq
;
1452 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1458 ext
->sample
= isl_vec_copy(base
->sample
);
1459 flags
= base
->flags
;
1460 ext
= add_constraints(ext
, base
, 0, 0);
1463 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1469 isl_space_free(dim
);
1470 isl_basic_map_free(base
);
1474 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1475 __isl_take isl_space
*dim
, unsigned extra
,
1476 unsigned n_eq
, unsigned n_ineq
)
1478 return (struct isl_basic_set
*)
1479 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1480 extra
, n_eq
, n_ineq
);
1483 struct isl_basic_map
*isl_basic_map_extend_constraints(
1484 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1488 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1492 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1493 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1494 unsigned n_eq
, unsigned n_ineq
)
1496 struct isl_basic_map
*bmap
;
1501 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1505 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1508 isl_basic_map_free(base
);
1512 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1513 unsigned nparam
, unsigned dim
, unsigned extra
,
1514 unsigned n_eq
, unsigned n_ineq
)
1516 return (struct isl_basic_set
*)
1517 isl_basic_map_extend((struct isl_basic_map
*)base
,
1518 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1521 struct isl_basic_set
*isl_basic_set_extend_constraints(
1522 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1524 return (struct isl_basic_set
*)
1525 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1529 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1531 return (struct isl_basic_set
*)
1532 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1535 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1540 if (bmap
->ref
> 1) {
1542 bmap
= isl_basic_map_dup(bmap
);
1545 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1549 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1557 return isl_set_dup(set
);
1560 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1568 return isl_map_dup(map
);
1571 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1572 unsigned a_len
, unsigned b_len
)
1574 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1575 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1576 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1579 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1580 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1588 isl_assert(bmap
->ctx
,
1589 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1591 if (n1
== 0 || n2
== 0)
1594 bmap
= isl_basic_map_cow(bmap
);
1598 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1599 if (isl_blk_is_error(blk
))
1602 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1604 bmap
->eq
[i
] + pos
, n1
, n2
);
1606 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1608 bmap
->ineq
[i
] + pos
, n1
, n2
);
1610 for (i
= 0; i
< bmap
->n_div
; ++i
)
1612 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1614 isl_blk_free(bmap
->ctx
, blk
);
1616 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1617 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1618 return isl_basic_map_finalize(bmap
);
1620 isl_basic_map_free(bmap
);
1624 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1625 __isl_take isl_basic_set
*bset
, unsigned n
)
1633 nparam
= isl_basic_set_n_param(bset
);
1634 dim
= isl_basic_set_n_dim(bset
);
1635 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1637 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1639 isl_basic_set_free(bset
);
1643 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1649 total
= isl_basic_map_total_dim(bmap
);
1650 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1651 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1653 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1655 i
= isl_basic_map_alloc_equality(bmap
);
1659 isl_int_set_si(bmap
->eq
[i
][0], 1);
1660 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1661 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1662 isl_vec_free(bmap
->sample
);
1663 bmap
->sample
= NULL
;
1664 return isl_basic_map_finalize(bmap
);
1666 isl_basic_map_free(bmap
);
1670 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1672 return (struct isl_basic_set
*)
1673 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1676 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1679 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1680 isl_int
*t
= bmap
->div
[a
];
1681 bmap
->div
[a
] = bmap
->div
[b
];
1684 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1685 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1687 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1688 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1690 for (i
= 0; i
< bmap
->n_div
; ++i
)
1691 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1692 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1695 /* Eliminate the specified n dimensions starting at first from the
1696 * constraints, without removing the dimensions from the space.
1697 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1699 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1700 enum isl_dim_type type
, unsigned first
, unsigned n
)
1709 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1710 isl_die(map
->ctx
, isl_error_invalid
,
1711 "index out of bounds", goto error
);
1713 map
= isl_map_cow(map
);
1717 for (i
= 0; i
< map
->n
; ++i
) {
1718 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], 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(__isl_take isl_set
*set
,
1733 enum isl_dim_type type
, unsigned first
, unsigned n
)
1735 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1738 /* Eliminate the specified n dimensions starting at first from the
1739 * constraints, without removing the dimensions from the space.
1740 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1742 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1743 unsigned first
, unsigned n
)
1745 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1748 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1749 __isl_take isl_basic_map
*bmap
)
1753 bmap
= isl_basic_map_eliminate_vars(bmap
,
1754 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1758 return isl_basic_map_finalize(bmap
);
1761 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1762 __isl_take isl_basic_set
*bset
)
1764 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1765 (struct isl_basic_map
*)bset
);
1768 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1777 map
= isl_map_cow(map
);
1781 for (i
= 0; i
< map
->n
; ++i
) {
1782 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1792 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1794 return isl_map_remove_divs(set
);
1797 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1798 enum isl_dim_type type
, unsigned first
, unsigned n
)
1802 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1804 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1806 bmap
= isl_basic_map_eliminate_vars(bmap
,
1807 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1810 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1812 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1815 isl_basic_map_free(bmap
);
1819 /* Return true if the definition of the given div (recursively) involves
1820 * any of the given variables.
1822 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1823 unsigned first
, unsigned n
)
1826 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1828 if (isl_int_is_zero(bmap
->div
[div
][0]))
1830 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1833 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1834 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1836 if (div_involves_vars(bmap
, i
, first
, n
))
1843 /* Try and add a lower and/or upper bound on "div" to "bmap"
1844 * based on inequality "i".
1845 * "total" is the total number of variables (excluding the divs).
1846 * "v" is a temporary object that can be used during the calculations.
1847 * If "lb" is set, then a lower bound should be constructed.
1848 * If "ub" is set, then an upper bound should be constructed.
1850 * The calling function has already checked that the inequality does not
1851 * reference "div", but we still need to check that the inequality is
1852 * of the right form. We'll consider the case where we want to construct
1853 * a lower bound. The construction of upper bounds is similar.
1855 * Let "div" be of the form
1857 * q = floor((a + f(x))/d)
1859 * We essentially check if constraint "i" is of the form
1863 * so that we can use it to derive a lower bound on "div".
1864 * However, we allow a slightly more general form
1868 * with the condition that the coefficients of g(x) - f(x) are all
1870 * Rewriting this constraint as
1874 * adding a + f(x) to both sides and dividing by d, we obtain
1876 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1878 * Taking the floor on both sides, we obtain
1880 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1884 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1886 * In the case of an upper bound, we construct the constraint
1888 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1891 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1892 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1893 unsigned total
, isl_int v
, int lb
, int ub
)
1897 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1899 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1900 bmap
->div
[div
][1 + 1 + j
]);
1901 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1904 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1905 bmap
->div
[div
][1 + 1 + j
]);
1906 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1912 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1914 int k
= isl_basic_map_alloc_inequality(bmap
);
1917 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1918 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1919 bmap
->div
[div
][1 + j
]);
1920 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1921 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1923 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1926 int k
= isl_basic_map_alloc_inequality(bmap
);
1929 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1930 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1931 bmap
->div
[div
][1 + j
]);
1932 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1933 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1935 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1940 isl_basic_map_free(bmap
);
1944 /* This function is called right before "div" is eliminated from "bmap"
1945 * using Fourier-Motzkin.
1946 * Look through the constraints of "bmap" for constraints on the argument
1947 * of the integer division and use them to construct constraints on the
1948 * integer division itself. These constraints can then be combined
1949 * during the Fourier-Motzkin elimination.
1950 * Note that it is only useful to introduce lower bounds on "div"
1951 * if "bmap" already contains upper bounds on "div" as the newly
1952 * introduce lower bounds can then be combined with the pre-existing
1953 * upper bounds. Similarly for upper bounds.
1954 * We therefore first check if "bmap" contains any lower and/or upper bounds
1957 * It is interesting to note that the introduction of these constraints
1958 * can indeed lead to more accurate results, even when compared to
1959 * deriving constraints on the argument of "div" from constraints on "div".
1960 * Consider, for example, the set
1962 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1964 * The second constraint can be rewritten as
1966 * 2 * [(-i-2j+3)/4] + k >= 0
1968 * from which we can derive
1970 * -i - 2j + 3 >= -2k
1976 * Combined with the first constraint, we obtain
1978 * -3 <= 3 + 2k or k >= -3
1980 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1981 * the first constraint, we obtain
1983 * [(i + 2j)/4] >= [-3/4] = -1
1985 * Combining this constraint with the second constraint, we obtain
1989 static __isl_give isl_basic_map
*insert_bounds_on_div(
1990 __isl_take isl_basic_map
*bmap
, int div
)
1993 int check_lb
, check_ub
;
2000 if (isl_int_is_zero(bmap
->div
[div
][0]))
2003 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2007 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2008 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2015 if (!check_lb
&& !check_ub
)
2020 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2021 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2024 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2025 check_lb
, check_ub
);
2033 /* Remove all divs (recursively) involving any of the given dimensions
2034 * in their definitions.
2036 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2037 __isl_take isl_basic_map
*bmap
,
2038 enum isl_dim_type type
, unsigned first
, unsigned n
)
2044 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2046 first
+= isl_basic_map_offset(bmap
, type
);
2048 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2049 if (!div_involves_vars(bmap
, i
, first
, n
))
2051 bmap
= insert_bounds_on_div(bmap
, i
);
2052 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2060 isl_basic_map_free(bmap
);
2064 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2065 __isl_take isl_basic_set
*bset
,
2066 enum isl_dim_type type
, unsigned first
, unsigned n
)
2068 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2071 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2072 enum isl_dim_type type
, unsigned first
, unsigned n
)
2081 map
= isl_map_cow(map
);
2085 for (i
= 0; i
< map
->n
; ++i
) {
2086 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2097 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2098 enum isl_dim_type type
, unsigned first
, unsigned n
)
2100 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2104 /* Does the desciption of "bmap" depend on the specified dimensions?
2105 * We also check whether the dimensions appear in any of the div definitions.
2106 * In principle there is no need for this check. If the dimensions appear
2107 * in a div definition, they also appear in the defining constraints of that
2110 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2111 enum isl_dim_type type
, unsigned first
, unsigned n
)
2118 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2119 isl_die(bmap
->ctx
, isl_error_invalid
,
2120 "index out of bounds", return -1);
2122 first
+= isl_basic_map_offset(bmap
, type
);
2123 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2124 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2126 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2127 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2129 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2130 if (isl_int_is_zero(bmap
->div
[i
][0]))
2132 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2139 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2140 enum isl_dim_type type
, unsigned first
, unsigned n
)
2147 if (first
+ n
> isl_map_dim(map
, type
))
2148 isl_die(map
->ctx
, isl_error_invalid
,
2149 "index out of bounds", return -1);
2151 for (i
= 0; i
< map
->n
; ++i
) {
2152 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2154 if (involves
< 0 || involves
)
2161 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2162 enum isl_dim_type type
, unsigned first
, unsigned n
)
2164 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2167 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2168 enum isl_dim_type type
, unsigned first
, unsigned n
)
2170 return isl_map_involves_dims(set
, type
, first
, n
);
2173 /* Return true if the definition of the given div is unknown or depends
2176 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2179 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2181 if (isl_int_is_zero(bmap
->div
[div
][0]))
2184 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2185 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2187 if (div_is_unknown(bmap
, i
))
2194 /* Remove all divs that are unknown or defined in terms of unknown divs.
2196 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2197 __isl_take isl_basic_map
*bmap
)
2204 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2205 if (!div_is_unknown(bmap
, i
))
2207 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2216 /* Remove all divs that are unknown or defined in terms of unknown divs.
2218 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2219 __isl_take isl_basic_set
*bset
)
2221 return isl_basic_map_remove_unknown_divs(bset
);
2224 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2233 map
= isl_map_cow(map
);
2237 for (i
= 0; i
< map
->n
; ++i
) {
2238 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2248 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2250 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2253 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2254 __isl_take isl_basic_set
*bset
,
2255 enum isl_dim_type type
, unsigned first
, unsigned n
)
2257 return (isl_basic_set
*)
2258 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2261 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2262 enum isl_dim_type type
, unsigned first
, unsigned n
)
2269 map
= isl_map_cow(map
);
2272 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2274 for (i
= 0; i
< map
->n
; ++i
) {
2275 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2276 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2280 map
= isl_map_drop(map
, type
, first
, n
);
2287 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2288 enum isl_dim_type type
, unsigned first
, unsigned n
)
2290 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2293 /* Project out n inputs starting at first using Fourier-Motzkin */
2294 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2295 unsigned first
, unsigned n
)
2297 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2300 static void dump_term(struct isl_basic_map
*bmap
,
2301 isl_int c
, int pos
, FILE *out
)
2304 unsigned in
= isl_basic_map_n_in(bmap
);
2305 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2306 unsigned nparam
= isl_basic_map_n_param(bmap
);
2308 isl_int_print(out
, c
, 0);
2310 if (!isl_int_is_one(c
))
2311 isl_int_print(out
, c
, 0);
2312 if (pos
< 1 + nparam
) {
2313 name
= isl_space_get_dim_name(bmap
->dim
,
2314 isl_dim_param
, pos
- 1);
2316 fprintf(out
, "%s", name
);
2318 fprintf(out
, "p%d", pos
- 1);
2319 } else if (pos
< 1 + nparam
+ in
)
2320 fprintf(out
, "i%d", pos
- 1 - nparam
);
2321 else if (pos
< 1 + nparam
+ dim
)
2322 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2324 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2328 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2329 int sign
, FILE *out
)
2333 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2337 for (i
= 0, first
= 1; i
< len
; ++i
) {
2338 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2341 fprintf(out
, " + ");
2343 isl_int_abs(v
, c
[i
]);
2344 dump_term(bmap
, v
, i
, out
);
2351 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2352 const char *op
, FILE *out
, int indent
)
2356 fprintf(out
, "%*s", indent
, "");
2358 dump_constraint_sign(bmap
, c
, 1, out
);
2359 fprintf(out
, " %s ", op
);
2360 dump_constraint_sign(bmap
, c
, -1, out
);
2364 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2365 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2367 fprintf(out
, "%*s", indent
, "");
2368 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2373 static void dump_constraints(struct isl_basic_map
*bmap
,
2374 isl_int
**c
, unsigned n
,
2375 const char *op
, FILE *out
, int indent
)
2379 for (i
= 0; i
< n
; ++i
)
2380 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2383 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2387 unsigned total
= isl_basic_map_total_dim(bmap
);
2389 for (j
= 0; j
< 1 + total
; ++j
) {
2390 if (isl_int_is_zero(exp
[j
]))
2392 if (!first
&& isl_int_is_pos(exp
[j
]))
2394 dump_term(bmap
, exp
[j
], j
, out
);
2399 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2403 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2404 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2406 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2407 fprintf(out
, "%*s", indent
, "");
2408 fprintf(out
, "e%d = [(", i
);
2409 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2411 isl_int_print(out
, bmap
->div
[i
][0], 0);
2412 fprintf(out
, "]\n");
2416 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2417 FILE *out
, int indent
)
2420 fprintf(out
, "null basic set\n");
2424 fprintf(out
, "%*s", indent
, "");
2425 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2426 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2427 bset
->extra
, bset
->flags
);
2428 dump((struct isl_basic_map
*)bset
, out
, indent
);
2431 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2432 FILE *out
, int indent
)
2435 fprintf(out
, "null basic map\n");
2439 fprintf(out
, "%*s", indent
, "");
2440 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2441 "flags: %x, n_name: %d\n",
2443 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2444 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2445 dump(bmap
, out
, indent
);
2448 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2453 total
= isl_basic_map_total_dim(bmap
);
2454 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2455 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2456 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2457 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2461 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2464 struct isl_set
*set
;
2468 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2469 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2470 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2471 sizeof(struct isl_set
) +
2472 (n
- 1) * sizeof(struct isl_basic_set
*));
2476 set
->ctx
= dim
->ctx
;
2477 isl_ctx_ref(set
->ctx
);
2485 isl_space_free(dim
);
2489 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2490 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2492 struct isl_set
*set
;
2495 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2499 set
= isl_set_alloc_space(dims
, n
, flags
);
2503 /* Make sure "map" has room for at least "n" more basic maps.
2505 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2508 struct isl_map
*grown
= NULL
;
2512 isl_assert(map
->ctx
, n
>= 0, goto error
);
2513 if (map
->n
+ n
<= map
->size
)
2515 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2518 for (i
= 0; i
< map
->n
; ++i
) {
2519 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2527 isl_map_free(grown
);
2532 /* Make sure "set" has room for at least "n" more basic sets.
2534 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2536 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2539 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2542 struct isl_set
*dup
;
2547 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2550 for (i
= 0; i
< set
->n
; ++i
)
2551 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2555 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2557 return isl_map_from_basic_map(bset
);
2560 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2562 struct isl_map
*map
;
2567 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2568 return isl_map_add_basic_map(map
, bmap
);
2571 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2572 __isl_take isl_basic_set
*bset
)
2574 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2575 (struct isl_basic_map
*)bset
);
2578 void *isl_set_free(__isl_take isl_set
*set
)
2588 isl_ctx_deref(set
->ctx
);
2589 for (i
= 0; i
< set
->n
; ++i
)
2590 isl_basic_set_free(set
->p
[i
]);
2591 isl_space_free(set
->dim
);
2597 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2602 fprintf(out
, "null set\n");
2606 fprintf(out
, "%*s", indent
, "");
2607 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2608 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2610 for (i
= 0; i
< set
->n
; ++i
) {
2611 fprintf(out
, "%*s", indent
, "");
2612 fprintf(out
, "basic set %d:\n", i
);
2613 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2617 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2622 fprintf(out
, "null map\n");
2626 fprintf(out
, "%*s", indent
, "");
2627 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2628 "flags: %x, n_name: %d\n",
2629 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2630 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2631 for (i
= 0; i
< map
->n
; ++i
) {
2632 fprintf(out
, "%*s", indent
, "");
2633 fprintf(out
, "basic map %d:\n", i
);
2634 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2638 struct isl_basic_map
*isl_basic_map_intersect_domain(
2639 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2641 struct isl_basic_map
*bmap_domain
;
2646 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2647 bset
->dim
, isl_dim_param
), goto error
);
2649 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2650 isl_assert(bset
->ctx
,
2651 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2653 bmap
= isl_basic_map_cow(bmap
);
2656 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2657 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2658 bmap_domain
= isl_basic_map_from_domain(bset
);
2659 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2661 bmap
= isl_basic_map_simplify(bmap
);
2662 return isl_basic_map_finalize(bmap
);
2664 isl_basic_map_free(bmap
);
2665 isl_basic_set_free(bset
);
2669 struct isl_basic_map
*isl_basic_map_intersect_range(
2670 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2672 struct isl_basic_map
*bmap_range
;
2677 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2678 bset
->dim
, isl_dim_param
), goto error
);
2680 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2681 isl_assert(bset
->ctx
,
2682 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2684 if (isl_basic_set_is_universe(bset
)) {
2685 isl_basic_set_free(bset
);
2689 bmap
= isl_basic_map_cow(bmap
);
2692 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2693 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2694 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2695 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2697 bmap
= isl_basic_map_simplify(bmap
);
2698 return isl_basic_map_finalize(bmap
);
2700 isl_basic_map_free(bmap
);
2701 isl_basic_set_free(bset
);
2705 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2711 total
= 1 + isl_basic_map_total_dim(bmap
);
2712 if (total
!= vec
->size
)
2717 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2718 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2719 if (!isl_int_is_zero(s
)) {
2725 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2726 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2727 if (isl_int_is_neg(s
)) {
2738 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2740 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2743 struct isl_basic_map
*isl_basic_map_intersect(
2744 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2746 struct isl_vec
*sample
= NULL
;
2748 if (!bmap1
|| !bmap2
)
2751 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2752 bmap2
->dim
, isl_dim_param
), goto error
);
2753 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2754 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2755 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2756 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2757 return isl_basic_map_intersect(bmap2
, bmap1
);
2759 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2760 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2761 isl_assert(bmap1
->ctx
,
2762 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2764 if (bmap1
->sample
&&
2765 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2766 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2767 sample
= isl_vec_copy(bmap1
->sample
);
2768 else if (bmap2
->sample
&&
2769 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2770 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2771 sample
= isl_vec_copy(bmap2
->sample
);
2773 bmap1
= isl_basic_map_cow(bmap1
);
2776 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2777 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2778 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2781 isl_vec_free(sample
);
2783 isl_vec_free(bmap1
->sample
);
2784 bmap1
->sample
= sample
;
2787 bmap1
= isl_basic_map_simplify(bmap1
);
2788 return isl_basic_map_finalize(bmap1
);
2791 isl_vec_free(sample
);
2792 isl_basic_map_free(bmap1
);
2793 isl_basic_map_free(bmap2
);
2797 struct isl_basic_set
*isl_basic_set_intersect(
2798 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2800 return (struct isl_basic_set
*)
2801 isl_basic_map_intersect(
2802 (struct isl_basic_map
*)bset1
,
2803 (struct isl_basic_map
*)bset2
);
2806 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2807 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2809 return isl_basic_set_intersect(bset1
, bset2
);
2812 /* Special case of isl_map_intersect, where both map1 and map2
2813 * are convex, without any divs and such that either map1 or map2
2814 * contains a single constraint. This constraint is then simply
2815 * added to the other map.
2817 static __isl_give isl_map
*map_intersect_add_constraint(
2818 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2820 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2821 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2822 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2823 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2825 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2826 return isl_map_intersect(map2
, map1
);
2828 isl_assert(map2
->ctx
,
2829 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2831 map1
= isl_map_cow(map1
);
2834 if (isl_map_plain_is_empty(map1
)) {
2838 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2839 if (map2
->p
[0]->n_eq
== 1)
2840 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2842 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2843 map2
->p
[0]->ineq
[0]);
2845 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2846 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2850 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2851 isl_basic_map_free(map1
->p
[0]);
2864 /* map2 may be either a parameter domain or a map living in the same
2867 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2868 __isl_take isl_map
*map2
)
2877 if ((isl_map_plain_is_empty(map1
) ||
2878 isl_map_plain_is_universe(map2
)) &&
2879 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2883 if ((isl_map_plain_is_empty(map2
) ||
2884 isl_map_plain_is_universe(map1
)) &&
2885 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2890 if (map1
->n
== 1 && map2
->n
== 1 &&
2891 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2892 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2893 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2894 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2895 return map_intersect_add_constraint(map1
, map2
);
2897 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2898 isl_space_dim(map2
->dim
, isl_dim_param
))
2899 isl_assert(map1
->ctx
,
2900 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2902 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2903 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2904 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2906 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2907 map1
->n
* map2
->n
, flags
);
2910 for (i
= 0; i
< map1
->n
; ++i
)
2911 for (j
= 0; j
< map2
->n
; ++j
) {
2912 struct isl_basic_map
*part
;
2913 part
= isl_basic_map_intersect(
2914 isl_basic_map_copy(map1
->p
[i
]),
2915 isl_basic_map_copy(map2
->p
[j
]));
2916 if (isl_basic_map_is_empty(part
) < 0)
2917 part
= isl_basic_map_free(part
);
2918 result
= isl_map_add_basic_map(result
, part
);
2931 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2932 __isl_take isl_map
*map2
)
2936 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2937 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2938 "spaces don't match", goto error
);
2939 return map_intersect_internal(map1
, map2
);
2946 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2947 __isl_take isl_map
*map2
)
2949 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2952 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2954 return (struct isl_set
*)
2955 isl_map_intersect((struct isl_map
*)set1
,
2956 (struct isl_map
*)set2
);
2959 /* map_intersect_internal accepts intersections
2960 * with parameter domains, so we can just call that function.
2962 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2963 __isl_take isl_set
*params
)
2965 return map_intersect_internal(map
, params
);
2968 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2969 __isl_take isl_map
*map2
)
2971 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2974 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2975 __isl_take isl_set
*params
)
2977 return isl_map_intersect_params(set
, params
);
2980 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2983 struct isl_basic_set
*bset
;
2988 bmap
= isl_basic_map_cow(bmap
);
2991 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2992 in
= isl_basic_map_n_in(bmap
);
2993 bset
= isl_basic_set_from_basic_map(bmap
);
2994 bset
= isl_basic_set_swap_vars(bset
, in
);
2995 return isl_basic_map_from_basic_set(bset
, dim
);
2998 static __isl_give isl_basic_map
*basic_map_space_reset(
2999 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3005 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3008 space
= isl_basic_map_get_space(bmap
);
3009 space
= isl_space_reset(space
, type
);
3010 bmap
= isl_basic_map_reset_space(bmap
, space
);
3014 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3015 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3016 unsigned pos
, unsigned n
)
3019 struct isl_basic_map
*res
;
3020 struct isl_dim_map
*dim_map
;
3021 unsigned total
, off
;
3022 enum isl_dim_type t
;
3025 return basic_map_space_reset(bmap
, type
);
3030 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3032 total
= isl_basic_map_total_dim(bmap
) + n
;
3033 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3035 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3037 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3039 unsigned size
= isl_basic_map_dim(bmap
, t
);
3040 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3042 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3043 pos
, size
- pos
, off
+ pos
+ n
);
3045 off
+= isl_space_dim(res_dim
, t
);
3047 isl_dim_map_div(dim_map
, bmap
, off
);
3049 res
= isl_basic_map_alloc_space(res_dim
,
3050 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3051 if (isl_basic_map_is_rational(bmap
))
3052 res
= isl_basic_map_set_rational(res
);
3053 if (isl_basic_map_plain_is_empty(bmap
)) {
3054 isl_basic_map_free(bmap
);
3056 return isl_basic_map_set_to_empty(res
);
3058 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3059 return isl_basic_map_finalize(res
);
3062 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3063 __isl_take isl_basic_set
*bset
,
3064 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3066 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3069 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3070 enum isl_dim_type type
, unsigned n
)
3074 return isl_basic_map_insert_dims(bmap
, type
,
3075 isl_basic_map_dim(bmap
, type
), n
);
3078 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3079 enum isl_dim_type type
, unsigned n
)
3083 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3084 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3086 isl_basic_set_free(bset
);
3090 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3091 enum isl_dim_type type
)
3095 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3098 space
= isl_map_get_space(map
);
3099 space
= isl_space_reset(space
, type
);
3100 map
= isl_map_reset_space(map
, space
);
3104 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3105 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3110 return map_space_reset(map
, type
);
3112 map
= isl_map_cow(map
);
3116 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3120 for (i
= 0; i
< map
->n
; ++i
) {
3121 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3132 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3133 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3135 return isl_map_insert_dims(set
, type
, pos
, n
);
3138 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3139 enum isl_dim_type type
, unsigned n
)
3143 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3146 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3147 enum isl_dim_type type
, unsigned n
)
3151 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3152 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3158 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3159 __isl_take isl_basic_map
*bmap
,
3160 enum isl_dim_type dst_type
, unsigned dst_pos
,
3161 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3163 struct isl_dim_map
*dim_map
;
3164 struct isl_basic_map
*res
;
3165 enum isl_dim_type t
;
3166 unsigned total
, off
;
3173 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3176 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3179 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3181 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3182 pos(bmap
->dim
, src_type
) + src_pos
+
3183 ((src_type
< dst_type
) ? n
: 0)) {
3184 bmap
= isl_basic_map_cow(bmap
);
3188 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3189 src_type
, src_pos
, n
);
3193 bmap
= isl_basic_map_finalize(bmap
);
3198 total
= isl_basic_map_total_dim(bmap
);
3199 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3202 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3203 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3204 if (t
== dst_type
) {
3205 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3208 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3211 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3212 dst_pos
, size
- dst_pos
, off
);
3213 off
+= size
- dst_pos
;
3214 } else if (t
== src_type
) {
3215 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3218 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3219 src_pos
+ n
, size
- src_pos
- n
, off
);
3220 off
+= size
- src_pos
- n
;
3222 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3226 isl_dim_map_div(dim_map
, bmap
, off
);
3228 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3229 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3230 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3234 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3235 src_type
, src_pos
, n
);
3239 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3240 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3241 bmap
= isl_basic_map_finalize(bmap
);
3245 isl_basic_map_free(bmap
);
3249 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3250 enum isl_dim_type dst_type
, unsigned dst_pos
,
3251 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3253 return (isl_basic_set
*)isl_basic_map_move_dims(
3254 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3257 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3258 enum isl_dim_type dst_type
, unsigned dst_pos
,
3259 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3263 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3264 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3265 src_type
, src_pos
, n
);
3271 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3272 enum isl_dim_type dst_type
, unsigned dst_pos
,
3273 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3282 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3285 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3288 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3290 map
= isl_map_cow(map
);
3294 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3298 for (i
= 0; i
< map
->n
; ++i
) {
3299 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3301 src_type
, src_pos
, n
);
3312 /* Move the specified dimensions to the last columns right before
3313 * the divs. Don't change the dimension specification of bmap.
3314 * That's the responsibility of the caller.
3316 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3317 enum isl_dim_type type
, unsigned first
, unsigned n
)
3319 struct isl_dim_map
*dim_map
;
3320 struct isl_basic_map
*res
;
3321 enum isl_dim_type t
;
3322 unsigned total
, off
;
3326 if (pos(bmap
->dim
, type
) + first
+ n
==
3327 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3330 total
= isl_basic_map_total_dim(bmap
);
3331 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3334 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3335 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3337 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3340 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3341 first
, n
, total
- bmap
->n_div
- n
);
3342 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3343 first
+ n
, size
- (first
+ n
), off
);
3344 off
+= size
- (first
+ n
);
3346 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3350 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3352 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3353 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3354 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3358 /* Turn the n dimensions of type type, starting at first
3359 * into existentially quantified variables.
3361 __isl_give isl_basic_map
*isl_basic_map_project_out(
3362 __isl_take isl_basic_map
*bmap
,
3363 enum isl_dim_type type
, unsigned first
, unsigned n
)
3371 return basic_map_space_reset(bmap
, type
);
3376 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3377 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3379 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3382 bmap
= move_last(bmap
, type
, first
, n
);
3383 bmap
= isl_basic_map_cow(bmap
);
3387 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3388 old
= bmap
->block2
.data
;
3389 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3390 (bmap
->extra
+ n
) * (1 + row_size
));
3391 if (!bmap
->block2
.data
)
3393 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3396 for (i
= 0; i
< n
; ++i
) {
3397 new_div
[i
] = bmap
->block2
.data
+
3398 (bmap
->extra
+ i
) * (1 + row_size
);
3399 isl_seq_clr(new_div
[i
], 1 + row_size
);
3401 for (i
= 0; i
< bmap
->extra
; ++i
)
3402 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3404 bmap
->div
= new_div
;
3408 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3411 bmap
= isl_basic_map_simplify(bmap
);
3412 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3413 return isl_basic_map_finalize(bmap
);
3415 isl_basic_map_free(bmap
);
3419 /* Turn the n dimensions of type type, starting at first
3420 * into existentially quantified variables.
3422 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3423 enum isl_dim_type type
, unsigned first
, unsigned n
)
3425 return (isl_basic_set
*)isl_basic_map_project_out(
3426 (isl_basic_map
*)bset
, type
, first
, n
);
3429 /* Turn the n dimensions of type type, starting at first
3430 * into existentially quantified variables.
3432 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3433 enum isl_dim_type type
, unsigned first
, unsigned n
)
3441 return map_space_reset(map
, type
);
3443 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3445 map
= isl_map_cow(map
);
3449 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3453 for (i
= 0; i
< map
->n
; ++i
) {
3454 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3465 /* Turn the n dimensions of type type, starting at first
3466 * into existentially quantified variables.
3468 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3469 enum isl_dim_type type
, unsigned first
, unsigned n
)
3471 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3474 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3478 for (i
= 0; i
< n
; ++i
) {
3479 j
= isl_basic_map_alloc_div(bmap
);
3482 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3486 isl_basic_map_free(bmap
);
3490 struct isl_basic_map
*isl_basic_map_apply_range(
3491 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3493 isl_space
*dim_result
= NULL
;
3494 struct isl_basic_map
*bmap
;
3495 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3496 struct isl_dim_map
*dim_map1
, *dim_map2
;
3498 if (!bmap1
|| !bmap2
)
3501 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3502 isl_space_copy(bmap2
->dim
));
3504 n_in
= isl_basic_map_n_in(bmap1
);
3505 n_out
= isl_basic_map_n_out(bmap2
);
3506 n
= isl_basic_map_n_out(bmap1
);
3507 nparam
= isl_basic_map_n_param(bmap1
);
3509 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3510 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3511 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3512 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3513 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3514 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3515 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3516 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3517 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3518 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3519 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3521 bmap
= isl_basic_map_alloc_space(dim_result
,
3522 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3523 bmap1
->n_eq
+ bmap2
->n_eq
,
3524 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3525 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3526 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3527 bmap
= add_divs(bmap
, n
);
3528 bmap
= isl_basic_map_simplify(bmap
);
3529 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3530 return isl_basic_map_finalize(bmap
);
3532 isl_basic_map_free(bmap1
);
3533 isl_basic_map_free(bmap2
);
3537 struct isl_basic_set
*isl_basic_set_apply(
3538 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3543 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3546 return (struct isl_basic_set
*)
3547 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3549 isl_basic_set_free(bset
);
3550 isl_basic_map_free(bmap
);
3554 struct isl_basic_map
*isl_basic_map_apply_domain(
3555 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3557 if (!bmap1
|| !bmap2
)
3560 isl_assert(bmap1
->ctx
,
3561 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3562 isl_assert(bmap1
->ctx
,
3563 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3566 bmap1
= isl_basic_map_reverse(bmap1
);
3567 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3568 return isl_basic_map_reverse(bmap1
);
3570 isl_basic_map_free(bmap1
);
3571 isl_basic_map_free(bmap2
);
3575 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3576 * A \cap B -> f(A) + f(B)
3578 struct isl_basic_map
*isl_basic_map_sum(
3579 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3581 unsigned n_in
, n_out
, nparam
, total
, pos
;
3582 struct isl_basic_map
*bmap
= NULL
;
3583 struct isl_dim_map
*dim_map1
, *dim_map2
;
3586 if (!bmap1
|| !bmap2
)
3589 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3592 nparam
= isl_basic_map_n_param(bmap1
);
3593 n_in
= isl_basic_map_n_in(bmap1
);
3594 n_out
= isl_basic_map_n_out(bmap1
);
3596 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3597 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3598 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3599 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3600 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3601 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3602 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3603 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3604 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3605 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3606 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3608 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3609 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3610 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3611 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3612 for (i
= 0; i
< n_out
; ++i
) {
3613 int j
= isl_basic_map_alloc_equality(bmap
);
3616 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3617 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3618 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3619 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3621 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3622 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3623 bmap
= add_divs(bmap
, 2 * n_out
);
3625 bmap
= isl_basic_map_simplify(bmap
);
3626 return isl_basic_map_finalize(bmap
);
3628 isl_basic_map_free(bmap
);
3629 isl_basic_map_free(bmap1
);
3630 isl_basic_map_free(bmap2
);
3634 /* Given two maps A -> f(A) and B -> g(B), construct a map
3635 * A \cap B -> f(A) + f(B)
3637 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3639 struct isl_map
*result
;
3645 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3647 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3648 map1
->n
* map2
->n
, 0);
3651 for (i
= 0; i
< map1
->n
; ++i
)
3652 for (j
= 0; j
< map2
->n
; ++j
) {
3653 struct isl_basic_map
*part
;
3654 part
= isl_basic_map_sum(
3655 isl_basic_map_copy(map1
->p
[i
]),
3656 isl_basic_map_copy(map2
->p
[j
]));
3657 if (isl_basic_map_is_empty(part
))
3658 isl_basic_map_free(part
);
3660 result
= isl_map_add_basic_map(result
, part
);
3673 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3674 __isl_take isl_set
*set2
)
3676 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3679 /* Given a basic map A -> f(A), construct A -> -f(A).
3681 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3686 bmap
= isl_basic_map_cow(bmap
);
3690 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3691 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3692 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3693 for (j
= 0; j
< n
; ++j
)
3694 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3695 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3696 for (j
= 0; j
< n
; ++j
)
3697 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3698 for (i
= 0; i
< bmap
->n_div
; ++i
)
3699 for (j
= 0; j
< n
; ++j
)
3700 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3701 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3702 return isl_basic_map_finalize(bmap
);
3705 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3707 return isl_basic_map_neg(bset
);
3710 /* Given a map A -> f(A), construct A -> -f(A).
3712 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3716 map
= isl_map_cow(map
);
3720 for (i
= 0; i
< map
->n
; ++i
) {
3721 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3732 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3734 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3737 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3738 * A -> floor(f(A)/d).
3740 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3743 unsigned n_in
, n_out
, nparam
, total
, pos
;
3744 struct isl_basic_map
*result
= NULL
;
3745 struct isl_dim_map
*dim_map
;
3751 nparam
= isl_basic_map_n_param(bmap
);
3752 n_in
= isl_basic_map_n_in(bmap
);
3753 n_out
= isl_basic_map_n_out(bmap
);
3755 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3756 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3757 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3758 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3759 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3760 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3762 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3763 bmap
->n_div
+ n_out
,
3764 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3765 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3766 result
= add_divs(result
, n_out
);
3767 for (i
= 0; i
< n_out
; ++i
) {
3769 j
= isl_basic_map_alloc_inequality(result
);
3772 isl_seq_clr(result
->ineq
[j
], 1+total
);
3773 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3774 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3775 j
= isl_basic_map_alloc_inequality(result
);
3778 isl_seq_clr(result
->ineq
[j
], 1+total
);
3779 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3780 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3781 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3784 result
= isl_basic_map_simplify(result
);
3785 return isl_basic_map_finalize(result
);
3787 isl_basic_map_free(result
);
3791 /* Given a map A -> f(A) and an integer d, construct a map
3792 * A -> floor(f(A)/d).
3794 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3798 map
= isl_map_cow(map
);
3802 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3803 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3804 for (i
= 0; i
< map
->n
; ++i
) {
3805 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3816 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3822 i
= isl_basic_map_alloc_equality(bmap
);
3825 nparam
= isl_basic_map_n_param(bmap
);
3826 n_in
= isl_basic_map_n_in(bmap
);
3827 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3828 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3829 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3830 return isl_basic_map_finalize(bmap
);
3832 isl_basic_map_free(bmap
);
3836 /* Add a constraints to "bmap" expressing i_pos < o_pos
3838 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3844 i
= isl_basic_map_alloc_inequality(bmap
);
3847 nparam
= isl_basic_map_n_param(bmap
);
3848 n_in
= isl_basic_map_n_in(bmap
);
3849 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3850 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3851 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3852 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3853 return isl_basic_map_finalize(bmap
);
3855 isl_basic_map_free(bmap
);
3859 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3861 static __isl_give isl_basic_map
*var_less_or_equal(
3862 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3868 i
= isl_basic_map_alloc_inequality(bmap
);
3871 nparam
= isl_basic_map_n_param(bmap
);
3872 n_in
= isl_basic_map_n_in(bmap
);
3873 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3874 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3875 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3876 return isl_basic_map_finalize(bmap
);
3878 isl_basic_map_free(bmap
);
3882 /* Add a constraints to "bmap" expressing i_pos > o_pos
3884 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3890 i
= isl_basic_map_alloc_inequality(bmap
);
3893 nparam
= isl_basic_map_n_param(bmap
);
3894 n_in
= isl_basic_map_n_in(bmap
);
3895 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3896 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3897 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3898 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3899 return isl_basic_map_finalize(bmap
);
3901 isl_basic_map_free(bmap
);
3905 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3907 static __isl_give isl_basic_map
*var_more_or_equal(
3908 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3914 i
= isl_basic_map_alloc_inequality(bmap
);
3917 nparam
= isl_basic_map_n_param(bmap
);
3918 n_in
= isl_basic_map_n_in(bmap
);
3919 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3920 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3921 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3922 return isl_basic_map_finalize(bmap
);
3924 isl_basic_map_free(bmap
);
3928 __isl_give isl_basic_map
*isl_basic_map_equal(
3929 __isl_take isl_space
*dim
, unsigned n_equal
)
3932 struct isl_basic_map
*bmap
;
3933 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3936 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3937 bmap
= var_equal(bmap
, i
);
3938 return isl_basic_map_finalize(bmap
);
3941 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3943 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3947 struct isl_basic_map
*bmap
;
3948 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3951 for (i
= 0; i
< pos
&& bmap
; ++i
)
3952 bmap
= var_equal(bmap
, i
);
3954 bmap
= var_less(bmap
, pos
);
3955 return isl_basic_map_finalize(bmap
);
3958 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3960 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3961 __isl_take isl_space
*dim
, unsigned pos
)
3964 isl_basic_map
*bmap
;
3966 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3967 for (i
= 0; i
< pos
; ++i
)
3968 bmap
= var_equal(bmap
, i
);
3969 bmap
= var_less_or_equal(bmap
, pos
);
3970 return isl_basic_map_finalize(bmap
);
3973 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3975 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3979 struct isl_basic_map
*bmap
;
3980 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3983 for (i
= 0; i
< pos
&& bmap
; ++i
)
3984 bmap
= var_equal(bmap
, i
);
3986 bmap
= var_more(bmap
, pos
);
3987 return isl_basic_map_finalize(bmap
);
3990 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3992 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3993 __isl_take isl_space
*dim
, unsigned pos
)
3996 isl_basic_map
*bmap
;
3998 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3999 for (i
= 0; i
< pos
; ++i
)
4000 bmap
= var_equal(bmap
, i
);
4001 bmap
= var_more_or_equal(bmap
, pos
);
4002 return isl_basic_map_finalize(bmap
);
4005 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4006 unsigned n
, int equal
)
4008 struct isl_map
*map
;
4011 if (n
== 0 && equal
)
4012 return isl_map_universe(dims
);
4014 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4016 for (i
= 0; i
+ 1 < n
; ++i
)
4017 map
= isl_map_add_basic_map(map
,
4018 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4021 map
= isl_map_add_basic_map(map
,
4022 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4024 map
= isl_map_add_basic_map(map
,
4025 isl_basic_map_less_at(dims
, n
- 1));
4027 isl_space_free(dims
);
4032 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4036 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4039 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4041 return map_lex_lte_first(dim
, n
, 0);
4044 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4046 return map_lex_lte_first(dim
, n
, 1);
4049 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4051 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4054 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4056 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4059 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4060 unsigned n
, int equal
)
4062 struct isl_map
*map
;
4065 if (n
== 0 && equal
)
4066 return isl_map_universe(dims
);
4068 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4070 for (i
= 0; i
+ 1 < n
; ++i
)
4071 map
= isl_map_add_basic_map(map
,
4072 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4075 map
= isl_map_add_basic_map(map
,
4076 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4078 map
= isl_map_add_basic_map(map
,
4079 isl_basic_map_more_at(dims
, n
- 1));
4081 isl_space_free(dims
);
4086 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4090 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4093 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4095 return map_lex_gte_first(dim
, n
, 0);
4098 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4100 return map_lex_gte_first(dim
, n
, 1);
4103 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4105 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4108 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4110 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4113 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4114 __isl_take isl_set
*set2
)
4117 map
= isl_map_lex_le(isl_set_get_space(set1
));
4118 map
= isl_map_intersect_domain(map
, set1
);
4119 map
= isl_map_intersect_range(map
, set2
);
4123 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4124 __isl_take isl_set
*set2
)
4127 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4128 map
= isl_map_intersect_domain(map
, set1
);
4129 map
= isl_map_intersect_range(map
, set2
);
4133 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4134 __isl_take isl_set
*set2
)
4137 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4138 map
= isl_map_intersect_domain(map
, set1
);
4139 map
= isl_map_intersect_range(map
, set2
);
4143 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4144 __isl_take isl_set
*set2
)
4147 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4148 map
= isl_map_intersect_domain(map
, set1
);
4149 map
= isl_map_intersect_range(map
, set2
);
4153 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4154 __isl_take isl_map
*map2
)
4157 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4158 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4159 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4163 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4164 __isl_take isl_map
*map2
)
4167 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4168 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4169 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4173 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4174 __isl_take isl_map
*map2
)
4177 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4178 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4179 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4183 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4184 __isl_take isl_map
*map2
)
4187 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4188 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4189 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4193 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4194 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4196 struct isl_basic_map
*bmap
;
4198 bset
= isl_basic_set_cow(bset
);
4202 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4203 isl_space_free(bset
->dim
);
4204 bmap
= (struct isl_basic_map
*) bset
;
4206 return isl_basic_map_finalize(bmap
);
4208 isl_basic_set_free(bset
);
4209 isl_space_free(dim
);
4213 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4217 if (bmap
->dim
->n_in
== 0)
4218 return (struct isl_basic_set
*)bmap
;
4219 bmap
= isl_basic_map_cow(bmap
);
4222 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4225 bmap
= isl_basic_map_finalize(bmap
);
4226 return (struct isl_basic_set
*)bmap
;
4228 isl_basic_map_free(bmap
);
4232 /* For a div d = floor(f/m), add the constraints
4235 * -(f-(n-1)) + m d >= 0
4237 * Note that the second constraint is the negation of
4241 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4242 unsigned pos
, isl_int
*div
)
4245 unsigned total
= isl_basic_map_total_dim(bmap
);
4247 i
= isl_basic_map_alloc_inequality(bmap
);
4250 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4251 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4253 j
= isl_basic_map_alloc_inequality(bmap
);
4256 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4257 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4258 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4262 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4263 unsigned pos
, isl_int
*div
)
4265 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4269 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4271 unsigned total
= isl_basic_map_total_dim(bmap
);
4272 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4274 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4278 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4280 return isl_basic_map_add_div_constraints(bset
, div
);
4283 struct isl_basic_set
*isl_basic_map_underlying_set(
4284 struct isl_basic_map
*bmap
)
4288 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4290 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4291 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4292 return (struct isl_basic_set
*)bmap
;
4293 bmap
= isl_basic_map_cow(bmap
);
4296 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4299 bmap
->extra
-= bmap
->n_div
;
4301 bmap
= isl_basic_map_finalize(bmap
);
4302 return (struct isl_basic_set
*)bmap
;
4304 isl_basic_map_free(bmap
);
4308 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4309 __isl_take isl_basic_set
*bset
)
4311 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4314 struct isl_basic_map
*isl_basic_map_overlying_set(
4315 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4317 struct isl_basic_map
*bmap
;
4318 struct isl_ctx
*ctx
;
4325 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4326 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4327 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4329 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4330 isl_basic_map_free(like
);
4331 return (struct isl_basic_map
*)bset
;
4333 bset
= isl_basic_set_cow(bset
);
4336 total
= bset
->dim
->n_out
+ bset
->extra
;
4337 bmap
= (struct isl_basic_map
*)bset
;
4338 isl_space_free(bmap
->dim
);
4339 bmap
->dim
= isl_space_copy(like
->dim
);
4342 bmap
->n_div
= like
->n_div
;
4343 bmap
->extra
+= like
->n_div
;
4347 ltotal
= total
- bmap
->extra
+ like
->extra
;
4350 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4351 bmap
->extra
* (1 + 1 + total
));
4352 if (isl_blk_is_error(bmap
->block2
))
4354 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4358 for (i
= 0; i
< bmap
->extra
; ++i
)
4359 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4360 for (i
= 0; i
< like
->n_div
; ++i
) {
4361 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4362 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4364 bmap
= isl_basic_map_extend_constraints(bmap
,
4365 0, 2 * like
->n_div
);
4366 for (i
= 0; i
< like
->n_div
; ++i
) {
4369 if (isl_int_is_zero(bmap
->div
[i
][0]))
4371 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4372 bmap
= isl_basic_map_free(bmap
);
4375 isl_basic_map_free(like
);
4376 bmap
= isl_basic_map_simplify(bmap
);
4377 bmap
= isl_basic_map_finalize(bmap
);
4380 isl_basic_map_free(like
);
4381 isl_basic_set_free(bset
);
4385 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4386 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4388 return (struct isl_basic_set
*)
4389 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4392 struct isl_set
*isl_set_from_underlying_set(
4393 struct isl_set
*set
, struct isl_basic_set
*like
)
4399 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4401 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4402 isl_basic_set_free(like
);
4405 set
= isl_set_cow(set
);
4408 for (i
= 0; i
< set
->n
; ++i
) {
4409 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4410 isl_basic_set_copy(like
));
4414 isl_space_free(set
->dim
);
4415 set
->dim
= isl_space_copy(like
->dim
);
4418 isl_basic_set_free(like
);
4421 isl_basic_set_free(like
);
4426 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4430 map
= isl_map_cow(map
);
4433 map
->dim
= isl_space_cow(map
->dim
);
4437 for (i
= 1; i
< map
->n
; ++i
)
4438 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4440 for (i
= 0; i
< map
->n
; ++i
) {
4441 map
->p
[i
] = (struct isl_basic_map
*)
4442 isl_basic_map_underlying_set(map
->p
[i
]);
4447 map
->dim
= isl_space_underlying(map
->dim
, 0);
4449 isl_space_free(map
->dim
);
4450 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4454 return (struct isl_set
*)map
;
4460 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4462 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4465 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4466 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4468 bmap
= isl_basic_map_cow(bmap
);
4472 isl_space_free(bmap
->dim
);
4475 bmap
= isl_basic_map_finalize(bmap
);
4479 isl_basic_map_free(bmap
);
4480 isl_space_free(dim
);
4484 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4485 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4487 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4491 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4492 __isl_take isl_space
*dim
)
4496 map
= isl_map_cow(map
);
4500 for (i
= 0; i
< map
->n
; ++i
) {
4501 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4502 isl_space_copy(dim
));
4506 isl_space_free(map
->dim
);
4512 isl_space_free(dim
);
4516 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4517 __isl_take isl_space
*dim
)
4519 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4522 /* Compute the parameter domain of the given basic set.
4524 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4529 if (isl_basic_set_is_params(bset
))
4532 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4533 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4534 space
= isl_basic_set_get_space(bset
);
4535 space
= isl_space_params(space
);
4536 bset
= isl_basic_set_reset_space(bset
, space
);
4540 /* Construct a zero-dimensional basic set with the given parameter domain.
4542 __isl_give isl_basic_set
*isl_basic_set_from_params(
4543 __isl_take isl_basic_set
*bset
)
4546 space
= isl_basic_set_get_space(bset
);
4547 space
= isl_space_set_from_params(space
);
4548 bset
= isl_basic_set_reset_space(bset
, space
);
4552 /* Compute the parameter domain of the given set.
4554 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4559 if (isl_set_is_params(set
))
4562 n
= isl_set_dim(set
, isl_dim_set
);
4563 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4564 space
= isl_set_get_space(set
);
4565 space
= isl_space_params(space
);
4566 set
= isl_set_reset_space(set
, space
);
4570 /* Construct a zero-dimensional set with the given parameter domain.
4572 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4575 space
= isl_set_get_space(set
);
4576 space
= isl_space_set_from_params(space
);
4577 set
= isl_set_reset_space(set
, space
);
4581 /* Compute the parameter domain of the given map.
4583 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4588 n
= isl_map_dim(map
, isl_dim_in
);
4589 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4590 n
= isl_map_dim(map
, isl_dim_out
);
4591 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4592 space
= isl_map_get_space(map
);
4593 space
= isl_space_params(space
);
4594 map
= isl_map_reset_space(map
, space
);
4598 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4601 struct isl_basic_set
*domain
;
4607 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4609 n_in
= isl_basic_map_n_in(bmap
);
4610 n_out
= isl_basic_map_n_out(bmap
);
4611 domain
= isl_basic_set_from_basic_map(bmap
);
4612 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4614 domain
= isl_basic_set_reset_space(domain
, dim
);
4619 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4623 return isl_space_may_be_set(bmap
->dim
);
4626 /* Is this basic map actually a set?
4627 * Users should never call this function. Outside of isl,
4628 * the type should indicate whether something is a set or a map.
4630 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4634 return isl_space_is_set(bmap
->dim
);
4637 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4641 if (isl_basic_map_is_set(bmap
))
4643 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4646 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4647 __isl_take isl_basic_map
*bmap
)
4651 isl_basic_map
*domain
;
4652 int nparam
, n_in
, n_out
;
4655 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4656 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4657 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4659 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4660 domain
= isl_basic_map_universe(dim
);
4662 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4663 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4664 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4666 total
= isl_basic_map_total_dim(bmap
);
4668 for (i
= 0; i
< n_in
; ++i
) {
4669 k
= isl_basic_map_alloc_equality(bmap
);
4672 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4673 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4674 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4677 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4678 return isl_basic_map_finalize(bmap
);
4680 isl_basic_map_free(bmap
);
4684 __isl_give isl_basic_map
*isl_basic_map_range_map(
4685 __isl_take isl_basic_map
*bmap
)
4689 isl_basic_map
*range
;
4690 int nparam
, n_in
, n_out
;
4693 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4694 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4695 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4697 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4698 range
= isl_basic_map_universe(dim
);
4700 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4701 bmap
= isl_basic_map_apply_range(bmap
, range
);
4702 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4704 total
= isl_basic_map_total_dim(bmap
);
4706 for (i
= 0; i
< n_out
; ++i
) {
4707 k
= isl_basic_map_alloc_equality(bmap
);
4710 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4711 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4712 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4715 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4716 return isl_basic_map_finalize(bmap
);
4718 isl_basic_map_free(bmap
);
4722 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4726 return isl_space_may_be_set(map
->dim
);
4729 /* Is this map actually a set?
4730 * Users should never call this function. Outside of isl,
4731 * the type should indicate whether something is a set or a map.
4733 int isl_map_is_set(__isl_keep isl_map
*map
)
4737 return isl_space_is_set(map
->dim
);
4740 struct isl_set
*isl_map_range(struct isl_map
*map
)
4743 struct isl_set
*set
;
4747 if (isl_map_is_set(map
))
4748 return (isl_set
*)map
;
4750 map
= isl_map_cow(map
);
4754 set
= (struct isl_set
*) map
;
4755 set
->dim
= isl_space_range(set
->dim
);
4758 for (i
= 0; i
< map
->n
; ++i
) {
4759 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4763 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4764 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4771 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4774 isl_space
*domain_dim
;
4776 map
= isl_map_cow(map
);
4780 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4781 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4782 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4785 for (i
= 0; i
< map
->n
; ++i
) {
4786 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4790 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4791 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4798 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4801 isl_space
*range_dim
;
4803 map
= isl_map_cow(map
);
4807 range_dim
= isl_space_range(isl_map_get_space(map
));
4808 range_dim
= isl_space_from_range(range_dim
);
4809 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4810 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4813 for (i
= 0; i
< map
->n
; ++i
) {
4814 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4818 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4819 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4826 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4827 __isl_take isl_space
*dim
)
4830 struct isl_map
*map
= NULL
;
4832 set
= isl_set_cow(set
);
4835 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4836 map
= (struct isl_map
*)set
;
4837 for (i
= 0; i
< set
->n
; ++i
) {
4838 map
->p
[i
] = isl_basic_map_from_basic_set(
4839 set
->p
[i
], isl_space_copy(dim
));
4843 isl_space_free(map
->dim
);
4847 isl_space_free(dim
);
4852 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4853 __isl_take isl_basic_set
*bset
)
4855 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4858 __isl_give isl_basic_map
*isl_basic_map_from_range(
4859 __isl_take isl_basic_set
*bset
)
4862 space
= isl_basic_set_get_space(bset
);
4863 space
= isl_space_from_range(space
);
4864 bset
= isl_basic_set_reset_space(bset
, space
);
4865 return (isl_basic_map
*)bset
;
4868 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4871 space
= isl_set_get_space(set
);
4872 space
= isl_space_from_range(space
);
4873 set
= isl_set_reset_space(set
, space
);
4874 return (struct isl_map
*)set
;
4877 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4879 return isl_map_reverse(isl_map_from_range(set
));
4882 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4883 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4885 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4888 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4889 __isl_take isl_set
*range
)
4891 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4894 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4897 struct isl_set
*set
= NULL
;
4901 map
= isl_map_cow(map
);
4904 map
->dim
= isl_space_as_set_space(map
->dim
);
4907 set
= (struct isl_set
*)map
;
4908 for (i
= 0; i
< map
->n
; ++i
) {
4909 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4919 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4922 struct isl_map
*map
;
4927 isl_die(dim
->ctx
, isl_error_internal
,
4928 "negative number of basic maps", goto error
);
4929 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4930 sizeof(struct isl_map
) +
4931 (n
- 1) * sizeof(struct isl_basic_map
*));
4935 map
->ctx
= dim
->ctx
;
4936 isl_ctx_ref(map
->ctx
);
4944 isl_space_free(dim
);
4948 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4949 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4952 struct isl_map
*map
;
4955 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4959 map
= isl_map_alloc_space(dims
, n
, flags
);
4963 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4965 struct isl_basic_map
*bmap
;
4966 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4967 bmap
= isl_basic_map_set_to_empty(bmap
);
4971 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4973 struct isl_basic_set
*bset
;
4974 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4975 bset
= isl_basic_set_set_to_empty(bset
);
4979 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4981 struct isl_basic_map
*bmap
;
4984 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4985 bmap
= isl_basic_map_set_to_empty(bmap
);
4989 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4991 struct isl_basic_map
*bmap
;
4994 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4995 bmap
= isl_basic_map_set_to_empty(bmap
);
4999 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5001 struct isl_basic_set
*bset
;
5004 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5005 bset
= isl_basic_set_set_to_empty(bset
);
5009 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5011 struct isl_basic_map
*bmap
;
5012 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5013 bmap
= isl_basic_map_finalize(bmap
);
5017 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5019 struct isl_basic_set
*bset
;
5020 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5021 bset
= isl_basic_set_finalize(bset
);
5025 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5028 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5029 isl_basic_map
*bmap
;
5031 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5032 for (i
= 0; i
< total
; ++i
) {
5033 int k
= isl_basic_map_alloc_inequality(bmap
);
5036 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5037 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5041 isl_basic_map_free(bmap
);
5045 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5047 return isl_basic_map_nat_universe(dim
);
5050 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5052 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5055 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5057 return isl_map_nat_universe(dim
);
5060 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5061 __isl_keep isl_basic_map
*model
)
5065 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5068 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5072 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5075 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5076 __isl_keep isl_set
*model
)
5080 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5083 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5085 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5088 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5092 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5095 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5099 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5102 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5104 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5107 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5111 return isl_set_empty(isl_space_copy(model
->dim
));
5114 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5116 struct isl_map
*map
;
5119 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5120 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5124 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5126 struct isl_set
*set
;
5129 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5130 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5134 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5138 return isl_set_universe(isl_space_copy(model
->dim
));
5141 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5144 struct isl_map
*dup
;
5148 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5149 for (i
= 0; i
< map
->n
; ++i
)
5150 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5154 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5155 __isl_take isl_basic_map
*bmap
)
5159 if (isl_basic_map_plain_is_empty(bmap
)) {
5160 isl_basic_map_free(bmap
);
5163 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5164 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5165 map
->p
[map
->n
] = bmap
;
5167 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5173 isl_basic_map_free(bmap
);
5177 void *isl_map_free(struct isl_map
*map
)
5187 isl_ctx_deref(map
->ctx
);
5188 for (i
= 0; i
< map
->n
; ++i
)
5189 isl_basic_map_free(map
->p
[i
]);
5190 isl_space_free(map
->dim
);
5196 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5197 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5201 base
= isl_map_cow(base
);
5205 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5208 for (i
= 0; i
< base
->n
; ++i
) {
5209 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5210 isl_space_copy(base
->dim
), 0, 0, 0);
5220 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5221 unsigned nparam
, unsigned dim
)
5223 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5227 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5228 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5232 bmap
= isl_basic_map_cow(bmap
);
5233 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5234 j
= isl_basic_map_alloc_equality(bmap
);
5237 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5238 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5239 isl_int_set_si(bmap
->eq
[j
][0], value
);
5240 bmap
= isl_basic_map_simplify(bmap
);
5241 return isl_basic_map_finalize(bmap
);
5243 isl_basic_map_free(bmap
);
5247 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5248 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5252 bmap
= isl_basic_map_cow(bmap
);
5253 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5254 j
= isl_basic_map_alloc_equality(bmap
);
5257 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5258 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5259 isl_int_set(bmap
->eq
[j
][0], value
);
5260 bmap
= isl_basic_map_simplify(bmap
);
5261 return isl_basic_map_finalize(bmap
);
5263 isl_basic_map_free(bmap
);
5267 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5268 enum isl_dim_type type
, unsigned pos
, int value
)
5272 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5273 return isl_basic_map_fix_pos_si(bmap
,
5274 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5276 isl_basic_map_free(bmap
);
5280 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5281 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5285 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5286 return isl_basic_map_fix_pos(bmap
,
5287 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5289 isl_basic_map_free(bmap
);
5293 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5294 enum isl_dim_type type
, unsigned pos
, int value
)
5296 return (struct isl_basic_set
*)
5297 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5301 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5302 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5304 return (struct isl_basic_set
*)
5305 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5309 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5310 unsigned input
, int value
)
5312 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5315 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5316 unsigned dim
, int value
)
5318 return (struct isl_basic_set
*)
5319 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5320 isl_dim_set
, dim
, value
);
5323 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5325 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5332 isl_basic_map_free(map
->p
[i
]);
5333 if (i
!= map
->n
- 1) {
5334 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5335 map
->p
[i
] = map
->p
[map
->n
- 1];
5342 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5343 enum isl_dim_type type
, unsigned pos
, int value
)
5347 map
= isl_map_cow(map
);
5351 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5352 for (i
= map
->n
- 1; i
>= 0; --i
) {
5353 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5354 if (remove_if_empty(map
, i
) < 0)
5357 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5364 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5365 enum isl_dim_type type
, unsigned pos
, int value
)
5367 return (struct isl_set
*)
5368 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5371 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5372 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5376 map
= isl_map_cow(map
);
5380 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5381 for (i
= 0; i
< map
->n
; ++i
) {
5382 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5386 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5393 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5394 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5396 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5399 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5400 unsigned input
, int value
)
5402 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5405 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5407 return (struct isl_set
*)
5408 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5411 static __isl_give isl_basic_map
*basic_map_bound_si(
5412 __isl_take isl_basic_map
*bmap
,
5413 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5419 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5420 pos
+= isl_basic_map_offset(bmap
, type
);
5421 bmap
= isl_basic_map_cow(bmap
);
5422 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5423 j
= isl_basic_map_alloc_inequality(bmap
);
5426 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5428 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5429 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5431 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5432 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5434 bmap
= isl_basic_map_simplify(bmap
);
5435 return isl_basic_map_finalize(bmap
);
5437 isl_basic_map_free(bmap
);
5441 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5442 __isl_take isl_basic_map
*bmap
,
5443 enum isl_dim_type type
, unsigned pos
, int value
)
5445 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5448 /* Constrain the values of the given dimension to be no greater than "value".
5450 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5451 __isl_take isl_basic_map
*bmap
,
5452 enum isl_dim_type type
, unsigned pos
, int value
)
5454 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5457 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5458 unsigned dim
, isl_int value
)
5462 bset
= isl_basic_set_cow(bset
);
5463 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5464 j
= isl_basic_set_alloc_inequality(bset
);
5467 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5468 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5469 isl_int_neg(bset
->ineq
[j
][0], value
);
5470 bset
= isl_basic_set_simplify(bset
);
5471 return isl_basic_set_finalize(bset
);
5473 isl_basic_set_free(bset
);
5477 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5478 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5482 map
= isl_map_cow(map
);
5486 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5487 for (i
= 0; i
< map
->n
; ++i
) {
5488 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5489 type
, pos
, value
, upper
);
5493 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5500 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5501 enum isl_dim_type type
, unsigned pos
, int value
)
5503 return map_bound_si(map
, type
, pos
, value
, 0);
5506 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5507 enum isl_dim_type type
, unsigned pos
, int value
)
5509 return map_bound_si(map
, type
, pos
, value
, 1);
5512 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5513 enum isl_dim_type type
, unsigned pos
, int value
)
5515 return (struct isl_set
*)
5516 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5519 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5520 enum isl_dim_type type
, unsigned pos
, int value
)
5522 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5525 /* Bound the given variable of "bmap" from below (or above is "upper"
5526 * is set) to "value".
5528 static __isl_give isl_basic_map
*basic_map_bound(
5529 __isl_take isl_basic_map
*bmap
,
5530 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5536 if (pos
>= isl_basic_map_dim(bmap
, type
))
5537 isl_die(bmap
->ctx
, isl_error_invalid
,
5538 "index out of bounds", goto error
);
5539 pos
+= isl_basic_map_offset(bmap
, type
);
5540 bmap
= isl_basic_map_cow(bmap
);
5541 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5542 j
= isl_basic_map_alloc_inequality(bmap
);
5545 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5547 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5548 isl_int_set(bmap
->ineq
[j
][0], value
);
5550 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5551 isl_int_neg(bmap
->ineq
[j
][0], value
);
5553 bmap
= isl_basic_map_simplify(bmap
);
5554 return isl_basic_map_finalize(bmap
);
5556 isl_basic_map_free(bmap
);
5560 /* Bound the given variable of "map" from below (or above is "upper"
5561 * is set) to "value".
5563 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5564 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5568 map
= isl_map_cow(map
);
5572 if (pos
>= isl_map_dim(map
, type
))
5573 isl_die(map
->ctx
, isl_error_invalid
,
5574 "index out of bounds", goto error
);
5575 for (i
= map
->n
- 1; i
>= 0; --i
) {
5576 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5577 if (remove_if_empty(map
, i
) < 0)
5580 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5587 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5588 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5590 return map_bound(map
, type
, pos
, value
, 0);
5593 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5594 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5596 return map_bound(map
, type
, pos
, value
, 1);
5599 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5600 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5602 return isl_map_lower_bound(set
, type
, pos
, value
);
5605 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5606 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5608 return isl_map_upper_bound(set
, type
, pos
, value
);
5611 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5616 set
= isl_set_cow(set
);
5620 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5621 for (i
= 0; i
< set
->n
; ++i
) {
5622 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5632 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5636 map
= isl_map_cow(map
);
5640 map
->dim
= isl_space_reverse(map
->dim
);
5643 for (i
= 0; i
< map
->n
; ++i
) {
5644 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5648 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5655 static struct isl_map
*isl_basic_map_partial_lexopt(
5656 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5657 struct isl_set
**empty
, int max
)
5661 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5662 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5664 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5666 isl_basic_map_free(bmap
);
5667 isl_basic_set_free(dom
);
5673 struct isl_map
*isl_basic_map_partial_lexmax(
5674 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5675 struct isl_set
**empty
)
5677 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5680 struct isl_map
*isl_basic_map_partial_lexmin(
5681 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5682 struct isl_set
**empty
)
5684 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5687 struct isl_set
*isl_basic_set_partial_lexmin(
5688 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5689 struct isl_set
**empty
)
5691 return (struct isl_set
*)
5692 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5696 struct isl_set
*isl_basic_set_partial_lexmax(
5697 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5698 struct isl_set
**empty
)
5700 return (struct isl_set
*)
5701 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5705 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5706 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5707 __isl_give isl_set
**empty
)
5709 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5712 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5713 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5714 __isl_give isl_set
**empty
)
5716 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5719 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5720 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5721 __isl_give isl_set
**empty
)
5723 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5726 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5727 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5728 __isl_give isl_set
**empty
)
5730 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5733 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5734 __isl_take isl_basic_map
*bmap
, int max
)
5736 isl_basic_set
*dom
= NULL
;
5737 isl_space
*dom_space
;
5741 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5742 dom
= isl_basic_set_universe(dom_space
);
5743 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5745 isl_basic_map_free(bmap
);
5749 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5750 __isl_take isl_basic_map
*bmap
)
5752 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5756 #define TYPE isl_pw_multi_aff
5758 #define SUFFIX _pw_multi_aff
5760 #define EMPTY isl_pw_multi_aff_empty
5762 #define ADD isl_pw_multi_aff_union_add
5763 #include "isl_map_lexopt_templ.c"
5765 /* Given a map "map", compute the lexicographically minimal
5766 * (or maximal) image element for each domain element in dom,
5767 * in the form of an isl_pw_multi_aff.
5768 * Set *empty to those elements in dom that do not have an image element.
5770 * We first compute the lexicographically minimal or maximal element
5771 * in the first basic map. This results in a partial solution "res"
5772 * and a subset "todo" of dom that still need to be handled.
5773 * We then consider each of the remaining maps in "map" and successively
5774 * update both "res" and "todo".
5776 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5777 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5778 __isl_give isl_set
**empty
, int max
)
5781 isl_pw_multi_aff
*res
;
5787 if (isl_map_plain_is_empty(map
)) {
5792 return isl_pw_multi_aff_from_map(map
);
5795 res
= basic_map_partial_lexopt_pw_multi_aff(
5796 isl_basic_map_copy(map
->p
[0]),
5797 isl_set_copy(dom
), &todo
, max
);
5799 for (i
= 1; i
< map
->n
; ++i
) {
5800 isl_pw_multi_aff
*res_i
;
5803 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5804 isl_basic_map_copy(map
->p
[i
]),
5805 isl_set_copy(dom
), &todo_i
, max
);
5808 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5810 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5812 todo
= isl_set_intersect(todo
, todo_i
);
5833 #define TYPE isl_map
5837 #define EMPTY isl_map_empty
5839 #define ADD isl_map_union_disjoint
5840 #include "isl_map_lexopt_templ.c"
5842 /* Given a map "map", compute the lexicographically minimal
5843 * (or maximal) image element for each domain element in dom.
5844 * Set *empty to those elements in dom that do not have an image element.
5846 * We first compute the lexicographically minimal or maximal element
5847 * in the first basic map. This results in a partial solution "res"
5848 * and a subset "todo" of dom that still need to be handled.
5849 * We then consider each of the remaining maps in "map" and successively
5850 * update both "res" and "todo".
5852 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5853 * Assume we are computing the lexicographical maximum.
5854 * We first compute the lexicographically maximal element in basic map i.
5855 * This results in a partial solution res_i and a subset todo_i.
5856 * Then we combine these results with those obtain for the first k basic maps
5857 * to obtain a result that is valid for the first k+1 basic maps.
5858 * In particular, the set where there is no solution is the set where
5859 * there is no solution for the first k basic maps and also no solution
5860 * for the ith basic map, i.e.,
5862 * todo^i = todo^k * todo_i
5864 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5865 * solutions, arbitrarily breaking ties in favor of res^k.
5866 * That is, when res^k(a) >= res_i(a), we pick res^k and
5867 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5868 * the lexicographic order.)
5869 * In practice, we compute
5871 * res^k * (res_i . "<=")
5875 * res_i * (res^k . "<")
5877 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5878 * where only one of res^k and res_i provides a solution and we simply pick
5885 * Note that we only compute these intersections when dom(res^k) intersects
5886 * dom(res_i). Otherwise, the only effect of these intersections is to
5887 * potentially break up res^k and res_i into smaller pieces.
5888 * We want to avoid such splintering as much as possible.
5889 * In fact, an earlier implementation of this function would look for
5890 * better results in the domain of res^k and for extra results in todo^k,
5891 * but this would always result in a splintering according to todo^k,
5892 * even when the domain of basic map i is disjoint from the domains of
5893 * the previous basic maps.
5895 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5896 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5897 __isl_give isl_set
**empty
, int max
)
5900 struct isl_map
*res
;
5901 struct isl_set
*todo
;
5906 if (isl_map_plain_is_empty(map
)) {
5914 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5915 isl_set_copy(dom
), &todo
, max
);
5917 for (i
= 1; i
< map
->n
; ++i
) {
5921 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5923 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5924 isl_set_copy(dom
), &todo_i
, max
);
5927 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5928 le
= isl_map_lex_le(dim
);
5930 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5931 le
= isl_map_lex_ge(dim
);
5933 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5934 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5935 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5936 le
= isl_map_intersect(le
, isl_map_copy(res
));
5938 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5939 res
= isl_map_intersect_domain(res
,
5940 isl_set_copy(todo_i
));
5941 res_i
= isl_map_intersect_domain(res_i
,
5942 isl_set_copy(todo
));
5945 res
= isl_map_union_disjoint(res
, res_i
);
5946 res
= isl_map_union_disjoint(res
, lt
);
5947 res
= isl_map_union_disjoint(res
, le
);
5949 todo
= isl_set_intersect(todo
, todo_i
);
5969 __isl_give isl_map
*isl_map_partial_lexmax(
5970 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5971 __isl_give isl_set
**empty
)
5973 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5976 __isl_give isl_map
*isl_map_partial_lexmin(
5977 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5978 __isl_give isl_set
**empty
)
5980 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5983 __isl_give isl_set
*isl_set_partial_lexmin(
5984 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5985 __isl_give isl_set
**empty
)
5987 return (struct isl_set
*)
5988 isl_map_partial_lexmin((struct isl_map
*)set
,
5992 __isl_give isl_set
*isl_set_partial_lexmax(
5993 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5994 __isl_give isl_set
**empty
)
5996 return (struct isl_set
*)
5997 isl_map_partial_lexmax((struct isl_map
*)set
,
6001 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6003 struct isl_basic_set
*dom
= NULL
;
6008 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
6009 dom
= isl_basic_set_universe(dom_dim
);
6010 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6012 isl_basic_map_free(bmap
);
6016 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6018 return isl_basic_map_lexopt(bmap
, 0);
6021 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6023 return isl_basic_map_lexopt(bmap
, 1);
6026 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6028 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6031 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6033 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6036 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
6038 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
6041 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
6043 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
6046 /* Extract the first and only affine expression from list
6047 * and then add it to *pwaff with the given dom.
6048 * This domain is known to be disjoint from other domains
6049 * because of the way isl_basic_map_foreach_lexmax works.
6051 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6052 __isl_take isl_aff_list
*list
, void *user
)
6054 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6056 isl_pw_aff
**pwaff
= user
;
6057 isl_pw_aff
*pwaff_i
;
6061 if (isl_aff_list_n_aff(list
) != 1)
6062 isl_die(ctx
, isl_error_internal
,
6063 "expecting single element list", goto error
);
6065 aff
= isl_aff_list_get_aff(list
, 0);
6066 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6068 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6070 isl_aff_list_free(list
);
6074 isl_basic_set_free(dom
);
6075 isl_aff_list_free(list
);
6079 /* Given a basic map with one output dimension, compute the minimum or
6080 * maximum of that dimension as an isl_pw_aff.
6082 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6083 * call update_dim_opt on each leaf of the result.
6085 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6088 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6092 dim
= isl_space_from_domain(isl_space_domain(dim
));
6093 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6094 pwaff
= isl_pw_aff_empty(dim
);
6096 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6098 return isl_pw_aff_free(pwaff
);
6103 /* Compute the minimum or maximum of the given output dimension
6104 * as a function of the parameters and the input dimensions,
6105 * but independently of the other output dimensions.
6107 * We first project out the other output dimension and then compute
6108 * the "lexicographic" maximum in each basic map, combining the results
6109 * using isl_pw_aff_union_max.
6111 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6118 n_out
= isl_map_dim(map
, isl_dim_out
);
6119 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6120 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6125 isl_space
*dim
= isl_map_get_space(map
);
6126 dim
= isl_space_domain(isl_space_from_range(dim
));
6128 return isl_pw_aff_empty(dim
);
6131 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6132 for (i
= 1; i
< map
->n
; ++i
) {
6133 isl_pw_aff
*pwaff_i
;
6135 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6136 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6144 /* Compute the maximum of the given output dimension as a function of the
6145 * parameters and input dimensions, but independently of
6146 * the other output dimensions.
6148 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6150 return map_dim_opt(map
, pos
, 1);
6153 /* Compute the minimum or maximum of the given set dimension
6154 * as a function of the parameters,
6155 * but independently of the other set dimensions.
6157 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6160 return map_dim_opt(set
, pos
, max
);
6163 /* Compute the maximum of the given set dimension as a function of the
6164 * parameters, but independently of the other set dimensions.
6166 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6168 return set_dim_opt(set
, pos
, 1);
6171 /* Compute the minimum of the given set dimension as a function of the
6172 * parameters, but independently of the other set dimensions.
6174 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6176 return set_dim_opt(set
, pos
, 0);
6179 /* Apply a preimage specified by "mat" on the parameters of "bset".
6180 * bset is assumed to have only parameters and divs.
6182 static struct isl_basic_set
*basic_set_parameter_preimage(
6183 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6190 bset
->dim
= isl_space_cow(bset
->dim
);
6194 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6196 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6198 bset
->dim
->nparam
= 0;
6199 bset
->dim
->n_out
= nparam
;
6200 bset
= isl_basic_set_preimage(bset
, mat
);
6202 bset
->dim
->nparam
= bset
->dim
->n_out
;
6203 bset
->dim
->n_out
= 0;
6208 isl_basic_set_free(bset
);
6212 /* Apply a preimage specified by "mat" on the parameters of "set".
6213 * set is assumed to have only parameters and divs.
6215 static struct isl_set
*set_parameter_preimage(
6216 struct isl_set
*set
, struct isl_mat
*mat
)
6218 isl_space
*dim
= NULL
;
6224 dim
= isl_space_copy(set
->dim
);
6225 dim
= isl_space_cow(dim
);
6229 nparam
= isl_set_dim(set
, isl_dim_param
);
6231 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6234 dim
->n_out
= nparam
;
6235 isl_set_reset_space(set
, dim
);
6236 set
= isl_set_preimage(set
, mat
);
6239 dim
= isl_space_copy(set
->dim
);
6240 dim
= isl_space_cow(dim
);
6243 dim
->nparam
= dim
->n_out
;
6245 isl_set_reset_space(set
, dim
);
6248 isl_space_free(dim
);
6255 /* Intersect the basic set "bset" with the affine space specified by the
6256 * equalities in "eq".
6258 static struct isl_basic_set
*basic_set_append_equalities(
6259 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6267 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6272 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6273 for (i
= 0; i
< eq
->n_row
; ++i
) {
6274 k
= isl_basic_set_alloc_equality(bset
);
6277 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6278 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6282 bset
= isl_basic_set_gauss(bset
, NULL
);
6283 bset
= isl_basic_set_finalize(bset
);
6288 isl_basic_set_free(bset
);
6292 /* Intersect the set "set" with the affine space specified by the
6293 * equalities in "eq".
6295 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6303 for (i
= 0; i
< set
->n
; ++i
) {
6304 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6317 /* Project the given basic set onto its parameter domain, possibly introducing
6318 * new, explicit, existential variables in the constraints.
6319 * The input has parameters and (possibly implicit) existential variables.
6320 * The output has the same parameters, but only
6321 * explicit existentially quantified variables.
6323 * The actual projection is performed by pip, but pip doesn't seem
6324 * to like equalities very much, so we first remove the equalities
6325 * among the parameters by performing a variable compression on
6326 * the parameters. Afterward, an inverse transformation is performed
6327 * and the equalities among the parameters are inserted back in.
6329 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6333 struct isl_mat
*T
, *T2
;
6334 struct isl_set
*set
;
6335 unsigned nparam
, n_div
;
6337 bset
= isl_basic_set_cow(bset
);
6341 if (bset
->n_eq
== 0)
6342 return isl_basic_set_lexmin(bset
);
6344 bset
= isl_basic_set_gauss(bset
, NULL
);
6347 if (isl_basic_set_plain_is_empty(bset
))
6348 return isl_set_from_basic_set(bset
);
6350 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6351 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6353 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6354 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6357 if (i
== bset
->n_eq
)
6358 return isl_basic_set_lexmin(bset
);
6360 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6362 eq
= isl_mat_cow(eq
);
6363 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6364 if (T
&& T
->n_col
== 0) {
6368 bset
= isl_basic_set_set_to_empty(bset
);
6369 return isl_set_from_basic_set(bset
);
6371 bset
= basic_set_parameter_preimage(bset
, T
);
6373 set
= isl_basic_set_lexmin(bset
);
6374 set
= set_parameter_preimage(set
, T2
);
6375 set
= set_append_equalities(set
, eq
);
6379 /* Compute an explicit representation for all the existentially
6380 * quantified variables.
6381 * The input and output dimensions are first turned into parameters.
6382 * compute_divs then returns a map with the same parameters and
6383 * no input or output dimensions and the dimension specification
6384 * is reset to that of the input.
6386 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6388 struct isl_basic_set
*bset
;
6389 struct isl_set
*set
;
6390 struct isl_map
*map
;
6391 isl_space
*dim
, *orig_dim
= NULL
;
6396 bmap
= isl_basic_map_cow(bmap
);
6400 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6401 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6402 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6403 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6407 orig_dim
= bmap
->dim
;
6409 bset
= (struct isl_basic_set
*)bmap
;
6411 set
= parameter_compute_divs(bset
);
6412 map
= (struct isl_map
*)set
;
6413 map
= isl_map_reset_space(map
, orig_dim
);
6417 isl_basic_map_free(bmap
);
6421 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6429 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6430 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6431 if (isl_int_is_zero(bmap
->div
[i
][0]))
6433 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6439 static int map_divs_known(__isl_keep isl_map
*map
)
6446 for (i
= 0; i
< map
->n
; ++i
) {
6447 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6455 /* If bmap contains any unknown divs, then compute explicit
6456 * expressions for them. However, this computation may be
6457 * quite expensive, so first try to remove divs that aren't
6460 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6463 struct isl_map
*map
;
6465 known
= isl_basic_map_divs_known(bmap
);
6469 return isl_map_from_basic_map(bmap
);
6471 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6473 known
= isl_basic_map_divs_known(bmap
);
6477 return isl_map_from_basic_map(bmap
);
6479 map
= compute_divs(bmap
);
6482 isl_basic_map_free(bmap
);
6486 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6490 struct isl_map
*res
;
6497 known
= map_divs_known(map
);
6505 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6506 for (i
= 1 ; i
< map
->n
; ++i
) {
6508 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6509 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6510 res
= isl_map_union_disjoint(res
, r2
);
6512 res
= isl_map_union(res
, r2
);
6519 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6521 return (struct isl_set
*)
6522 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6525 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6527 return (struct isl_set
*)
6528 isl_map_compute_divs((struct isl_map
*)set
);
6531 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6534 struct isl_set
*set
;
6539 map
= isl_map_cow(map
);
6543 set
= (struct isl_set
*)map
;
6544 set
->dim
= isl_space_domain(set
->dim
);
6547 for (i
= 0; i
< map
->n
; ++i
) {
6548 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6552 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6553 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6560 /* Return the union of "map1" and "map2", where we assume for now that
6561 * "map1" and "map2" are disjoint. Note that the basic maps inside
6562 * "map1" or "map2" may not be disjoint from each other.
6563 * Also note that this function is also called from isl_map_union,
6564 * which takes care of handling the situation where "map1" and "map2"
6565 * may not be disjoint.
6567 * If one of the inputs is empty, we can simply return the other input.
6568 * Similarly, if one of the inputs is universal, then it is equal to the union.
6570 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6571 __isl_take isl_map
*map2
)
6575 struct isl_map
*map
= NULL
;
6590 is_universe
= isl_map_plain_is_universe(map1
);
6591 if (is_universe
< 0)
6598 is_universe
= isl_map_plain_is_universe(map2
);
6599 if (is_universe
< 0)
6606 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6608 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6609 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6610 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6612 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6613 map1
->n
+ map2
->n
, flags
);
6616 for (i
= 0; i
< map1
->n
; ++i
) {
6617 map
= isl_map_add_basic_map(map
,
6618 isl_basic_map_copy(map1
->p
[i
]));
6622 for (i
= 0; i
< map2
->n
; ++i
) {
6623 map
= isl_map_add_basic_map(map
,
6624 isl_basic_map_copy(map2
->p
[i
]));
6638 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6639 __isl_take isl_map
*map2
)
6641 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6644 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6646 map1
= isl_map_union_disjoint(map1
, map2
);
6650 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6654 struct isl_set
*isl_set_union_disjoint(
6655 struct isl_set
*set1
, struct isl_set
*set2
)
6657 return (struct isl_set
*)
6658 isl_map_union_disjoint(
6659 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6662 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6664 return (struct isl_set
*)
6665 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6668 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6671 * "map" and "set" are assumed to be compatible and non-NULL.
6673 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6674 __isl_take isl_set
*set
,
6675 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6676 __isl_take isl_basic_set
*bset
))
6679 struct isl_map
*result
;
6682 if (isl_set_plain_is_universe(set
)) {
6687 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6688 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6689 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6691 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6692 map
->n
* set
->n
, flags
);
6693 for (i
= 0; result
&& i
< map
->n
; ++i
)
6694 for (j
= 0; j
< set
->n
; ++j
) {
6695 result
= isl_map_add_basic_map(result
,
6696 fn(isl_basic_map_copy(map
->p
[i
]),
6697 isl_basic_set_copy(set
->p
[j
])));
6707 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6708 __isl_take isl_set
*set
)
6713 if (!isl_map_compatible_range(map
, set
))
6714 isl_die(set
->ctx
, isl_error_invalid
,
6715 "incompatible spaces", goto error
);
6717 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6724 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6725 __isl_take isl_set
*set
)
6727 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6730 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
6731 __isl_take isl_set
*set
)
6736 if (!isl_map_compatible_domain(map
, set
))
6737 isl_die(set
->ctx
, isl_error_invalid
,
6738 "incompatible spaces", goto error
);
6740 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
6747 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
6748 __isl_take isl_set
*set
)
6750 return isl_map_align_params_map_map_and(map
, set
,
6751 &map_intersect_domain
);
6754 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6755 __isl_take isl_map
*map2
)
6759 map1
= isl_map_reverse(map1
);
6760 map1
= isl_map_apply_range(map1
, map2
);
6761 return isl_map_reverse(map1
);
6768 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6769 __isl_take isl_map
*map2
)
6771 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6774 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6775 __isl_take isl_map
*map2
)
6777 isl_space
*dim_result
;
6778 struct isl_map
*result
;
6784 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6785 isl_space_copy(map2
->dim
));
6787 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6790 for (i
= 0; i
< map1
->n
; ++i
)
6791 for (j
= 0; j
< map2
->n
; ++j
) {
6792 result
= isl_map_add_basic_map(result
,
6793 isl_basic_map_apply_range(
6794 isl_basic_map_copy(map1
->p
[i
]),
6795 isl_basic_map_copy(map2
->p
[j
])));
6801 if (result
&& result
->n
<= 1)
6802 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6810 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6811 __isl_take isl_map
*map2
)
6813 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6817 * returns range - domain
6819 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6821 isl_space
*dims
, *target_dim
;
6822 struct isl_basic_set
*bset
;
6829 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6830 bmap
->dim
, isl_dim_out
),
6832 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6833 dim
= isl_basic_map_n_in(bmap
);
6834 nparam
= isl_basic_map_n_param(bmap
);
6835 bset
= isl_basic_set_from_basic_map(bmap
);
6836 bset
= isl_basic_set_cow(bset
);
6837 dims
= isl_basic_set_get_space(bset
);
6838 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6839 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6840 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6841 for (i
= 0; i
< dim
; ++i
) {
6842 int j
= isl_basic_map_alloc_equality(
6843 (struct isl_basic_map
*)bset
);
6845 bset
= isl_basic_set_free(bset
);
6848 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6849 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6850 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6851 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6853 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6854 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6857 isl_basic_map_free(bmap
);
6862 * returns range - domain
6864 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6868 struct isl_set
*result
;
6873 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6874 map
->dim
, isl_dim_out
),
6876 dim
= isl_map_get_space(map
);
6877 dim
= isl_space_domain(dim
);
6878 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6881 for (i
= 0; i
< map
->n
; ++i
)
6882 result
= isl_set_add_basic_set(result
,
6883 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6892 * returns [domain -> range] -> range - domain
6894 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6895 __isl_take isl_basic_map
*bmap
)
6899 isl_basic_map
*domain
;
6903 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6904 isl_die(bmap
->ctx
, isl_error_invalid
,
6905 "domain and range don't match", goto error
);
6907 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6908 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6910 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6911 domain
= isl_basic_map_universe(dim
);
6913 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6914 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6915 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6917 total
= isl_basic_map_total_dim(bmap
);
6919 for (i
= 0; i
< n
; ++i
) {
6920 k
= isl_basic_map_alloc_equality(bmap
);
6923 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6924 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6925 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6926 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6929 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6930 return isl_basic_map_finalize(bmap
);
6932 isl_basic_map_free(bmap
);
6937 * returns [domain -> range] -> range - domain
6939 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6942 isl_space
*domain_dim
;
6947 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6948 isl_die(map
->ctx
, isl_error_invalid
,
6949 "domain and range don't match", goto error
);
6951 map
= isl_map_cow(map
);
6955 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6956 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6957 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6960 for (i
= 0; i
< map
->n
; ++i
) {
6961 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6965 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6972 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6974 struct isl_basic_map
*bmap
;
6982 nparam
= dims
->nparam
;
6984 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6988 for (i
= 0; i
< dim
; ++i
) {
6989 int j
= isl_basic_map_alloc_equality(bmap
);
6992 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6993 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6994 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6996 return isl_basic_map_finalize(bmap
);
6998 isl_basic_map_free(bmap
);
7002 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7006 if (dim
->n_in
!= dim
->n_out
)
7007 isl_die(dim
->ctx
, isl_error_invalid
,
7008 "number of input and output dimensions needs to be "
7009 "the same", goto error
);
7010 return basic_map_identity(dim
);
7012 isl_space_free(dim
);
7016 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7018 if (!model
|| !model
->dim
)
7020 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7023 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7025 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7028 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7030 if (!model
|| !model
->dim
)
7032 return isl_map_identity(isl_space_copy(model
->dim
));
7035 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7037 if (!model
|| !model
->dim
)
7039 return isl_map_identity(isl_space_copy(model
->dim
));
7042 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7044 isl_space
*dim
= isl_set_get_space(set
);
7046 id
= isl_map_identity(isl_space_map_from_set(dim
));
7047 return isl_map_intersect_range(id
, set
);
7050 /* Construct a basic set with all set dimensions having only non-negative
7053 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7054 __isl_take isl_space
*space
)
7059 struct isl_basic_set
*bset
;
7063 nparam
= space
->nparam
;
7065 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7068 for (i
= 0; i
< dim
; ++i
) {
7069 int k
= isl_basic_set_alloc_inequality(bset
);
7072 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7073 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7077 isl_basic_set_free(bset
);
7081 /* Construct the half-space x_pos >= 0.
7083 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7087 isl_basic_set
*nonneg
;
7089 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7090 k
= isl_basic_set_alloc_inequality(nonneg
);
7093 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7094 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7096 return isl_basic_set_finalize(nonneg
);
7098 isl_basic_set_free(nonneg
);
7102 /* Construct the half-space x_pos <= -1.
7104 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7109 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7110 k
= isl_basic_set_alloc_inequality(neg
);
7113 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7114 isl_int_set_si(neg
->ineq
[k
][0], -1);
7115 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7117 return isl_basic_set_finalize(neg
);
7119 isl_basic_set_free(neg
);
7123 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7124 enum isl_dim_type type
, unsigned first
, unsigned n
)
7127 isl_basic_set
*nonneg
;
7135 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7137 for (i
= 0; i
< n
; ++i
) {
7138 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7139 pos(set
->dim
, type
) + first
+ i
);
7140 neg
= neg_halfspace(isl_set_get_space(set
),
7141 pos(set
->dim
, type
) + first
+ i
);
7143 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7152 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7153 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7160 if (isl_set_plain_is_empty(set
)) {
7165 return fn(set
, signs
, user
);
7168 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7170 half
= isl_set_intersect(half
, isl_set_copy(set
));
7171 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7175 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7177 half
= isl_set_intersect(half
, set
);
7178 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7184 /* Call "fn" on the intersections of "set" with each of the orthants
7185 * (except for obviously empty intersections). The orthant is identified
7186 * by the signs array, with each entry having value 1 or -1 according
7187 * to the sign of the corresponding variable.
7189 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7190 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7200 if (isl_set_plain_is_empty(set
))
7203 nparam
= isl_set_dim(set
, isl_dim_param
);
7204 nvar
= isl_set_dim(set
, isl_dim_set
);
7206 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7208 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7216 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7218 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7221 int isl_basic_map_is_subset(
7222 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7225 struct isl_map
*map1
;
7226 struct isl_map
*map2
;
7228 if (!bmap1
|| !bmap2
)
7231 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7232 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7234 is_subset
= isl_map_is_subset(map1
, map2
);
7242 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7243 __isl_keep isl_basic_set
*bset2
)
7245 return isl_basic_map_is_subset(bset1
, bset2
);
7248 int isl_basic_map_is_equal(
7249 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7253 if (!bmap1
|| !bmap2
)
7255 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7258 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7262 int isl_basic_set_is_equal(
7263 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7265 return isl_basic_map_is_equal(
7266 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7269 int isl_map_is_empty(struct isl_map
*map
)
7276 for (i
= 0; i
< map
->n
; ++i
) {
7277 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7286 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7288 return map
? map
->n
== 0 : -1;
7291 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7293 return isl_map_plain_is_empty(map
);
7296 int isl_set_plain_is_empty(struct isl_set
*set
)
7298 return set
? set
->n
== 0 : -1;
7301 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7303 return isl_set_plain_is_empty(set
);
7306 int isl_set_is_empty(struct isl_set
*set
)
7308 return isl_map_is_empty((struct isl_map
*)set
);
7311 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7316 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7319 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7324 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7327 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7333 is_subset
= isl_map_is_subset(map1
, map2
);
7336 is_subset
= isl_map_is_subset(map2
, map1
);
7340 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7342 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7345 int isl_basic_map_is_strict_subset(
7346 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7350 if (!bmap1
|| !bmap2
)
7352 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7355 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7356 if (is_subset
== -1)
7361 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7367 is_subset
= isl_map_is_subset(map1
, map2
);
7370 is_subset
= isl_map_is_subset(map2
, map1
);
7371 if (is_subset
== -1)
7376 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7378 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7381 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7385 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7388 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7392 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7395 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7402 for (i
= 0; i
< map
->n
; ++i
) {
7403 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7411 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7413 return isl_map_plain_is_universe((isl_map
*) set
);
7416 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7418 return isl_set_plain_is_universe(set
);
7421 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7423 struct isl_basic_set
*bset
= NULL
;
7424 struct isl_vec
*sample
= NULL
;
7431 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7434 if (isl_basic_map_is_universe(bmap
))
7437 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7438 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7439 copy
= isl_basic_map_remove_redundancies(copy
);
7440 empty
= isl_basic_map_plain_is_empty(copy
);
7441 isl_basic_map_free(copy
);
7445 total
= 1 + isl_basic_map_total_dim(bmap
);
7446 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7447 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7453 isl_vec_free(bmap
->sample
);
7454 bmap
->sample
= NULL
;
7455 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7458 sample
= isl_basic_set_sample_vec(bset
);
7461 empty
= sample
->size
== 0;
7462 isl_vec_free(bmap
->sample
);
7463 bmap
->sample
= sample
;
7465 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7470 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7474 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7477 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7479 return isl_basic_map_plain_is_empty(bmap
);
7482 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7486 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7489 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7491 return isl_basic_set_plain_is_empty(bset
);
7494 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7496 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7499 struct isl_map
*isl_basic_map_union(
7500 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7502 struct isl_map
*map
;
7503 if (!bmap1
|| !bmap2
)
7506 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7508 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7511 map
= isl_map_add_basic_map(map
, bmap1
);
7512 map
= isl_map_add_basic_map(map
, bmap2
);
7515 isl_basic_map_free(bmap1
);
7516 isl_basic_map_free(bmap2
);
7520 struct isl_set
*isl_basic_set_union(
7521 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7523 return (struct isl_set
*)isl_basic_map_union(
7524 (struct isl_basic_map
*)bset1
,
7525 (struct isl_basic_map
*)bset2
);
7528 /* Order divs such that any div only depends on previous divs */
7529 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7537 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7539 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7541 if (isl_int_is_zero(bmap
->div
[i
][0]))
7543 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7547 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7553 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7555 return (struct isl_basic_set
*)
7556 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7559 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7566 for (i
= 0; i
< map
->n
; ++i
) {
7567 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7578 /* Apply the expansion computed by isl_merge_divs.
7579 * The expansion itself is given by "exp" while the resulting
7580 * list of divs is given by "div".
7582 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7583 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7588 bset
= isl_basic_set_cow(bset
);
7592 if (div
->n_row
< bset
->n_div
)
7593 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7594 "not an expansion", goto error
);
7596 n_div
= bset
->n_div
;
7597 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7598 div
->n_row
- n_div
, 0,
7599 2 * (div
->n_row
- n_div
));
7601 for (i
= n_div
; i
< div
->n_row
; ++i
)
7602 if (isl_basic_set_alloc_div(bset
) < 0)
7606 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7607 if (j
>= 0 && exp
[j
] == i
) {
7609 isl_basic_map_swap_div(bset
, i
, j
);
7612 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7613 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7621 isl_basic_set_free(bset
);
7626 /* Look for a div in dst that corresponds to the div "div" in src.
7627 * The divs before "div" in src and dst are assumed to be the same.
7629 * Returns -1 if no corresponding div was found and the position
7630 * of the corresponding div in dst otherwise.
7632 static int find_div(struct isl_basic_map
*dst
,
7633 struct isl_basic_map
*src
, unsigned div
)
7637 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7639 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7640 for (i
= div
; i
< dst
->n_div
; ++i
)
7641 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7642 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7643 dst
->n_div
- div
) == -1)
7648 struct isl_basic_map
*isl_basic_map_align_divs(
7649 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7657 if (src
->n_div
== 0)
7660 for (i
= 0; i
< src
->n_div
; ++i
)
7661 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7663 src
= isl_basic_map_order_divs(src
);
7664 dst
= isl_basic_map_cow(dst
);
7665 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7666 src
->n_div
, 0, 2 * src
->n_div
);
7669 total
= isl_space_dim(src
->dim
, isl_dim_all
);
7670 for (i
= 0; i
< src
->n_div
; ++i
) {
7671 int j
= find_div(dst
, src
, i
);
7673 j
= isl_basic_map_alloc_div(dst
);
7676 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7677 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7678 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7682 isl_basic_map_swap_div(dst
, i
, j
);
7686 isl_basic_map_free(dst
);
7690 struct isl_basic_set
*isl_basic_set_align_divs(
7691 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7693 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7694 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7697 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7705 map
= isl_map_compute_divs(map
);
7706 map
= isl_map_cow(map
);
7710 for (i
= 1; i
< map
->n
; ++i
)
7711 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7712 for (i
= 1; i
< map
->n
; ++i
)
7713 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7715 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7719 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7721 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7724 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7725 __isl_take isl_map
*map
)
7729 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7730 map
= isl_map_intersect_domain(map
, set
);
7731 set
= isl_map_range(map
);
7739 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7740 __isl_take isl_map
*map
)
7742 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7745 /* There is no need to cow as removing empty parts doesn't change
7746 * the meaning of the set.
7748 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7755 for (i
= map
->n
- 1; i
>= 0; --i
)
7756 remove_if_empty(map
, i
);
7761 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7763 return (struct isl_set
*)
7764 isl_map_remove_empty_parts((struct isl_map
*)set
);
7767 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7769 struct isl_basic_map
*bmap
;
7770 if (!map
|| map
->n
== 0)
7772 bmap
= map
->p
[map
->n
-1];
7773 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7774 return isl_basic_map_copy(bmap
);
7777 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7779 return (struct isl_basic_set
*)
7780 isl_map_copy_basic_map((struct isl_map
*)set
);
7783 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7784 __isl_keep isl_basic_map
*bmap
)
7790 for (i
= map
->n
-1; i
>= 0; --i
) {
7791 if (map
->p
[i
] != bmap
)
7793 map
= isl_map_cow(map
);
7796 isl_basic_map_free(map
->p
[i
]);
7797 if (i
!= map
->n
-1) {
7798 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7799 map
->p
[i
] = map
->p
[map
->n
-1];
7810 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7811 struct isl_basic_set
*bset
)
7813 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7814 (struct isl_basic_map
*)bset
);
7817 /* Given two basic sets bset1 and bset2, compute the maximal difference
7818 * between the values of dimension pos in bset1 and those in bset2
7819 * for any common value of the parameters and dimensions preceding pos.
7821 static enum isl_lp_result
basic_set_maximal_difference_at(
7822 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7823 int pos
, isl_int
*opt
)
7826 struct isl_basic_map
*bmap1
= NULL
;
7827 struct isl_basic_map
*bmap2
= NULL
;
7828 struct isl_ctx
*ctx
;
7829 struct isl_vec
*obj
;
7832 unsigned dim1
, dim2
;
7833 enum isl_lp_result res
;
7835 if (!bset1
|| !bset2
)
7836 return isl_lp_error
;
7838 nparam
= isl_basic_set_n_param(bset1
);
7839 dim1
= isl_basic_set_n_dim(bset1
);
7840 dim2
= isl_basic_set_n_dim(bset2
);
7841 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7842 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7843 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7844 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7845 if (!bmap1
|| !bmap2
)
7847 bmap1
= isl_basic_map_cow(bmap1
);
7848 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7849 pos
, (dim1
- pos
) + (dim2
- pos
),
7850 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7851 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7854 total
= isl_basic_map_total_dim(bmap1
);
7856 obj
= isl_vec_alloc(ctx
, 1 + total
);
7859 isl_seq_clr(obj
->block
.data
, 1 + total
);
7860 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7861 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7862 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7864 isl_basic_map_free(bmap1
);
7868 isl_basic_map_free(bmap2
);
7870 isl_basic_map_free(bmap1
);
7871 return isl_lp_error
;
7874 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7875 * for any common value of the parameters and dimensions preceding pos
7876 * in both basic sets, the values of dimension pos in bset1 are
7877 * smaller or larger than those in bset2.
7880 * 1 if bset1 follows bset2
7881 * -1 if bset1 precedes bset2
7882 * 0 if bset1 and bset2 are incomparable
7883 * -2 if some error occurred.
7885 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7886 struct isl_basic_set
*bset2
, int pos
)
7889 enum isl_lp_result res
;
7894 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7896 if (res
== isl_lp_empty
)
7898 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7899 res
== isl_lp_unbounded
)
7901 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7910 /* Given two basic sets bset1 and bset2, check whether
7911 * for any common value of the parameters and dimensions preceding pos
7912 * there is a value of dimension pos in bset1 that is larger
7913 * than a value of the same dimension in bset2.
7916 * 1 if there exists such a pair
7917 * 0 if there is no such pair, but there is a pair of equal values
7919 * -2 if some error occurred.
7921 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7922 __isl_keep isl_basic_set
*bset2
, int pos
)
7925 enum isl_lp_result res
;
7930 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7932 if (res
== isl_lp_empty
)
7934 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7935 res
== isl_lp_unbounded
)
7937 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7939 else if (res
== isl_lp_ok
)
7948 /* Given two sets set1 and set2, check whether
7949 * for any common value of the parameters and dimensions preceding pos
7950 * there is a value of dimension pos in set1 that is larger
7951 * than a value of the same dimension in set2.
7954 * 1 if there exists such a pair
7955 * 0 if there is no such pair, but there is a pair of equal values
7957 * -2 if some error occurred.
7959 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7960 __isl_keep isl_set
*set2
, int pos
)
7968 for (i
= 0; i
< set1
->n
; ++i
)
7969 for (j
= 0; j
< set2
->n
; ++j
) {
7971 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7972 if (f
== 1 || f
== -2)
7981 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7982 unsigned pos
, isl_int
*val
)
7990 total
= isl_basic_map_total_dim(bmap
);
7991 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7992 for (; d
+1 > pos
; --d
)
7993 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7997 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7999 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8001 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8004 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8010 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8011 unsigned pos
, isl_int
*val
)
8023 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8026 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8027 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8028 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8029 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8033 isl_int_set(*val
, v
);
8039 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8040 unsigned pos
, isl_int
*val
)
8042 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8046 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8049 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8052 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8053 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8055 if (pos
>= isl_basic_map_dim(bmap
, type
))
8057 return isl_basic_map_plain_has_fixed_var(bmap
,
8058 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8061 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8062 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8064 if (pos
>= isl_map_dim(map
, type
))
8066 return isl_map_plain_has_fixed_var(map
,
8067 map_offset(map
, type
) - 1 + pos
, val
);
8070 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8071 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8073 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8076 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8077 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8079 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8082 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8083 * then return this fixed value in *val.
8085 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8086 unsigned dim
, isl_int
*val
)
8088 return isl_basic_set_plain_has_fixed_var(bset
,
8089 isl_basic_set_n_param(bset
) + dim
, val
);
8092 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8093 * then return this fixed value in *val.
8095 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8096 unsigned dim
, isl_int
*val
)
8098 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8101 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8102 unsigned dim
, isl_int
*val
)
8104 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8107 /* Check if input variable in has fixed value and if so and if val is not NULL,
8108 * then return this fixed value in *val.
8110 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8111 unsigned in
, isl_int
*val
)
8113 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8116 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8117 * and if val is not NULL, then return this lower bound in *val.
8119 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8120 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8122 int i
, i_eq
= -1, i_ineq
= -1;
8129 total
= isl_basic_set_total_dim(bset
);
8130 nparam
= isl_basic_set_n_param(bset
);
8131 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8132 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8138 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8139 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8141 if (i_eq
!= -1 || i_ineq
!= -1)
8145 if (i_eq
== -1 && i_ineq
== -1)
8147 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8148 /* The coefficient should always be one due to normalization. */
8149 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8151 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8153 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8154 total
- nparam
- dim
- 1) != -1)
8157 isl_int_neg(*val
, c
[0]);
8161 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8162 unsigned dim
, isl_int
*val
)
8174 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8178 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8180 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8181 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8183 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8187 isl_int_set(*val
, v
);
8198 /* uset_gist depends on constraints without existentially quantified
8199 * variables sorting first.
8201 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8203 const struct constraint
*c1
= (const struct constraint
*)p1
;
8204 const struct constraint
*c2
= (const struct constraint
*)p2
;
8206 unsigned size
= isl_min(c1
->size
, c2
->size
);
8208 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8209 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8214 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8217 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8218 struct isl_basic_map
*bmap
)
8221 struct constraint
*c
;
8226 total
= isl_basic_map_total_dim(bmap
);
8227 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8230 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8232 c
[i
].c
= bmap
->ineq
[i
];
8234 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8235 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8236 bmap
->ineq
[i
] = c
[i
].c
;
8240 isl_basic_map_free(bmap
);
8244 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8245 __isl_take isl_basic_set
*bset
)
8247 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8248 (struct isl_basic_map
*)bset
);
8251 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8255 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8257 bmap
= isl_basic_map_remove_redundancies(bmap
);
8258 bmap
= isl_basic_map_sort_constraints(bmap
);
8260 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8264 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8266 return (struct isl_basic_set
*)isl_basic_map_normalize(
8267 (struct isl_basic_map
*)bset
);
8270 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8271 const __isl_keep isl_basic_map
*bmap2
)
8278 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8279 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8280 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8281 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8282 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8283 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8284 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8285 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8286 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8287 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8288 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8290 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8292 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8294 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8295 return bmap1
->n_eq
- bmap2
->n_eq
;
8296 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8297 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8298 if (bmap1
->n_div
!= bmap2
->n_div
)
8299 return bmap1
->n_div
- bmap2
->n_div
;
8300 total
= isl_basic_map_total_dim(bmap1
);
8301 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8302 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8306 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8307 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8311 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8312 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8319 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8320 const __isl_keep isl_basic_set
*bset2
)
8322 return isl_basic_map_plain_cmp(bset1
, bset2
);
8325 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8331 if (set1
->n
!= set2
->n
)
8332 return set1
->n
- set2
->n
;
8334 for (i
= 0; i
< set1
->n
; ++i
) {
8335 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8343 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8344 __isl_keep isl_basic_map
*bmap2
)
8346 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8349 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8350 __isl_keep isl_basic_set
*bset2
)
8352 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8353 (isl_basic_map
*)bset2
);
8356 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8358 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8359 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8361 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8364 /* We normalize in place, but if anything goes wrong we need
8365 * to return NULL, so we need to make sure we don't change the
8366 * meaning of any possible other copies of map.
8368 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8371 struct isl_basic_map
*bmap
;
8375 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8377 for (i
= 0; i
< map
->n
; ++i
) {
8378 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8381 isl_basic_map_free(map
->p
[i
]);
8384 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8385 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8386 map
= isl_map_remove_empty_parts(map
);
8389 for (i
= map
->n
- 1; i
>= 1; --i
) {
8390 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8392 isl_basic_map_free(map
->p
[i
-1]);
8393 for (j
= i
; j
< map
->n
; ++j
)
8394 map
->p
[j
-1] = map
->p
[j
];
8404 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8406 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8409 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8419 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8422 map1
= isl_map_copy(map1
);
8423 map2
= isl_map_copy(map2
);
8424 map1
= isl_map_normalize(map1
);
8425 map2
= isl_map_normalize(map2
);
8428 equal
= map1
->n
== map2
->n
;
8429 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8430 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8443 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8445 return isl_map_plain_is_equal(map1
, map2
);
8448 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8450 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8451 (struct isl_map
*)set2
);
8454 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8456 return isl_set_plain_is_equal(set1
, set2
);
8459 /* Return an interval that ranges from min to max (inclusive)
8461 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8462 isl_int min
, isl_int max
)
8465 struct isl_basic_set
*bset
= NULL
;
8467 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8471 k
= isl_basic_set_alloc_inequality(bset
);
8474 isl_int_set_si(bset
->ineq
[k
][1], 1);
8475 isl_int_neg(bset
->ineq
[k
][0], min
);
8477 k
= isl_basic_set_alloc_inequality(bset
);
8480 isl_int_set_si(bset
->ineq
[k
][1], -1);
8481 isl_int_set(bset
->ineq
[k
][0], max
);
8485 isl_basic_set_free(bset
);
8489 /* Return the Cartesian product of the basic sets in list (in the given order).
8491 __isl_give isl_basic_set
*isl_basic_set_list_product(
8492 __isl_take
struct isl_basic_set_list
*list
)
8500 struct isl_basic_set
*product
= NULL
;
8504 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8505 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8506 nparam
= isl_basic_set_n_param(list
->p
[0]);
8507 dim
= isl_basic_set_n_dim(list
->p
[0]);
8508 extra
= list
->p
[0]->n_div
;
8509 n_eq
= list
->p
[0]->n_eq
;
8510 n_ineq
= list
->p
[0]->n_ineq
;
8511 for (i
= 1; i
< list
->n
; ++i
) {
8512 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8513 isl_assert(list
->ctx
,
8514 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8515 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8516 extra
+= list
->p
[i
]->n_div
;
8517 n_eq
+= list
->p
[i
]->n_eq
;
8518 n_ineq
+= list
->p
[i
]->n_ineq
;
8520 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8525 for (i
= 0; i
< list
->n
; ++i
) {
8526 isl_basic_set_add_constraints(product
,
8527 isl_basic_set_copy(list
->p
[i
]), dim
);
8528 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8530 isl_basic_set_list_free(list
);
8533 isl_basic_set_free(product
);
8534 isl_basic_set_list_free(list
);
8538 struct isl_basic_map
*isl_basic_map_product(
8539 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8541 isl_space
*dim_result
= NULL
;
8542 struct isl_basic_map
*bmap
;
8543 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8544 struct isl_dim_map
*dim_map1
, *dim_map2
;
8546 if (!bmap1
|| !bmap2
)
8549 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8550 bmap2
->dim
, isl_dim_param
), goto error
);
8551 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8552 isl_space_copy(bmap2
->dim
));
8554 in1
= isl_basic_map_n_in(bmap1
);
8555 in2
= isl_basic_map_n_in(bmap2
);
8556 out1
= isl_basic_map_n_out(bmap1
);
8557 out2
= isl_basic_map_n_out(bmap2
);
8558 nparam
= isl_basic_map_n_param(bmap1
);
8560 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8561 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8562 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8563 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8564 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8565 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8566 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8567 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8568 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8569 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8570 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8572 bmap
= isl_basic_map_alloc_space(dim_result
,
8573 bmap1
->n_div
+ bmap2
->n_div
,
8574 bmap1
->n_eq
+ bmap2
->n_eq
,
8575 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8576 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8577 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8578 bmap
= isl_basic_map_simplify(bmap
);
8579 return isl_basic_map_finalize(bmap
);
8581 isl_basic_map_free(bmap1
);
8582 isl_basic_map_free(bmap2
);
8586 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8587 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8589 isl_basic_map
*prod
;
8591 prod
= isl_basic_map_product(bmap1
, bmap2
);
8592 prod
= isl_basic_map_flatten(prod
);
8596 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8597 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8599 return isl_basic_map_flat_range_product(bset1
, bset2
);
8602 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8603 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8605 isl_space
*space_result
= NULL
;
8606 isl_basic_map
*bmap
;
8607 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8608 struct isl_dim_map
*dim_map1
, *dim_map2
;
8610 if (!bmap1
|| !bmap2
)
8613 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8614 isl_space_copy(bmap2
->dim
));
8616 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8617 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8618 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8619 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8621 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8622 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8623 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8624 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8625 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8626 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8627 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8628 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8629 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8630 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8631 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8633 bmap
= isl_basic_map_alloc_space(space_result
,
8634 bmap1
->n_div
+ bmap2
->n_div
,
8635 bmap1
->n_eq
+ bmap2
->n_eq
,
8636 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8637 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8638 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8639 bmap
= isl_basic_map_simplify(bmap
);
8640 return isl_basic_map_finalize(bmap
);
8642 isl_basic_map_free(bmap1
);
8643 isl_basic_map_free(bmap2
);
8647 __isl_give isl_basic_map
*isl_basic_map_range_product(
8648 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8650 isl_space
*dim_result
= NULL
;
8651 isl_basic_map
*bmap
;
8652 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8653 struct isl_dim_map
*dim_map1
, *dim_map2
;
8655 if (!bmap1
|| !bmap2
)
8658 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8659 bmap2
->dim
, isl_dim_param
))
8660 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8661 "parameters don't match", goto error
);
8663 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8664 isl_space_copy(bmap2
->dim
));
8666 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8667 out1
= isl_basic_map_n_out(bmap1
);
8668 out2
= isl_basic_map_n_out(bmap2
);
8669 nparam
= isl_basic_map_n_param(bmap1
);
8671 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8672 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8673 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8674 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8675 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8676 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8677 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8678 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8679 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8680 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8681 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8683 bmap
= isl_basic_map_alloc_space(dim_result
,
8684 bmap1
->n_div
+ bmap2
->n_div
,
8685 bmap1
->n_eq
+ bmap2
->n_eq
,
8686 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8687 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8688 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8689 bmap
= isl_basic_map_simplify(bmap
);
8690 return isl_basic_map_finalize(bmap
);
8692 isl_basic_map_free(bmap1
);
8693 isl_basic_map_free(bmap2
);
8697 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8698 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8700 isl_basic_map
*prod
;
8702 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8703 prod
= isl_basic_map_flatten_range(prod
);
8707 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8708 __isl_take isl_map
*map2
,
8709 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8710 __isl_take isl_space
*right
),
8711 __isl_give isl_basic_map
*(*basic_map_product
)(
8712 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8715 struct isl_map
*result
;
8721 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8722 map2
->dim
, isl_dim_param
), goto error
);
8724 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8725 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8726 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8728 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8729 isl_space_copy(map2
->dim
)),
8730 map1
->n
* map2
->n
, flags
);
8733 for (i
= 0; i
< map1
->n
; ++i
)
8734 for (j
= 0; j
< map2
->n
; ++j
) {
8735 struct isl_basic_map
*part
;
8736 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8737 isl_basic_map_copy(map2
->p
[j
]));
8738 if (isl_basic_map_is_empty(part
))
8739 isl_basic_map_free(part
);
8741 result
= isl_map_add_basic_map(result
, part
);
8754 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8756 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8757 __isl_take isl_map
*map2
)
8759 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8762 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8763 __isl_take isl_map
*map2
)
8765 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8768 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8770 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8771 __isl_take isl_map
*map2
)
8775 prod
= isl_map_product(map1
, map2
);
8776 prod
= isl_map_flatten(prod
);
8780 /* Given two set A and B, construct its Cartesian product A x B.
8782 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8784 return isl_map_range_product(set1
, set2
);
8787 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8788 __isl_take isl_set
*set2
)
8790 return isl_map_flat_range_product(set1
, set2
);
8793 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8795 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8796 __isl_take isl_map
*map2
)
8798 return map_product(map1
, map2
, &isl_space_domain_product
,
8799 &isl_basic_map_domain_product
);
8802 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8804 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8805 __isl_take isl_map
*map2
)
8807 return map_product(map1
, map2
, &isl_space_range_product
,
8808 &isl_basic_map_range_product
);
8811 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8812 __isl_take isl_map
*map2
)
8814 return isl_map_align_params_map_map_and(map1
, map2
,
8815 &map_domain_product_aligned
);
8818 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8819 __isl_take isl_map
*map2
)
8821 return isl_map_align_params_map_map_and(map1
, map2
,
8822 &map_range_product_aligned
);
8825 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8827 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8828 __isl_take isl_map
*map2
)
8832 prod
= isl_map_domain_product(map1
, map2
);
8833 prod
= isl_map_flatten_domain(prod
);
8837 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8839 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8840 __isl_take isl_map
*map2
)
8844 prod
= isl_map_range_product(map1
, map2
);
8845 prod
= isl_map_flatten_range(prod
);
8849 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8852 uint32_t hash
= isl_hash_init();
8857 bmap
= isl_basic_map_copy(bmap
);
8858 bmap
= isl_basic_map_normalize(bmap
);
8861 total
= isl_basic_map_total_dim(bmap
);
8862 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8863 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8865 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8866 isl_hash_hash(hash
, c_hash
);
8868 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8869 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8871 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8872 isl_hash_hash(hash
, c_hash
);
8874 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8875 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8877 if (isl_int_is_zero(bmap
->div
[i
][0]))
8879 isl_hash_byte(hash
, i
& 0xFF);
8880 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8881 isl_hash_hash(hash
, c_hash
);
8883 isl_basic_map_free(bmap
);
8887 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8889 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8892 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8899 map
= isl_map_copy(map
);
8900 map
= isl_map_normalize(map
);
8904 hash
= isl_hash_init();
8905 for (i
= 0; i
< map
->n
; ++i
) {
8907 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8908 isl_hash_hash(hash
, bmap_hash
);
8916 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8918 return isl_map_get_hash((isl_map
*)set
);
8921 /* Check if the value for dimension dim is completely determined
8922 * by the values of the other parameters and variables.
8923 * That is, check if dimension dim is involved in an equality.
8925 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8932 nparam
= isl_basic_set_n_param(bset
);
8933 for (i
= 0; i
< bset
->n_eq
; ++i
)
8934 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8939 /* Check if the value for dimension dim is completely determined
8940 * by the values of the other parameters and variables.
8941 * That is, check if dimension dim is involved in an equality
8942 * for each of the subsets.
8944 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8950 for (i
= 0; i
< set
->n
; ++i
) {
8952 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8959 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8961 return set
? set
->n
: 0;
8964 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8965 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8972 for (i
= 0; i
< map
->n
; ++i
)
8973 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8979 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8980 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8987 for (i
= 0; i
< set
->n
; ++i
)
8988 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8994 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9001 bset
= isl_basic_set_cow(bset
);
9005 dim
= isl_basic_set_get_space(bset
);
9006 dim
= isl_space_lift(dim
, bset
->n_div
);
9009 isl_space_free(bset
->dim
);
9011 bset
->extra
-= bset
->n_div
;
9014 bset
= isl_basic_set_finalize(bset
);
9018 isl_basic_set_free(bset
);
9022 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9028 set
= isl_set_align_divs(set
);
9033 set
= isl_set_cow(set
);
9037 n_div
= set
->p
[0]->n_div
;
9038 dim
= isl_set_get_space(set
);
9039 dim
= isl_space_lift(dim
, n_div
);
9042 isl_space_free(set
->dim
);
9045 for (i
= 0; i
< set
->n
; ++i
) {
9046 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9057 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9060 struct isl_basic_map
*bmap
;
9067 set
= isl_set_align_divs(set
);
9072 dim
= isl_set_get_space(set
);
9073 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9075 return isl_map_identity(isl_space_map_from_set(dim
));
9078 n_div
= set
->p
[0]->n_div
;
9079 dim
= isl_space_map_from_set(dim
);
9080 n_param
= isl_space_dim(dim
, isl_dim_param
);
9081 n_set
= isl_space_dim(dim
, isl_dim_in
);
9082 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9083 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9084 for (i
= 0; i
< n_set
; ++i
)
9085 bmap
= var_equal(bmap
, i
);
9087 total
= n_param
+ n_set
+ n_set
+ n_div
;
9088 for (i
= 0; i
< n_div
; ++i
) {
9089 k
= isl_basic_map_alloc_inequality(bmap
);
9092 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9093 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9094 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9095 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9096 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9097 set
->p
[0]->div
[i
][0]);
9099 l
= isl_basic_map_alloc_inequality(bmap
);
9102 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9103 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9104 set
->p
[0]->div
[i
][0]);
9105 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9109 bmap
= isl_basic_map_simplify(bmap
);
9110 bmap
= isl_basic_map_finalize(bmap
);
9111 return isl_map_from_basic_map(bmap
);
9114 isl_basic_map_free(bmap
);
9118 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9126 dim
= isl_basic_set_total_dim(bset
);
9127 size
+= bset
->n_eq
* (1 + dim
);
9128 size
+= bset
->n_ineq
* (1 + dim
);
9129 size
+= bset
->n_div
* (2 + dim
);
9134 int isl_set_size(__isl_keep isl_set
*set
)
9142 for (i
= 0; i
< set
->n
; ++i
)
9143 size
+= isl_basic_set_size(set
->p
[i
]);
9148 /* Check if there is any lower bound (if lower == 0) and/or upper
9149 * bound (if upper == 0) on the specified dim.
9151 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9152 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9159 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9161 pos
+= isl_basic_map_offset(bmap
, type
);
9163 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9164 if (isl_int_is_zero(bmap
->div
[i
][0]))
9166 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9170 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9171 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9174 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9175 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9182 return lower
&& upper
;
9185 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9186 enum isl_dim_type type
, unsigned pos
)
9188 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9191 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9192 enum isl_dim_type type
, unsigned pos
)
9194 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9197 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9198 enum isl_dim_type type
, unsigned pos
)
9200 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9203 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9204 enum isl_dim_type type
, unsigned pos
)
9211 for (i
= 0; i
< map
->n
; ++i
) {
9213 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9214 if (bounded
< 0 || !bounded
)
9221 /* Return 1 if the specified dim is involved in both an upper bound
9222 * and a lower bound.
9224 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9225 enum isl_dim_type type
, unsigned pos
)
9227 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9230 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9232 static int has_any_bound(__isl_keep isl_map
*map
,
9233 enum isl_dim_type type
, unsigned pos
,
9234 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9235 enum isl_dim_type type
, unsigned pos
))
9242 for (i
= 0; i
< map
->n
; ++i
) {
9244 bounded
= fn(map
->p
[i
], type
, pos
);
9245 if (bounded
< 0 || bounded
)
9252 /* Return 1 if the specified dim is involved in any lower bound.
9254 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9255 enum isl_dim_type type
, unsigned pos
)
9257 return has_any_bound(set
, type
, pos
,
9258 &isl_basic_map_dim_has_lower_bound
);
9261 /* Return 1 if the specified dim is involved in any upper bound.
9263 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9264 enum isl_dim_type type
, unsigned pos
)
9266 return has_any_bound(set
, type
, pos
,
9267 &isl_basic_map_dim_has_upper_bound
);
9270 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9272 static int has_bound(__isl_keep isl_map
*map
,
9273 enum isl_dim_type type
, unsigned pos
,
9274 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9275 enum isl_dim_type type
, unsigned pos
))
9282 for (i
= 0; i
< map
->n
; ++i
) {
9284 bounded
= fn(map
->p
[i
], type
, pos
);
9285 if (bounded
< 0 || !bounded
)
9292 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9294 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9295 enum isl_dim_type type
, unsigned pos
)
9297 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9300 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9302 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9303 enum isl_dim_type type
, unsigned pos
)
9305 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9308 /* For each of the "n" variables starting at "first", determine
9309 * the sign of the variable and put the results in the first "n"
9310 * elements of the array "signs".
9312 * 1 means that the variable is non-negative
9313 * -1 means that the variable is non-positive
9314 * 0 means the variable attains both positive and negative values.
9316 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9317 unsigned first
, unsigned n
, int *signs
)
9319 isl_vec
*bound
= NULL
;
9320 struct isl_tab
*tab
= NULL
;
9321 struct isl_tab_undo
*snap
;
9324 if (!bset
|| !signs
)
9327 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9328 tab
= isl_tab_from_basic_set(bset
, 0);
9332 isl_seq_clr(bound
->el
, bound
->size
);
9333 isl_int_set_si(bound
->el
[0], -1);
9335 snap
= isl_tab_snap(tab
);
9336 for (i
= 0; i
< n
; ++i
) {
9339 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9340 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9343 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9344 if (isl_tab_rollback(tab
, snap
) < 0)
9352 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9353 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9356 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9357 if (isl_tab_rollback(tab
, snap
) < 0)
9360 signs
[i
] = empty
? -1 : 0;
9364 isl_vec_free(bound
);
9368 isl_vec_free(bound
);
9372 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9373 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9375 if (!bset
|| !signs
)
9377 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9380 first
+= pos(bset
->dim
, type
) - 1;
9381 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9384 /* Check if the given basic map is obviously single-valued.
9385 * In particular, for each output dimension, check that there is
9386 * an equality that defines the output dimension in terms of
9387 * earlier dimensions.
9389 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9399 total
= 1 + isl_basic_map_total_dim(bmap
);
9400 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9401 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9403 for (i
= 0; i
< n_out
; ++i
) {
9404 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9405 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9407 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9408 total
- (o_out
+ i
+ 1)) == -1)
9411 if (j
>= bmap
->n_eq
)
9418 /* Check if the given basic map is single-valued.
9423 * and check if the result is a subset of the identity mapping.
9425 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9428 isl_basic_map
*test
;
9432 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9436 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9437 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9439 space
= isl_basic_map_get_space(bmap
);
9440 space
= isl_space_map_from_set(isl_space_range(space
));
9441 id
= isl_basic_map_identity(space
);
9443 sv
= isl_basic_map_is_subset(test
, id
);
9445 isl_basic_map_free(test
);
9446 isl_basic_map_free(id
);
9451 /* Check if the given map is obviously single-valued.
9453 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9462 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9465 /* Check if the given map is single-valued.
9470 * and check if the result is a subset of the identity mapping.
9472 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9479 sv
= isl_map_plain_is_single_valued(map
);
9483 test
= isl_map_reverse(isl_map_copy(map
));
9484 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9486 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9487 id
= isl_map_identity(dim
);
9489 sv
= isl_map_is_subset(test
, id
);
9497 int isl_map_is_injective(__isl_keep isl_map
*map
)
9501 map
= isl_map_copy(map
);
9502 map
= isl_map_reverse(map
);
9503 in
= isl_map_is_single_valued(map
);
9509 /* Check if the given map is obviously injective.
9511 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9515 map
= isl_map_copy(map
);
9516 map
= isl_map_reverse(map
);
9517 in
= isl_map_plain_is_single_valued(map
);
9523 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9527 sv
= isl_map_is_single_valued(map
);
9531 return isl_map_is_injective(map
);
9534 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9536 return isl_map_is_single_valued((isl_map
*)set
);
9539 int isl_map_is_translation(__isl_keep isl_map
*map
)
9544 delta
= isl_map_deltas(isl_map_copy(map
));
9545 ok
= isl_set_is_singleton(delta
);
9546 isl_set_free(delta
);
9551 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9553 if (isl_seq_first_non_zero(p
, pos
) != -1)
9555 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9560 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9569 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9572 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9573 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9574 for (j
= 0; j
< nvar
; ++j
) {
9575 int lower
= 0, upper
= 0;
9576 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9577 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9579 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9585 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9586 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9588 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9590 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9595 if (!lower
|| !upper
)
9602 int isl_set_is_box(__isl_keep isl_set
*set
)
9609 return isl_basic_set_is_box(set
->p
[0]);
9612 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9617 return isl_space_is_wrapping(bset
->dim
);
9620 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9625 return isl_space_is_wrapping(set
->dim
);
9628 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9630 bmap
= isl_basic_map_cow(bmap
);
9634 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9638 bmap
= isl_basic_map_finalize(bmap
);
9640 return (isl_basic_set
*)bmap
;
9642 isl_basic_map_free(bmap
);
9646 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9650 map
= isl_map_cow(map
);
9654 for (i
= 0; i
< map
->n
; ++i
) {
9655 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9659 map
->dim
= isl_space_wrap(map
->dim
);
9663 return (isl_set
*)map
;
9669 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9671 bset
= isl_basic_set_cow(bset
);
9675 bset
->dim
= isl_space_unwrap(bset
->dim
);
9679 bset
= isl_basic_set_finalize(bset
);
9681 return (isl_basic_map
*)bset
;
9683 isl_basic_set_free(bset
);
9687 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9694 if (!isl_set_is_wrapping(set
))
9695 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9698 set
= isl_set_cow(set
);
9702 for (i
= 0; i
< set
->n
; ++i
) {
9703 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9708 set
->dim
= isl_space_unwrap(set
->dim
);
9712 return (isl_map
*)set
;
9718 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9719 enum isl_dim_type type
)
9724 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9727 bmap
= isl_basic_map_cow(bmap
);
9731 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9735 bmap
= isl_basic_map_finalize(bmap
);
9739 isl_basic_map_free(bmap
);
9743 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9744 enum isl_dim_type type
)
9751 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9754 map
= isl_map_cow(map
);
9758 for (i
= 0; i
< map
->n
; ++i
) {
9759 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9763 map
->dim
= isl_space_reset(map
->dim
, type
);
9773 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9778 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9781 bmap
= isl_basic_map_cow(bmap
);
9785 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9789 bmap
= isl_basic_map_finalize(bmap
);
9793 isl_basic_map_free(bmap
);
9797 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9799 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9802 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9803 __isl_take isl_basic_map
*bmap
)
9808 if (!bmap
->dim
->nested
[0])
9811 bmap
= isl_basic_map_cow(bmap
);
9815 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9819 bmap
= isl_basic_map_finalize(bmap
);
9823 isl_basic_map_free(bmap
);
9827 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9828 __isl_take isl_basic_map
*bmap
)
9833 if (!bmap
->dim
->nested
[1])
9836 bmap
= isl_basic_map_cow(bmap
);
9840 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9844 bmap
= isl_basic_map_finalize(bmap
);
9848 isl_basic_map_free(bmap
);
9852 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9859 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9862 map
= isl_map_cow(map
);
9866 for (i
= 0; i
< map
->n
; ++i
) {
9867 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9871 map
->dim
= isl_space_flatten(map
->dim
);
9881 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9883 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9886 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9888 isl_space
*dim
, *flat_dim
;
9891 dim
= isl_set_get_space(set
);
9892 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9893 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9894 map
= isl_map_intersect_domain(map
, set
);
9899 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9906 if (!map
->dim
->nested
[0])
9909 map
= isl_map_cow(map
);
9913 for (i
= 0; i
< map
->n
; ++i
) {
9914 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9918 map
->dim
= isl_space_flatten_domain(map
->dim
);
9928 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9935 if (!map
->dim
->nested
[1])
9938 map
= isl_map_cow(map
);
9942 for (i
= 0; i
< map
->n
; ++i
) {
9943 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9947 map
->dim
= isl_space_flatten_range(map
->dim
);
9957 /* Reorder the dimensions of "bmap" according to the given dim_map
9958 * and set the dimension specification to "dim".
9960 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9961 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9966 bmap
= isl_basic_map_cow(bmap
);
9967 if (!bmap
|| !dim
|| !dim_map
)
9970 flags
= bmap
->flags
;
9971 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9972 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9973 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9974 res
= isl_basic_map_alloc_space(dim
,
9975 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9976 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9979 res
= isl_basic_map_finalize(res
);
9983 isl_basic_map_free(bmap
);
9984 isl_space_free(dim
);
9988 /* Reorder the dimensions of "map" according to given reordering.
9990 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9991 __isl_take isl_reordering
*r
)
9994 struct isl_dim_map
*dim_map
;
9996 map
= isl_map_cow(map
);
9997 dim_map
= isl_dim_map_from_reordering(r
);
9998 if (!map
|| !r
|| !dim_map
)
10001 for (i
= 0; i
< map
->n
; ++i
) {
10002 struct isl_dim_map
*dim_map_i
;
10004 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10006 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10007 isl_space_copy(r
->dim
), dim_map_i
);
10013 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10015 isl_reordering_free(r
);
10021 isl_reordering_free(r
);
10025 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10026 __isl_take isl_reordering
*r
)
10028 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10031 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10032 __isl_take isl_space
*model
)
10036 if (!map
|| !model
)
10039 ctx
= isl_space_get_ctx(model
);
10040 if (!isl_space_has_named_params(model
))
10041 isl_die(ctx
, isl_error_invalid
,
10042 "model has unnamed parameters", goto error
);
10043 if (!isl_space_has_named_params(map
->dim
))
10044 isl_die(ctx
, isl_error_invalid
,
10045 "relation has unnamed parameters", goto error
);
10046 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10047 isl_reordering
*exp
;
10049 model
= isl_space_drop_dims(model
, isl_dim_in
,
10050 0, isl_space_dim(model
, isl_dim_in
));
10051 model
= isl_space_drop_dims(model
, isl_dim_out
,
10052 0, isl_space_dim(model
, isl_dim_out
));
10053 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10054 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10055 map
= isl_map_realign(map
, exp
);
10058 isl_space_free(model
);
10061 isl_space_free(model
);
10066 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10067 __isl_take isl_space
*model
)
10069 return isl_map_align_params(set
, model
);
10072 /* Align the parameters of "bmap" to those of "model", introducing
10073 * additional parameters if needed.
10075 __isl_give isl_basic_map
*isl_basic_map_align_params(
10076 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10080 if (!bmap
|| !model
)
10083 ctx
= isl_space_get_ctx(model
);
10084 if (!isl_space_has_named_params(model
))
10085 isl_die(ctx
, isl_error_invalid
,
10086 "model has unnamed parameters", goto error
);
10087 if (!isl_space_has_named_params(bmap
->dim
))
10088 isl_die(ctx
, isl_error_invalid
,
10089 "relation has unnamed parameters", goto error
);
10090 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10091 isl_reordering
*exp
;
10092 struct isl_dim_map
*dim_map
;
10094 model
= isl_space_drop_dims(model
, isl_dim_in
,
10095 0, isl_space_dim(model
, isl_dim_in
));
10096 model
= isl_space_drop_dims(model
, isl_dim_out
,
10097 0, isl_space_dim(model
, isl_dim_out
));
10098 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10099 exp
= isl_reordering_extend_space(exp
,
10100 isl_basic_map_get_space(bmap
));
10101 dim_map
= isl_dim_map_from_reordering(exp
);
10102 bmap
= isl_basic_map_realign(bmap
,
10103 exp
? isl_space_copy(exp
->dim
) : NULL
,
10104 isl_dim_map_extend(dim_map
, bmap
));
10105 isl_reordering_free(exp
);
10109 isl_space_free(model
);
10112 isl_space_free(model
);
10113 isl_basic_map_free(bmap
);
10117 /* Align the parameters of "bset" to those of "model", introducing
10118 * additional parameters if needed.
10120 __isl_give isl_basic_set
*isl_basic_set_align_params(
10121 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10123 return isl_basic_map_align_params(bset
, model
);
10126 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10127 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10128 enum isl_dim_type c2
, enum isl_dim_type c3
,
10129 enum isl_dim_type c4
, enum isl_dim_type c5
)
10131 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10132 struct isl_mat
*mat
;
10138 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10139 isl_basic_map_total_dim(bmap
) + 1);
10142 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10143 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10144 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10145 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10146 isl_int_set(mat
->row
[i
][pos
],
10147 bmap
->eq
[i
][off
+ k
]);
10155 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10156 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10157 enum isl_dim_type c2
, enum isl_dim_type c3
,
10158 enum isl_dim_type c4
, enum isl_dim_type c5
)
10160 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10161 struct isl_mat
*mat
;
10167 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10168 isl_basic_map_total_dim(bmap
) + 1);
10171 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10172 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10173 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10174 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10175 isl_int_set(mat
->row
[i
][pos
],
10176 bmap
->ineq
[i
][off
+ k
]);
10184 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10185 __isl_take isl_space
*dim
,
10186 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10187 enum isl_dim_type c2
, enum isl_dim_type c3
,
10188 enum isl_dim_type c4
, enum isl_dim_type c5
)
10190 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10191 isl_basic_map
*bmap
;
10197 if (!dim
|| !eq
|| !ineq
)
10200 if (eq
->n_col
!= ineq
->n_col
)
10201 isl_die(dim
->ctx
, isl_error_invalid
,
10202 "equalities and inequalities matrices should have "
10203 "same number of columns", goto error
);
10205 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10207 if (eq
->n_col
< total
)
10208 isl_die(dim
->ctx
, isl_error_invalid
,
10209 "number of columns too small", goto error
);
10211 extra
= eq
->n_col
- total
;
10213 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10214 eq
->n_row
, ineq
->n_row
);
10217 for (i
= 0; i
< extra
; ++i
) {
10218 k
= isl_basic_map_alloc_div(bmap
);
10221 isl_int_set_si(bmap
->div
[k
][0], 0);
10223 for (i
= 0; i
< eq
->n_row
; ++i
) {
10224 l
= isl_basic_map_alloc_equality(bmap
);
10227 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10228 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10229 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10230 isl_int_set(bmap
->eq
[l
][off
+ k
],
10236 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10237 l
= isl_basic_map_alloc_inequality(bmap
);
10240 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10241 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10242 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10243 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10244 ineq
->row
[i
][pos
]);
10250 isl_space_free(dim
);
10252 isl_mat_free(ineq
);
10256 isl_space_free(dim
);
10258 isl_mat_free(ineq
);
10262 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10263 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10264 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10266 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10267 c1
, c2
, c3
, c4
, isl_dim_in
);
10270 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10271 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10272 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10274 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10275 c1
, c2
, c3
, c4
, isl_dim_in
);
10278 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10279 __isl_take isl_space
*dim
,
10280 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10281 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10283 return (isl_basic_set
*)
10284 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10285 c1
, c2
, c3
, c4
, isl_dim_in
);
10288 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10293 return isl_space_can_zip(bmap
->dim
);
10296 int isl_map_can_zip(__isl_keep isl_map
*map
)
10301 return isl_space_can_zip(map
->dim
);
10304 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10305 * (A -> C) -> (B -> D).
10307 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10316 if (!isl_basic_map_can_zip(bmap
))
10317 isl_die(bmap
->ctx
, isl_error_invalid
,
10318 "basic map cannot be zipped", goto error
);
10319 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10320 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10321 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10322 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10323 bmap
= isl_basic_map_cow(bmap
);
10324 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10327 bmap
->dim
= isl_space_zip(bmap
->dim
);
10332 isl_basic_map_free(bmap
);
10336 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10337 * (A -> C) -> (B -> D).
10339 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10346 if (!isl_map_can_zip(map
))
10347 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10350 map
= isl_map_cow(map
);
10354 for (i
= 0; i
< map
->n
; ++i
) {
10355 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10360 map
->dim
= isl_space_zip(map
->dim
);
10370 /* Can we apply isl_basic_map_curry to "bmap"?
10371 * That is, does it have a nested relation in its domain?
10373 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10378 return isl_space_can_curry(bmap
->dim
);
10381 /* Can we apply isl_map_curry to "map"?
10382 * That is, does it have a nested relation in its domain?
10384 int isl_map_can_curry(__isl_keep isl_map
*map
)
10389 return isl_space_can_curry(map
->dim
);
10392 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10395 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10401 if (!isl_basic_map_can_curry(bmap
))
10402 isl_die(bmap
->ctx
, isl_error_invalid
,
10403 "basic map cannot be curried", goto error
);
10404 bmap
= isl_basic_map_cow(bmap
);
10407 bmap
->dim
= isl_space_curry(bmap
->dim
);
10412 isl_basic_map_free(bmap
);
10416 /* Given a map (A -> B) -> C, return the corresponding map
10419 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10426 if (!isl_map_can_curry(map
))
10427 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10430 map
= isl_map_cow(map
);
10434 for (i
= 0; i
< map
->n
; ++i
) {
10435 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10440 map
->dim
= isl_space_curry(map
->dim
);
10450 /* Can we apply isl_basic_map_uncurry to "bmap"?
10451 * That is, does it have a nested relation in its domain?
10453 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10458 return isl_space_can_uncurry(bmap
->dim
);
10461 /* Can we apply isl_map_uncurry to "map"?
10462 * That is, does it have a nested relation in its domain?
10464 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10469 return isl_space_can_uncurry(map
->dim
);
10472 /* Given a basic map A -> (B -> C), return the corresponding basic map
10475 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10481 if (!isl_basic_map_can_uncurry(bmap
))
10482 isl_die(bmap
->ctx
, isl_error_invalid
,
10483 "basic map cannot be uncurried",
10484 return isl_basic_map_free(bmap
));
10485 bmap
= isl_basic_map_cow(bmap
);
10488 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10490 return isl_basic_map_free(bmap
);
10494 /* Given a map A -> (B -> C), return the corresponding map
10497 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10504 if (!isl_map_can_uncurry(map
))
10505 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10506 return isl_map_free(map
));
10508 map
= isl_map_cow(map
);
10512 for (i
= 0; i
< map
->n
; ++i
) {
10513 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10515 return isl_map_free(map
);
10518 map
->dim
= isl_space_uncurry(map
->dim
);
10520 return isl_map_free(map
);
10525 /* Construct a basic map mapping the domain of the affine expression
10526 * to a one-dimensional range prescribed by the affine expression.
10528 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10532 isl_local_space
*ls
;
10533 isl_basic_map
*bmap
;
10538 ls
= isl_aff_get_local_space(aff
);
10539 bmap
= isl_basic_map_from_local_space(ls
);
10540 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10541 k
= isl_basic_map_alloc_equality(bmap
);
10545 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10546 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10547 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10548 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10549 aff
->v
->size
- (pos
+ 1));
10552 bmap
= isl_basic_map_finalize(bmap
);
10556 isl_basic_map_free(bmap
);
10560 /* Construct a map mapping the domain of the affine expression
10561 * to a one-dimensional range prescribed by the affine expression.
10563 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10565 isl_basic_map
*bmap
;
10567 bmap
= isl_basic_map_from_aff(aff
);
10568 return isl_map_from_basic_map(bmap
);
10571 /* Construct a basic map mapping the domain the multi-affine expression
10572 * to its range, with each dimension in the range equated to the
10573 * corresponding affine expression.
10575 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10576 __isl_take isl_multi_aff
*maff
)
10580 isl_basic_map
*bmap
;
10585 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10586 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10587 "invalid space", return isl_multi_aff_free(maff
));
10589 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10590 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10592 for (i
= 0; i
< maff
->n
; ++i
) {
10594 isl_basic_map
*bmap_i
;
10596 aff
= isl_aff_copy(maff
->p
[i
]);
10597 bmap_i
= isl_basic_map_from_aff(aff
);
10599 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10602 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10604 isl_multi_aff_free(maff
);
10608 /* Construct a map mapping the domain the multi-affine expression
10609 * to its range, with each dimension in the range equated to the
10610 * corresponding affine expression.
10612 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10614 isl_basic_map
*bmap
;
10616 bmap
= isl_basic_map_from_multi_aff(maff
);
10617 return isl_map_from_basic_map(bmap
);
10620 /* Construct a basic map mapping a domain in the given space to
10621 * to an n-dimensional range, with n the number of elements in the list,
10622 * where each coordinate in the range is prescribed by the
10623 * corresponding affine expression.
10624 * The domains of all affine expressions in the list are assumed to match
10627 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10628 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10632 isl_basic_map
*bmap
;
10637 dim
= isl_space_from_domain(domain_dim
);
10638 bmap
= isl_basic_map_universe(dim
);
10640 for (i
= 0; i
< list
->n
; ++i
) {
10642 isl_basic_map
*bmap_i
;
10644 aff
= isl_aff_copy(list
->p
[i
]);
10645 bmap_i
= isl_basic_map_from_aff(aff
);
10647 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10650 isl_aff_list_free(list
);
10654 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10655 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10657 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10660 /* Construct a basic map where the given dimensions are equal to each other.
10662 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10663 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10665 isl_basic_map
*bmap
= NULL
;
10671 if (pos1
>= isl_space_dim(space
, type1
))
10672 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10673 "index out of bounds", goto error
);
10674 if (pos2
>= isl_space_dim(space
, type2
))
10675 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10676 "index out of bounds", goto error
);
10678 if (type1
== type2
&& pos1
== pos2
)
10679 return isl_basic_map_universe(space
);
10681 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10682 i
= isl_basic_map_alloc_equality(bmap
);
10685 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10686 pos1
+= isl_basic_map_offset(bmap
, type1
);
10687 pos2
+= isl_basic_map_offset(bmap
, type2
);
10688 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10689 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10690 bmap
= isl_basic_map_finalize(bmap
);
10691 isl_space_free(space
);
10694 isl_space_free(space
);
10695 isl_basic_map_free(bmap
);
10699 /* Add a constraint imposing that the given two dimensions are equal.
10701 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10702 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10706 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10708 bmap
= isl_basic_map_intersect(bmap
, eq
);
10713 /* Add a constraint imposing that the given two dimensions are equal.
10715 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10716 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10718 isl_basic_map
*bmap
;
10720 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10722 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10727 /* Add a constraint imposing that the given two dimensions have opposite values.
10729 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10730 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10732 isl_basic_map
*bmap
= NULL
;
10738 if (pos1
>= isl_map_dim(map
, type1
))
10739 isl_die(map
->ctx
, isl_error_invalid
,
10740 "index out of bounds", goto error
);
10741 if (pos2
>= isl_map_dim(map
, type2
))
10742 isl_die(map
->ctx
, isl_error_invalid
,
10743 "index out of bounds", goto error
);
10745 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10746 i
= isl_basic_map_alloc_equality(bmap
);
10749 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10750 pos1
+= isl_basic_map_offset(bmap
, type1
);
10751 pos2
+= isl_basic_map_offset(bmap
, type2
);
10752 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10753 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10754 bmap
= isl_basic_map_finalize(bmap
);
10756 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10760 isl_basic_map_free(bmap
);
10765 /* Add a constraint imposing that the value of the first dimension is
10766 * greater than or equal to that of the second.
10768 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10769 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10772 isl_local_space
*ls
;
10777 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10778 isl_die(bmap
->ctx
, isl_error_invalid
,
10779 "index out of bounds", return isl_basic_map_free(bmap
));
10780 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10781 isl_die(bmap
->ctx
, isl_error_invalid
,
10782 "index out of bounds", return isl_basic_map_free(bmap
));
10784 if (type1
== type2
&& pos1
== pos2
)
10787 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10788 c
= isl_inequality_alloc(ls
);
10789 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10790 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10791 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10796 /* Add a constraint imposing that the value of the first dimension is
10797 * greater than that of the second.
10799 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10800 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10802 isl_basic_map
*bmap
= NULL
;
10808 if (pos1
>= isl_map_dim(map
, type1
))
10809 isl_die(map
->ctx
, isl_error_invalid
,
10810 "index out of bounds", goto error
);
10811 if (pos2
>= isl_map_dim(map
, type2
))
10812 isl_die(map
->ctx
, isl_error_invalid
,
10813 "index out of bounds", goto error
);
10815 if (type1
== type2
&& pos1
== pos2
) {
10816 isl_space
*space
= isl_map_get_space(map
);
10818 return isl_map_empty(space
);
10821 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10822 i
= isl_basic_map_alloc_inequality(bmap
);
10825 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10826 pos1
+= isl_basic_map_offset(bmap
, type1
);
10827 pos2
+= isl_basic_map_offset(bmap
, type2
);
10828 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10829 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10830 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10831 bmap
= isl_basic_map_finalize(bmap
);
10833 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10837 isl_basic_map_free(bmap
);
10842 /* Add a constraint imposing that the value of the first dimension is
10843 * smaller than that of the second.
10845 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
10846 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10848 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
10851 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10855 isl_local_space
*ls
;
10860 if (!isl_basic_map_divs_known(bmap
))
10861 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10862 "some divs are unknown", return NULL
);
10864 ls
= isl_basic_map_get_local_space(bmap
);
10865 div
= isl_local_space_get_div(ls
, pos
);
10866 isl_local_space_free(ls
);
10871 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10874 return isl_basic_map_get_div(bset
, pos
);
10877 /* Plug in "subs" for dimension "type", "pos" of "bset".
10879 * Let i be the dimension to replace and let "subs" be of the form
10883 * Any integer division with a non-zero coefficient for i,
10885 * floor((a i + g)/m)
10889 * floor((a f + d g)/(m d))
10891 * Constraints of the form
10899 * We currently require that "subs" is an integral expression.
10900 * Handling rational expressions may require us to add stride constraints
10901 * as we do in isl_basic_set_preimage_multi_aff.
10903 __isl_give isl_basic_set
*isl_basic_set_substitute(
10904 __isl_take isl_basic_set
*bset
,
10905 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10911 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10914 bset
= isl_basic_set_cow(bset
);
10915 if (!bset
|| !subs
)
10918 ctx
= isl_basic_set_get_ctx(bset
);
10919 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10920 isl_die(ctx
, isl_error_invalid
,
10921 "spaces don't match", goto error
);
10922 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10923 isl_die(ctx
, isl_error_unsupported
,
10924 "cannot handle divs yet", goto error
);
10925 if (!isl_int_is_one(subs
->v
->el
[0]))
10926 isl_die(ctx
, isl_error_invalid
,
10927 "can only substitute integer expressions", goto error
);
10929 pos
+= isl_basic_set_offset(bset
, type
);
10933 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10934 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10936 isl_int_set(v
, bset
->eq
[i
][pos
]);
10937 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10938 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10939 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10942 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10943 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10945 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10946 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10947 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10948 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10951 for (i
= 0; i
< bset
->n_div
; ++i
) {
10952 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10954 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10955 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10956 isl_seq_combine(bset
->div
[i
] + 1,
10957 subs
->v
->el
[0], bset
->div
[i
] + 1,
10958 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10959 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10964 bset
= isl_basic_set_simplify(bset
);
10965 return isl_basic_set_finalize(bset
);
10967 isl_basic_set_free(bset
);
10971 /* Plug in "subs" for dimension "type", "pos" of "set".
10973 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10974 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10978 if (set
&& isl_set_plain_is_empty(set
))
10981 set
= isl_set_cow(set
);
10985 for (i
= set
->n
- 1; i
>= 0; --i
) {
10986 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10987 if (remove_if_empty(set
, i
) < 0)
10997 /* Check if the range of "ma" is compatible with "space".
10998 * Return -1 if anything is wrong.
11000 static int check_space_compatible_range_multi_aff(
11001 __isl_keep isl_space
*space
, __isl_keep isl_multi_aff
*ma
)
11004 isl_space
*ma_space
;
11006 ma_space
= isl_multi_aff_get_space(ma
);
11007 m
= isl_space_is_range_internal(space
, ma_space
);
11008 isl_space_free(ma_space
);
11010 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11011 "spaces don't match", return -1);
11015 /* Check if the range of "ma" is compatible with "bset".
11016 * Return -1 if anything is wrong.
11018 static int check_basic_set_compatible_range_multi_aff(
11019 __isl_keep isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11021 return check_space_compatible_range_multi_aff(bset
->dim
, ma
);
11024 /* Copy the divs from "ma" to "bset", adding zeros for the coefficients
11025 * of the other divs in "bset".
11027 static int set_ma_divs(__isl_keep isl_basic_set
*bset
,
11028 __isl_keep isl_multi_aff
*ma
, int n_div
)
11031 isl_local_space
*ls
;
11036 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11040 for (i
= 0; i
< n_div
; ++i
) {
11041 isl_seq_cpy(bset
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
11042 isl_seq_clr(bset
->div
[i
] + ls
->div
->n_col
, bset
->n_div
- n_div
);
11043 if (isl_basic_set_add_div_constraints(bset
, i
) < 0)
11047 isl_local_space_free(ls
);
11050 isl_local_space_free(ls
);
11054 /* How many stride constraints does "ma" enforce?
11055 * That is, how many of the affine expressions have a denominator
11056 * different from one?
11058 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11063 for (i
= 0; i
< ma
->n
; ++i
)
11064 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11070 /* For each affine expression in ma of the form
11072 * x_i = (f_i y + h_i)/m_i
11074 * with m_i different from one, add a constraint to "bset"
11077 * f_i y + h_i = m_i alpha_i
11079 * with alpha_i an additional existentially quantified variable.
11081 static __isl_give isl_basic_set
*add_ma_strides(
11082 __isl_take isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11088 total
= isl_basic_set_total_dim(bset
);
11089 for (i
= 0; i
< ma
->n
; ++i
) {
11092 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11094 div
= isl_basic_set_alloc_div(bset
);
11095 k
= isl_basic_set_alloc_equality(bset
);
11096 if (div
< 0 || k
< 0)
11098 isl_int_set_si(bset
->div
[div
][0], 0);
11099 len
= ma
->p
[i
]->v
->size
;
11100 isl_seq_cpy(bset
->eq
[k
], ma
->p
[i
]->v
->el
+ 1, len
- 1);
11101 isl_seq_clr(bset
->eq
[k
] + len
- 1, 1 + total
- (len
- 1));
11102 isl_int_neg(bset
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11108 isl_basic_set_free(bset
);
11112 /* Compute the preimage of "bset" under the function represented by "ma".
11113 * In other words, plug in "ma" in "bset". The result is a basic set
11114 * that lives in the domain space of "ma".
11116 * If bset is represented by
11118 * A(p) + B x + C(divs) >= 0
11120 * and ma is represented by
11122 * x = D(p) + F(y) + G(divs')
11124 * then the result is
11126 * A(p) + B D(p) + B F(y) + B G(divs') + C(divs) >= 0
11128 * The divs in the input set are similarly adjusted.
11131 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
11135 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
11137 * If bset is not a rational set and if F(y) involves any denominators
11139 * x_i = (f_i y + h_i)/m_i
11141 * the additional constraints are added to ensure that we only
11142 * map back integer points. That is we enforce
11144 * f_i y + h_i = m_i alpha_i
11146 * with alpha_i an additional existentially quantified variable.
11148 * We first copy over the divs from "ma".
11149 * Then we add the modified constraints and divs from "bset".
11150 * Finally, we add the stride constraints, if needed.
11152 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11153 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11157 isl_basic_set
*res
= NULL
;
11158 int n_div_bset
, n_div_ma
;
11159 isl_int f
, c1
, c2
, g
;
11160 int rational
, strides
;
11167 ma
= isl_multi_aff_align_divs(ma
);
11170 if (check_basic_set_compatible_range_multi_aff(bset
, ma
) < 0)
11173 n_div_bset
= isl_basic_set_dim(bset
, isl_dim_div
);
11174 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11176 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
11177 rational
= isl_basic_set_is_rational(bset
);
11178 strides
= rational
? 0 : multi_aff_strides(ma
);
11179 res
= isl_basic_set_alloc_space(space
, n_div_ma
+ n_div_bset
+ strides
,
11180 bset
->n_eq
+ strides
, bset
->n_ineq
+ 2 * n_div_ma
);
11182 res
= isl_basic_set_set_rational(res
);
11184 for (i
= 0; i
< n_div_ma
+ n_div_bset
; ++i
)
11185 if (isl_basic_set_alloc_div(res
) < 0)
11188 if (set_ma_divs(res
, ma
, n_div_ma
) < 0)
11191 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11192 k
= isl_basic_set_alloc_equality(res
);
11195 isl_seq_preimage(res
->eq
[k
], bset
->eq
[i
], ma
, n_div_ma
,
11196 n_div_bset
, f
, c1
, c2
, g
, 0);
11199 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11200 k
= isl_basic_set_alloc_inequality(res
);
11203 isl_seq_preimage(res
->ineq
[k
], bset
->ineq
[i
], ma
, n_div_ma
,
11204 n_div_bset
, f
, c1
, c2
, g
, 0);
11207 for (i
= 0; i
< bset
->n_div
; ++i
) {
11208 if (isl_int_is_zero(bset
->div
[i
][0])) {
11209 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11212 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bset
->div
[i
],
11213 ma
, n_div_ma
, n_div_bset
, f
, c1
, c2
, g
, 1);
11217 res
= add_ma_strides(res
, ma
);
11223 isl_basic_set_free(bset
);
11224 isl_multi_aff_free(ma
);
11225 res
= isl_basic_set_simplify(res
);
11226 return isl_basic_set_finalize(res
);
11232 isl_basic_set_free(bset
);
11233 isl_multi_aff_free(ma
);
11234 isl_basic_set_free(res
);
11238 /* Check if the range of "ma" is compatible with "set".
11239 * Return -1 if anything is wrong.
11241 static int check_set_compatible_range_multi_aff(
11242 __isl_keep isl_set
*set
, __isl_keep isl_multi_aff
*ma
)
11244 return check_space_compatible_range_multi_aff(set
->dim
, ma
);
11247 /* Compute the preimage of "set" under the function represented by "ma".
11248 * In other words, plug in "ma" in "set. The result is a set
11249 * that lives in the domain space of "ma".
11251 static __isl_give isl_set
*set_preimage_multi_aff(__isl_take isl_set
*set
,
11252 __isl_take isl_multi_aff
*ma
)
11256 set
= isl_set_cow(set
);
11257 ma
= isl_multi_aff_align_divs(ma
);
11260 if (check_set_compatible_range_multi_aff(set
, ma
) < 0)
11263 for (i
= 0; i
< set
->n
; ++i
) {
11264 set
->p
[i
] = isl_basic_set_preimage_multi_aff(set
->p
[i
],
11265 isl_multi_aff_copy(ma
));
11270 isl_space_free(set
->dim
);
11271 set
->dim
= isl_multi_aff_get_domain_space(ma
);
11275 isl_multi_aff_free(ma
);
11277 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
11278 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
11281 isl_multi_aff_free(ma
);
11286 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11287 __isl_take isl_multi_aff
*ma
)
11292 if (isl_space_match(set
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11293 return set_preimage_multi_aff(set
, ma
);
11295 if (!isl_space_has_named_params(set
->dim
) ||
11296 !isl_space_has_named_params(ma
->space
))
11297 isl_die(set
->ctx
, isl_error_invalid
,
11298 "unaligned unnamed parameters", goto error
);
11299 set
= isl_set_align_params(set
, isl_multi_aff_get_space(ma
));
11300 ma
= isl_multi_aff_align_params(ma
, isl_set_get_space(set
));
11302 return set_preimage_multi_aff(set
, ma
);
11304 isl_multi_aff_free(ma
);
11305 return isl_set_free(set
);
11308 /* Compute the preimage of "set" under the function represented by "pma".
11309 * In other words, plug in "pma" in "set. The result is a set
11310 * that lives in the domain space of "pma".
11312 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11313 __isl_take isl_pw_multi_aff
*pma
)
11322 isl_pw_multi_aff_free(pma
);
11323 res
= isl_set_empty(isl_set_get_space(set
));
11328 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11329 isl_multi_aff_copy(pma
->p
[0].maff
));
11330 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11332 for (i
= 1; i
< pma
->n
; ++i
) {
11335 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11336 isl_multi_aff_copy(pma
->p
[i
].maff
));
11337 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11338 res
= isl_set_union(res
, res_i
);
11341 isl_pw_multi_aff_free(pma
);
11345 isl_pw_multi_aff_free(pma
);
11350 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11351 __isl_take isl_pw_multi_aff
*pma
)
11356 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11357 return set_preimage_pw_multi_aff(set
, pma
);
11359 if (!isl_space_has_named_params(set
->dim
) ||
11360 !isl_space_has_named_params(pma
->dim
))
11361 isl_die(set
->ctx
, isl_error_invalid
,
11362 "unaligned unnamed parameters", goto error
);
11363 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11364 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11366 return set_preimage_pw_multi_aff(set
, pma
);
11368 isl_pw_multi_aff_free(pma
);
11369 return isl_set_free(set
);