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
);
3055 return isl_basic_map_set_to_empty(res
);
3057 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3058 return isl_basic_map_finalize(res
);
3061 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3062 __isl_take isl_basic_set
*bset
,
3063 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3065 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3068 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3069 enum isl_dim_type type
, unsigned n
)
3073 return isl_basic_map_insert_dims(bmap
, type
,
3074 isl_basic_map_dim(bmap
, type
), n
);
3077 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3078 enum isl_dim_type type
, unsigned n
)
3082 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3083 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3085 isl_basic_set_free(bset
);
3089 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3090 enum isl_dim_type type
)
3094 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3097 space
= isl_map_get_space(map
);
3098 space
= isl_space_reset(space
, type
);
3099 map
= isl_map_reset_space(map
, space
);
3103 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3104 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3109 return map_space_reset(map
, type
);
3111 map
= isl_map_cow(map
);
3115 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3119 for (i
= 0; i
< map
->n
; ++i
) {
3120 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3131 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3132 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3134 return isl_map_insert_dims(set
, type
, pos
, n
);
3137 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3138 enum isl_dim_type type
, unsigned n
)
3142 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3145 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3146 enum isl_dim_type type
, unsigned n
)
3150 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3151 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3157 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3158 __isl_take isl_basic_map
*bmap
,
3159 enum isl_dim_type dst_type
, unsigned dst_pos
,
3160 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3162 struct isl_dim_map
*dim_map
;
3163 struct isl_basic_map
*res
;
3164 enum isl_dim_type t
;
3165 unsigned total
, off
;
3172 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3175 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3178 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3180 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3181 pos(bmap
->dim
, src_type
) + src_pos
+
3182 ((src_type
< dst_type
) ? n
: 0)) {
3183 bmap
= isl_basic_map_cow(bmap
);
3187 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3188 src_type
, src_pos
, n
);
3192 bmap
= isl_basic_map_finalize(bmap
);
3197 total
= isl_basic_map_total_dim(bmap
);
3198 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3201 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3202 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3203 if (t
== dst_type
) {
3204 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3207 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3210 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3211 dst_pos
, size
- dst_pos
, off
);
3212 off
+= size
- dst_pos
;
3213 } else if (t
== src_type
) {
3214 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3217 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3218 src_pos
+ n
, size
- src_pos
- n
, off
);
3219 off
+= size
- src_pos
- n
;
3221 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3225 isl_dim_map_div(dim_map
, bmap
, off
);
3227 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3228 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3229 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3233 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3234 src_type
, src_pos
, n
);
3238 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3239 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3240 bmap
= isl_basic_map_finalize(bmap
);
3244 isl_basic_map_free(bmap
);
3248 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3249 enum isl_dim_type dst_type
, unsigned dst_pos
,
3250 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3252 return (isl_basic_set
*)isl_basic_map_move_dims(
3253 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3256 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3257 enum isl_dim_type dst_type
, unsigned dst_pos
,
3258 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3262 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3263 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3264 src_type
, src_pos
, n
);
3270 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3271 enum isl_dim_type dst_type
, unsigned dst_pos
,
3272 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3281 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3284 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3287 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3289 map
= isl_map_cow(map
);
3293 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3297 for (i
= 0; i
< map
->n
; ++i
) {
3298 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3300 src_type
, src_pos
, n
);
3311 /* Move the specified dimensions to the last columns right before
3312 * the divs. Don't change the dimension specification of bmap.
3313 * That's the responsibility of the caller.
3315 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3316 enum isl_dim_type type
, unsigned first
, unsigned n
)
3318 struct isl_dim_map
*dim_map
;
3319 struct isl_basic_map
*res
;
3320 enum isl_dim_type t
;
3321 unsigned total
, off
;
3325 if (pos(bmap
->dim
, type
) + first
+ n
==
3326 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3329 total
= isl_basic_map_total_dim(bmap
);
3330 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3333 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3334 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3336 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3339 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3340 first
, n
, total
- bmap
->n_div
- n
);
3341 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3342 first
+ n
, size
- (first
+ n
), off
);
3343 off
+= size
- (first
+ n
);
3345 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3349 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3351 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3352 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3353 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3357 /* Turn the n dimensions of type type, starting at first
3358 * into existentially quantified variables.
3360 __isl_give isl_basic_map
*isl_basic_map_project_out(
3361 __isl_take isl_basic_map
*bmap
,
3362 enum isl_dim_type type
, unsigned first
, unsigned n
)
3370 return basic_map_space_reset(bmap
, type
);
3375 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3376 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3378 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3381 bmap
= move_last(bmap
, type
, first
, n
);
3382 bmap
= isl_basic_map_cow(bmap
);
3386 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3387 old
= bmap
->block2
.data
;
3388 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3389 (bmap
->extra
+ n
) * (1 + row_size
));
3390 if (!bmap
->block2
.data
)
3392 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3395 for (i
= 0; i
< n
; ++i
) {
3396 new_div
[i
] = bmap
->block2
.data
+
3397 (bmap
->extra
+ i
) * (1 + row_size
);
3398 isl_seq_clr(new_div
[i
], 1 + row_size
);
3400 for (i
= 0; i
< bmap
->extra
; ++i
)
3401 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3403 bmap
->div
= new_div
;
3407 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3410 bmap
= isl_basic_map_simplify(bmap
);
3411 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3412 return isl_basic_map_finalize(bmap
);
3414 isl_basic_map_free(bmap
);
3418 /* Turn the n dimensions of type type, starting at first
3419 * into existentially quantified variables.
3421 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3422 enum isl_dim_type type
, unsigned first
, unsigned n
)
3424 return (isl_basic_set
*)isl_basic_map_project_out(
3425 (isl_basic_map
*)bset
, type
, first
, n
);
3428 /* Turn the n dimensions of type type, starting at first
3429 * into existentially quantified variables.
3431 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3432 enum isl_dim_type type
, unsigned first
, unsigned n
)
3440 return map_space_reset(map
, type
);
3442 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3444 map
= isl_map_cow(map
);
3448 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3452 for (i
= 0; i
< map
->n
; ++i
) {
3453 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3464 /* Turn the n dimensions of type type, starting at first
3465 * into existentially quantified variables.
3467 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3468 enum isl_dim_type type
, unsigned first
, unsigned n
)
3470 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3473 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3477 for (i
= 0; i
< n
; ++i
) {
3478 j
= isl_basic_map_alloc_div(bmap
);
3481 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3485 isl_basic_map_free(bmap
);
3489 struct isl_basic_map
*isl_basic_map_apply_range(
3490 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3492 isl_space
*dim_result
= NULL
;
3493 struct isl_basic_map
*bmap
;
3494 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3495 struct isl_dim_map
*dim_map1
, *dim_map2
;
3497 if (!bmap1
|| !bmap2
)
3500 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3501 isl_space_copy(bmap2
->dim
));
3503 n_in
= isl_basic_map_n_in(bmap1
);
3504 n_out
= isl_basic_map_n_out(bmap2
);
3505 n
= isl_basic_map_n_out(bmap1
);
3506 nparam
= isl_basic_map_n_param(bmap1
);
3508 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3509 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3510 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3511 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3512 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3513 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3514 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3515 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3516 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3517 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3518 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3520 bmap
= isl_basic_map_alloc_space(dim_result
,
3521 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3522 bmap1
->n_eq
+ bmap2
->n_eq
,
3523 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3524 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3525 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3526 bmap
= add_divs(bmap
, n
);
3527 bmap
= isl_basic_map_simplify(bmap
);
3528 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3529 return isl_basic_map_finalize(bmap
);
3531 isl_basic_map_free(bmap1
);
3532 isl_basic_map_free(bmap2
);
3536 struct isl_basic_set
*isl_basic_set_apply(
3537 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3542 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3545 return (struct isl_basic_set
*)
3546 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3548 isl_basic_set_free(bset
);
3549 isl_basic_map_free(bmap
);
3553 struct isl_basic_map
*isl_basic_map_apply_domain(
3554 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3556 if (!bmap1
|| !bmap2
)
3559 isl_assert(bmap1
->ctx
,
3560 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3561 isl_assert(bmap1
->ctx
,
3562 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3565 bmap1
= isl_basic_map_reverse(bmap1
);
3566 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3567 return isl_basic_map_reverse(bmap1
);
3569 isl_basic_map_free(bmap1
);
3570 isl_basic_map_free(bmap2
);
3574 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3575 * A \cap B -> f(A) + f(B)
3577 struct isl_basic_map
*isl_basic_map_sum(
3578 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3580 unsigned n_in
, n_out
, nparam
, total
, pos
;
3581 struct isl_basic_map
*bmap
= NULL
;
3582 struct isl_dim_map
*dim_map1
, *dim_map2
;
3585 if (!bmap1
|| !bmap2
)
3588 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3591 nparam
= isl_basic_map_n_param(bmap1
);
3592 n_in
= isl_basic_map_n_in(bmap1
);
3593 n_out
= isl_basic_map_n_out(bmap1
);
3595 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3596 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3597 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3598 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3599 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3600 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3601 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3602 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3603 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3604 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3605 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3607 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3608 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3609 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3610 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3611 for (i
= 0; i
< n_out
; ++i
) {
3612 int j
= isl_basic_map_alloc_equality(bmap
);
3615 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3616 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3617 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3618 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3620 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3621 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3622 bmap
= add_divs(bmap
, 2 * n_out
);
3624 bmap
= isl_basic_map_simplify(bmap
);
3625 return isl_basic_map_finalize(bmap
);
3627 isl_basic_map_free(bmap
);
3628 isl_basic_map_free(bmap1
);
3629 isl_basic_map_free(bmap2
);
3633 /* Given two maps A -> f(A) and B -> g(B), construct a map
3634 * A \cap B -> f(A) + f(B)
3636 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3638 struct isl_map
*result
;
3644 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3646 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3647 map1
->n
* map2
->n
, 0);
3650 for (i
= 0; i
< map1
->n
; ++i
)
3651 for (j
= 0; j
< map2
->n
; ++j
) {
3652 struct isl_basic_map
*part
;
3653 part
= isl_basic_map_sum(
3654 isl_basic_map_copy(map1
->p
[i
]),
3655 isl_basic_map_copy(map2
->p
[j
]));
3656 if (isl_basic_map_is_empty(part
))
3657 isl_basic_map_free(part
);
3659 result
= isl_map_add_basic_map(result
, part
);
3672 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3673 __isl_take isl_set
*set2
)
3675 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3678 /* Given a basic map A -> f(A), construct A -> -f(A).
3680 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3685 bmap
= isl_basic_map_cow(bmap
);
3689 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3690 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3691 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3692 for (j
= 0; j
< n
; ++j
)
3693 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3694 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3695 for (j
= 0; j
< n
; ++j
)
3696 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3697 for (i
= 0; i
< bmap
->n_div
; ++i
)
3698 for (j
= 0; j
< n
; ++j
)
3699 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3700 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3701 return isl_basic_map_finalize(bmap
);
3704 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3706 return isl_basic_map_neg(bset
);
3709 /* Given a map A -> f(A), construct A -> -f(A).
3711 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3715 map
= isl_map_cow(map
);
3719 for (i
= 0; i
< map
->n
; ++i
) {
3720 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3731 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3733 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3736 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3737 * A -> floor(f(A)/d).
3739 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3742 unsigned n_in
, n_out
, nparam
, total
, pos
;
3743 struct isl_basic_map
*result
= NULL
;
3744 struct isl_dim_map
*dim_map
;
3750 nparam
= isl_basic_map_n_param(bmap
);
3751 n_in
= isl_basic_map_n_in(bmap
);
3752 n_out
= isl_basic_map_n_out(bmap
);
3754 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3755 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3756 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3757 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3758 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3759 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3761 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3762 bmap
->n_div
+ n_out
,
3763 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3764 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3765 result
= add_divs(result
, n_out
);
3766 for (i
= 0; i
< n_out
; ++i
) {
3768 j
= isl_basic_map_alloc_inequality(result
);
3771 isl_seq_clr(result
->ineq
[j
], 1+total
);
3772 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3773 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3774 j
= isl_basic_map_alloc_inequality(result
);
3777 isl_seq_clr(result
->ineq
[j
], 1+total
);
3778 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3779 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3780 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3783 result
= isl_basic_map_simplify(result
);
3784 return isl_basic_map_finalize(result
);
3786 isl_basic_map_free(result
);
3790 /* Given a map A -> f(A) and an integer d, construct a map
3791 * A -> floor(f(A)/d).
3793 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3797 map
= isl_map_cow(map
);
3801 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3802 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3803 for (i
= 0; i
< map
->n
; ++i
) {
3804 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3815 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3821 i
= isl_basic_map_alloc_equality(bmap
);
3824 nparam
= isl_basic_map_n_param(bmap
);
3825 n_in
= isl_basic_map_n_in(bmap
);
3826 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3827 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3828 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3829 return isl_basic_map_finalize(bmap
);
3831 isl_basic_map_free(bmap
);
3835 /* Add a constraints to "bmap" expressing i_pos < o_pos
3837 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3843 i
= isl_basic_map_alloc_inequality(bmap
);
3846 nparam
= isl_basic_map_n_param(bmap
);
3847 n_in
= isl_basic_map_n_in(bmap
);
3848 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3849 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3850 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3851 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3852 return isl_basic_map_finalize(bmap
);
3854 isl_basic_map_free(bmap
);
3858 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3860 static __isl_give isl_basic_map
*var_less_or_equal(
3861 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3867 i
= isl_basic_map_alloc_inequality(bmap
);
3870 nparam
= isl_basic_map_n_param(bmap
);
3871 n_in
= isl_basic_map_n_in(bmap
);
3872 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3873 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3874 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3875 return isl_basic_map_finalize(bmap
);
3877 isl_basic_map_free(bmap
);
3881 /* Add a constraints to "bmap" expressing i_pos > o_pos
3883 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3889 i
= isl_basic_map_alloc_inequality(bmap
);
3892 nparam
= isl_basic_map_n_param(bmap
);
3893 n_in
= isl_basic_map_n_in(bmap
);
3894 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3895 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3896 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3897 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3898 return isl_basic_map_finalize(bmap
);
3900 isl_basic_map_free(bmap
);
3904 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3906 static __isl_give isl_basic_map
*var_more_or_equal(
3907 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3913 i
= isl_basic_map_alloc_inequality(bmap
);
3916 nparam
= isl_basic_map_n_param(bmap
);
3917 n_in
= isl_basic_map_n_in(bmap
);
3918 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3919 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3920 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3921 return isl_basic_map_finalize(bmap
);
3923 isl_basic_map_free(bmap
);
3927 __isl_give isl_basic_map
*isl_basic_map_equal(
3928 __isl_take isl_space
*dim
, unsigned n_equal
)
3931 struct isl_basic_map
*bmap
;
3932 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3935 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3936 bmap
= var_equal(bmap
, i
);
3937 return isl_basic_map_finalize(bmap
);
3940 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3942 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3946 struct isl_basic_map
*bmap
;
3947 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3950 for (i
= 0; i
< pos
&& bmap
; ++i
)
3951 bmap
= var_equal(bmap
, i
);
3953 bmap
= var_less(bmap
, pos
);
3954 return isl_basic_map_finalize(bmap
);
3957 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3959 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3960 __isl_take isl_space
*dim
, unsigned pos
)
3963 isl_basic_map
*bmap
;
3965 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3966 for (i
= 0; i
< pos
; ++i
)
3967 bmap
= var_equal(bmap
, i
);
3968 bmap
= var_less_or_equal(bmap
, pos
);
3969 return isl_basic_map_finalize(bmap
);
3972 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3974 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3978 struct isl_basic_map
*bmap
;
3979 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3982 for (i
= 0; i
< pos
&& bmap
; ++i
)
3983 bmap
= var_equal(bmap
, i
);
3985 bmap
= var_more(bmap
, pos
);
3986 return isl_basic_map_finalize(bmap
);
3989 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3991 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3992 __isl_take isl_space
*dim
, unsigned pos
)
3995 isl_basic_map
*bmap
;
3997 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3998 for (i
= 0; i
< pos
; ++i
)
3999 bmap
= var_equal(bmap
, i
);
4000 bmap
= var_more_or_equal(bmap
, pos
);
4001 return isl_basic_map_finalize(bmap
);
4004 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4005 unsigned n
, int equal
)
4007 struct isl_map
*map
;
4010 if (n
== 0 && equal
)
4011 return isl_map_universe(dims
);
4013 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4015 for (i
= 0; i
+ 1 < n
; ++i
)
4016 map
= isl_map_add_basic_map(map
,
4017 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4020 map
= isl_map_add_basic_map(map
,
4021 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4023 map
= isl_map_add_basic_map(map
,
4024 isl_basic_map_less_at(dims
, n
- 1));
4026 isl_space_free(dims
);
4031 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4035 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4038 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4040 return map_lex_lte_first(dim
, n
, 0);
4043 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4045 return map_lex_lte_first(dim
, n
, 1);
4048 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4050 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4053 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4055 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4058 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4059 unsigned n
, int equal
)
4061 struct isl_map
*map
;
4064 if (n
== 0 && equal
)
4065 return isl_map_universe(dims
);
4067 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4069 for (i
= 0; i
+ 1 < n
; ++i
)
4070 map
= isl_map_add_basic_map(map
,
4071 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4074 map
= isl_map_add_basic_map(map
,
4075 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4077 map
= isl_map_add_basic_map(map
,
4078 isl_basic_map_more_at(dims
, n
- 1));
4080 isl_space_free(dims
);
4085 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4089 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4092 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4094 return map_lex_gte_first(dim
, n
, 0);
4097 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4099 return map_lex_gte_first(dim
, n
, 1);
4102 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4104 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4107 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4109 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4112 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4113 __isl_take isl_set
*set2
)
4116 map
= isl_map_lex_le(isl_set_get_space(set1
));
4117 map
= isl_map_intersect_domain(map
, set1
);
4118 map
= isl_map_intersect_range(map
, set2
);
4122 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4123 __isl_take isl_set
*set2
)
4126 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4127 map
= isl_map_intersect_domain(map
, set1
);
4128 map
= isl_map_intersect_range(map
, set2
);
4132 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4133 __isl_take isl_set
*set2
)
4136 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4137 map
= isl_map_intersect_domain(map
, set1
);
4138 map
= isl_map_intersect_range(map
, set2
);
4142 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4143 __isl_take isl_set
*set2
)
4146 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4147 map
= isl_map_intersect_domain(map
, set1
);
4148 map
= isl_map_intersect_range(map
, set2
);
4152 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4153 __isl_take isl_map
*map2
)
4156 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4157 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4158 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4162 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4163 __isl_take isl_map
*map2
)
4166 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4167 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4168 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4172 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4173 __isl_take isl_map
*map2
)
4176 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4177 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4178 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4182 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4183 __isl_take isl_map
*map2
)
4186 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4187 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4188 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4192 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4193 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4195 struct isl_basic_map
*bmap
;
4197 bset
= isl_basic_set_cow(bset
);
4201 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4202 isl_space_free(bset
->dim
);
4203 bmap
= (struct isl_basic_map
*) bset
;
4205 return isl_basic_map_finalize(bmap
);
4207 isl_basic_set_free(bset
);
4208 isl_space_free(dim
);
4212 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4216 if (bmap
->dim
->n_in
== 0)
4217 return (struct isl_basic_set
*)bmap
;
4218 bmap
= isl_basic_map_cow(bmap
);
4221 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4224 bmap
= isl_basic_map_finalize(bmap
);
4225 return (struct isl_basic_set
*)bmap
;
4227 isl_basic_map_free(bmap
);
4231 /* For a div d = floor(f/m), add the constraints
4234 * -(f-(n-1)) + m d >= 0
4236 * Note that the second constraint is the negation of
4240 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4241 unsigned pos
, isl_int
*div
)
4244 unsigned total
= isl_basic_map_total_dim(bmap
);
4246 i
= isl_basic_map_alloc_inequality(bmap
);
4249 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4250 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4252 j
= isl_basic_map_alloc_inequality(bmap
);
4255 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4256 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4257 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4261 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4262 unsigned pos
, isl_int
*div
)
4264 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4268 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4270 unsigned total
= isl_basic_map_total_dim(bmap
);
4271 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4273 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4277 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4279 return isl_basic_map_add_div_constraints(bset
, div
);
4282 struct isl_basic_set
*isl_basic_map_underlying_set(
4283 struct isl_basic_map
*bmap
)
4287 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4289 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4290 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4291 return (struct isl_basic_set
*)bmap
;
4292 bmap
= isl_basic_map_cow(bmap
);
4295 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4298 bmap
->extra
-= bmap
->n_div
;
4300 bmap
= isl_basic_map_finalize(bmap
);
4301 return (struct isl_basic_set
*)bmap
;
4303 isl_basic_map_free(bmap
);
4307 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4308 __isl_take isl_basic_set
*bset
)
4310 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4313 struct isl_basic_map
*isl_basic_map_overlying_set(
4314 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4316 struct isl_basic_map
*bmap
;
4317 struct isl_ctx
*ctx
;
4324 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4325 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4326 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4328 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4329 isl_basic_map_free(like
);
4330 return (struct isl_basic_map
*)bset
;
4332 bset
= isl_basic_set_cow(bset
);
4335 total
= bset
->dim
->n_out
+ bset
->extra
;
4336 bmap
= (struct isl_basic_map
*)bset
;
4337 isl_space_free(bmap
->dim
);
4338 bmap
->dim
= isl_space_copy(like
->dim
);
4341 bmap
->n_div
= like
->n_div
;
4342 bmap
->extra
+= like
->n_div
;
4346 ltotal
= total
- bmap
->extra
+ like
->extra
;
4349 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4350 bmap
->extra
* (1 + 1 + total
));
4351 if (isl_blk_is_error(bmap
->block2
))
4353 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4357 for (i
= 0; i
< bmap
->extra
; ++i
)
4358 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4359 for (i
= 0; i
< like
->n_div
; ++i
) {
4360 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4361 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4363 bmap
= isl_basic_map_extend_constraints(bmap
,
4364 0, 2 * like
->n_div
);
4365 for (i
= 0; i
< like
->n_div
; ++i
) {
4368 if (isl_int_is_zero(bmap
->div
[i
][0]))
4370 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4371 bmap
= isl_basic_map_free(bmap
);
4374 isl_basic_map_free(like
);
4375 bmap
= isl_basic_map_simplify(bmap
);
4376 bmap
= isl_basic_map_finalize(bmap
);
4379 isl_basic_map_free(like
);
4380 isl_basic_set_free(bset
);
4384 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4385 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4387 return (struct isl_basic_set
*)
4388 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4391 struct isl_set
*isl_set_from_underlying_set(
4392 struct isl_set
*set
, struct isl_basic_set
*like
)
4398 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4400 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4401 isl_basic_set_free(like
);
4404 set
= isl_set_cow(set
);
4407 for (i
= 0; i
< set
->n
; ++i
) {
4408 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4409 isl_basic_set_copy(like
));
4413 isl_space_free(set
->dim
);
4414 set
->dim
= isl_space_copy(like
->dim
);
4417 isl_basic_set_free(like
);
4420 isl_basic_set_free(like
);
4425 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4429 map
= isl_map_cow(map
);
4432 map
->dim
= isl_space_cow(map
->dim
);
4436 for (i
= 1; i
< map
->n
; ++i
)
4437 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4439 for (i
= 0; i
< map
->n
; ++i
) {
4440 map
->p
[i
] = (struct isl_basic_map
*)
4441 isl_basic_map_underlying_set(map
->p
[i
]);
4446 map
->dim
= isl_space_underlying(map
->dim
, 0);
4448 isl_space_free(map
->dim
);
4449 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4453 return (struct isl_set
*)map
;
4459 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4461 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4464 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4465 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4467 bmap
= isl_basic_map_cow(bmap
);
4471 isl_space_free(bmap
->dim
);
4474 bmap
= isl_basic_map_finalize(bmap
);
4478 isl_basic_map_free(bmap
);
4479 isl_space_free(dim
);
4483 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4484 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4486 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4490 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4491 __isl_take isl_space
*dim
)
4495 map
= isl_map_cow(map
);
4499 for (i
= 0; i
< map
->n
; ++i
) {
4500 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4501 isl_space_copy(dim
));
4505 isl_space_free(map
->dim
);
4511 isl_space_free(dim
);
4515 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4516 __isl_take isl_space
*dim
)
4518 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4521 /* Compute the parameter domain of the given basic set.
4523 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4528 if (isl_basic_set_is_params(bset
))
4531 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4532 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4533 space
= isl_basic_set_get_space(bset
);
4534 space
= isl_space_params(space
);
4535 bset
= isl_basic_set_reset_space(bset
, space
);
4539 /* Construct a zero-dimensional basic set with the given parameter domain.
4541 __isl_give isl_basic_set
*isl_basic_set_from_params(
4542 __isl_take isl_basic_set
*bset
)
4545 space
= isl_basic_set_get_space(bset
);
4546 space
= isl_space_set_from_params(space
);
4547 bset
= isl_basic_set_reset_space(bset
, space
);
4551 /* Compute the parameter domain of the given set.
4553 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4558 if (isl_set_is_params(set
))
4561 n
= isl_set_dim(set
, isl_dim_set
);
4562 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4563 space
= isl_set_get_space(set
);
4564 space
= isl_space_params(space
);
4565 set
= isl_set_reset_space(set
, space
);
4569 /* Construct a zero-dimensional set with the given parameter domain.
4571 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4574 space
= isl_set_get_space(set
);
4575 space
= isl_space_set_from_params(space
);
4576 set
= isl_set_reset_space(set
, space
);
4580 /* Compute the parameter domain of the given map.
4582 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4587 n
= isl_map_dim(map
, isl_dim_in
);
4588 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4589 n
= isl_map_dim(map
, isl_dim_out
);
4590 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4591 space
= isl_map_get_space(map
);
4592 space
= isl_space_params(space
);
4593 map
= isl_map_reset_space(map
, space
);
4597 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4600 struct isl_basic_set
*domain
;
4606 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4608 n_in
= isl_basic_map_n_in(bmap
);
4609 n_out
= isl_basic_map_n_out(bmap
);
4610 domain
= isl_basic_set_from_basic_map(bmap
);
4611 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4613 domain
= isl_basic_set_reset_space(domain
, dim
);
4618 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4622 return isl_space_may_be_set(bmap
->dim
);
4625 /* Is this basic map actually a set?
4626 * Users should never call this function. Outside of isl,
4627 * the type should indicate whether something is a set or a map.
4629 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4633 return isl_space_is_set(bmap
->dim
);
4636 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4640 if (isl_basic_map_is_set(bmap
))
4642 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4645 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4646 __isl_take isl_basic_map
*bmap
)
4650 isl_basic_map
*domain
;
4651 int nparam
, n_in
, n_out
;
4654 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4655 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4656 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4658 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4659 domain
= isl_basic_map_universe(dim
);
4661 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4662 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4663 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4665 total
= isl_basic_map_total_dim(bmap
);
4667 for (i
= 0; i
< n_in
; ++i
) {
4668 k
= isl_basic_map_alloc_equality(bmap
);
4671 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4672 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4673 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4676 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4677 return isl_basic_map_finalize(bmap
);
4679 isl_basic_map_free(bmap
);
4683 __isl_give isl_basic_map
*isl_basic_map_range_map(
4684 __isl_take isl_basic_map
*bmap
)
4688 isl_basic_map
*range
;
4689 int nparam
, n_in
, n_out
;
4692 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4693 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4694 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4696 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4697 range
= isl_basic_map_universe(dim
);
4699 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4700 bmap
= isl_basic_map_apply_range(bmap
, range
);
4701 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4703 total
= isl_basic_map_total_dim(bmap
);
4705 for (i
= 0; i
< n_out
; ++i
) {
4706 k
= isl_basic_map_alloc_equality(bmap
);
4709 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4710 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4711 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4714 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4715 return isl_basic_map_finalize(bmap
);
4717 isl_basic_map_free(bmap
);
4721 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4725 return isl_space_may_be_set(map
->dim
);
4728 /* Is this map actually a set?
4729 * Users should never call this function. Outside of isl,
4730 * the type should indicate whether something is a set or a map.
4732 int isl_map_is_set(__isl_keep isl_map
*map
)
4736 return isl_space_is_set(map
->dim
);
4739 struct isl_set
*isl_map_range(struct isl_map
*map
)
4742 struct isl_set
*set
;
4746 if (isl_map_is_set(map
))
4747 return (isl_set
*)map
;
4749 map
= isl_map_cow(map
);
4753 set
= (struct isl_set
*) map
;
4754 set
->dim
= isl_space_range(set
->dim
);
4757 for (i
= 0; i
< map
->n
; ++i
) {
4758 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4762 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4763 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4770 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4773 isl_space
*domain_dim
;
4775 map
= isl_map_cow(map
);
4779 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4780 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4781 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4784 for (i
= 0; i
< map
->n
; ++i
) {
4785 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4789 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4790 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4797 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4800 isl_space
*range_dim
;
4802 map
= isl_map_cow(map
);
4806 range_dim
= isl_space_range(isl_map_get_space(map
));
4807 range_dim
= isl_space_from_range(range_dim
);
4808 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4809 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4812 for (i
= 0; i
< map
->n
; ++i
) {
4813 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4817 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4818 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4825 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4826 __isl_take isl_space
*dim
)
4829 struct isl_map
*map
= NULL
;
4831 set
= isl_set_cow(set
);
4834 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4835 map
= (struct isl_map
*)set
;
4836 for (i
= 0; i
< set
->n
; ++i
) {
4837 map
->p
[i
] = isl_basic_map_from_basic_set(
4838 set
->p
[i
], isl_space_copy(dim
));
4842 isl_space_free(map
->dim
);
4846 isl_space_free(dim
);
4851 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4852 __isl_take isl_basic_set
*bset
)
4854 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4857 __isl_give isl_basic_map
*isl_basic_map_from_range(
4858 __isl_take isl_basic_set
*bset
)
4861 space
= isl_basic_set_get_space(bset
);
4862 space
= isl_space_from_range(space
);
4863 bset
= isl_basic_set_reset_space(bset
, space
);
4864 return (isl_basic_map
*)bset
;
4867 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4870 space
= isl_set_get_space(set
);
4871 space
= isl_space_from_range(space
);
4872 set
= isl_set_reset_space(set
, space
);
4873 return (struct isl_map
*)set
;
4876 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4878 return isl_map_reverse(isl_map_from_range(set
));
4881 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4882 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4884 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4887 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4888 __isl_take isl_set
*range
)
4890 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4893 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4896 struct isl_set
*set
= NULL
;
4900 map
= isl_map_cow(map
);
4903 map
->dim
= isl_space_as_set_space(map
->dim
);
4906 set
= (struct isl_set
*)map
;
4907 for (i
= 0; i
< map
->n
; ++i
) {
4908 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4918 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4921 struct isl_map
*map
;
4926 isl_die(dim
->ctx
, isl_error_internal
,
4927 "negative number of basic maps", goto error
);
4928 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4929 sizeof(struct isl_map
) +
4930 (n
- 1) * sizeof(struct isl_basic_map
*));
4934 map
->ctx
= dim
->ctx
;
4935 isl_ctx_ref(map
->ctx
);
4943 isl_space_free(dim
);
4947 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4948 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4951 struct isl_map
*map
;
4954 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4958 map
= isl_map_alloc_space(dims
, n
, flags
);
4962 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4964 struct isl_basic_map
*bmap
;
4965 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4966 bmap
= isl_basic_map_set_to_empty(bmap
);
4970 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4972 struct isl_basic_set
*bset
;
4973 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4974 bset
= isl_basic_set_set_to_empty(bset
);
4978 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4980 struct isl_basic_map
*bmap
;
4983 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4984 bmap
= isl_basic_map_set_to_empty(bmap
);
4988 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4990 struct isl_basic_map
*bmap
;
4993 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4994 bmap
= isl_basic_map_set_to_empty(bmap
);
4998 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5000 struct isl_basic_set
*bset
;
5003 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5004 bset
= isl_basic_set_set_to_empty(bset
);
5008 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5010 struct isl_basic_map
*bmap
;
5011 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5012 bmap
= isl_basic_map_finalize(bmap
);
5016 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5018 struct isl_basic_set
*bset
;
5019 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5020 bset
= isl_basic_set_finalize(bset
);
5024 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5027 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5028 isl_basic_map
*bmap
;
5030 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5031 for (i
= 0; i
< total
; ++i
) {
5032 int k
= isl_basic_map_alloc_inequality(bmap
);
5035 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5036 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5040 isl_basic_map_free(bmap
);
5044 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5046 return isl_basic_map_nat_universe(dim
);
5049 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5051 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5054 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5056 return isl_map_nat_universe(dim
);
5059 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5060 __isl_keep isl_basic_map
*model
)
5064 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5067 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5071 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5074 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5075 __isl_keep isl_set
*model
)
5079 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5082 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5084 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5087 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5091 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5094 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5098 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5101 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5103 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5106 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5110 return isl_set_empty(isl_space_copy(model
->dim
));
5113 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5115 struct isl_map
*map
;
5118 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5119 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5123 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5125 struct isl_set
*set
;
5128 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5129 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5133 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5137 return isl_set_universe(isl_space_copy(model
->dim
));
5140 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5143 struct isl_map
*dup
;
5147 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5148 for (i
= 0; i
< map
->n
; ++i
)
5149 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5153 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5154 __isl_take isl_basic_map
*bmap
)
5158 if (isl_basic_map_plain_is_empty(bmap
)) {
5159 isl_basic_map_free(bmap
);
5162 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5163 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5164 map
->p
[map
->n
] = bmap
;
5166 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5172 isl_basic_map_free(bmap
);
5176 void *isl_map_free(struct isl_map
*map
)
5186 isl_ctx_deref(map
->ctx
);
5187 for (i
= 0; i
< map
->n
; ++i
)
5188 isl_basic_map_free(map
->p
[i
]);
5189 isl_space_free(map
->dim
);
5195 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5196 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5200 base
= isl_map_cow(base
);
5204 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5207 for (i
= 0; i
< base
->n
; ++i
) {
5208 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5209 isl_space_copy(base
->dim
), 0, 0, 0);
5219 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5220 unsigned nparam
, unsigned dim
)
5222 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5226 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5227 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5231 bmap
= isl_basic_map_cow(bmap
);
5232 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5233 j
= isl_basic_map_alloc_equality(bmap
);
5236 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5237 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5238 isl_int_set_si(bmap
->eq
[j
][0], value
);
5239 bmap
= isl_basic_map_simplify(bmap
);
5240 return isl_basic_map_finalize(bmap
);
5242 isl_basic_map_free(bmap
);
5246 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5247 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5251 bmap
= isl_basic_map_cow(bmap
);
5252 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5253 j
= isl_basic_map_alloc_equality(bmap
);
5256 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5257 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5258 isl_int_set(bmap
->eq
[j
][0], value
);
5259 bmap
= isl_basic_map_simplify(bmap
);
5260 return isl_basic_map_finalize(bmap
);
5262 isl_basic_map_free(bmap
);
5266 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5267 enum isl_dim_type type
, unsigned pos
, int value
)
5271 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5272 return isl_basic_map_fix_pos_si(bmap
,
5273 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5275 isl_basic_map_free(bmap
);
5279 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5280 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5284 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5285 return isl_basic_map_fix_pos(bmap
,
5286 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5288 isl_basic_map_free(bmap
);
5292 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5293 enum isl_dim_type type
, unsigned pos
, int value
)
5295 return (struct isl_basic_set
*)
5296 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5300 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5301 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5303 return (struct isl_basic_set
*)
5304 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5308 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5309 unsigned input
, int value
)
5311 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5314 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5315 unsigned dim
, int value
)
5317 return (struct isl_basic_set
*)
5318 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5319 isl_dim_set
, dim
, value
);
5322 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5324 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5331 isl_basic_map_free(map
->p
[i
]);
5332 if (i
!= map
->n
- 1) {
5333 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5334 map
->p
[i
] = map
->p
[map
->n
- 1];
5341 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5342 enum isl_dim_type type
, unsigned pos
, int value
)
5346 map
= isl_map_cow(map
);
5350 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5351 for (i
= map
->n
- 1; i
>= 0; --i
) {
5352 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5353 if (remove_if_empty(map
, i
) < 0)
5356 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5363 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5364 enum isl_dim_type type
, unsigned pos
, int value
)
5366 return (struct isl_set
*)
5367 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5370 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5371 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5375 map
= isl_map_cow(map
);
5379 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5380 for (i
= 0; i
< map
->n
; ++i
) {
5381 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5385 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5392 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5393 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5395 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5398 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5399 unsigned input
, int value
)
5401 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5404 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5406 return (struct isl_set
*)
5407 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5410 static __isl_give isl_basic_map
*basic_map_bound_si(
5411 __isl_take isl_basic_map
*bmap
,
5412 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5418 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5419 pos
+= isl_basic_map_offset(bmap
, type
);
5420 bmap
= isl_basic_map_cow(bmap
);
5421 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5422 j
= isl_basic_map_alloc_inequality(bmap
);
5425 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5427 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5428 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5430 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5431 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5433 bmap
= isl_basic_map_simplify(bmap
);
5434 return isl_basic_map_finalize(bmap
);
5436 isl_basic_map_free(bmap
);
5440 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5441 __isl_take isl_basic_map
*bmap
,
5442 enum isl_dim_type type
, unsigned pos
, int value
)
5444 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5447 /* Constrain the values of the given dimension to be no greater than "value".
5449 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5450 __isl_take isl_basic_map
*bmap
,
5451 enum isl_dim_type type
, unsigned pos
, int value
)
5453 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5456 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5457 unsigned dim
, isl_int value
)
5461 bset
= isl_basic_set_cow(bset
);
5462 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5463 j
= isl_basic_set_alloc_inequality(bset
);
5466 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5467 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5468 isl_int_neg(bset
->ineq
[j
][0], value
);
5469 bset
= isl_basic_set_simplify(bset
);
5470 return isl_basic_set_finalize(bset
);
5472 isl_basic_set_free(bset
);
5476 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5477 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5481 map
= isl_map_cow(map
);
5485 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5486 for (i
= 0; i
< map
->n
; ++i
) {
5487 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5488 type
, pos
, value
, upper
);
5492 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5499 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5500 enum isl_dim_type type
, unsigned pos
, int value
)
5502 return map_bound_si(map
, type
, pos
, value
, 0);
5505 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5506 enum isl_dim_type type
, unsigned pos
, int value
)
5508 return map_bound_si(map
, type
, pos
, value
, 1);
5511 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5512 enum isl_dim_type type
, unsigned pos
, int value
)
5514 return (struct isl_set
*)
5515 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5518 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5519 enum isl_dim_type type
, unsigned pos
, int value
)
5521 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5524 /* Bound the given variable of "bmap" from below (or above is "upper"
5525 * is set) to "value".
5527 static __isl_give isl_basic_map
*basic_map_bound(
5528 __isl_take isl_basic_map
*bmap
,
5529 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5535 if (pos
>= isl_basic_map_dim(bmap
, type
))
5536 isl_die(bmap
->ctx
, isl_error_invalid
,
5537 "index out of bounds", goto error
);
5538 pos
+= isl_basic_map_offset(bmap
, type
);
5539 bmap
= isl_basic_map_cow(bmap
);
5540 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5541 j
= isl_basic_map_alloc_inequality(bmap
);
5544 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5546 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5547 isl_int_set(bmap
->ineq
[j
][0], value
);
5549 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5550 isl_int_neg(bmap
->ineq
[j
][0], value
);
5552 bmap
= isl_basic_map_simplify(bmap
);
5553 return isl_basic_map_finalize(bmap
);
5555 isl_basic_map_free(bmap
);
5559 /* Bound the given variable of "map" from below (or above is "upper"
5560 * is set) to "value".
5562 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5563 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5567 map
= isl_map_cow(map
);
5571 if (pos
>= isl_map_dim(map
, type
))
5572 isl_die(map
->ctx
, isl_error_invalid
,
5573 "index out of bounds", goto error
);
5574 for (i
= map
->n
- 1; i
>= 0; --i
) {
5575 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5576 if (remove_if_empty(map
, i
) < 0)
5579 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5586 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5587 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5589 return map_bound(map
, type
, pos
, value
, 0);
5592 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5593 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5595 return map_bound(map
, type
, pos
, value
, 1);
5598 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5599 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5601 return isl_map_lower_bound(set
, type
, pos
, value
);
5604 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5605 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5607 return isl_map_upper_bound(set
, type
, pos
, value
);
5610 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5615 set
= isl_set_cow(set
);
5619 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5620 for (i
= 0; i
< set
->n
; ++i
) {
5621 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5631 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5635 map
= isl_map_cow(map
);
5639 map
->dim
= isl_space_reverse(map
->dim
);
5642 for (i
= 0; i
< map
->n
; ++i
) {
5643 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5647 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5654 static struct isl_map
*isl_basic_map_partial_lexopt(
5655 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5656 struct isl_set
**empty
, int max
)
5660 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5661 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5663 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5665 isl_basic_map_free(bmap
);
5666 isl_basic_set_free(dom
);
5672 struct isl_map
*isl_basic_map_partial_lexmax(
5673 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5674 struct isl_set
**empty
)
5676 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5679 struct isl_map
*isl_basic_map_partial_lexmin(
5680 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5681 struct isl_set
**empty
)
5683 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5686 struct isl_set
*isl_basic_set_partial_lexmin(
5687 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5688 struct isl_set
**empty
)
5690 return (struct isl_set
*)
5691 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5695 struct isl_set
*isl_basic_set_partial_lexmax(
5696 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5697 struct isl_set
**empty
)
5699 return (struct isl_set
*)
5700 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5704 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5705 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5706 __isl_give isl_set
**empty
)
5708 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5711 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5712 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5713 __isl_give isl_set
**empty
)
5715 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5718 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5719 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5720 __isl_give isl_set
**empty
)
5722 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5725 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5726 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5727 __isl_give isl_set
**empty
)
5729 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5732 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5733 __isl_take isl_basic_map
*bmap
, int max
)
5735 isl_basic_set
*dom
= NULL
;
5736 isl_space
*dom_space
;
5740 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5741 dom
= isl_basic_set_universe(dom_space
);
5742 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5744 isl_basic_map_free(bmap
);
5748 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5749 __isl_take isl_basic_map
*bmap
)
5751 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5755 #define TYPE isl_pw_multi_aff
5757 #define SUFFIX _pw_multi_aff
5759 #define EMPTY isl_pw_multi_aff_empty
5761 #define ADD isl_pw_multi_aff_union_add
5762 #include "isl_map_lexopt_templ.c"
5764 /* Given a map "map", compute the lexicographically minimal
5765 * (or maximal) image element for each domain element in dom,
5766 * in the form of an isl_pw_multi_aff.
5767 * Set *empty to those elements in dom that do not have an image element.
5769 * We first compute the lexicographically minimal or maximal element
5770 * in the first basic map. This results in a partial solution "res"
5771 * and a subset "todo" of dom that still need to be handled.
5772 * We then consider each of the remaining maps in "map" and successively
5773 * update both "res" and "todo".
5775 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5776 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5777 __isl_give isl_set
**empty
, int max
)
5780 isl_pw_multi_aff
*res
;
5786 if (isl_map_plain_is_empty(map
)) {
5791 return isl_pw_multi_aff_from_map(map
);
5794 res
= basic_map_partial_lexopt_pw_multi_aff(
5795 isl_basic_map_copy(map
->p
[0]),
5796 isl_set_copy(dom
), &todo
, max
);
5798 for (i
= 1; i
< map
->n
; ++i
) {
5799 isl_pw_multi_aff
*res_i
;
5802 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5803 isl_basic_map_copy(map
->p
[i
]),
5804 isl_set_copy(dom
), &todo_i
, max
);
5807 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5809 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5811 todo
= isl_set_intersect(todo
, todo_i
);
5832 #define TYPE isl_map
5836 #define EMPTY isl_map_empty
5838 #define ADD isl_map_union_disjoint
5839 #include "isl_map_lexopt_templ.c"
5841 /* Given a map "map", compute the lexicographically minimal
5842 * (or maximal) image element for each domain element in dom.
5843 * Set *empty to those elements in dom that do not have an image element.
5845 * We first compute the lexicographically minimal or maximal element
5846 * in the first basic map. This results in a partial solution "res"
5847 * and a subset "todo" of dom that still need to be handled.
5848 * We then consider each of the remaining maps in "map" and successively
5849 * update both "res" and "todo".
5851 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5852 * Assume we are computing the lexicographical maximum.
5853 * We first compute the lexicographically maximal element in basic map i.
5854 * This results in a partial solution res_i and a subset todo_i.
5855 * Then we combine these results with those obtain for the first k basic maps
5856 * to obtain a result that is valid for the first k+1 basic maps.
5857 * In particular, the set where there is no solution is the set where
5858 * there is no solution for the first k basic maps and also no solution
5859 * for the ith basic map, i.e.,
5861 * todo^i = todo^k * todo_i
5863 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5864 * solutions, arbitrarily breaking ties in favor of res^k.
5865 * That is, when res^k(a) >= res_i(a), we pick res^k and
5866 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5867 * the lexicographic order.)
5868 * In practice, we compute
5870 * res^k * (res_i . "<=")
5874 * res_i * (res^k . "<")
5876 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5877 * where only one of res^k and res_i provides a solution and we simply pick
5884 * Note that we only compute these intersections when dom(res^k) intersects
5885 * dom(res_i). Otherwise, the only effect of these intersections is to
5886 * potentially break up res^k and res_i into smaller pieces.
5887 * We want to avoid such splintering as much as possible.
5888 * In fact, an earlier implementation of this function would look for
5889 * better results in the domain of res^k and for extra results in todo^k,
5890 * but this would always result in a splintering according to todo^k,
5891 * even when the domain of basic map i is disjoint from the domains of
5892 * the previous basic maps.
5894 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5895 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5896 __isl_give isl_set
**empty
, int max
)
5899 struct isl_map
*res
;
5900 struct isl_set
*todo
;
5905 if (isl_map_plain_is_empty(map
)) {
5913 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5914 isl_set_copy(dom
), &todo
, max
);
5916 for (i
= 1; i
< map
->n
; ++i
) {
5920 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5922 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5923 isl_set_copy(dom
), &todo_i
, max
);
5926 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5927 le
= isl_map_lex_le(dim
);
5929 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5930 le
= isl_map_lex_ge(dim
);
5932 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5933 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5934 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5935 le
= isl_map_intersect(le
, isl_map_copy(res
));
5937 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5938 res
= isl_map_intersect_domain(res
,
5939 isl_set_copy(todo_i
));
5940 res_i
= isl_map_intersect_domain(res_i
,
5941 isl_set_copy(todo
));
5944 res
= isl_map_union_disjoint(res
, res_i
);
5945 res
= isl_map_union_disjoint(res
, lt
);
5946 res
= isl_map_union_disjoint(res
, le
);
5948 todo
= isl_set_intersect(todo
, todo_i
);
5968 __isl_give isl_map
*isl_map_partial_lexmax(
5969 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5970 __isl_give isl_set
**empty
)
5972 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5975 __isl_give isl_map
*isl_map_partial_lexmin(
5976 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5977 __isl_give isl_set
**empty
)
5979 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5982 __isl_give isl_set
*isl_set_partial_lexmin(
5983 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5984 __isl_give isl_set
**empty
)
5986 return (struct isl_set
*)
5987 isl_map_partial_lexmin((struct isl_map
*)set
,
5991 __isl_give isl_set
*isl_set_partial_lexmax(
5992 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5993 __isl_give isl_set
**empty
)
5995 return (struct isl_set
*)
5996 isl_map_partial_lexmax((struct isl_map
*)set
,
6000 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6002 struct isl_basic_set
*dom
= NULL
;
6007 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
6008 dom
= isl_basic_set_universe(dom_dim
);
6009 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6011 isl_basic_map_free(bmap
);
6015 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6017 return isl_basic_map_lexopt(bmap
, 0);
6020 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6022 return isl_basic_map_lexopt(bmap
, 1);
6025 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6027 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6030 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6032 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6035 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
6037 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
6040 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
6042 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
6045 /* Extract the first and only affine expression from list
6046 * and then add it to *pwaff with the given dom.
6047 * This domain is known to be disjoint from other domains
6048 * because of the way isl_basic_map_foreach_lexmax works.
6050 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6051 __isl_take isl_aff_list
*list
, void *user
)
6053 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6055 isl_pw_aff
**pwaff
= user
;
6056 isl_pw_aff
*pwaff_i
;
6060 if (isl_aff_list_n_aff(list
) != 1)
6061 isl_die(ctx
, isl_error_internal
,
6062 "expecting single element list", goto error
);
6064 aff
= isl_aff_list_get_aff(list
, 0);
6065 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6067 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6069 isl_aff_list_free(list
);
6073 isl_basic_set_free(dom
);
6074 isl_aff_list_free(list
);
6078 /* Given a basic map with one output dimension, compute the minimum or
6079 * maximum of that dimension as an isl_pw_aff.
6081 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6082 * call update_dim_opt on each leaf of the result.
6084 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6087 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6091 dim
= isl_space_from_domain(isl_space_domain(dim
));
6092 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6093 pwaff
= isl_pw_aff_empty(dim
);
6095 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6097 return isl_pw_aff_free(pwaff
);
6102 /* Compute the minimum or maximum of the given output dimension
6103 * as a function of the parameters and the input dimensions,
6104 * but independently of the other output dimensions.
6106 * We first project out the other output dimension and then compute
6107 * the "lexicographic" maximum in each basic map, combining the results
6108 * using isl_pw_aff_union_max.
6110 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6117 n_out
= isl_map_dim(map
, isl_dim_out
);
6118 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6119 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6124 isl_space
*dim
= isl_map_get_space(map
);
6125 dim
= isl_space_domain(isl_space_from_range(dim
));
6127 return isl_pw_aff_empty(dim
);
6130 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6131 for (i
= 1; i
< map
->n
; ++i
) {
6132 isl_pw_aff
*pwaff_i
;
6134 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6135 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6143 /* Compute the maximum of the given output dimension as a function of the
6144 * parameters and input dimensions, but independently of
6145 * the other output dimensions.
6147 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6149 return map_dim_opt(map
, pos
, 1);
6152 /* Compute the minimum or maximum of the given set dimension
6153 * as a function of the parameters,
6154 * but independently of the other set dimensions.
6156 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6159 return map_dim_opt(set
, pos
, max
);
6162 /* Compute the maximum of the given set dimension as a function of the
6163 * parameters, but independently of the other set dimensions.
6165 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6167 return set_dim_opt(set
, pos
, 1);
6170 /* Compute the minimum of the given set dimension as a function of the
6171 * parameters, but independently of the other set dimensions.
6173 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6175 return set_dim_opt(set
, pos
, 0);
6178 /* Apply a preimage specified by "mat" on the parameters of "bset".
6179 * bset is assumed to have only parameters and divs.
6181 static struct isl_basic_set
*basic_set_parameter_preimage(
6182 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6189 bset
->dim
= isl_space_cow(bset
->dim
);
6193 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6195 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6197 bset
->dim
->nparam
= 0;
6198 bset
->dim
->n_out
= nparam
;
6199 bset
= isl_basic_set_preimage(bset
, mat
);
6201 bset
->dim
->nparam
= bset
->dim
->n_out
;
6202 bset
->dim
->n_out
= 0;
6207 isl_basic_set_free(bset
);
6211 /* Apply a preimage specified by "mat" on the parameters of "set".
6212 * set is assumed to have only parameters and divs.
6214 static struct isl_set
*set_parameter_preimage(
6215 struct isl_set
*set
, struct isl_mat
*mat
)
6217 isl_space
*dim
= NULL
;
6223 dim
= isl_space_copy(set
->dim
);
6224 dim
= isl_space_cow(dim
);
6228 nparam
= isl_set_dim(set
, isl_dim_param
);
6230 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6233 dim
->n_out
= nparam
;
6234 isl_set_reset_space(set
, dim
);
6235 set
= isl_set_preimage(set
, mat
);
6238 dim
= isl_space_copy(set
->dim
);
6239 dim
= isl_space_cow(dim
);
6242 dim
->nparam
= dim
->n_out
;
6244 isl_set_reset_space(set
, dim
);
6247 isl_space_free(dim
);
6254 /* Intersect the basic set "bset" with the affine space specified by the
6255 * equalities in "eq".
6257 static struct isl_basic_set
*basic_set_append_equalities(
6258 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6266 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6271 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6272 for (i
= 0; i
< eq
->n_row
; ++i
) {
6273 k
= isl_basic_set_alloc_equality(bset
);
6276 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6277 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6281 bset
= isl_basic_set_gauss(bset
, NULL
);
6282 bset
= isl_basic_set_finalize(bset
);
6287 isl_basic_set_free(bset
);
6291 /* Intersect the set "set" with the affine space specified by the
6292 * equalities in "eq".
6294 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6302 for (i
= 0; i
< set
->n
; ++i
) {
6303 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6316 /* Project the given basic set onto its parameter domain, possibly introducing
6317 * new, explicit, existential variables in the constraints.
6318 * The input has parameters and (possibly implicit) existential variables.
6319 * The output has the same parameters, but only
6320 * explicit existentially quantified variables.
6322 * The actual projection is performed by pip, but pip doesn't seem
6323 * to like equalities very much, so we first remove the equalities
6324 * among the parameters by performing a variable compression on
6325 * the parameters. Afterward, an inverse transformation is performed
6326 * and the equalities among the parameters are inserted back in.
6328 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6332 struct isl_mat
*T
, *T2
;
6333 struct isl_set
*set
;
6334 unsigned nparam
, n_div
;
6336 bset
= isl_basic_set_cow(bset
);
6340 if (bset
->n_eq
== 0)
6341 return isl_basic_set_lexmin(bset
);
6343 bset
= isl_basic_set_gauss(bset
, NULL
);
6346 if (isl_basic_set_plain_is_empty(bset
))
6347 return isl_set_from_basic_set(bset
);
6349 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6350 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6352 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6353 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6356 if (i
== bset
->n_eq
)
6357 return isl_basic_set_lexmin(bset
);
6359 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6361 eq
= isl_mat_cow(eq
);
6362 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6363 if (T
&& T
->n_col
== 0) {
6367 bset
= isl_basic_set_set_to_empty(bset
);
6368 return isl_set_from_basic_set(bset
);
6370 bset
= basic_set_parameter_preimage(bset
, T
);
6372 set
= isl_basic_set_lexmin(bset
);
6373 set
= set_parameter_preimage(set
, T2
);
6374 set
= set_append_equalities(set
, eq
);
6378 /* Compute an explicit representation for all the existentially
6379 * quantified variables.
6380 * The input and output dimensions are first turned into parameters.
6381 * compute_divs then returns a map with the same parameters and
6382 * no input or output dimensions and the dimension specification
6383 * is reset to that of the input.
6385 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6387 struct isl_basic_set
*bset
;
6388 struct isl_set
*set
;
6389 struct isl_map
*map
;
6390 isl_space
*dim
, *orig_dim
= NULL
;
6395 bmap
= isl_basic_map_cow(bmap
);
6399 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6400 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6401 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6402 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6406 orig_dim
= bmap
->dim
;
6408 bset
= (struct isl_basic_set
*)bmap
;
6410 set
= parameter_compute_divs(bset
);
6411 map
= (struct isl_map
*)set
;
6412 map
= isl_map_reset_space(map
, orig_dim
);
6416 isl_basic_map_free(bmap
);
6420 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6428 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6429 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6430 if (isl_int_is_zero(bmap
->div
[i
][0]))
6432 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6438 static int map_divs_known(__isl_keep isl_map
*map
)
6445 for (i
= 0; i
< map
->n
; ++i
) {
6446 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6454 /* If bmap contains any unknown divs, then compute explicit
6455 * expressions for them. However, this computation may be
6456 * quite expensive, so first try to remove divs that aren't
6459 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6462 struct isl_map
*map
;
6464 known
= isl_basic_map_divs_known(bmap
);
6468 return isl_map_from_basic_map(bmap
);
6470 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6472 known
= isl_basic_map_divs_known(bmap
);
6476 return isl_map_from_basic_map(bmap
);
6478 map
= compute_divs(bmap
);
6481 isl_basic_map_free(bmap
);
6485 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6489 struct isl_map
*res
;
6496 known
= map_divs_known(map
);
6504 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6505 for (i
= 1 ; i
< map
->n
; ++i
) {
6507 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6508 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6509 res
= isl_map_union_disjoint(res
, r2
);
6511 res
= isl_map_union(res
, r2
);
6518 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6520 return (struct isl_set
*)
6521 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6524 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6526 return (struct isl_set
*)
6527 isl_map_compute_divs((struct isl_map
*)set
);
6530 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6533 struct isl_set
*set
;
6538 map
= isl_map_cow(map
);
6542 set
= (struct isl_set
*)map
;
6543 set
->dim
= isl_space_domain(set
->dim
);
6546 for (i
= 0; i
< map
->n
; ++i
) {
6547 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6551 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6552 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6559 /* Return the union of "map1" and "map2", where we assume for now that
6560 * "map1" and "map2" are disjoint. Note that the basic maps inside
6561 * "map1" or "map2" may not be disjoint from each other.
6562 * Also note that this function is also called from isl_map_union,
6563 * which takes care of handling the situation where "map1" and "map2"
6564 * may not be disjoint.
6566 * If one of the inputs is empty, we can simply return the other input.
6567 * Similarly, if one of the inputs is universal, then it is equal to the union.
6569 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6570 __isl_take isl_map
*map2
)
6574 struct isl_map
*map
= NULL
;
6589 is_universe
= isl_map_plain_is_universe(map1
);
6590 if (is_universe
< 0)
6597 is_universe
= isl_map_plain_is_universe(map2
);
6598 if (is_universe
< 0)
6605 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6607 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6608 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6609 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6611 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6612 map1
->n
+ map2
->n
, flags
);
6615 for (i
= 0; i
< map1
->n
; ++i
) {
6616 map
= isl_map_add_basic_map(map
,
6617 isl_basic_map_copy(map1
->p
[i
]));
6621 for (i
= 0; i
< map2
->n
; ++i
) {
6622 map
= isl_map_add_basic_map(map
,
6623 isl_basic_map_copy(map2
->p
[i
]));
6637 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6638 __isl_take isl_map
*map2
)
6640 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6643 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6645 map1
= isl_map_union_disjoint(map1
, map2
);
6649 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6653 struct isl_set
*isl_set_union_disjoint(
6654 struct isl_set
*set1
, struct isl_set
*set2
)
6656 return (struct isl_set
*)
6657 isl_map_union_disjoint(
6658 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6661 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6663 return (struct isl_set
*)
6664 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6667 /* Apply "fn" to pairs of elements from "map" and "set" and collect
6670 * "map" and "set" are assumed to be compatible and non-NULL.
6672 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
6673 __isl_take isl_set
*set
,
6674 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
6675 __isl_take isl_basic_set
*bset
))
6678 struct isl_map
*result
;
6681 if (isl_set_plain_is_universe(set
)) {
6686 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6687 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6688 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6690 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6691 map
->n
* set
->n
, flags
);
6692 for (i
= 0; result
&& i
< map
->n
; ++i
)
6693 for (j
= 0; j
< set
->n
; ++j
) {
6694 result
= isl_map_add_basic_map(result
,
6695 fn(isl_basic_map_copy(map
->p
[i
]),
6696 isl_basic_set_copy(set
->p
[j
])));
6706 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6707 __isl_take isl_set
*set
)
6712 if (!isl_map_compatible_range(map
, set
))
6713 isl_die(set
->ctx
, isl_error_invalid
,
6714 "incompatible spaces", goto error
);
6716 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
6723 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6724 __isl_take isl_set
*set
)
6726 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6729 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
6730 __isl_take isl_set
*set
)
6735 if (!isl_map_compatible_domain(map
, set
))
6736 isl_die(set
->ctx
, isl_error_invalid
,
6737 "incompatible spaces", goto error
);
6739 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
6746 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
6747 __isl_take isl_set
*set
)
6749 return isl_map_align_params_map_map_and(map
, set
,
6750 &map_intersect_domain
);
6753 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6754 __isl_take isl_map
*map2
)
6758 map1
= isl_map_reverse(map1
);
6759 map1
= isl_map_apply_range(map1
, map2
);
6760 return isl_map_reverse(map1
);
6767 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6768 __isl_take isl_map
*map2
)
6770 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6773 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6774 __isl_take isl_map
*map2
)
6776 isl_space
*dim_result
;
6777 struct isl_map
*result
;
6783 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6784 isl_space_copy(map2
->dim
));
6786 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6789 for (i
= 0; i
< map1
->n
; ++i
)
6790 for (j
= 0; j
< map2
->n
; ++j
) {
6791 result
= isl_map_add_basic_map(result
,
6792 isl_basic_map_apply_range(
6793 isl_basic_map_copy(map1
->p
[i
]),
6794 isl_basic_map_copy(map2
->p
[j
])));
6800 if (result
&& result
->n
<= 1)
6801 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6809 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6810 __isl_take isl_map
*map2
)
6812 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6816 * returns range - domain
6818 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6820 isl_space
*dims
, *target_dim
;
6821 struct isl_basic_set
*bset
;
6828 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6829 bmap
->dim
, isl_dim_out
),
6831 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6832 dim
= isl_basic_map_n_in(bmap
);
6833 nparam
= isl_basic_map_n_param(bmap
);
6834 bset
= isl_basic_set_from_basic_map(bmap
);
6835 bset
= isl_basic_set_cow(bset
);
6836 dims
= isl_basic_set_get_space(bset
);
6837 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6838 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6839 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6840 for (i
= 0; i
< dim
; ++i
) {
6841 int j
= isl_basic_map_alloc_equality(
6842 (struct isl_basic_map
*)bset
);
6844 bset
= isl_basic_set_free(bset
);
6847 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6848 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6849 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6850 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6852 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6853 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6856 isl_basic_map_free(bmap
);
6861 * returns range - domain
6863 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6867 struct isl_set
*result
;
6872 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6873 map
->dim
, isl_dim_out
),
6875 dim
= isl_map_get_space(map
);
6876 dim
= isl_space_domain(dim
);
6877 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6880 for (i
= 0; i
< map
->n
; ++i
)
6881 result
= isl_set_add_basic_set(result
,
6882 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6891 * returns [domain -> range] -> range - domain
6893 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6894 __isl_take isl_basic_map
*bmap
)
6898 isl_basic_map
*domain
;
6902 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6903 isl_die(bmap
->ctx
, isl_error_invalid
,
6904 "domain and range don't match", goto error
);
6906 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6907 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6909 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6910 domain
= isl_basic_map_universe(dim
);
6912 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6913 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6914 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6916 total
= isl_basic_map_total_dim(bmap
);
6918 for (i
= 0; i
< n
; ++i
) {
6919 k
= isl_basic_map_alloc_equality(bmap
);
6922 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6923 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6924 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6925 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6928 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6929 return isl_basic_map_finalize(bmap
);
6931 isl_basic_map_free(bmap
);
6936 * returns [domain -> range] -> range - domain
6938 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6941 isl_space
*domain_dim
;
6946 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6947 isl_die(map
->ctx
, isl_error_invalid
,
6948 "domain and range don't match", goto error
);
6950 map
= isl_map_cow(map
);
6954 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6955 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6956 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6959 for (i
= 0; i
< map
->n
; ++i
) {
6960 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6964 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6971 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6973 struct isl_basic_map
*bmap
;
6981 nparam
= dims
->nparam
;
6983 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6987 for (i
= 0; i
< dim
; ++i
) {
6988 int j
= isl_basic_map_alloc_equality(bmap
);
6991 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6992 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6993 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6995 return isl_basic_map_finalize(bmap
);
6997 isl_basic_map_free(bmap
);
7001 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7005 if (dim
->n_in
!= dim
->n_out
)
7006 isl_die(dim
->ctx
, isl_error_invalid
,
7007 "number of input and output dimensions needs to be "
7008 "the same", goto error
);
7009 return basic_map_identity(dim
);
7011 isl_space_free(dim
);
7015 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7017 if (!model
|| !model
->dim
)
7019 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7022 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7024 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7027 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7029 if (!model
|| !model
->dim
)
7031 return isl_map_identity(isl_space_copy(model
->dim
));
7034 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7036 if (!model
|| !model
->dim
)
7038 return isl_map_identity(isl_space_copy(model
->dim
));
7041 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7043 isl_space
*dim
= isl_set_get_space(set
);
7045 id
= isl_map_identity(isl_space_map_from_set(dim
));
7046 return isl_map_intersect_range(id
, set
);
7049 /* Construct a basic set with all set dimensions having only non-negative
7052 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7053 __isl_take isl_space
*space
)
7058 struct isl_basic_set
*bset
;
7062 nparam
= space
->nparam
;
7064 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7067 for (i
= 0; i
< dim
; ++i
) {
7068 int k
= isl_basic_set_alloc_inequality(bset
);
7071 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7072 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7076 isl_basic_set_free(bset
);
7080 /* Construct the half-space x_pos >= 0.
7082 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7086 isl_basic_set
*nonneg
;
7088 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7089 k
= isl_basic_set_alloc_inequality(nonneg
);
7092 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7093 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7095 return isl_basic_set_finalize(nonneg
);
7097 isl_basic_set_free(nonneg
);
7101 /* Construct the half-space x_pos <= -1.
7103 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7108 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7109 k
= isl_basic_set_alloc_inequality(neg
);
7112 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7113 isl_int_set_si(neg
->ineq
[k
][0], -1);
7114 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7116 return isl_basic_set_finalize(neg
);
7118 isl_basic_set_free(neg
);
7122 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7123 enum isl_dim_type type
, unsigned first
, unsigned n
)
7126 isl_basic_set
*nonneg
;
7134 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7136 for (i
= 0; i
< n
; ++i
) {
7137 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7138 pos(set
->dim
, type
) + first
+ i
);
7139 neg
= neg_halfspace(isl_set_get_space(set
),
7140 pos(set
->dim
, type
) + first
+ i
);
7142 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7151 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7152 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7159 if (isl_set_plain_is_empty(set
)) {
7164 return fn(set
, signs
, user
);
7167 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7169 half
= isl_set_intersect(half
, isl_set_copy(set
));
7170 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7174 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7176 half
= isl_set_intersect(half
, set
);
7177 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7183 /* Call "fn" on the intersections of "set" with each of the orthants
7184 * (except for obviously empty intersections). The orthant is identified
7185 * by the signs array, with each entry having value 1 or -1 according
7186 * to the sign of the corresponding variable.
7188 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7189 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7199 if (isl_set_plain_is_empty(set
))
7202 nparam
= isl_set_dim(set
, isl_dim_param
);
7203 nvar
= isl_set_dim(set
, isl_dim_set
);
7205 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7207 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7215 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7217 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7220 int isl_basic_map_is_subset(
7221 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7224 struct isl_map
*map1
;
7225 struct isl_map
*map2
;
7227 if (!bmap1
|| !bmap2
)
7230 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7231 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7233 is_subset
= isl_map_is_subset(map1
, map2
);
7241 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7242 __isl_keep isl_basic_set
*bset2
)
7244 return isl_basic_map_is_subset(bset1
, bset2
);
7247 int isl_basic_map_is_equal(
7248 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7252 if (!bmap1
|| !bmap2
)
7254 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7257 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7261 int isl_basic_set_is_equal(
7262 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7264 return isl_basic_map_is_equal(
7265 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7268 int isl_map_is_empty(struct isl_map
*map
)
7275 for (i
= 0; i
< map
->n
; ++i
) {
7276 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7285 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7287 return map
? map
->n
== 0 : -1;
7290 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7292 return isl_map_plain_is_empty(map
);
7295 int isl_set_plain_is_empty(struct isl_set
*set
)
7297 return set
? set
->n
== 0 : -1;
7300 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7302 return isl_set_plain_is_empty(set
);
7305 int isl_set_is_empty(struct isl_set
*set
)
7307 return isl_map_is_empty((struct isl_map
*)set
);
7310 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7315 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7318 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7323 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7326 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7332 is_subset
= isl_map_is_subset(map1
, map2
);
7335 is_subset
= isl_map_is_subset(map2
, map1
);
7339 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7341 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7344 int isl_basic_map_is_strict_subset(
7345 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7349 if (!bmap1
|| !bmap2
)
7351 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7354 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7355 if (is_subset
== -1)
7360 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7366 is_subset
= isl_map_is_subset(map1
, map2
);
7369 is_subset
= isl_map_is_subset(map2
, map1
);
7370 if (is_subset
== -1)
7375 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7377 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7380 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7384 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7387 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7391 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7394 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7401 for (i
= 0; i
< map
->n
; ++i
) {
7402 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7410 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7412 return isl_map_plain_is_universe((isl_map
*) set
);
7415 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7417 return isl_set_plain_is_universe(set
);
7420 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7422 struct isl_basic_set
*bset
= NULL
;
7423 struct isl_vec
*sample
= NULL
;
7430 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7433 if (isl_basic_map_is_universe(bmap
))
7436 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7437 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7438 copy
= isl_basic_map_remove_redundancies(copy
);
7439 empty
= isl_basic_map_plain_is_empty(copy
);
7440 isl_basic_map_free(copy
);
7444 total
= 1 + isl_basic_map_total_dim(bmap
);
7445 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7446 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7452 isl_vec_free(bmap
->sample
);
7453 bmap
->sample
= NULL
;
7454 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7457 sample
= isl_basic_set_sample_vec(bset
);
7460 empty
= sample
->size
== 0;
7461 isl_vec_free(bmap
->sample
);
7462 bmap
->sample
= sample
;
7464 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7469 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7473 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7476 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7478 return isl_basic_map_plain_is_empty(bmap
);
7481 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7485 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7488 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7490 return isl_basic_set_plain_is_empty(bset
);
7493 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7495 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7498 struct isl_map
*isl_basic_map_union(
7499 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7501 struct isl_map
*map
;
7502 if (!bmap1
|| !bmap2
)
7505 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7507 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7510 map
= isl_map_add_basic_map(map
, bmap1
);
7511 map
= isl_map_add_basic_map(map
, bmap2
);
7514 isl_basic_map_free(bmap1
);
7515 isl_basic_map_free(bmap2
);
7519 struct isl_set
*isl_basic_set_union(
7520 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7522 return (struct isl_set
*)isl_basic_map_union(
7523 (struct isl_basic_map
*)bset1
,
7524 (struct isl_basic_map
*)bset2
);
7527 /* Order divs such that any div only depends on previous divs */
7528 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7536 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7538 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7540 if (isl_int_is_zero(bmap
->div
[i
][0]))
7542 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7546 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7552 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7554 return (struct isl_basic_set
*)
7555 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7558 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7565 for (i
= 0; i
< map
->n
; ++i
) {
7566 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7577 /* Apply the expansion computed by isl_merge_divs.
7578 * The expansion itself is given by "exp" while the resulting
7579 * list of divs is given by "div".
7581 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7582 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7587 bset
= isl_basic_set_cow(bset
);
7591 if (div
->n_row
< bset
->n_div
)
7592 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7593 "not an expansion", goto error
);
7595 n_div
= bset
->n_div
;
7596 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7597 div
->n_row
- n_div
, 0,
7598 2 * (div
->n_row
- n_div
));
7600 for (i
= n_div
; i
< div
->n_row
; ++i
)
7601 if (isl_basic_set_alloc_div(bset
) < 0)
7605 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7606 if (j
>= 0 && exp
[j
] == i
) {
7608 isl_basic_map_swap_div(bset
, i
, j
);
7611 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7612 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7620 isl_basic_set_free(bset
);
7625 /* Look for a div in dst that corresponds to the div "div" in src.
7626 * The divs before "div" in src and dst are assumed to be the same.
7628 * Returns -1 if no corresponding div was found and the position
7629 * of the corresponding div in dst otherwise.
7631 static int find_div(struct isl_basic_map
*dst
,
7632 struct isl_basic_map
*src
, unsigned div
)
7636 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7638 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7639 for (i
= div
; i
< dst
->n_div
; ++i
)
7640 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7641 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7642 dst
->n_div
- div
) == -1)
7647 struct isl_basic_map
*isl_basic_map_align_divs(
7648 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7656 if (src
->n_div
== 0)
7659 for (i
= 0; i
< src
->n_div
; ++i
)
7660 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7662 src
= isl_basic_map_order_divs(src
);
7663 dst
= isl_basic_map_cow(dst
);
7664 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7665 src
->n_div
, 0, 2 * src
->n_div
);
7668 total
= isl_space_dim(src
->dim
, isl_dim_all
);
7669 for (i
= 0; i
< src
->n_div
; ++i
) {
7670 int j
= find_div(dst
, src
, i
);
7672 j
= isl_basic_map_alloc_div(dst
);
7675 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7676 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7677 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7681 isl_basic_map_swap_div(dst
, i
, j
);
7685 isl_basic_map_free(dst
);
7689 struct isl_basic_set
*isl_basic_set_align_divs(
7690 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7692 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7693 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7696 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7704 map
= isl_map_compute_divs(map
);
7705 map
= isl_map_cow(map
);
7709 for (i
= 1; i
< map
->n
; ++i
)
7710 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7711 for (i
= 1; i
< map
->n
; ++i
)
7712 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7714 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7718 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7720 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7723 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7724 __isl_take isl_map
*map
)
7728 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7729 map
= isl_map_intersect_domain(map
, set
);
7730 set
= isl_map_range(map
);
7738 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7739 __isl_take isl_map
*map
)
7741 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7744 /* There is no need to cow as removing empty parts doesn't change
7745 * the meaning of the set.
7747 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7754 for (i
= map
->n
- 1; i
>= 0; --i
)
7755 remove_if_empty(map
, i
);
7760 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7762 return (struct isl_set
*)
7763 isl_map_remove_empty_parts((struct isl_map
*)set
);
7766 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7768 struct isl_basic_map
*bmap
;
7769 if (!map
|| map
->n
== 0)
7771 bmap
= map
->p
[map
->n
-1];
7772 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7773 return isl_basic_map_copy(bmap
);
7776 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7778 return (struct isl_basic_set
*)
7779 isl_map_copy_basic_map((struct isl_map
*)set
);
7782 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7783 __isl_keep isl_basic_map
*bmap
)
7789 for (i
= map
->n
-1; i
>= 0; --i
) {
7790 if (map
->p
[i
] != bmap
)
7792 map
= isl_map_cow(map
);
7795 isl_basic_map_free(map
->p
[i
]);
7796 if (i
!= map
->n
-1) {
7797 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7798 map
->p
[i
] = map
->p
[map
->n
-1];
7809 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7810 struct isl_basic_set
*bset
)
7812 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7813 (struct isl_basic_map
*)bset
);
7816 /* Given two basic sets bset1 and bset2, compute the maximal difference
7817 * between the values of dimension pos in bset1 and those in bset2
7818 * for any common value of the parameters and dimensions preceding pos.
7820 static enum isl_lp_result
basic_set_maximal_difference_at(
7821 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7822 int pos
, isl_int
*opt
)
7825 struct isl_basic_map
*bmap1
= NULL
;
7826 struct isl_basic_map
*bmap2
= NULL
;
7827 struct isl_ctx
*ctx
;
7828 struct isl_vec
*obj
;
7831 unsigned dim1
, dim2
;
7832 enum isl_lp_result res
;
7834 if (!bset1
|| !bset2
)
7835 return isl_lp_error
;
7837 nparam
= isl_basic_set_n_param(bset1
);
7838 dim1
= isl_basic_set_n_dim(bset1
);
7839 dim2
= isl_basic_set_n_dim(bset2
);
7840 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7841 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7842 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7843 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7844 if (!bmap1
|| !bmap2
)
7846 bmap1
= isl_basic_map_cow(bmap1
);
7847 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7848 pos
, (dim1
- pos
) + (dim2
- pos
),
7849 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7850 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7853 total
= isl_basic_map_total_dim(bmap1
);
7855 obj
= isl_vec_alloc(ctx
, 1 + total
);
7858 isl_seq_clr(obj
->block
.data
, 1 + total
);
7859 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7860 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7861 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7863 isl_basic_map_free(bmap1
);
7867 isl_basic_map_free(bmap2
);
7869 isl_basic_map_free(bmap1
);
7870 return isl_lp_error
;
7873 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7874 * for any common value of the parameters and dimensions preceding pos
7875 * in both basic sets, the values of dimension pos in bset1 are
7876 * smaller or larger than those in bset2.
7879 * 1 if bset1 follows bset2
7880 * -1 if bset1 precedes bset2
7881 * 0 if bset1 and bset2 are incomparable
7882 * -2 if some error occurred.
7884 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7885 struct isl_basic_set
*bset2
, int pos
)
7888 enum isl_lp_result res
;
7893 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7895 if (res
== isl_lp_empty
)
7897 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7898 res
== isl_lp_unbounded
)
7900 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7909 /* Given two basic sets bset1 and bset2, check whether
7910 * for any common value of the parameters and dimensions preceding pos
7911 * there is a value of dimension pos in bset1 that is larger
7912 * than a value of the same dimension in bset2.
7915 * 1 if there exists such a pair
7916 * 0 if there is no such pair, but there is a pair of equal values
7918 * -2 if some error occurred.
7920 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7921 __isl_keep isl_basic_set
*bset2
, int pos
)
7924 enum isl_lp_result res
;
7929 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7931 if (res
== isl_lp_empty
)
7933 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7934 res
== isl_lp_unbounded
)
7936 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7938 else if (res
== isl_lp_ok
)
7947 /* Given two sets set1 and set2, check whether
7948 * for any common value of the parameters and dimensions preceding pos
7949 * there is a value of dimension pos in set1 that is larger
7950 * than a value of the same dimension in set2.
7953 * 1 if there exists such a pair
7954 * 0 if there is no such pair, but there is a pair of equal values
7956 * -2 if some error occurred.
7958 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7959 __isl_keep isl_set
*set2
, int pos
)
7967 for (i
= 0; i
< set1
->n
; ++i
)
7968 for (j
= 0; j
< set2
->n
; ++j
) {
7970 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7971 if (f
== 1 || f
== -2)
7980 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7981 unsigned pos
, isl_int
*val
)
7989 total
= isl_basic_map_total_dim(bmap
);
7990 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7991 for (; d
+1 > pos
; --d
)
7992 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7996 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7998 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8000 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8003 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8009 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8010 unsigned pos
, isl_int
*val
)
8022 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8025 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8026 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8027 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8028 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8032 isl_int_set(*val
, v
);
8038 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8039 unsigned pos
, isl_int
*val
)
8041 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8045 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8048 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8051 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8052 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8054 if (pos
>= isl_basic_map_dim(bmap
, type
))
8056 return isl_basic_map_plain_has_fixed_var(bmap
,
8057 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8060 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8061 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8063 if (pos
>= isl_map_dim(map
, type
))
8065 return isl_map_plain_has_fixed_var(map
,
8066 map_offset(map
, type
) - 1 + pos
, val
);
8069 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8070 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8072 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8075 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8076 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8078 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8081 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8082 * then return this fixed value in *val.
8084 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8085 unsigned dim
, isl_int
*val
)
8087 return isl_basic_set_plain_has_fixed_var(bset
,
8088 isl_basic_set_n_param(bset
) + dim
, val
);
8091 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8092 * then return this fixed value in *val.
8094 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8095 unsigned dim
, isl_int
*val
)
8097 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8100 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8101 unsigned dim
, isl_int
*val
)
8103 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8106 /* Check if input variable in has fixed value and if so and if val is not NULL,
8107 * then return this fixed value in *val.
8109 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8110 unsigned in
, isl_int
*val
)
8112 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8115 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8116 * and if val is not NULL, then return this lower bound in *val.
8118 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8119 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8121 int i
, i_eq
= -1, i_ineq
= -1;
8128 total
= isl_basic_set_total_dim(bset
);
8129 nparam
= isl_basic_set_n_param(bset
);
8130 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8131 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8137 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8138 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8140 if (i_eq
!= -1 || i_ineq
!= -1)
8144 if (i_eq
== -1 && i_ineq
== -1)
8146 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8147 /* The coefficient should always be one due to normalization. */
8148 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8150 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8152 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8153 total
- nparam
- dim
- 1) != -1)
8156 isl_int_neg(*val
, c
[0]);
8160 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8161 unsigned dim
, isl_int
*val
)
8173 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8177 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8179 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8180 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8182 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8186 isl_int_set(*val
, v
);
8197 /* uset_gist depends on constraints without existentially quantified
8198 * variables sorting first.
8200 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8202 const struct constraint
*c1
= (const struct constraint
*)p1
;
8203 const struct constraint
*c2
= (const struct constraint
*)p2
;
8205 unsigned size
= isl_min(c1
->size
, c2
->size
);
8207 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8208 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8213 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8216 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8217 struct isl_basic_map
*bmap
)
8220 struct constraint
*c
;
8225 total
= isl_basic_map_total_dim(bmap
);
8226 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8229 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8231 c
[i
].c
= bmap
->ineq
[i
];
8233 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8234 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8235 bmap
->ineq
[i
] = c
[i
].c
;
8239 isl_basic_map_free(bmap
);
8243 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8244 __isl_take isl_basic_set
*bset
)
8246 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8247 (struct isl_basic_map
*)bset
);
8250 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8254 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8256 bmap
= isl_basic_map_remove_redundancies(bmap
);
8257 bmap
= isl_basic_map_sort_constraints(bmap
);
8259 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8263 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8265 return (struct isl_basic_set
*)isl_basic_map_normalize(
8266 (struct isl_basic_map
*)bset
);
8269 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8270 const __isl_keep isl_basic_map
*bmap2
)
8277 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8278 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8279 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8280 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8281 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8282 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8283 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8284 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8285 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8286 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8287 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8289 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8291 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8293 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8294 return bmap1
->n_eq
- bmap2
->n_eq
;
8295 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8296 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8297 if (bmap1
->n_div
!= bmap2
->n_div
)
8298 return bmap1
->n_div
- bmap2
->n_div
;
8299 total
= isl_basic_map_total_dim(bmap1
);
8300 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8301 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8305 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8306 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8310 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8311 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8318 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8319 const __isl_keep isl_basic_set
*bset2
)
8321 return isl_basic_map_plain_cmp(bset1
, bset2
);
8324 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8330 if (set1
->n
!= set2
->n
)
8331 return set1
->n
- set2
->n
;
8333 for (i
= 0; i
< set1
->n
; ++i
) {
8334 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8342 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8343 __isl_keep isl_basic_map
*bmap2
)
8345 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8348 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8349 __isl_keep isl_basic_set
*bset2
)
8351 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8352 (isl_basic_map
*)bset2
);
8355 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8357 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8358 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8360 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8363 /* We normalize in place, but if anything goes wrong we need
8364 * to return NULL, so we need to make sure we don't change the
8365 * meaning of any possible other copies of map.
8367 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8370 struct isl_basic_map
*bmap
;
8374 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8376 for (i
= 0; i
< map
->n
; ++i
) {
8377 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8380 isl_basic_map_free(map
->p
[i
]);
8383 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8384 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8385 map
= isl_map_remove_empty_parts(map
);
8388 for (i
= map
->n
- 1; i
>= 1; --i
) {
8389 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8391 isl_basic_map_free(map
->p
[i
-1]);
8392 for (j
= i
; j
< map
->n
; ++j
)
8393 map
->p
[j
-1] = map
->p
[j
];
8403 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8405 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8408 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8418 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8421 map1
= isl_map_copy(map1
);
8422 map2
= isl_map_copy(map2
);
8423 map1
= isl_map_normalize(map1
);
8424 map2
= isl_map_normalize(map2
);
8427 equal
= map1
->n
== map2
->n
;
8428 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8429 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8442 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8444 return isl_map_plain_is_equal(map1
, map2
);
8447 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8449 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8450 (struct isl_map
*)set2
);
8453 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8455 return isl_set_plain_is_equal(set1
, set2
);
8458 /* Return an interval that ranges from min to max (inclusive)
8460 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8461 isl_int min
, isl_int max
)
8464 struct isl_basic_set
*bset
= NULL
;
8466 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8470 k
= isl_basic_set_alloc_inequality(bset
);
8473 isl_int_set_si(bset
->ineq
[k
][1], 1);
8474 isl_int_neg(bset
->ineq
[k
][0], min
);
8476 k
= isl_basic_set_alloc_inequality(bset
);
8479 isl_int_set_si(bset
->ineq
[k
][1], -1);
8480 isl_int_set(bset
->ineq
[k
][0], max
);
8484 isl_basic_set_free(bset
);
8488 /* Return the Cartesian product of the basic sets in list (in the given order).
8490 __isl_give isl_basic_set
*isl_basic_set_list_product(
8491 __isl_take
struct isl_basic_set_list
*list
)
8499 struct isl_basic_set
*product
= NULL
;
8503 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8504 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8505 nparam
= isl_basic_set_n_param(list
->p
[0]);
8506 dim
= isl_basic_set_n_dim(list
->p
[0]);
8507 extra
= list
->p
[0]->n_div
;
8508 n_eq
= list
->p
[0]->n_eq
;
8509 n_ineq
= list
->p
[0]->n_ineq
;
8510 for (i
= 1; i
< list
->n
; ++i
) {
8511 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8512 isl_assert(list
->ctx
,
8513 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8514 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8515 extra
+= list
->p
[i
]->n_div
;
8516 n_eq
+= list
->p
[i
]->n_eq
;
8517 n_ineq
+= list
->p
[i
]->n_ineq
;
8519 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8524 for (i
= 0; i
< list
->n
; ++i
) {
8525 isl_basic_set_add_constraints(product
,
8526 isl_basic_set_copy(list
->p
[i
]), dim
);
8527 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8529 isl_basic_set_list_free(list
);
8532 isl_basic_set_free(product
);
8533 isl_basic_set_list_free(list
);
8537 struct isl_basic_map
*isl_basic_map_product(
8538 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8540 isl_space
*dim_result
= NULL
;
8541 struct isl_basic_map
*bmap
;
8542 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8543 struct isl_dim_map
*dim_map1
, *dim_map2
;
8545 if (!bmap1
|| !bmap2
)
8548 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8549 bmap2
->dim
, isl_dim_param
), goto error
);
8550 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8551 isl_space_copy(bmap2
->dim
));
8553 in1
= isl_basic_map_n_in(bmap1
);
8554 in2
= isl_basic_map_n_in(bmap2
);
8555 out1
= isl_basic_map_n_out(bmap1
);
8556 out2
= isl_basic_map_n_out(bmap2
);
8557 nparam
= isl_basic_map_n_param(bmap1
);
8559 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8560 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8561 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8562 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8563 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8564 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8565 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8566 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8567 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8568 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8569 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8571 bmap
= isl_basic_map_alloc_space(dim_result
,
8572 bmap1
->n_div
+ bmap2
->n_div
,
8573 bmap1
->n_eq
+ bmap2
->n_eq
,
8574 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8575 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8576 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8577 bmap
= isl_basic_map_simplify(bmap
);
8578 return isl_basic_map_finalize(bmap
);
8580 isl_basic_map_free(bmap1
);
8581 isl_basic_map_free(bmap2
);
8585 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8586 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8588 isl_basic_map
*prod
;
8590 prod
= isl_basic_map_product(bmap1
, bmap2
);
8591 prod
= isl_basic_map_flatten(prod
);
8595 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8596 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8598 return isl_basic_map_flat_range_product(bset1
, bset2
);
8601 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8602 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8604 isl_space
*space_result
= NULL
;
8605 isl_basic_map
*bmap
;
8606 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8607 struct isl_dim_map
*dim_map1
, *dim_map2
;
8609 if (!bmap1
|| !bmap2
)
8612 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8613 isl_space_copy(bmap2
->dim
));
8615 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8616 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8617 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8618 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8620 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8621 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8622 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8623 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8624 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8625 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8626 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8627 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8628 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8629 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8630 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8632 bmap
= isl_basic_map_alloc_space(space_result
,
8633 bmap1
->n_div
+ bmap2
->n_div
,
8634 bmap1
->n_eq
+ bmap2
->n_eq
,
8635 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8636 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8637 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8638 bmap
= isl_basic_map_simplify(bmap
);
8639 return isl_basic_map_finalize(bmap
);
8641 isl_basic_map_free(bmap1
);
8642 isl_basic_map_free(bmap2
);
8646 __isl_give isl_basic_map
*isl_basic_map_range_product(
8647 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8649 isl_space
*dim_result
= NULL
;
8650 isl_basic_map
*bmap
;
8651 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8652 struct isl_dim_map
*dim_map1
, *dim_map2
;
8654 if (!bmap1
|| !bmap2
)
8657 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8658 bmap2
->dim
, isl_dim_param
))
8659 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8660 "parameters don't match", goto error
);
8662 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8663 isl_space_copy(bmap2
->dim
));
8665 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8666 out1
= isl_basic_map_n_out(bmap1
);
8667 out2
= isl_basic_map_n_out(bmap2
);
8668 nparam
= isl_basic_map_n_param(bmap1
);
8670 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8671 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8672 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8673 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8674 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8675 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8676 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8677 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8678 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8679 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8680 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8682 bmap
= isl_basic_map_alloc_space(dim_result
,
8683 bmap1
->n_div
+ bmap2
->n_div
,
8684 bmap1
->n_eq
+ bmap2
->n_eq
,
8685 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8686 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8687 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8688 bmap
= isl_basic_map_simplify(bmap
);
8689 return isl_basic_map_finalize(bmap
);
8691 isl_basic_map_free(bmap1
);
8692 isl_basic_map_free(bmap2
);
8696 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8697 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8699 isl_basic_map
*prod
;
8701 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8702 prod
= isl_basic_map_flatten_range(prod
);
8706 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8707 __isl_take isl_map
*map2
,
8708 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8709 __isl_take isl_space
*right
),
8710 __isl_give isl_basic_map
*(*basic_map_product
)(
8711 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8714 struct isl_map
*result
;
8720 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8721 map2
->dim
, isl_dim_param
), goto error
);
8723 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8724 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8725 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8727 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8728 isl_space_copy(map2
->dim
)),
8729 map1
->n
* map2
->n
, flags
);
8732 for (i
= 0; i
< map1
->n
; ++i
)
8733 for (j
= 0; j
< map2
->n
; ++j
) {
8734 struct isl_basic_map
*part
;
8735 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8736 isl_basic_map_copy(map2
->p
[j
]));
8737 if (isl_basic_map_is_empty(part
))
8738 isl_basic_map_free(part
);
8740 result
= isl_map_add_basic_map(result
, part
);
8753 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8755 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8756 __isl_take isl_map
*map2
)
8758 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8761 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8762 __isl_take isl_map
*map2
)
8764 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8767 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8769 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8770 __isl_take isl_map
*map2
)
8774 prod
= isl_map_product(map1
, map2
);
8775 prod
= isl_map_flatten(prod
);
8779 /* Given two set A and B, construct its Cartesian product A x B.
8781 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8783 return isl_map_range_product(set1
, set2
);
8786 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8787 __isl_take isl_set
*set2
)
8789 return isl_map_flat_range_product(set1
, set2
);
8792 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8794 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8795 __isl_take isl_map
*map2
)
8797 return map_product(map1
, map2
, &isl_space_domain_product
,
8798 &isl_basic_map_domain_product
);
8801 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8803 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8804 __isl_take isl_map
*map2
)
8806 return map_product(map1
, map2
, &isl_space_range_product
,
8807 &isl_basic_map_range_product
);
8810 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8811 __isl_take isl_map
*map2
)
8813 return isl_map_align_params_map_map_and(map1
, map2
,
8814 &map_domain_product_aligned
);
8817 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8818 __isl_take isl_map
*map2
)
8820 return isl_map_align_params_map_map_and(map1
, map2
,
8821 &map_range_product_aligned
);
8824 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8826 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8827 __isl_take isl_map
*map2
)
8831 prod
= isl_map_domain_product(map1
, map2
);
8832 prod
= isl_map_flatten_domain(prod
);
8836 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8838 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8839 __isl_take isl_map
*map2
)
8843 prod
= isl_map_range_product(map1
, map2
);
8844 prod
= isl_map_flatten_range(prod
);
8848 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8851 uint32_t hash
= isl_hash_init();
8856 bmap
= isl_basic_map_copy(bmap
);
8857 bmap
= isl_basic_map_normalize(bmap
);
8860 total
= isl_basic_map_total_dim(bmap
);
8861 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8862 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8864 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8865 isl_hash_hash(hash
, c_hash
);
8867 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8868 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8870 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8871 isl_hash_hash(hash
, c_hash
);
8873 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8874 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8876 if (isl_int_is_zero(bmap
->div
[i
][0]))
8878 isl_hash_byte(hash
, i
& 0xFF);
8879 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8880 isl_hash_hash(hash
, c_hash
);
8882 isl_basic_map_free(bmap
);
8886 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8888 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8891 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8898 map
= isl_map_copy(map
);
8899 map
= isl_map_normalize(map
);
8903 hash
= isl_hash_init();
8904 for (i
= 0; i
< map
->n
; ++i
) {
8906 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8907 isl_hash_hash(hash
, bmap_hash
);
8915 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8917 return isl_map_get_hash((isl_map
*)set
);
8920 /* Check if the value for dimension dim is completely determined
8921 * by the values of the other parameters and variables.
8922 * That is, check if dimension dim is involved in an equality.
8924 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8931 nparam
= isl_basic_set_n_param(bset
);
8932 for (i
= 0; i
< bset
->n_eq
; ++i
)
8933 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8938 /* Check if the value for dimension dim is completely determined
8939 * by the values of the other parameters and variables.
8940 * That is, check if dimension dim is involved in an equality
8941 * for each of the subsets.
8943 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8949 for (i
= 0; i
< set
->n
; ++i
) {
8951 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8958 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8960 return set
? set
->n
: 0;
8963 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8964 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8971 for (i
= 0; i
< map
->n
; ++i
)
8972 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8978 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8979 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8986 for (i
= 0; i
< set
->n
; ++i
)
8987 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8993 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9000 bset
= isl_basic_set_cow(bset
);
9004 dim
= isl_basic_set_get_space(bset
);
9005 dim
= isl_space_lift(dim
, bset
->n_div
);
9008 isl_space_free(bset
->dim
);
9010 bset
->extra
-= bset
->n_div
;
9013 bset
= isl_basic_set_finalize(bset
);
9017 isl_basic_set_free(bset
);
9021 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9027 set
= isl_set_align_divs(set
);
9032 set
= isl_set_cow(set
);
9036 n_div
= set
->p
[0]->n_div
;
9037 dim
= isl_set_get_space(set
);
9038 dim
= isl_space_lift(dim
, n_div
);
9041 isl_space_free(set
->dim
);
9044 for (i
= 0; i
< set
->n
; ++i
) {
9045 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9056 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9059 struct isl_basic_map
*bmap
;
9066 set
= isl_set_align_divs(set
);
9071 dim
= isl_set_get_space(set
);
9072 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9074 return isl_map_identity(isl_space_map_from_set(dim
));
9077 n_div
= set
->p
[0]->n_div
;
9078 dim
= isl_space_map_from_set(dim
);
9079 n_param
= isl_space_dim(dim
, isl_dim_param
);
9080 n_set
= isl_space_dim(dim
, isl_dim_in
);
9081 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9082 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9083 for (i
= 0; i
< n_set
; ++i
)
9084 bmap
= var_equal(bmap
, i
);
9086 total
= n_param
+ n_set
+ n_set
+ n_div
;
9087 for (i
= 0; i
< n_div
; ++i
) {
9088 k
= isl_basic_map_alloc_inequality(bmap
);
9091 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9092 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9093 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9094 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9095 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9096 set
->p
[0]->div
[i
][0]);
9098 l
= isl_basic_map_alloc_inequality(bmap
);
9101 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9102 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9103 set
->p
[0]->div
[i
][0]);
9104 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9108 bmap
= isl_basic_map_simplify(bmap
);
9109 bmap
= isl_basic_map_finalize(bmap
);
9110 return isl_map_from_basic_map(bmap
);
9113 isl_basic_map_free(bmap
);
9117 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9125 dim
= isl_basic_set_total_dim(bset
);
9126 size
+= bset
->n_eq
* (1 + dim
);
9127 size
+= bset
->n_ineq
* (1 + dim
);
9128 size
+= bset
->n_div
* (2 + dim
);
9133 int isl_set_size(__isl_keep isl_set
*set
)
9141 for (i
= 0; i
< set
->n
; ++i
)
9142 size
+= isl_basic_set_size(set
->p
[i
]);
9147 /* Check if there is any lower bound (if lower == 0) and/or upper
9148 * bound (if upper == 0) on the specified dim.
9150 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9151 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9158 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9160 pos
+= isl_basic_map_offset(bmap
, type
);
9162 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9163 if (isl_int_is_zero(bmap
->div
[i
][0]))
9165 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9169 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9170 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9173 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9174 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9181 return lower
&& upper
;
9184 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9185 enum isl_dim_type type
, unsigned pos
)
9187 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9190 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9191 enum isl_dim_type type
, unsigned pos
)
9193 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9196 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9197 enum isl_dim_type type
, unsigned pos
)
9199 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9202 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9203 enum isl_dim_type type
, unsigned pos
)
9210 for (i
= 0; i
< map
->n
; ++i
) {
9212 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9213 if (bounded
< 0 || !bounded
)
9220 /* Return 1 if the specified dim is involved in both an upper bound
9221 * and a lower bound.
9223 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9224 enum isl_dim_type type
, unsigned pos
)
9226 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9229 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9231 static int has_any_bound(__isl_keep isl_map
*map
,
9232 enum isl_dim_type type
, unsigned pos
,
9233 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9234 enum isl_dim_type type
, unsigned pos
))
9241 for (i
= 0; i
< map
->n
; ++i
) {
9243 bounded
= fn(map
->p
[i
], type
, pos
);
9244 if (bounded
< 0 || bounded
)
9251 /* Return 1 if the specified dim is involved in any lower bound.
9253 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9254 enum isl_dim_type type
, unsigned pos
)
9256 return has_any_bound(set
, type
, pos
,
9257 &isl_basic_map_dim_has_lower_bound
);
9260 /* Return 1 if the specified dim is involved in any upper bound.
9262 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9263 enum isl_dim_type type
, unsigned pos
)
9265 return has_any_bound(set
, type
, pos
,
9266 &isl_basic_map_dim_has_upper_bound
);
9269 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9271 static int has_bound(__isl_keep isl_map
*map
,
9272 enum isl_dim_type type
, unsigned pos
,
9273 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9274 enum isl_dim_type type
, unsigned pos
))
9281 for (i
= 0; i
< map
->n
; ++i
) {
9283 bounded
= fn(map
->p
[i
], type
, pos
);
9284 if (bounded
< 0 || !bounded
)
9291 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9293 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9294 enum isl_dim_type type
, unsigned pos
)
9296 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9299 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9301 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9302 enum isl_dim_type type
, unsigned pos
)
9304 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9307 /* For each of the "n" variables starting at "first", determine
9308 * the sign of the variable and put the results in the first "n"
9309 * elements of the array "signs".
9311 * 1 means that the variable is non-negative
9312 * -1 means that the variable is non-positive
9313 * 0 means the variable attains both positive and negative values.
9315 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9316 unsigned first
, unsigned n
, int *signs
)
9318 isl_vec
*bound
= NULL
;
9319 struct isl_tab
*tab
= NULL
;
9320 struct isl_tab_undo
*snap
;
9323 if (!bset
|| !signs
)
9326 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9327 tab
= isl_tab_from_basic_set(bset
, 0);
9331 isl_seq_clr(bound
->el
, bound
->size
);
9332 isl_int_set_si(bound
->el
[0], -1);
9334 snap
= isl_tab_snap(tab
);
9335 for (i
= 0; i
< n
; ++i
) {
9338 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9339 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9342 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9343 if (isl_tab_rollback(tab
, snap
) < 0)
9351 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9352 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9355 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9356 if (isl_tab_rollback(tab
, snap
) < 0)
9359 signs
[i
] = empty
? -1 : 0;
9363 isl_vec_free(bound
);
9367 isl_vec_free(bound
);
9371 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9372 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9374 if (!bset
|| !signs
)
9376 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9379 first
+= pos(bset
->dim
, type
) - 1;
9380 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9383 /* Check if the given basic map is obviously single-valued.
9384 * In particular, for each output dimension, check that there is
9385 * an equality that defines the output dimension in terms of
9386 * earlier dimensions.
9388 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9398 total
= 1 + isl_basic_map_total_dim(bmap
);
9399 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9400 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9402 for (i
= 0; i
< n_out
; ++i
) {
9403 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9404 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9406 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9407 total
- (o_out
+ i
+ 1)) == -1)
9410 if (j
>= bmap
->n_eq
)
9417 /* Check if the given basic map is single-valued.
9422 * and check if the result is a subset of the identity mapping.
9424 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9427 isl_basic_map
*test
;
9431 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9435 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9436 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9438 space
= isl_basic_map_get_space(bmap
);
9439 space
= isl_space_map_from_set(isl_space_range(space
));
9440 id
= isl_basic_map_identity(space
);
9442 sv
= isl_basic_map_is_subset(test
, id
);
9444 isl_basic_map_free(test
);
9445 isl_basic_map_free(id
);
9450 /* Check if the given map is obviously single-valued.
9452 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9461 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9464 /* Check if the given map is single-valued.
9469 * and check if the result is a subset of the identity mapping.
9471 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9478 sv
= isl_map_plain_is_single_valued(map
);
9482 test
= isl_map_reverse(isl_map_copy(map
));
9483 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9485 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9486 id
= isl_map_identity(dim
);
9488 sv
= isl_map_is_subset(test
, id
);
9496 int isl_map_is_injective(__isl_keep isl_map
*map
)
9500 map
= isl_map_copy(map
);
9501 map
= isl_map_reverse(map
);
9502 in
= isl_map_is_single_valued(map
);
9508 /* Check if the given map is obviously injective.
9510 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9514 map
= isl_map_copy(map
);
9515 map
= isl_map_reverse(map
);
9516 in
= isl_map_plain_is_single_valued(map
);
9522 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9526 sv
= isl_map_is_single_valued(map
);
9530 return isl_map_is_injective(map
);
9533 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9535 return isl_map_is_single_valued((isl_map
*)set
);
9538 int isl_map_is_translation(__isl_keep isl_map
*map
)
9543 delta
= isl_map_deltas(isl_map_copy(map
));
9544 ok
= isl_set_is_singleton(delta
);
9545 isl_set_free(delta
);
9550 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9552 if (isl_seq_first_non_zero(p
, pos
) != -1)
9554 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9559 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9568 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9571 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9572 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9573 for (j
= 0; j
< nvar
; ++j
) {
9574 int lower
= 0, upper
= 0;
9575 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9576 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9578 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9584 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9585 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9587 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9589 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9594 if (!lower
|| !upper
)
9601 int isl_set_is_box(__isl_keep isl_set
*set
)
9608 return isl_basic_set_is_box(set
->p
[0]);
9611 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9616 return isl_space_is_wrapping(bset
->dim
);
9619 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9624 return isl_space_is_wrapping(set
->dim
);
9627 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9629 bmap
= isl_basic_map_cow(bmap
);
9633 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9637 bmap
= isl_basic_map_finalize(bmap
);
9639 return (isl_basic_set
*)bmap
;
9641 isl_basic_map_free(bmap
);
9645 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9649 map
= isl_map_cow(map
);
9653 for (i
= 0; i
< map
->n
; ++i
) {
9654 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9658 map
->dim
= isl_space_wrap(map
->dim
);
9662 return (isl_set
*)map
;
9668 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9670 bset
= isl_basic_set_cow(bset
);
9674 bset
->dim
= isl_space_unwrap(bset
->dim
);
9678 bset
= isl_basic_set_finalize(bset
);
9680 return (isl_basic_map
*)bset
;
9682 isl_basic_set_free(bset
);
9686 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9693 if (!isl_set_is_wrapping(set
))
9694 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9697 set
= isl_set_cow(set
);
9701 for (i
= 0; i
< set
->n
; ++i
) {
9702 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9707 set
->dim
= isl_space_unwrap(set
->dim
);
9711 return (isl_map
*)set
;
9717 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9718 enum isl_dim_type type
)
9723 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9726 bmap
= isl_basic_map_cow(bmap
);
9730 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9734 bmap
= isl_basic_map_finalize(bmap
);
9738 isl_basic_map_free(bmap
);
9742 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9743 enum isl_dim_type type
)
9750 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9753 map
= isl_map_cow(map
);
9757 for (i
= 0; i
< map
->n
; ++i
) {
9758 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9762 map
->dim
= isl_space_reset(map
->dim
, type
);
9772 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9777 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9780 bmap
= isl_basic_map_cow(bmap
);
9784 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9788 bmap
= isl_basic_map_finalize(bmap
);
9792 isl_basic_map_free(bmap
);
9796 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9798 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9801 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9802 __isl_take isl_basic_map
*bmap
)
9807 if (!bmap
->dim
->nested
[0])
9810 bmap
= isl_basic_map_cow(bmap
);
9814 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9818 bmap
= isl_basic_map_finalize(bmap
);
9822 isl_basic_map_free(bmap
);
9826 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9827 __isl_take isl_basic_map
*bmap
)
9832 if (!bmap
->dim
->nested
[1])
9835 bmap
= isl_basic_map_cow(bmap
);
9839 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9843 bmap
= isl_basic_map_finalize(bmap
);
9847 isl_basic_map_free(bmap
);
9851 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9858 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9861 map
= isl_map_cow(map
);
9865 for (i
= 0; i
< map
->n
; ++i
) {
9866 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9870 map
->dim
= isl_space_flatten(map
->dim
);
9880 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9882 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9885 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9887 isl_space
*dim
, *flat_dim
;
9890 dim
= isl_set_get_space(set
);
9891 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9892 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9893 map
= isl_map_intersect_domain(map
, set
);
9898 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9905 if (!map
->dim
->nested
[0])
9908 map
= isl_map_cow(map
);
9912 for (i
= 0; i
< map
->n
; ++i
) {
9913 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9917 map
->dim
= isl_space_flatten_domain(map
->dim
);
9927 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9934 if (!map
->dim
->nested
[1])
9937 map
= isl_map_cow(map
);
9941 for (i
= 0; i
< map
->n
; ++i
) {
9942 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9946 map
->dim
= isl_space_flatten_range(map
->dim
);
9956 /* Reorder the dimensions of "bmap" according to the given dim_map
9957 * and set the dimension specification to "dim".
9959 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9960 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9965 bmap
= isl_basic_map_cow(bmap
);
9966 if (!bmap
|| !dim
|| !dim_map
)
9969 flags
= bmap
->flags
;
9970 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9971 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9972 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9973 res
= isl_basic_map_alloc_space(dim
,
9974 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9975 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9978 res
= isl_basic_map_finalize(res
);
9982 isl_basic_map_free(bmap
);
9983 isl_space_free(dim
);
9987 /* Reorder the dimensions of "map" according to given reordering.
9989 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9990 __isl_take isl_reordering
*r
)
9993 struct isl_dim_map
*dim_map
;
9995 map
= isl_map_cow(map
);
9996 dim_map
= isl_dim_map_from_reordering(r
);
9997 if (!map
|| !r
|| !dim_map
)
10000 for (i
= 0; i
< map
->n
; ++i
) {
10001 struct isl_dim_map
*dim_map_i
;
10003 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10005 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10006 isl_space_copy(r
->dim
), dim_map_i
);
10012 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10014 isl_reordering_free(r
);
10020 isl_reordering_free(r
);
10024 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10025 __isl_take isl_reordering
*r
)
10027 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10030 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10031 __isl_take isl_space
*model
)
10035 if (!map
|| !model
)
10038 ctx
= isl_space_get_ctx(model
);
10039 if (!isl_space_has_named_params(model
))
10040 isl_die(ctx
, isl_error_invalid
,
10041 "model has unnamed parameters", goto error
);
10042 if (!isl_space_has_named_params(map
->dim
))
10043 isl_die(ctx
, isl_error_invalid
,
10044 "relation has unnamed parameters", goto error
);
10045 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10046 isl_reordering
*exp
;
10048 model
= isl_space_drop_dims(model
, isl_dim_in
,
10049 0, isl_space_dim(model
, isl_dim_in
));
10050 model
= isl_space_drop_dims(model
, isl_dim_out
,
10051 0, isl_space_dim(model
, isl_dim_out
));
10052 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10053 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10054 map
= isl_map_realign(map
, exp
);
10057 isl_space_free(model
);
10060 isl_space_free(model
);
10065 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10066 __isl_take isl_space
*model
)
10068 return isl_map_align_params(set
, model
);
10071 /* Align the parameters of "bmap" to those of "model", introducing
10072 * additional parameters if needed.
10074 __isl_give isl_basic_map
*isl_basic_map_align_params(
10075 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10079 if (!bmap
|| !model
)
10082 ctx
= isl_space_get_ctx(model
);
10083 if (!isl_space_has_named_params(model
))
10084 isl_die(ctx
, isl_error_invalid
,
10085 "model has unnamed parameters", goto error
);
10086 if (!isl_space_has_named_params(bmap
->dim
))
10087 isl_die(ctx
, isl_error_invalid
,
10088 "relation has unnamed parameters", goto error
);
10089 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10090 isl_reordering
*exp
;
10091 struct isl_dim_map
*dim_map
;
10093 model
= isl_space_drop_dims(model
, isl_dim_in
,
10094 0, isl_space_dim(model
, isl_dim_in
));
10095 model
= isl_space_drop_dims(model
, isl_dim_out
,
10096 0, isl_space_dim(model
, isl_dim_out
));
10097 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10098 exp
= isl_reordering_extend_space(exp
,
10099 isl_basic_map_get_space(bmap
));
10100 dim_map
= isl_dim_map_from_reordering(exp
);
10101 bmap
= isl_basic_map_realign(bmap
,
10102 exp
? isl_space_copy(exp
->dim
) : NULL
,
10103 isl_dim_map_extend(dim_map
, bmap
));
10104 isl_reordering_free(exp
);
10108 isl_space_free(model
);
10111 isl_space_free(model
);
10112 isl_basic_map_free(bmap
);
10116 /* Align the parameters of "bset" to those of "model", introducing
10117 * additional parameters if needed.
10119 __isl_give isl_basic_set
*isl_basic_set_align_params(
10120 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10122 return isl_basic_map_align_params(bset
, model
);
10125 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10126 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10127 enum isl_dim_type c2
, enum isl_dim_type c3
,
10128 enum isl_dim_type c4
, enum isl_dim_type c5
)
10130 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10131 struct isl_mat
*mat
;
10137 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10138 isl_basic_map_total_dim(bmap
) + 1);
10141 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10142 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10143 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10144 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10145 isl_int_set(mat
->row
[i
][pos
],
10146 bmap
->eq
[i
][off
+ k
]);
10154 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10155 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10156 enum isl_dim_type c2
, enum isl_dim_type c3
,
10157 enum isl_dim_type c4
, enum isl_dim_type c5
)
10159 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10160 struct isl_mat
*mat
;
10166 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10167 isl_basic_map_total_dim(bmap
) + 1);
10170 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10171 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10172 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10173 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10174 isl_int_set(mat
->row
[i
][pos
],
10175 bmap
->ineq
[i
][off
+ k
]);
10183 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10184 __isl_take isl_space
*dim
,
10185 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10186 enum isl_dim_type c2
, enum isl_dim_type c3
,
10187 enum isl_dim_type c4
, enum isl_dim_type c5
)
10189 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10190 isl_basic_map
*bmap
;
10196 if (!dim
|| !eq
|| !ineq
)
10199 if (eq
->n_col
!= ineq
->n_col
)
10200 isl_die(dim
->ctx
, isl_error_invalid
,
10201 "equalities and inequalities matrices should have "
10202 "same number of columns", goto error
);
10204 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10206 if (eq
->n_col
< total
)
10207 isl_die(dim
->ctx
, isl_error_invalid
,
10208 "number of columns too small", goto error
);
10210 extra
= eq
->n_col
- total
;
10212 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10213 eq
->n_row
, ineq
->n_row
);
10216 for (i
= 0; i
< extra
; ++i
) {
10217 k
= isl_basic_map_alloc_div(bmap
);
10220 isl_int_set_si(bmap
->div
[k
][0], 0);
10222 for (i
= 0; i
< eq
->n_row
; ++i
) {
10223 l
= isl_basic_map_alloc_equality(bmap
);
10226 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10227 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10228 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10229 isl_int_set(bmap
->eq
[l
][off
+ k
],
10235 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10236 l
= isl_basic_map_alloc_inequality(bmap
);
10239 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10240 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10241 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10242 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10243 ineq
->row
[i
][pos
]);
10249 isl_space_free(dim
);
10251 isl_mat_free(ineq
);
10255 isl_space_free(dim
);
10257 isl_mat_free(ineq
);
10261 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10262 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10263 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10265 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10266 c1
, c2
, c3
, c4
, isl_dim_in
);
10269 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10270 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10271 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10273 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10274 c1
, c2
, c3
, c4
, isl_dim_in
);
10277 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10278 __isl_take isl_space
*dim
,
10279 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10280 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10282 return (isl_basic_set
*)
10283 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10284 c1
, c2
, c3
, c4
, isl_dim_in
);
10287 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10292 return isl_space_can_zip(bmap
->dim
);
10295 int isl_map_can_zip(__isl_keep isl_map
*map
)
10300 return isl_space_can_zip(map
->dim
);
10303 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10304 * (A -> C) -> (B -> D).
10306 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10315 if (!isl_basic_map_can_zip(bmap
))
10316 isl_die(bmap
->ctx
, isl_error_invalid
,
10317 "basic map cannot be zipped", goto error
);
10318 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10319 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10320 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10321 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10322 bmap
= isl_basic_map_cow(bmap
);
10323 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10326 bmap
->dim
= isl_space_zip(bmap
->dim
);
10331 isl_basic_map_free(bmap
);
10335 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10336 * (A -> C) -> (B -> D).
10338 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10345 if (!isl_map_can_zip(map
))
10346 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10349 map
= isl_map_cow(map
);
10353 for (i
= 0; i
< map
->n
; ++i
) {
10354 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10359 map
->dim
= isl_space_zip(map
->dim
);
10369 /* Can we apply isl_basic_map_curry to "bmap"?
10370 * That is, does it have a nested relation in its domain?
10372 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10377 return isl_space_can_curry(bmap
->dim
);
10380 /* Can we apply isl_map_curry to "map"?
10381 * That is, does it have a nested relation in its domain?
10383 int isl_map_can_curry(__isl_keep isl_map
*map
)
10388 return isl_space_can_curry(map
->dim
);
10391 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10394 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10400 if (!isl_basic_map_can_curry(bmap
))
10401 isl_die(bmap
->ctx
, isl_error_invalid
,
10402 "basic map cannot be curried", goto error
);
10403 bmap
= isl_basic_map_cow(bmap
);
10406 bmap
->dim
= isl_space_curry(bmap
->dim
);
10411 isl_basic_map_free(bmap
);
10415 /* Given a map (A -> B) -> C, return the corresponding map
10418 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10425 if (!isl_map_can_curry(map
))
10426 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10429 map
= isl_map_cow(map
);
10433 for (i
= 0; i
< map
->n
; ++i
) {
10434 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10439 map
->dim
= isl_space_curry(map
->dim
);
10449 /* Can we apply isl_basic_map_uncurry to "bmap"?
10450 * That is, does it have a nested relation in its domain?
10452 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10457 return isl_space_can_uncurry(bmap
->dim
);
10460 /* Can we apply isl_map_uncurry to "map"?
10461 * That is, does it have a nested relation in its domain?
10463 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10468 return isl_space_can_uncurry(map
->dim
);
10471 /* Given a basic map A -> (B -> C), return the corresponding basic map
10474 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10480 if (!isl_basic_map_can_uncurry(bmap
))
10481 isl_die(bmap
->ctx
, isl_error_invalid
,
10482 "basic map cannot be uncurried",
10483 return isl_basic_map_free(bmap
));
10484 bmap
= isl_basic_map_cow(bmap
);
10487 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10489 return isl_basic_map_free(bmap
);
10493 /* Given a map A -> (B -> C), return the corresponding map
10496 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10503 if (!isl_map_can_uncurry(map
))
10504 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10505 return isl_map_free(map
));
10507 map
= isl_map_cow(map
);
10511 for (i
= 0; i
< map
->n
; ++i
) {
10512 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10514 return isl_map_free(map
);
10517 map
->dim
= isl_space_uncurry(map
->dim
);
10519 return isl_map_free(map
);
10524 /* Construct a basic map mapping the domain of the affine expression
10525 * to a one-dimensional range prescribed by the affine expression.
10527 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10531 isl_local_space
*ls
;
10532 isl_basic_map
*bmap
;
10537 ls
= isl_aff_get_local_space(aff
);
10538 bmap
= isl_basic_map_from_local_space(ls
);
10539 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10540 k
= isl_basic_map_alloc_equality(bmap
);
10544 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10545 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10546 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10547 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10548 aff
->v
->size
- (pos
+ 1));
10551 bmap
= isl_basic_map_finalize(bmap
);
10555 isl_basic_map_free(bmap
);
10559 /* Construct a map mapping the domain of the affine expression
10560 * to a one-dimensional range prescribed by the affine expression.
10562 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10564 isl_basic_map
*bmap
;
10566 bmap
= isl_basic_map_from_aff(aff
);
10567 return isl_map_from_basic_map(bmap
);
10570 /* Construct a basic map mapping the domain the multi-affine expression
10571 * to its range, with each dimension in the range equated to the
10572 * corresponding affine expression.
10574 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10575 __isl_take isl_multi_aff
*maff
)
10579 isl_basic_map
*bmap
;
10584 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10585 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10586 "invalid space", return isl_multi_aff_free(maff
));
10588 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10589 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10591 for (i
= 0; i
< maff
->n
; ++i
) {
10593 isl_basic_map
*bmap_i
;
10595 aff
= isl_aff_copy(maff
->p
[i
]);
10596 bmap_i
= isl_basic_map_from_aff(aff
);
10598 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10601 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10603 isl_multi_aff_free(maff
);
10607 /* Construct a map mapping the domain the multi-affine expression
10608 * to its range, with each dimension in the range equated to the
10609 * corresponding affine expression.
10611 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10613 isl_basic_map
*bmap
;
10615 bmap
= isl_basic_map_from_multi_aff(maff
);
10616 return isl_map_from_basic_map(bmap
);
10619 /* Construct a basic map mapping a domain in the given space to
10620 * to an n-dimensional range, with n the number of elements in the list,
10621 * where each coordinate in the range is prescribed by the
10622 * corresponding affine expression.
10623 * The domains of all affine expressions in the list are assumed to match
10626 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10627 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10631 isl_basic_map
*bmap
;
10636 dim
= isl_space_from_domain(domain_dim
);
10637 bmap
= isl_basic_map_universe(dim
);
10639 for (i
= 0; i
< list
->n
; ++i
) {
10641 isl_basic_map
*bmap_i
;
10643 aff
= isl_aff_copy(list
->p
[i
]);
10644 bmap_i
= isl_basic_map_from_aff(aff
);
10646 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10649 isl_aff_list_free(list
);
10653 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10654 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10656 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10659 /* Construct a basic map where the given dimensions are equal to each other.
10661 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10662 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10664 isl_basic_map
*bmap
= NULL
;
10670 if (pos1
>= isl_space_dim(space
, type1
))
10671 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10672 "index out of bounds", goto error
);
10673 if (pos2
>= isl_space_dim(space
, type2
))
10674 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10675 "index out of bounds", goto error
);
10677 if (type1
== type2
&& pos1
== pos2
)
10678 return isl_basic_map_universe(space
);
10680 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10681 i
= isl_basic_map_alloc_equality(bmap
);
10684 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10685 pos1
+= isl_basic_map_offset(bmap
, type1
);
10686 pos2
+= isl_basic_map_offset(bmap
, type2
);
10687 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10688 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10689 bmap
= isl_basic_map_finalize(bmap
);
10690 isl_space_free(space
);
10693 isl_space_free(space
);
10694 isl_basic_map_free(bmap
);
10698 /* Add a constraint imposing that the given two dimensions are equal.
10700 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10701 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10705 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10707 bmap
= isl_basic_map_intersect(bmap
, eq
);
10712 /* Add a constraint imposing that the given two dimensions are equal.
10714 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10715 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10717 isl_basic_map
*bmap
;
10719 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10721 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10726 /* Add a constraint imposing that the given two dimensions have opposite values.
10728 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10729 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10731 isl_basic_map
*bmap
= NULL
;
10737 if (pos1
>= isl_map_dim(map
, type1
))
10738 isl_die(map
->ctx
, isl_error_invalid
,
10739 "index out of bounds", goto error
);
10740 if (pos2
>= isl_map_dim(map
, type2
))
10741 isl_die(map
->ctx
, isl_error_invalid
,
10742 "index out of bounds", goto error
);
10744 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10745 i
= isl_basic_map_alloc_equality(bmap
);
10748 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10749 pos1
+= isl_basic_map_offset(bmap
, type1
);
10750 pos2
+= isl_basic_map_offset(bmap
, type2
);
10751 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10752 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10753 bmap
= isl_basic_map_finalize(bmap
);
10755 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10759 isl_basic_map_free(bmap
);
10764 /* Add a constraint imposing that the value of the first dimension is
10765 * greater than or equal to that of the second.
10767 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10768 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10771 isl_local_space
*ls
;
10776 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10777 isl_die(bmap
->ctx
, isl_error_invalid
,
10778 "index out of bounds", return isl_basic_map_free(bmap
));
10779 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10780 isl_die(bmap
->ctx
, isl_error_invalid
,
10781 "index out of bounds", return isl_basic_map_free(bmap
));
10783 if (type1
== type2
&& pos1
== pos2
)
10786 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10787 c
= isl_inequality_alloc(ls
);
10788 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10789 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10790 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10795 /* Add a constraint imposing that the value of the first dimension is
10796 * greater than that of the second.
10798 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10799 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10801 isl_basic_map
*bmap
= NULL
;
10807 if (pos1
>= isl_map_dim(map
, type1
))
10808 isl_die(map
->ctx
, isl_error_invalid
,
10809 "index out of bounds", goto error
);
10810 if (pos2
>= isl_map_dim(map
, type2
))
10811 isl_die(map
->ctx
, isl_error_invalid
,
10812 "index out of bounds", goto error
);
10814 if (type1
== type2
&& pos1
== pos2
) {
10815 isl_space
*space
= isl_map_get_space(map
);
10817 return isl_map_empty(space
);
10820 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10821 i
= isl_basic_map_alloc_inequality(bmap
);
10824 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10825 pos1
+= isl_basic_map_offset(bmap
, type1
);
10826 pos2
+= isl_basic_map_offset(bmap
, type2
);
10827 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10828 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10829 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10830 bmap
= isl_basic_map_finalize(bmap
);
10832 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10836 isl_basic_map_free(bmap
);
10841 /* Add a constraint imposing that the value of the first dimension is
10842 * smaller than that of the second.
10844 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
10845 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10847 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
10850 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10854 isl_local_space
*ls
;
10859 if (!isl_basic_map_divs_known(bmap
))
10860 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10861 "some divs are unknown", return NULL
);
10863 ls
= isl_basic_map_get_local_space(bmap
);
10864 div
= isl_local_space_get_div(ls
, pos
);
10865 isl_local_space_free(ls
);
10870 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10873 return isl_basic_map_get_div(bset
, pos
);
10876 /* Plug in "subs" for dimension "type", "pos" of "bset".
10878 * Let i be the dimension to replace and let "subs" be of the form
10882 * Any integer division with a non-zero coefficient for i,
10884 * floor((a i + g)/m)
10888 * floor((a f + d g)/(m d))
10890 * Constraints of the form
10898 * We currently require that "subs" is an integral expression.
10899 * Handling rational expressions may require us to add stride constraints
10900 * as we do in isl_basic_set_preimage_multi_aff.
10902 __isl_give isl_basic_set
*isl_basic_set_substitute(
10903 __isl_take isl_basic_set
*bset
,
10904 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10910 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10913 bset
= isl_basic_set_cow(bset
);
10914 if (!bset
|| !subs
)
10917 ctx
= isl_basic_set_get_ctx(bset
);
10918 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10919 isl_die(ctx
, isl_error_invalid
,
10920 "spaces don't match", goto error
);
10921 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10922 isl_die(ctx
, isl_error_unsupported
,
10923 "cannot handle divs yet", goto error
);
10924 if (!isl_int_is_one(subs
->v
->el
[0]))
10925 isl_die(ctx
, isl_error_invalid
,
10926 "can only substitute integer expressions", goto error
);
10928 pos
+= isl_basic_set_offset(bset
, type
);
10932 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10933 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10935 isl_int_set(v
, bset
->eq
[i
][pos
]);
10936 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10937 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10938 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10941 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10942 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10944 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10945 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10946 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10947 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10950 for (i
= 0; i
< bset
->n_div
; ++i
) {
10951 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10953 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10954 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10955 isl_seq_combine(bset
->div
[i
] + 1,
10956 subs
->v
->el
[0], bset
->div
[i
] + 1,
10957 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10958 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10963 bset
= isl_basic_set_simplify(bset
);
10964 return isl_basic_set_finalize(bset
);
10966 isl_basic_set_free(bset
);
10970 /* Plug in "subs" for dimension "type", "pos" of "set".
10972 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10973 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10977 if (set
&& isl_set_plain_is_empty(set
))
10980 set
= isl_set_cow(set
);
10984 for (i
= set
->n
- 1; i
>= 0; --i
) {
10985 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10986 if (remove_if_empty(set
, i
) < 0)
10996 /* Check if the range of "ma" is compatible with "space".
10997 * Return -1 if anything is wrong.
10999 static int check_space_compatible_range_multi_aff(
11000 __isl_keep isl_space
*space
, __isl_keep isl_multi_aff
*ma
)
11003 isl_space
*ma_space
;
11005 ma_space
= isl_multi_aff_get_space(ma
);
11006 m
= isl_space_is_range_internal(space
, ma_space
);
11007 isl_space_free(ma_space
);
11009 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11010 "spaces don't match", return -1);
11014 /* Check if the range of "ma" is compatible with "bset".
11015 * Return -1 if anything is wrong.
11017 static int check_basic_set_compatible_range_multi_aff(
11018 __isl_keep isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11020 return check_space_compatible_range_multi_aff(bset
->dim
, ma
);
11023 /* Copy the divs from "ma" to "bset", adding zeros for the coefficients
11024 * of the other divs in "bset".
11026 static int set_ma_divs(__isl_keep isl_basic_set
*bset
,
11027 __isl_keep isl_multi_aff
*ma
, int n_div
)
11030 isl_local_space
*ls
;
11035 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11039 for (i
= 0; i
< n_div
; ++i
) {
11040 isl_seq_cpy(bset
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
11041 isl_seq_clr(bset
->div
[i
] + ls
->div
->n_col
, bset
->n_div
- n_div
);
11042 if (isl_basic_set_add_div_constraints(bset
, i
) < 0)
11046 isl_local_space_free(ls
);
11049 isl_local_space_free(ls
);
11053 /* How many stride constraints does "ma" enforce?
11054 * That is, how many of the affine expressions have a denominator
11055 * different from one?
11057 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11062 for (i
= 0; i
< ma
->n
; ++i
)
11063 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11069 /* For each affine expression in ma of the form
11071 * x_i = (f_i y + h_i)/m_i
11073 * with m_i different from one, add a constraint to "bset"
11076 * f_i y + h_i = m_i alpha_i
11078 * with alpha_i an additional existentially quantified variable.
11080 static __isl_give isl_basic_set
*add_ma_strides(
11081 __isl_take isl_basic_set
*bset
, __isl_keep isl_multi_aff
*ma
)
11087 total
= isl_basic_set_total_dim(bset
);
11088 for (i
= 0; i
< ma
->n
; ++i
) {
11091 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11093 div
= isl_basic_set_alloc_div(bset
);
11094 k
= isl_basic_set_alloc_equality(bset
);
11095 if (div
< 0 || k
< 0)
11097 isl_int_set_si(bset
->div
[div
][0], 0);
11098 len
= ma
->p
[i
]->v
->size
;
11099 isl_seq_cpy(bset
->eq
[k
], ma
->p
[i
]->v
->el
+ 1, len
- 1);
11100 isl_seq_clr(bset
->eq
[k
] + len
- 1, 1 + total
- (len
- 1));
11101 isl_int_neg(bset
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11107 isl_basic_set_free(bset
);
11111 /* Compute the preimage of "bset" under the function represented by "ma".
11112 * In other words, plug in "ma" in "bset". The result is a basic set
11113 * that lives in the domain space of "ma".
11115 * If bset is represented by
11117 * A(p) + B x + C(divs) >= 0
11119 * and ma is represented by
11121 * x = D(p) + F(y) + G(divs')
11123 * then the result is
11125 * A(p) + B D(p) + B F(y) + B G(divs') + C(divs) >= 0
11127 * The divs in the input set are similarly adjusted.
11130 * floor((a_i(p) + b_i x + c_i(divs))/n_i)
11134 * floor((a_i(p) + b_i D(p) + b_i F(y) + B_i G(divs') + c_i(divs))/n_i)
11136 * If bset is not a rational set and if F(y) involves any denominators
11138 * x_i = (f_i y + h_i)/m_i
11140 * the additional constraints are added to ensure that we only
11141 * map back integer points. That is we enforce
11143 * f_i y + h_i = m_i alpha_i
11145 * with alpha_i an additional existentially quantified variable.
11147 * We first copy over the divs from "ma".
11148 * Then we add the modified constraints and divs from "bset".
11149 * Finally, we add the stride constraints, if needed.
11151 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11152 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11156 isl_basic_set
*res
= NULL
;
11157 int n_div_bset
, n_div_ma
;
11158 isl_int f
, c1
, c2
, g
;
11159 int rational
, strides
;
11166 ma
= isl_multi_aff_align_divs(ma
);
11169 if (check_basic_set_compatible_range_multi_aff(bset
, ma
) < 0)
11172 n_div_bset
= isl_basic_set_dim(bset
, isl_dim_div
);
11173 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11175 space
= isl_space_domain(isl_multi_aff_get_space(ma
));
11176 rational
= isl_basic_set_is_rational(bset
);
11177 strides
= rational
? 0 : multi_aff_strides(ma
);
11178 res
= isl_basic_set_alloc_space(space
, n_div_ma
+ n_div_bset
+ strides
,
11179 bset
->n_eq
+ strides
, bset
->n_ineq
+ 2 * n_div_ma
);
11181 res
= isl_basic_set_set_rational(res
);
11183 for (i
= 0; i
< n_div_ma
+ n_div_bset
; ++i
)
11184 if (isl_basic_set_alloc_div(res
) < 0)
11187 if (set_ma_divs(res
, ma
, n_div_ma
) < 0)
11190 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11191 k
= isl_basic_set_alloc_equality(res
);
11194 isl_seq_preimage(res
->eq
[k
], bset
->eq
[i
], ma
, n_div_ma
,
11195 n_div_bset
, f
, c1
, c2
, g
, 0);
11198 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11199 k
= isl_basic_set_alloc_inequality(res
);
11202 isl_seq_preimage(res
->ineq
[k
], bset
->ineq
[i
], ma
, n_div_ma
,
11203 n_div_bset
, f
, c1
, c2
, g
, 0);
11206 for (i
= 0; i
< bset
->n_div
; ++i
) {
11207 if (isl_int_is_zero(bset
->div
[i
][0])) {
11208 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11211 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bset
->div
[i
],
11212 ma
, n_div_ma
, n_div_bset
, f
, c1
, c2
, g
, 1);
11216 res
= add_ma_strides(res
, ma
);
11222 isl_basic_set_free(bset
);
11223 isl_multi_aff_free(ma
);
11224 res
= isl_basic_set_simplify(res
);
11225 return isl_basic_set_finalize(res
);
11231 isl_basic_set_free(bset
);
11232 isl_multi_aff_free(ma
);
11233 isl_basic_set_free(res
);
11237 /* Check if the range of "ma" is compatible with "set".
11238 * Return -1 if anything is wrong.
11240 static int check_set_compatible_range_multi_aff(
11241 __isl_keep isl_set
*set
, __isl_keep isl_multi_aff
*ma
)
11243 return check_space_compatible_range_multi_aff(set
->dim
, ma
);
11246 /* Compute the preimage of "set" under the function represented by "ma".
11247 * In other words, plug in "ma" in "set. The result is a set
11248 * that lives in the domain space of "ma".
11250 static __isl_give isl_set
*set_preimage_multi_aff(__isl_take isl_set
*set
,
11251 __isl_take isl_multi_aff
*ma
)
11255 set
= isl_set_cow(set
);
11256 ma
= isl_multi_aff_align_divs(ma
);
11259 if (check_set_compatible_range_multi_aff(set
, ma
) < 0)
11262 for (i
= 0; i
< set
->n
; ++i
) {
11263 set
->p
[i
] = isl_basic_set_preimage_multi_aff(set
->p
[i
],
11264 isl_multi_aff_copy(ma
));
11269 isl_space_free(set
->dim
);
11270 set
->dim
= isl_multi_aff_get_domain_space(ma
);
11274 isl_multi_aff_free(ma
);
11276 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
11277 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
11280 isl_multi_aff_free(ma
);
11285 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11286 __isl_take isl_multi_aff
*ma
)
11291 if (isl_space_match(set
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11292 return set_preimage_multi_aff(set
, ma
);
11294 if (!isl_space_has_named_params(set
->dim
) ||
11295 !isl_space_has_named_params(ma
->space
))
11296 isl_die(set
->ctx
, isl_error_invalid
,
11297 "unaligned unnamed parameters", goto error
);
11298 set
= isl_set_align_params(set
, isl_multi_aff_get_space(ma
));
11299 ma
= isl_multi_aff_align_params(ma
, isl_set_get_space(set
));
11301 return set_preimage_multi_aff(set
, ma
);
11303 isl_multi_aff_free(ma
);
11304 return isl_set_free(set
);
11307 /* Compute the preimage of "set" under the function represented by "pma".
11308 * In other words, plug in "pma" in "set. The result is a set
11309 * that lives in the domain space of "pma".
11311 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11312 __isl_take isl_pw_multi_aff
*pma
)
11321 isl_pw_multi_aff_free(pma
);
11322 res
= isl_set_empty(isl_set_get_space(set
));
11327 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11328 isl_multi_aff_copy(pma
->p
[0].maff
));
11329 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11331 for (i
= 1; i
< pma
->n
; ++i
) {
11334 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11335 isl_multi_aff_copy(pma
->p
[i
].maff
));
11336 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11337 res
= isl_set_union(res
, res_i
);
11340 isl_pw_multi_aff_free(pma
);
11344 isl_pw_multi_aff_free(pma
);
11349 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11350 __isl_take isl_pw_multi_aff
*pma
)
11355 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11356 return set_preimage_pw_multi_aff(set
, pma
);
11358 if (!isl_space_has_named_params(set
->dim
) ||
11359 !isl_space_has_named_params(pma
->dim
))
11360 isl_die(set
->ctx
, isl_error_invalid
,
11361 "unaligned unnamed parameters", goto error
);
11362 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11363 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11365 return set_preimage_pw_multi_aff(set
, pma
);
11367 isl_pw_multi_aff_free(pma
);
11368 return isl_set_free(set
);