2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include "isl_sample.h"
30 /* Maps dst positions to src positions */
36 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
39 struct isl_dim_map
*dim_map
;
40 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
41 sizeof(struct isl_dim_map
) + len
* sizeof(int));
44 dim_map
->len
= 1 + len
;
46 for (i
= 0; i
< len
; ++i
)
47 dim_map
->pos
[1 + i
] = -1;
51 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
54 case isl_dim_param
: return dim
->nparam
;
55 case isl_dim_in
: return dim
->n_in
;
56 case isl_dim_out
: return dim
->n_out
;
57 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
62 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
65 case isl_dim_param
: return 1;
66 case isl_dim_in
: return 1 + dim
->nparam
;
67 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
72 static void isl_dim_map_dim_range(struct isl_dim_map
*dim_map
,
73 struct isl_dim
*dim
, enum isl_dim_type type
,
74 unsigned first
, unsigned n
, unsigned dst_pos
)
82 src_pos
= pos(dim
, type
);
83 for (i
= 0; i
< n
; ++i
)
84 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ first
+ i
;
87 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
88 enum isl_dim_type type
, unsigned dst_pos
)
90 isl_dim_map_dim_range(dim_map
, dim
, type
, 0, n(dim
, type
), dst_pos
);
93 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
94 struct isl_basic_map
*bmap
, unsigned dst_pos
)
99 if (!dim_map
|| !bmap
)
102 src_pos
= 1 + isl_dim_total(bmap
->dim
);
103 for (i
= 0; i
< bmap
->n_div
; ++i
)
104 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
107 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
111 for (i
= 0; i
< dim_map
->len
; ++i
)
112 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
113 fprintf(stderr
, "\n");
116 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
117 enum isl_dim_type type
)
124 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
125 case isl_dim_div
: return bmap
->n_div
;
126 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
131 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
133 return map
? n(map
->dim
, type
) : 0;
136 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
138 return set
? n(set
->dim
, type
) : 0;
141 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
142 enum isl_dim_type type
)
144 struct isl_dim
*dim
= bmap
->dim
;
146 case isl_dim_param
: return 1;
147 case isl_dim_in
: return 1 + dim
->nparam
;
148 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
149 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
154 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
156 return pos(map
->dim
, type
);
159 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
160 enum isl_dim_type type
)
162 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
165 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
167 return isl_basic_set_dim(bset
, isl_dim_set
);
170 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
172 return isl_basic_set_dim(bset
, isl_dim_param
);
175 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
177 return isl_dim_total(bset
->dim
) + bset
->n_div
;
180 unsigned isl_set_n_dim(const struct isl_set
*set
)
182 return isl_set_dim(set
, isl_dim_set
);
185 unsigned isl_set_n_param(const struct isl_set
*set
)
187 return isl_set_dim(set
, isl_dim_param
);
190 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
192 return bmap
->dim
->n_in
;
195 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
197 return bmap
->dim
->n_out
;
200 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
202 return bmap
->dim
->nparam
;
205 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
210 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
212 return bmap
? isl_dim_total(bmap
->dim
) + bmap
->n_div
: 0;
215 unsigned isl_map_n_in(const struct isl_map
*map
)
217 return map
->dim
->n_in
;
220 unsigned isl_map_n_out(const struct isl_map
*map
)
222 return map
->dim
->n_out
;
225 unsigned isl_map_n_param(const struct isl_map
*map
)
227 return map
->dim
->nparam
;
230 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
232 return map
->dim
->n_in
== set
->dim
->n_out
&&
233 map
->dim
->nparam
== set
->dim
->nparam
;
236 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
237 struct isl_basic_set
*bset
)
239 return bmap
->dim
->n_in
== bset
->dim
->n_out
&&
240 bmap
->dim
->nparam
== bset
->dim
->nparam
;
243 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
244 struct isl_basic_set
*bset
)
246 return bmap
->dim
->n_out
== bset
->dim
->n_out
&&
247 bmap
->dim
->nparam
== bset
->dim
->nparam
;
250 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
252 return map
? map
->ctx
: NULL
;
255 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
259 return isl_dim_copy(bmap
->dim
);
262 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
266 return isl_dim_copy(bset
->dim
);
269 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
273 return isl_dim_copy(map
->dim
);
276 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
280 return isl_dim_copy(set
->dim
);
283 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
284 __isl_take isl_basic_map
*bmap
,
285 enum isl_dim_type type
, unsigned pos
, const char *s
)
289 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
294 isl_basic_map_free(bmap
);
298 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
299 enum isl_dim_type type
, unsigned pos
, const char *s
)
306 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
310 for (i
= 0; i
< map
->n
; ++i
) {
311 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
322 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
323 __isl_take isl_basic_set
*bset
,
324 enum isl_dim_type type
, unsigned pos
, const char *s
)
326 return (isl_basic_set
*)isl_basic_map_set_dim_name(
327 (isl_basic_map
*)bset
, type
, pos
, s
);
330 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
331 enum isl_dim_type type
, unsigned pos
, const char *s
)
333 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
336 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
340 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
343 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
344 struct isl_basic_map
*bmap
, unsigned extra
,
345 unsigned n_eq
, unsigned n_ineq
)
348 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
353 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
354 if (isl_blk_is_error(bmap
->block
))
357 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
362 bmap
->block2
= isl_blk_empty();
365 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
366 if (isl_blk_is_error(bmap
->block2
))
369 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
374 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
375 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
377 for (i
= 0; i
< extra
; ++i
)
378 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
382 bmap
->c_size
= n_eq
+ n_ineq
;
383 bmap
->eq
= bmap
->ineq
+ n_ineq
;
392 isl_basic_map_free(bmap
);
396 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
397 unsigned nparam
, unsigned dim
, unsigned extra
,
398 unsigned n_eq
, unsigned n_ineq
)
400 struct isl_basic_map
*bmap
;
401 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
402 return (struct isl_basic_set
*)bmap
;
405 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
406 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
408 struct isl_basic_map
*bmap
;
411 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
412 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
413 return (struct isl_basic_set
*)bmap
;
416 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
417 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
419 struct isl_basic_map
*bmap
;
423 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
428 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
434 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
435 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
436 unsigned n_eq
, unsigned n_ineq
)
438 struct isl_basic_map
*bmap
;
441 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
445 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
449 static void dup_constraints(
450 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
453 unsigned total
= isl_basic_map_total_dim(src
);
455 for (i
= 0; i
< src
->n_eq
; ++i
) {
456 int j
= isl_basic_map_alloc_equality(dst
);
457 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
460 for (i
= 0; i
< src
->n_ineq
; ++i
) {
461 int j
= isl_basic_map_alloc_inequality(dst
);
462 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
465 for (i
= 0; i
< src
->n_div
; ++i
) {
466 int j
= isl_basic_map_alloc_div(dst
);
467 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
469 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
472 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
474 struct isl_basic_map
*dup
;
478 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
479 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
482 dup_constraints(dup
, bmap
);
483 dup
->flags
= bmap
->flags
;
484 dup
->sample
= isl_vec_copy(bmap
->sample
);
488 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
490 struct isl_basic_map
*dup
;
492 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
493 return (struct isl_basic_set
*)dup
;
496 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
501 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
505 return isl_basic_set_dup(bset
);
508 struct isl_set
*isl_set_copy(struct isl_set
*set
)
517 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
522 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
526 bmap
= isl_basic_map_dup(bmap
);
528 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
532 struct isl_map
*isl_map_copy(struct isl_map
*map
)
541 void isl_basic_map_free(struct isl_basic_map
*bmap
)
549 isl_ctx_deref(bmap
->ctx
);
551 isl_blk_free(bmap
->ctx
, bmap
->block2
);
553 isl_blk_free(bmap
->ctx
, bmap
->block
);
554 isl_vec_free(bmap
->sample
);
555 isl_dim_free(bmap
->dim
);
559 void isl_basic_set_free(struct isl_basic_set
*bset
)
561 isl_basic_map_free((struct isl_basic_map
*)bset
);
564 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
566 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
569 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
575 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
576 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
578 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
579 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
580 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
581 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
582 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
583 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
585 int j
= isl_basic_map_alloc_inequality(bmap
);
589 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
590 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
597 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
598 bmap
->extra
- bmap
->n_div
);
602 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
604 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
607 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
611 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
616 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
618 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
621 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
626 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
628 if (pos
!= bmap
->n_eq
- 1) {
630 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
631 bmap
->eq
[bmap
->n_eq
- 1] = t
;
637 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
639 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
642 void isl_basic_map_inequality_to_equality(
643 struct isl_basic_map
*bmap
, unsigned pos
)
648 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
649 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
654 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
655 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
656 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
657 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
660 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
662 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
665 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
671 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
672 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
673 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
674 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
675 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
676 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
677 1 + isl_basic_map_total_dim(bmap
),
678 bmap
->extra
- bmap
->n_div
);
679 return bmap
->n_ineq
++;
682 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
684 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
687 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
691 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
696 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
698 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
701 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
706 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
708 if (pos
!= bmap
->n_ineq
- 1) {
710 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
711 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
712 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
718 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
720 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
723 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
728 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
731 k
= isl_basic_map_alloc_equality(bmap
);
734 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
737 isl_basic_map_free(bmap
);
741 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
744 return (isl_basic_set
*)
745 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
748 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
753 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
756 k
= isl_basic_map_alloc_inequality(bmap
);
759 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
762 isl_basic_map_free(bmap
);
766 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
769 return (isl_basic_set
*)
770 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
773 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
777 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
778 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
779 1 + 1 + isl_basic_map_total_dim(bmap
),
780 bmap
->extra
- bmap
->n_div
);
781 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
782 return bmap
->n_div
++;
785 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
787 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
790 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
794 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
799 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
801 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
804 /* Copy constraint from src to dst, putting the vars of src at offset
805 * dim_off in dst and the divs of src at offset div_off in dst.
806 * If both sets are actually map, then dim_off applies to the input
809 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
810 struct isl_basic_map
*src_map
, isl_int
*src
,
811 unsigned in_off
, unsigned out_off
, unsigned div_off
)
813 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
814 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
815 unsigned src_in
= isl_basic_map_n_in(src_map
);
816 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
817 unsigned src_out
= isl_basic_map_n_out(src_map
);
818 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
819 isl_int_set(dst
[0], src
[0]);
820 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
821 if (dst_nparam
> src_nparam
)
822 isl_seq_clr(dst
+1+src_nparam
,
823 dst_nparam
- src_nparam
);
824 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
825 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
827 isl_min(dst_in
-in_off
, src_in
));
828 if (dst_in
-in_off
> src_in
)
829 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
830 dst_in
- in_off
- src_in
);
831 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
832 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
833 src
+1+src_nparam
+src_in
,
834 isl_min(dst_out
-out_off
, src_out
));
835 if (dst_out
-out_off
> src_out
)
836 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
837 dst_out
- out_off
- src_out
);
838 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
839 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
840 src
+1+src_nparam
+src_in
+src_out
,
841 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
842 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
843 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
844 div_off
+src_map
->n_div
,
845 dst_map
->n_div
- div_off
- src_map
->n_div
);
848 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
849 struct isl_basic_map
*src_map
, isl_int
*src
,
850 unsigned in_off
, unsigned out_off
, unsigned div_off
)
852 isl_int_set(dst
[0], src
[0]);
853 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
856 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
857 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
862 if (!bmap1
|| !bmap2
)
865 div_off
= bmap1
->n_div
;
867 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
868 int i1
= isl_basic_map_alloc_equality(bmap1
);
871 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
872 i_pos
, o_pos
, div_off
);
875 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
876 int i1
= isl_basic_map_alloc_inequality(bmap1
);
879 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
880 i_pos
, o_pos
, div_off
);
883 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
884 int i1
= isl_basic_map_alloc_div(bmap1
);
887 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
888 i_pos
, o_pos
, div_off
);
891 isl_basic_map_free(bmap2
);
896 isl_basic_map_free(bmap1
);
897 isl_basic_map_free(bmap2
);
901 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
902 struct isl_dim_map
*dim_map
)
906 for (i
= 0; i
< dim_map
->len
; ++i
) {
907 if (dim_map
->pos
[i
] < 0)
908 isl_int_set_si(dst
[i
], 0);
910 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
914 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
915 struct isl_dim_map
*dim_map
)
917 isl_int_set(dst
[0], src
[0]);
918 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
921 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
922 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
926 if (!src
|| !dst
|| !dim_map
)
929 for (i
= 0; i
< src
->n_eq
; ++i
) {
930 int i1
= isl_basic_map_alloc_equality(dst
);
933 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
936 for (i
= 0; i
< src
->n_ineq
; ++i
) {
937 int i1
= isl_basic_map_alloc_inequality(dst
);
940 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
943 for (i
= 0; i
< src
->n_div
; ++i
) {
944 int i1
= isl_basic_map_alloc_div(dst
);
947 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
951 isl_basic_map_free(src
);
956 isl_basic_map_free(src
);
957 isl_basic_map_free(dst
);
961 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
962 struct isl_basic_set
*bset2
, unsigned pos
)
964 return (struct isl_basic_set
*)
965 add_constraints((struct isl_basic_map
*)bset1
,
966 (struct isl_basic_map
*)bset2
, 0, pos
);
969 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
970 struct isl_dim
*dim
, unsigned extra
,
971 unsigned n_eq
, unsigned n_ineq
)
973 struct isl_basic_map
*ext
;
983 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
984 base
->extra
>= base
->n_div
+ extra
;
986 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
987 room_for_ineq(base
, n_ineq
)) {
992 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
993 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
994 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
995 extra
+= base
->extra
;
997 n_ineq
+= base
->n_ineq
;
999 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1005 ext
->sample
= isl_vec_copy(base
->sample
);
1006 flags
= base
->flags
;
1007 ext
= add_constraints(ext
, base
, 0, 0);
1010 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1017 isl_basic_map_free(base
);
1021 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1022 struct isl_dim
*dim
, unsigned extra
,
1023 unsigned n_eq
, unsigned n_ineq
)
1025 return (struct isl_basic_set
*)
1026 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1027 extra
, n_eq
, n_ineq
);
1030 struct isl_basic_map
*isl_basic_map_extend_constraints(
1031 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1035 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1039 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1040 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1041 unsigned n_eq
, unsigned n_ineq
)
1043 struct isl_basic_map
*bmap
;
1044 struct isl_dim
*dim
;
1048 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1052 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1055 isl_basic_map_free(base
);
1059 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1060 unsigned nparam
, unsigned dim
, unsigned extra
,
1061 unsigned n_eq
, unsigned n_ineq
)
1063 return (struct isl_basic_set
*)
1064 isl_basic_map_extend((struct isl_basic_map
*)base
,
1065 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1068 struct isl_basic_set
*isl_basic_set_extend_constraints(
1069 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1071 return (struct isl_basic_set
*)
1072 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1076 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1078 return (struct isl_basic_set
*)
1079 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1082 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1087 if (bmap
->ref
> 1) {
1089 bmap
= isl_basic_map_dup(bmap
);
1092 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1096 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1104 return isl_set_dup(set
);
1107 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1115 return isl_map_dup(map
);
1118 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1119 unsigned a_len
, unsigned b_len
)
1121 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1122 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1123 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1126 struct isl_basic_set
*isl_basic_set_swap_vars(
1127 struct isl_basic_set
*bset
, unsigned n
)
1137 nparam
= isl_basic_set_n_param(bset
);
1138 dim
= isl_basic_set_n_dim(bset
);
1139 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1144 bset
= isl_basic_set_cow(bset
);
1148 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1149 if (isl_blk_is_error(blk
))
1152 for (i
= 0; i
< bset
->n_eq
; ++i
)
1154 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1156 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1158 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1160 for (i
= 0; i
< bset
->n_div
; ++i
)
1162 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1164 isl_blk_free(bset
->ctx
, blk
);
1166 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1167 return isl_basic_set_gauss(bset
, NULL
);
1169 isl_basic_set_free(bset
);
1173 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1176 set
= isl_set_cow(set
);
1180 for (i
= 0; i
< set
->n
; ++i
) {
1181 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1187 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1191 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1197 total
= isl_basic_map_total_dim(bmap
);
1198 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1199 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1201 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1203 i
= isl_basic_map_alloc_equality(bmap
);
1207 isl_int_set_si(bmap
->eq
[i
][0], 1);
1208 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1209 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1210 isl_vec_free(bmap
->sample
);
1211 bmap
->sample
= NULL
;
1212 return isl_basic_map_finalize(bmap
);
1214 isl_basic_map_free(bmap
);
1218 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1220 return (struct isl_basic_set
*)
1221 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1224 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1227 unsigned off
= isl_dim_total(bmap
->dim
);
1228 isl_int
*t
= bmap
->div
[a
];
1229 bmap
->div
[a
] = bmap
->div
[b
];
1232 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1233 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1235 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1236 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1238 for (i
= 0; i
< bmap
->n_div
; ++i
)
1239 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1240 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1243 /* Eliminate the specified n dimensions starting at first from the
1244 * constraints using Fourier-Motzkin. The dimensions themselves
1247 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1248 enum isl_dim_type type
, unsigned first
, unsigned n
)
1257 map
= isl_map_cow(map
);
1260 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1261 first
+= pos(map
->dim
, type
) - 1;
1263 for (i
= 0; i
< map
->n
; ++i
) {
1264 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1274 /* Eliminate the specified n dimensions starting at first from the
1275 * constraints using Fourier-Motzkin. The dimensions themselves
1278 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1279 enum isl_dim_type type
, unsigned first
, unsigned n
)
1281 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1284 /* Eliminate the specified n dimensions starting at first from the
1285 * constraints using Fourier-Motzkin. The dimensions themselves
1288 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1289 unsigned first
, unsigned n
)
1291 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1294 /* Project out n dimensions starting at first using Fourier-Motzkin */
1295 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1296 unsigned first
, unsigned n
)
1298 set
= isl_set_eliminate_dims(set
, first
, n
);
1299 set
= isl_set_drop_dims(set
, first
, n
);
1303 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1305 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1313 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1322 set
= isl_set_cow(set
);
1326 for (i
= 0; i
< set
->n
; ++i
) {
1327 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1337 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1338 enum isl_dim_type type
, unsigned first
, unsigned n
)
1342 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1346 bmap
= isl_basic_map_eliminate_vars(bmap
,
1347 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1350 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1352 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1355 isl_basic_map_free(bmap
);
1359 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1360 enum isl_dim_type type
, unsigned first
, unsigned n
)
1362 return (isl_basic_set
*)
1363 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1366 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1367 enum isl_dim_type type
, unsigned first
, unsigned n
)
1374 map
= isl_map_cow(map
);
1377 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1379 for (i
= 0; i
< map
->n
; ++i
) {
1380 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1381 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1385 map
= isl_map_drop(map
, type
, first
, n
);
1392 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1393 enum isl_dim_type type
, unsigned first
, unsigned n
)
1395 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1398 /* Project out n inputs starting at first using Fourier-Motzkin */
1399 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1400 unsigned first
, unsigned n
)
1402 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1405 /* Project out n dimensions starting at first using Fourier-Motzkin */
1406 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1407 unsigned first
, unsigned n
)
1409 unsigned nparam
= isl_basic_set_n_param(bset
);
1410 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1411 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1415 static void dump_term(struct isl_basic_map
*bmap
,
1416 isl_int c
, int pos
, FILE *out
)
1419 unsigned in
= isl_basic_map_n_in(bmap
);
1420 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1421 unsigned nparam
= isl_basic_map_n_param(bmap
);
1423 isl_int_print(out
, c
, 0);
1425 if (!isl_int_is_one(c
))
1426 isl_int_print(out
, c
, 0);
1427 if (pos
< 1 + nparam
) {
1428 name
= isl_dim_get_name(bmap
->dim
,
1429 isl_dim_param
, pos
- 1);
1431 fprintf(out
, "%s", name
);
1433 fprintf(out
, "p%d", pos
- 1);
1434 } else if (pos
< 1 + nparam
+ in
)
1435 fprintf(out
, "i%d", pos
- 1 - nparam
);
1436 else if (pos
< 1 + nparam
+ dim
)
1437 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1439 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1443 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1444 int sign
, FILE *out
)
1448 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1452 for (i
= 0, first
= 1; i
< len
; ++i
) {
1453 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1456 fprintf(out
, " + ");
1458 isl_int_abs(v
, c
[i
]);
1459 dump_term(bmap
, v
, i
, out
);
1466 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1467 const char *op
, FILE *out
, int indent
)
1471 fprintf(out
, "%*s", indent
, "");
1473 dump_constraint_sign(bmap
, c
, 1, out
);
1474 fprintf(out
, " %s ", op
);
1475 dump_constraint_sign(bmap
, c
, -1, out
);
1479 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1480 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1482 fprintf(out
, "%*s", indent
, "");
1483 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1488 static void dump_constraints(struct isl_basic_map
*bmap
,
1489 isl_int
**c
, unsigned n
,
1490 const char *op
, FILE *out
, int indent
)
1494 for (i
= 0; i
< n
; ++i
)
1495 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1498 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1502 unsigned total
= isl_basic_map_total_dim(bmap
);
1504 for (j
= 0; j
< 1 + total
; ++j
) {
1505 if (isl_int_is_zero(exp
[j
]))
1507 if (!first
&& isl_int_is_pos(exp
[j
]))
1509 dump_term(bmap
, exp
[j
], j
, out
);
1514 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1518 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1519 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1521 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1522 fprintf(out
, "%*s", indent
, "");
1523 fprintf(out
, "e%d = [(", i
);
1524 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1526 isl_int_print(out
, bmap
->div
[i
][0], 0);
1527 fprintf(out
, "]\n");
1531 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1534 fprintf(out
, "null basic set\n");
1538 fprintf(out
, "%*s", indent
, "");
1539 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1540 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1541 bset
->extra
, bset
->flags
);
1542 dump((struct isl_basic_map
*)bset
, out
, indent
);
1545 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1548 fprintf(out
, "null basic map\n");
1552 fprintf(out
, "%*s", indent
, "");
1553 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1554 "flags: %x, n_name: %d\n",
1556 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1557 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1558 dump(bmap
, out
, indent
);
1561 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1566 total
= isl_basic_map_total_dim(bmap
);
1567 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1568 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1569 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1570 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1574 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1576 struct isl_set
*set
;
1580 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1581 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1582 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1583 sizeof(struct isl_set
) +
1584 (n
- 1) * sizeof(struct isl_basic_set
*));
1588 set
->ctx
= dim
->ctx
;
1589 isl_ctx_ref(set
->ctx
);
1601 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1602 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1604 struct isl_set
*set
;
1605 struct isl_dim
*dims
;
1607 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1611 set
= isl_set_alloc_dim(dims
, n
, flags
);
1615 /* Make sure "map" has room for at least "n" more basic maps.
1617 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1620 struct isl_map
*grown
= NULL
;
1624 isl_assert(map
->ctx
, n
>= 0, goto error
);
1625 if (map
->n
+ n
<= map
->size
)
1627 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1630 for (i
= 0; i
< map
->n
; ++i
) {
1631 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1639 isl_map_free(grown
);
1644 /* Make sure "set" has room for at least "n" more basic sets.
1646 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1648 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1651 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1654 struct isl_set
*dup
;
1659 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1662 for (i
= 0; i
< set
->n
; ++i
)
1663 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1667 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1669 struct isl_set
*set
;
1674 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1676 isl_basic_set_free(bset
);
1679 return isl_set_add_basic_set(set
, bset
);
1682 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1684 struct isl_map
*map
;
1689 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1691 isl_basic_map_free(bmap
);
1694 return isl_map_add_basic_map(map
, bmap
);
1697 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1698 __isl_take isl_basic_set
*bset
)
1700 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1701 (struct isl_basic_map
*)bset
);
1704 void isl_set_free(struct isl_set
*set
)
1714 isl_ctx_deref(set
->ctx
);
1715 for (i
= 0; i
< set
->n
; ++i
)
1716 isl_basic_set_free(set
->p
[i
]);
1717 isl_dim_free(set
->dim
);
1721 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1726 fprintf(out
, "null set\n");
1730 fprintf(out
, "%*s", indent
, "");
1731 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1732 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1734 for (i
= 0; i
< set
->n
; ++i
) {
1735 fprintf(out
, "%*s", indent
, "");
1736 fprintf(out
, "basic set %d:\n", i
);
1737 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1741 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1746 fprintf(out
, "null map\n");
1750 fprintf(out
, "%*s", indent
, "");
1751 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1752 "flags: %x, n_name: %d\n",
1753 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1754 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1755 for (i
= 0; i
< map
->n
; ++i
) {
1756 fprintf(out
, "%*s", indent
, "");
1757 fprintf(out
, "basic map %d:\n", i
);
1758 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1762 struct isl_basic_map
*isl_basic_map_intersect_domain(
1763 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1765 struct isl_basic_map
*bmap_domain
;
1766 struct isl_dim
*dim
;
1771 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1772 bset
->dim
, isl_dim_param
), goto error
);
1774 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1775 isl_assert(bset
->ctx
,
1776 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1778 bmap
= isl_basic_map_cow(bmap
);
1781 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1782 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1783 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1784 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1785 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1787 bmap
= isl_basic_map_simplify(bmap
);
1788 return isl_basic_map_finalize(bmap
);
1790 isl_basic_map_free(bmap
);
1791 isl_basic_set_free(bset
);
1795 struct isl_basic_map
*isl_basic_map_intersect_range(
1796 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1798 struct isl_basic_map
*bmap_range
;
1803 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1804 bset
->dim
, isl_dim_param
), goto error
);
1806 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1807 isl_assert(bset
->ctx
,
1808 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1810 bmap
= isl_basic_map_cow(bmap
);
1813 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1814 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1815 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1816 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1818 bmap
= isl_basic_map_simplify(bmap
);
1819 return isl_basic_map_finalize(bmap
);
1821 isl_basic_map_free(bmap
);
1822 isl_basic_set_free(bset
);
1826 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1832 total
= 1 + isl_basic_map_total_dim(bmap
);
1833 if (total
!= vec
->size
)
1838 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1839 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1840 if (!isl_int_is_zero(s
)) {
1846 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1847 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1848 if (isl_int_is_neg(s
)) {
1859 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1861 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1864 struct isl_basic_map
*isl_basic_map_intersect(
1865 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1867 struct isl_vec
*sample
= NULL
;
1869 if (!bmap1
|| !bmap2
)
1872 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1873 bmap2
->dim
, isl_dim_param
), goto error
);
1874 if (isl_dim_total(bmap1
->dim
) ==
1875 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1876 isl_dim_total(bmap2
->dim
) !=
1877 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1878 return isl_basic_map_intersect(bmap2
, bmap1
);
1880 if (isl_dim_total(bmap2
->dim
) !=
1881 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1882 isl_assert(bmap1
->ctx
,
1883 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1885 if (bmap1
->sample
&&
1886 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1887 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1888 sample
= isl_vec_copy(bmap1
->sample
);
1889 else if (bmap2
->sample
&&
1890 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1891 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1892 sample
= isl_vec_copy(bmap2
->sample
);
1894 bmap1
= isl_basic_map_cow(bmap1
);
1897 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1898 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1899 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1902 isl_vec_free(sample
);
1904 isl_vec_free(bmap1
->sample
);
1905 bmap1
->sample
= sample
;
1908 bmap1
= isl_basic_map_simplify(bmap1
);
1909 return isl_basic_map_finalize(bmap1
);
1912 isl_vec_free(sample
);
1913 isl_basic_map_free(bmap1
);
1914 isl_basic_map_free(bmap2
);
1918 struct isl_basic_set
*isl_basic_set_intersect(
1919 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1921 return (struct isl_basic_set
*)
1922 isl_basic_map_intersect(
1923 (struct isl_basic_map
*)bset1
,
1924 (struct isl_basic_map
*)bset2
);
1927 /* Special case of isl_map_intersect, where both map1 and map2
1928 * are convex, without any divs and such that either map1 or map2
1929 * contains a single constraint. This constraint is then simply
1930 * added to the other map.
1932 static __isl_give isl_map
*map_intersect_add_constraint(
1933 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
1935 struct isl_basic_map
*bmap1
;
1936 struct isl_basic_map
*bmap2
;
1938 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
1939 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
1940 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
1941 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
1943 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
1944 return isl_map_intersect(map2
, map1
);
1946 isl_assert(map2
->ctx
,
1947 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
1949 map1
= isl_map_cow(map1
);
1952 if (isl_map_fast_is_empty(map1
)) {
1956 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
1957 if (map2
->p
[0]->n_eq
== 1)
1958 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
1960 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
1961 map2
->p
[0]->ineq
[0]);
1963 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
1964 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
1968 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
1969 isl_basic_map_free(map1
->p
[0]);
1982 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1985 struct isl_map
*result
;
1991 if (isl_map_fast_is_empty(map1
)) {
1995 if (isl_map_fast_is_empty(map2
)) {
2000 if (map1
->n
== 1 && map2
->n
== 1 &&
2001 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2002 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2003 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2004 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2005 return map_intersect_add_constraint(map1
, map2
);
2006 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2007 map2
->dim
, isl_dim_param
), goto error
);
2008 if (isl_dim_total(map1
->dim
) ==
2009 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2010 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2011 return isl_map_intersect(map2
, map1
);
2013 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2014 isl_assert(map1
->ctx
,
2015 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2017 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2018 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2019 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2021 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2022 map1
->n
* map2
->n
, flags
);
2025 for (i
= 0; i
< map1
->n
; ++i
)
2026 for (j
= 0; j
< map2
->n
; ++j
) {
2027 struct isl_basic_map
*part
;
2028 part
= isl_basic_map_intersect(
2029 isl_basic_map_copy(map1
->p
[i
]),
2030 isl_basic_map_copy(map2
->p
[j
]));
2031 if (isl_basic_map_is_empty(part
))
2032 isl_basic_map_free(part
);
2034 result
= isl_map_add_basic_map(result
, part
);
2047 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2049 return (struct isl_set
*)
2050 isl_map_intersect((struct isl_map
*)set1
,
2051 (struct isl_map
*)set2
);
2054 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2056 struct isl_dim
*dim
;
2057 struct isl_basic_set
*bset
;
2062 bmap
= isl_basic_map_cow(bmap
);
2065 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2066 in
= isl_basic_map_n_in(bmap
);
2067 bset
= isl_basic_set_from_basic_map(bmap
);
2068 bset
= isl_basic_set_swap_vars(bset
, in
);
2069 return isl_basic_map_from_basic_set(bset
, dim
);
2072 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2073 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2075 struct isl_dim
*res_dim
;
2076 struct isl_basic_map
*res
;
2077 struct isl_dim_map
*dim_map
;
2078 unsigned total
, off
;
2079 enum isl_dim_type t
;
2087 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2089 total
= isl_basic_map_total_dim(bmap
) + n
;
2090 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2092 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2094 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2096 unsigned size
= isl_basic_map_dim(bmap
, t
);
2097 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2099 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2100 pos
, size
- pos
, off
+ pos
+ n
);
2102 off
+= isl_dim_size(res_dim
, t
);
2104 isl_dim_map_div(dim_map
, bmap
, off
);
2106 res
= isl_basic_map_alloc_dim(res_dim
,
2107 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2108 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2109 res
= isl_basic_map_simplify(res
);
2110 return isl_basic_map_finalize(res
);
2113 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2114 enum isl_dim_type type
, unsigned n
)
2118 return isl_basic_map_insert(bmap
, type
,
2119 isl_basic_map_dim(bmap
, type
), n
);
2122 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2123 enum isl_dim_type type
, unsigned n
)
2127 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2128 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2130 isl_basic_set_free(bset
);
2134 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2135 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2142 map
= isl_map_cow(map
);
2146 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2150 for (i
= 0; i
< map
->n
; ++i
) {
2151 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2162 __isl_give isl_map
*isl_map_add(__isl_take isl_map
*map
,
2163 enum isl_dim_type type
, unsigned n
)
2167 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2170 __isl_give isl_set
*isl_set_add(__isl_take isl_set
*set
,
2171 enum isl_dim_type type
, unsigned n
)
2175 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2176 return (isl_set
*)isl_map_add((isl_map
*)set
, type
, n
);
2182 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2183 __isl_take isl_basic_map
*bmap
,
2184 enum isl_dim_type dst_type
, unsigned dst_pos
,
2185 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2188 struct isl_dim_map
*dim_map
;
2189 struct isl_basic_map
*res
;
2190 enum isl_dim_type t
;
2191 unsigned total
, off
;
2198 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2201 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2204 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2206 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2207 pos(bmap
->dim
, src_type
) + src_pos
+
2208 ((src_type
< dst_type
) ? n
: 0)) {
2209 bmap
= isl_basic_map_cow(bmap
);
2213 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2214 src_type
, src_pos
, n
);
2218 bmap
= isl_basic_map_finalize(bmap
);
2223 total
= isl_basic_map_total_dim(bmap
);
2224 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2227 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2228 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2229 if (t
== dst_type
) {
2230 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2233 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2236 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2237 dst_pos
, size
- dst_pos
, off
);
2238 off
+= size
- dst_pos
;
2239 } else if (t
== src_type
) {
2240 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2243 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2244 src_pos
+ n
, size
- src_pos
- n
, off
);
2245 off
+= size
- src_pos
- n
;
2247 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2251 isl_dim_map_div(dim_map
, bmap
, off
);
2253 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2254 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2255 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2257 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2258 src_type
, src_pos
, n
);
2262 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2263 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2264 bmap
= isl_basic_map_finalize(bmap
);
2268 isl_basic_map_free(bmap
);
2272 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2273 enum isl_dim_type dst_type
, unsigned dst_pos
,
2274 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2276 return (isl_basic_set
*)isl_basic_map_move_dims(
2277 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2280 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2281 enum isl_dim_type dst_type
, unsigned dst_pos
,
2282 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2286 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2287 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2288 src_type
, src_pos
, n
);
2294 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2295 enum isl_dim_type dst_type
, unsigned dst_pos
,
2296 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2305 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2308 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2311 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2313 map
= isl_map_cow(map
);
2317 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2321 for (i
= 0; i
< map
->n
; ++i
) {
2322 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2324 src_type
, src_pos
, n
);
2335 /* Move the specified dimensions to the last columns right before
2336 * the divs. Don't change the dimension specification of bmap.
2337 * That's the responsibility of the caller.
2339 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2340 enum isl_dim_type type
, unsigned first
, unsigned n
)
2342 struct isl_dim_map
*dim_map
;
2343 struct isl_basic_map
*res
;
2344 enum isl_dim_type t
;
2345 unsigned total
, off
;
2349 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2352 total
= isl_basic_map_total_dim(bmap
);
2353 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2356 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2357 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2359 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2362 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2363 first
, n
, total
- bmap
->n_div
- n
);
2364 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2365 first
+ n
, size
- (first
+ n
), off
);
2366 off
+= size
- (first
+ n
);
2368 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2372 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2374 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2375 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2376 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2380 /* Turn the n dimensions of type type, starting at first
2381 * into existentially quantified variables.
2383 __isl_give isl_basic_map
*isl_basic_map_project_out(
2384 __isl_take isl_basic_map
*bmap
,
2385 enum isl_dim_type type
, unsigned first
, unsigned n
)
2398 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2399 return isl_basic_map_remove(bmap
, type
, first
, n
);
2401 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2404 bmap
= move_last(bmap
, type
, first
, n
);
2405 bmap
= isl_basic_map_cow(bmap
);
2409 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2410 old
= bmap
->block2
.data
;
2411 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2412 (bmap
->extra
+ n
) * (1 + row_size
));
2413 if (!bmap
->block2
.data
)
2415 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2418 for (i
= 0; i
< n
; ++i
) {
2419 new_div
[i
] = bmap
->block2
.data
+
2420 (bmap
->extra
+ i
) * (1 + row_size
);
2421 isl_seq_clr(new_div
[i
], 1 + row_size
);
2423 for (i
= 0; i
< bmap
->extra
; ++i
)
2424 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2426 bmap
->div
= new_div
;
2430 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2433 bmap
= isl_basic_map_simplify(bmap
);
2434 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2435 return isl_basic_map_finalize(bmap
);
2437 isl_basic_map_free(bmap
);
2441 /* Turn the n dimensions of type type, starting at first
2442 * into existentially quantified variables.
2444 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2445 enum isl_dim_type type
, unsigned first
, unsigned n
)
2447 return (isl_basic_set
*)isl_basic_map_project_out(
2448 (isl_basic_map
*)bset
, type
, first
, n
);
2451 /* Turn the n dimensions of type type, starting at first
2452 * into existentially quantified variables.
2454 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2455 enum isl_dim_type type
, unsigned first
, unsigned n
)
2465 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2467 map
= isl_map_cow(map
);
2471 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2475 for (i
= 0; i
< map
->n
; ++i
) {
2476 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2487 /* Turn the n dimensions of type type, starting at first
2488 * into existentially quantified variables.
2490 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2491 enum isl_dim_type type
, unsigned first
, unsigned n
)
2493 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2496 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2500 for (i
= 0; i
< n
; ++i
) {
2501 j
= isl_basic_map_alloc_div(bmap
);
2504 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2508 isl_basic_map_free(bmap
);
2512 struct isl_basic_map
*isl_basic_map_apply_range(
2513 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2515 struct isl_dim
*dim_result
= NULL
;
2516 struct isl_basic_map
*bmap
;
2517 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2518 struct isl_dim_map
*dim_map1
, *dim_map2
;
2520 if (!bmap1
|| !bmap2
)
2523 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2524 isl_dim_copy(bmap2
->dim
));
2526 n_in
= isl_basic_map_n_in(bmap1
);
2527 n_out
= isl_basic_map_n_out(bmap2
);
2528 n
= isl_basic_map_n_out(bmap1
);
2529 nparam
= isl_basic_map_n_param(bmap1
);
2531 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2532 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2533 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2534 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2535 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2536 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2537 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2538 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2539 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2540 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2541 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2543 bmap
= isl_basic_map_alloc_dim(dim_result
,
2544 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2545 bmap1
->n_eq
+ bmap2
->n_eq
,
2546 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2547 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2548 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2549 bmap
= add_divs(bmap
, n
);
2550 bmap
= isl_basic_map_simplify(bmap
);
2551 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2552 return isl_basic_map_finalize(bmap
);
2554 isl_basic_map_free(bmap1
);
2555 isl_basic_map_free(bmap2
);
2559 struct isl_basic_set
*isl_basic_set_apply(
2560 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2565 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2568 return (struct isl_basic_set
*)
2569 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2571 isl_basic_set_free(bset
);
2572 isl_basic_map_free(bmap
);
2576 struct isl_basic_map
*isl_basic_map_apply_domain(
2577 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2579 if (!bmap1
|| !bmap2
)
2582 isl_assert(bmap1
->ctx
,
2583 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2584 isl_assert(bmap1
->ctx
,
2585 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2588 bmap1
= isl_basic_map_reverse(bmap1
);
2589 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2590 return isl_basic_map_reverse(bmap1
);
2592 isl_basic_map_free(bmap1
);
2593 isl_basic_map_free(bmap2
);
2597 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2598 * A \cap B -> f(A) + f(B)
2600 struct isl_basic_map
*isl_basic_map_sum(
2601 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2603 unsigned n_in
, n_out
, nparam
, total
, pos
;
2604 struct isl_basic_map
*bmap
= NULL
;
2605 struct isl_dim_map
*dim_map1
, *dim_map2
;
2608 if (!bmap1
|| !bmap2
)
2611 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2614 nparam
= isl_basic_map_n_param(bmap1
);
2615 n_in
= isl_basic_map_n_in(bmap1
);
2616 n_out
= isl_basic_map_n_out(bmap1
);
2618 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2619 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2620 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2621 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2622 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2623 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2624 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2625 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2626 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2627 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2628 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2630 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2631 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2632 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2633 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2634 for (i
= 0; i
< n_out
; ++i
) {
2635 int j
= isl_basic_map_alloc_equality(bmap
);
2638 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2639 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2640 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2641 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2643 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2644 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2645 bmap
= add_divs(bmap
, 2 * n_out
);
2647 bmap
= isl_basic_map_simplify(bmap
);
2648 return isl_basic_map_finalize(bmap
);
2650 isl_basic_map_free(bmap
);
2651 isl_basic_map_free(bmap1
);
2652 isl_basic_map_free(bmap2
);
2656 /* Given two maps A -> f(A) and B -> g(B), construct a map
2657 * A \cap B -> f(A) + f(B)
2659 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2661 struct isl_map
*result
;
2667 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2669 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2670 map1
->n
* map2
->n
, 0);
2673 for (i
= 0; i
< map1
->n
; ++i
)
2674 for (j
= 0; j
< map2
->n
; ++j
) {
2675 struct isl_basic_map
*part
;
2676 part
= isl_basic_map_sum(
2677 isl_basic_map_copy(map1
->p
[i
]),
2678 isl_basic_map_copy(map2
->p
[j
]));
2679 if (isl_basic_map_is_empty(part
))
2680 isl_basic_map_free(part
);
2682 result
= isl_map_add_basic_map(result
, part
);
2695 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2696 __isl_take isl_set
*set2
)
2698 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2701 /* Given a basic map A -> f(A), construct A -> -f(A).
2703 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2708 bmap
= isl_basic_map_cow(bmap
);
2712 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2713 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2714 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2715 for (j
= 0; j
< n
; ++j
)
2716 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2717 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2718 for (j
= 0; j
< n
; ++j
)
2719 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2720 for (i
= 0; i
< bmap
->n_div
; ++i
)
2721 for (j
= 0; j
< n
; ++j
)
2722 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2723 return isl_basic_map_finalize(bmap
);
2726 /* Given a map A -> f(A), construct A -> -f(A).
2728 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2732 map
= isl_map_cow(map
);
2736 for (i
= 0; i
< map
->n
; ++i
) {
2737 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2748 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2750 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2753 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2754 * A -> floor(f(A)/d).
2756 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2759 unsigned n_in
, n_out
, nparam
, total
, pos
;
2760 struct isl_basic_map
*result
= NULL
;
2761 struct isl_dim_map
*dim_map
;
2767 nparam
= isl_basic_map_n_param(bmap
);
2768 n_in
= isl_basic_map_n_in(bmap
);
2769 n_out
= isl_basic_map_n_out(bmap
);
2771 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2772 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2773 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2774 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2775 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2776 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2778 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2779 bmap
->n_div
+ n_out
,
2780 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2781 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2782 result
= add_divs(result
, n_out
);
2783 for (i
= 0; i
< n_out
; ++i
) {
2785 j
= isl_basic_map_alloc_inequality(result
);
2788 isl_seq_clr(result
->ineq
[j
], 1+total
);
2789 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2790 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2791 j
= isl_basic_map_alloc_inequality(result
);
2794 isl_seq_clr(result
->ineq
[j
], 1+total
);
2795 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2796 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2797 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2800 result
= isl_basic_map_simplify(result
);
2801 return isl_basic_map_finalize(result
);
2803 isl_basic_map_free(result
);
2807 /* Given a map A -> f(A) and an integer d, construct a map
2808 * A -> floor(f(A)/d).
2810 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2814 map
= isl_map_cow(map
);
2818 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2819 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2820 for (i
= 0; i
< map
->n
; ++i
) {
2821 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2832 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2838 i
= isl_basic_map_alloc_equality(bmap
);
2841 nparam
= isl_basic_map_n_param(bmap
);
2842 n_in
= isl_basic_map_n_in(bmap
);
2843 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2844 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2845 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2846 return isl_basic_map_finalize(bmap
);
2848 isl_basic_map_free(bmap
);
2852 /* Add a constraints to "bmap" expressing i_pos < o_pos
2854 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2860 i
= isl_basic_map_alloc_inequality(bmap
);
2863 nparam
= isl_basic_map_n_param(bmap
);
2864 n_in
= isl_basic_map_n_in(bmap
);
2865 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2866 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2867 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2868 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2869 return isl_basic_map_finalize(bmap
);
2871 isl_basic_map_free(bmap
);
2875 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2877 static __isl_give isl_basic_map
*var_less_or_equal(
2878 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2884 i
= isl_basic_map_alloc_inequality(bmap
);
2887 nparam
= isl_basic_map_n_param(bmap
);
2888 n_in
= isl_basic_map_n_in(bmap
);
2889 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2890 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2891 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2892 return isl_basic_map_finalize(bmap
);
2894 isl_basic_map_free(bmap
);
2898 /* Add a constraints to "bmap" expressing i_pos > o_pos
2900 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2906 i
= isl_basic_map_alloc_inequality(bmap
);
2909 nparam
= isl_basic_map_n_param(bmap
);
2910 n_in
= isl_basic_map_n_in(bmap
);
2911 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2912 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2913 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2914 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2915 return isl_basic_map_finalize(bmap
);
2917 isl_basic_map_free(bmap
);
2921 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2923 static __isl_give isl_basic_map
*var_more_or_equal(
2924 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2930 i
= isl_basic_map_alloc_inequality(bmap
);
2933 nparam
= isl_basic_map_n_param(bmap
);
2934 n_in
= isl_basic_map_n_in(bmap
);
2935 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2936 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2937 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2938 return isl_basic_map_finalize(bmap
);
2940 isl_basic_map_free(bmap
);
2944 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2947 struct isl_basic_map
*bmap
;
2948 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2951 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2952 bmap
= var_equal(bmap
, i
);
2953 return isl_basic_map_finalize(bmap
);
2956 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
2958 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2961 struct isl_basic_map
*bmap
;
2962 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2965 for (i
= 0; i
< pos
&& bmap
; ++i
)
2966 bmap
= var_equal(bmap
, i
);
2968 bmap
= var_less(bmap
, pos
);
2969 return isl_basic_map_finalize(bmap
);
2972 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
2974 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
2975 __isl_take isl_dim
*dim
, unsigned pos
)
2978 isl_basic_map
*bmap
;
2980 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2981 for (i
= 0; i
< pos
; ++i
)
2982 bmap
= var_equal(bmap
, i
);
2983 bmap
= var_less_or_equal(bmap
, pos
);
2984 return isl_basic_map_finalize(bmap
);
2987 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2989 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2992 struct isl_basic_map
*bmap
;
2993 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2996 for (i
= 0; i
< pos
&& bmap
; ++i
)
2997 bmap
= var_equal(bmap
, i
);
2999 bmap
= var_more(bmap
, pos
);
3000 return isl_basic_map_finalize(bmap
);
3003 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3005 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3006 __isl_take isl_dim
*dim
, unsigned pos
)
3009 isl_basic_map
*bmap
;
3011 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3012 for (i
= 0; i
< pos
; ++i
)
3013 bmap
= var_equal(bmap
, i
);
3014 bmap
= var_more_or_equal(bmap
, pos
);
3015 return isl_basic_map_finalize(bmap
);
3018 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3019 unsigned n
, int equal
)
3021 struct isl_map
*map
;
3024 if (n
== 0 && equal
)
3025 return isl_map_universe(dims
);
3027 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3029 for (i
= 0; i
+ 1 < n
; ++i
)
3030 map
= isl_map_add_basic_map(map
,
3031 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3034 map
= isl_map_add_basic_map(map
,
3035 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3037 map
= isl_map_add_basic_map(map
,
3038 isl_basic_map_less_at(dims
, n
- 1));
3045 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3049 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3052 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3054 return map_lex_lte_first(dim
, n
, 0);
3057 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3059 return map_lex_lte_first(dim
, n
, 1);
3062 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3064 return map_lex_lte(isl_dim_map(set_dim
), 0);
3067 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3069 return map_lex_lte(isl_dim_map(set_dim
), 1);
3072 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3073 unsigned n
, int equal
)
3075 struct isl_map
*map
;
3078 if (n
== 0 && equal
)
3079 return isl_map_universe(dims
);
3081 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3083 for (i
= 0; i
+ 1 < n
; ++i
)
3084 map
= isl_map_add_basic_map(map
,
3085 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3088 map
= isl_map_add_basic_map(map
,
3089 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3091 map
= isl_map_add_basic_map(map
,
3092 isl_basic_map_more_at(dims
, n
- 1));
3099 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3103 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3106 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3108 return map_lex_gte_first(dim
, n
, 0);
3111 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3113 return map_lex_gte_first(dim
, n
, 1);
3116 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3118 return map_lex_gte(isl_dim_map(set_dim
), 0);
3121 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3123 return map_lex_gte(isl_dim_map(set_dim
), 1);
3126 struct isl_basic_map
*isl_basic_map_from_basic_set(
3127 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3129 struct isl_basic_map
*bmap
;
3131 bset
= isl_basic_set_cow(bset
);
3135 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3136 isl_dim_free(bset
->dim
);
3137 bmap
= (struct isl_basic_map
*) bset
;
3139 return isl_basic_map_finalize(bmap
);
3141 isl_basic_set_free(bset
);
3146 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3150 if (bmap
->dim
->n_in
== 0)
3151 return (struct isl_basic_set
*)bmap
;
3152 bmap
= isl_basic_map_cow(bmap
);
3155 bmap
->dim
= isl_dim_cow(bmap
->dim
);
3158 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
3159 bmap
->dim
->n_in
= 0;
3160 bmap
= isl_basic_map_finalize(bmap
);
3161 return (struct isl_basic_set
*)bmap
;
3163 isl_basic_map_free(bmap
);
3167 /* For a div d = floor(f/m), add the constraints
3170 * -(f-(n-1)) + m d >= 0
3172 * Note that the second constraint is the negation of
3176 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3177 unsigned pos
, isl_int
*div
)
3180 unsigned total
= isl_basic_map_total_dim(bmap
);
3182 i
= isl_basic_map_alloc_inequality(bmap
);
3185 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3186 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3188 j
= isl_basic_map_alloc_inequality(bmap
);
3191 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3192 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3193 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3197 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3198 unsigned pos
, isl_int
*div
)
3200 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3204 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3206 unsigned total
= isl_basic_map_total_dim(bmap
);
3207 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3209 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3213 struct isl_basic_set
*isl_basic_map_underlying_set(
3214 struct isl_basic_map
*bmap
)
3218 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
3219 return (struct isl_basic_set
*)bmap
;
3220 bmap
= isl_basic_map_cow(bmap
);
3223 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3226 bmap
->extra
-= bmap
->n_div
;
3228 bmap
= isl_basic_map_finalize(bmap
);
3229 return (struct isl_basic_set
*)bmap
;
3234 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3235 __isl_take isl_basic_set
*bset
)
3237 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3240 struct isl_basic_map
*isl_basic_map_overlying_set(
3241 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3243 struct isl_basic_map
*bmap
;
3244 struct isl_ctx
*ctx
;
3251 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3252 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3253 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3255 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3256 isl_basic_map_free(like
);
3257 return (struct isl_basic_map
*)bset
;
3259 bset
= isl_basic_set_cow(bset
);
3262 total
= bset
->dim
->n_out
+ bset
->extra
;
3263 bmap
= (struct isl_basic_map
*)bset
;
3264 isl_dim_free(bmap
->dim
);
3265 bmap
->dim
= isl_dim_copy(like
->dim
);
3268 bmap
->n_div
= like
->n_div
;
3269 bmap
->extra
+= like
->n_div
;
3272 ltotal
= total
- bmap
->extra
+ like
->extra
;
3275 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3276 bmap
->extra
* (1 + 1 + total
));
3277 if (isl_blk_is_error(bmap
->block2
))
3279 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3283 for (i
= 0; i
< bmap
->extra
; ++i
)
3284 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3285 for (i
= 0; i
< like
->n_div
; ++i
) {
3286 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3287 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3289 bmap
= isl_basic_map_extend_constraints(bmap
,
3290 0, 2 * like
->n_div
);
3291 for (i
= 0; i
< like
->n_div
; ++i
) {
3292 if (isl_int_is_zero(bmap
->div
[i
][0]))
3294 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3298 isl_basic_map_free(like
);
3299 bmap
= isl_basic_map_simplify(bmap
);
3300 bmap
= isl_basic_map_finalize(bmap
);
3303 isl_basic_map_free(like
);
3304 isl_basic_set_free(bset
);
3308 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3309 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3311 return (struct isl_basic_set
*)
3312 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3315 struct isl_set
*isl_set_from_underlying_set(
3316 struct isl_set
*set
, struct isl_basic_set
*like
)
3322 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3324 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3325 isl_basic_set_free(like
);
3328 set
= isl_set_cow(set
);
3331 for (i
= 0; i
< set
->n
; ++i
) {
3332 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3333 isl_basic_set_copy(like
));
3337 isl_dim_free(set
->dim
);
3338 set
->dim
= isl_dim_copy(like
->dim
);
3341 isl_basic_set_free(like
);
3344 isl_basic_set_free(like
);
3349 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3353 map
= isl_map_cow(map
);
3356 map
->dim
= isl_dim_cow(map
->dim
);
3360 for (i
= 1; i
< map
->n
; ++i
)
3361 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3363 for (i
= 0; i
< map
->n
; ++i
) {
3364 map
->p
[i
] = (struct isl_basic_map
*)
3365 isl_basic_map_underlying_set(map
->p
[i
]);
3370 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3372 isl_dim_free(map
->dim
);
3373 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3377 return (struct isl_set
*)map
;
3383 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3385 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3388 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3390 struct isl_basic_set
*domain
;
3395 n_in
= isl_basic_map_n_in(bmap
);
3396 n_out
= isl_basic_map_n_out(bmap
);
3397 domain
= isl_basic_set_from_basic_map(bmap
);
3398 return isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3401 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3403 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3406 struct isl_set
*isl_map_range(struct isl_map
*map
)
3409 struct isl_set
*set
;
3413 if (isl_map_dim(map
, isl_dim_in
) == 0)
3414 return (isl_set
*)map
;
3416 map
= isl_map_cow(map
);
3420 set
= (struct isl_set
*) map
;
3421 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3424 for (i
= 0; i
< map
->n
; ++i
) {
3425 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3429 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3430 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3437 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3440 struct isl_map
*map
= NULL
;
3442 set
= isl_set_cow(set
);
3445 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3446 map
= (struct isl_map
*)set
;
3447 for (i
= 0; i
< set
->n
; ++i
) {
3448 map
->p
[i
] = isl_basic_map_from_basic_set(
3449 set
->p
[i
], isl_dim_copy(dim
));
3453 isl_dim_free(map
->dim
);
3462 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3464 return (struct isl_map
*)set
;
3467 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3469 return isl_map_reverse(isl_map_from_range(set
));
3472 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3473 __isl_take isl_set
*range
)
3475 return isl_map_product(isl_map_from_domain(domain
),
3476 isl_map_from_range(range
));
3479 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3482 struct isl_set
*set
= NULL
;
3486 map
= isl_map_cow(map
);
3489 map
->dim
= isl_dim_cow(map
->dim
);
3492 map
->dim
->n_out
+= map
->dim
->n_in
;
3494 set
= (struct isl_set
*)map
;
3495 for (i
= 0; i
< map
->n
; ++i
) {
3496 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3506 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3508 struct isl_map
*map
;
3512 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3513 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3514 sizeof(struct isl_map
) +
3515 (n
- 1) * sizeof(struct isl_basic_map
*));
3519 map
->ctx
= dim
->ctx
;
3520 isl_ctx_ref(map
->ctx
);
3532 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
3533 unsigned nparam
, unsigned in
, unsigned out
, int n
,
3536 struct isl_map
*map
;
3537 struct isl_dim
*dims
;
3539 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
3543 map
= isl_map_alloc_dim(dims
, n
, flags
);
3547 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
3549 struct isl_basic_map
*bmap
;
3550 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
3551 bmap
= isl_basic_map_set_to_empty(bmap
);
3555 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
3557 struct isl_basic_set
*bset
;
3558 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
3559 bset
= isl_basic_set_set_to_empty(bset
);
3563 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
3565 struct isl_basic_map
*bmap
;
3568 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3569 bmap
= isl_basic_map_set_to_empty(bmap
);
3573 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
3575 struct isl_basic_map
*bmap
;
3578 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3579 bmap
= isl_basic_map_set_to_empty(bmap
);
3583 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
3585 struct isl_basic_set
*bset
;
3588 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3589 bset
= isl_basic_set_set_to_empty(bset
);
3593 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
3595 struct isl_basic_map
*bmap
;
3596 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
3600 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
3602 struct isl_basic_set
*bset
;
3603 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
3607 __isl_give isl_basic_map
*isl_basic_map_universe_like(
3608 __isl_keep isl_basic_map
*model
)
3612 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3615 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
3619 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3622 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
3623 __isl_keep isl_set
*model
)
3627 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3630 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
3632 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3635 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
3639 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3642 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
3646 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3649 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
3651 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3654 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
3658 return isl_set_empty(isl_dim_copy(model
->dim
));
3661 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
3663 struct isl_map
*map
;
3666 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3667 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
3671 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
3673 struct isl_set
*set
;
3676 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3677 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
3681 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
3685 return isl_set_universe(isl_dim_copy(model
->dim
));
3688 struct isl_map
*isl_map_dup(struct isl_map
*map
)
3691 struct isl_map
*dup
;
3695 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
3696 for (i
= 0; i
< map
->n
; ++i
)
3697 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
3701 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
3702 __isl_take isl_basic_map
*bmap
)
3706 if (isl_basic_map_fast_is_empty(bmap
)) {
3707 isl_basic_map_free(bmap
);
3710 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
3711 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
3712 map
->p
[map
->n
] = bmap
;
3714 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3720 isl_basic_map_free(bmap
);
3724 void isl_map_free(struct isl_map
*map
)
3734 isl_ctx_deref(map
->ctx
);
3735 for (i
= 0; i
< map
->n
; ++i
)
3736 isl_basic_map_free(map
->p
[i
]);
3737 isl_dim_free(map
->dim
);
3741 struct isl_map
*isl_map_extend(struct isl_map
*base
,
3742 unsigned nparam
, unsigned n_in
, unsigned n_out
)
3746 base
= isl_map_cow(base
);
3750 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
3753 for (i
= 0; i
< base
->n
; ++i
) {
3754 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
3755 isl_dim_copy(base
->dim
), 0, 0, 0);
3765 struct isl_set
*isl_set_extend(struct isl_set
*base
,
3766 unsigned nparam
, unsigned dim
)
3768 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
3772 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
3773 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
3777 bmap
= isl_basic_map_cow(bmap
);
3778 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3779 j
= isl_basic_map_alloc_equality(bmap
);
3782 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3783 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3784 isl_int_set_si(bmap
->eq
[j
][0], value
);
3785 bmap
= isl_basic_map_simplify(bmap
);
3786 return isl_basic_map_finalize(bmap
);
3788 isl_basic_map_free(bmap
);
3792 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
3793 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
3797 bmap
= isl_basic_map_cow(bmap
);
3798 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3799 j
= isl_basic_map_alloc_equality(bmap
);
3802 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3803 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3804 isl_int_set(bmap
->eq
[j
][0], value
);
3805 bmap
= isl_basic_map_simplify(bmap
);
3806 return isl_basic_map_finalize(bmap
);
3808 isl_basic_map_free(bmap
);
3812 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
3813 enum isl_dim_type type
, unsigned pos
, int value
)
3817 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3818 return isl_basic_map_fix_pos_si(bmap
,
3819 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3821 isl_basic_map_free(bmap
);
3825 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
3826 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3830 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3831 return isl_basic_map_fix_pos(bmap
,
3832 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3834 isl_basic_map_free(bmap
);
3838 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
3839 enum isl_dim_type type
, unsigned pos
, int value
)
3841 return (struct isl_basic_set
*)
3842 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3846 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
3847 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3849 return (struct isl_basic_set
*)
3850 isl_basic_map_fix((struct isl_basic_map
*)bset
,
3854 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
3855 unsigned input
, int value
)
3857 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
3860 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
3861 unsigned dim
, int value
)
3863 return (struct isl_basic_set
*)
3864 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3865 isl_dim_set
, dim
, value
);
3868 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
3869 enum isl_dim_type type
, unsigned pos
, int value
)
3873 map
= isl_map_cow(map
);
3877 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3878 for (i
= 0; i
< map
->n
; ++i
) {
3879 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
3883 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3890 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
3891 enum isl_dim_type type
, unsigned pos
, int value
)
3893 return (struct isl_set
*)
3894 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
3897 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
3898 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3902 map
= isl_map_cow(map
);
3906 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3907 for (i
= 0; i
< map
->n
; ++i
) {
3908 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
3912 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3919 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
3920 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3922 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
3925 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
3926 unsigned input
, int value
)
3928 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
3931 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
3933 return (struct isl_set
*)
3934 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
3937 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
3938 __isl_take isl_basic_map
*bmap
,
3939 enum isl_dim_type type
, unsigned pos
, int value
)
3945 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3946 pos
+= isl_basic_map_offset(bmap
, type
);
3947 bmap
= isl_basic_map_cow(bmap
);
3948 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
3949 j
= isl_basic_map_alloc_inequality(bmap
);
3952 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
3953 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
3954 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
3955 bmap
= isl_basic_map_simplify(bmap
);
3956 return isl_basic_map_finalize(bmap
);
3958 isl_basic_map_free(bmap
);
3962 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
3963 unsigned dim
, isl_int value
)
3967 bset
= isl_basic_set_cow(bset
);
3968 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
3969 j
= isl_basic_set_alloc_inequality(bset
);
3972 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
3973 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
3974 isl_int_neg(bset
->ineq
[j
][0], value
);
3975 bset
= isl_basic_set_simplify(bset
);
3976 return isl_basic_set_finalize(bset
);
3978 isl_basic_set_free(bset
);
3982 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
3983 enum isl_dim_type type
, unsigned pos
, int value
)
3987 map
= isl_map_cow(map
);
3991 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3992 for (i
= 0; i
< map
->n
; ++i
) {
3993 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
3998 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4005 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4006 enum isl_dim_type type
, unsigned pos
, int value
)
4008 return (struct isl_set
*)
4009 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4012 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4017 set
= isl_set_cow(set
);
4021 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4022 for (i
= 0; i
< set
->n
; ++i
) {
4023 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4033 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4037 map
= isl_map_cow(map
);
4041 map
->dim
= isl_dim_reverse(map
->dim
);
4044 for (i
= 0; i
< map
->n
; ++i
) {
4045 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4049 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4056 static struct isl_map
*isl_basic_map_partial_lexopt(
4057 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4058 struct isl_set
**empty
, int max
)
4062 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4063 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4065 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4067 isl_basic_map_free(bmap
);
4068 isl_basic_set_free(dom
);
4074 struct isl_map
*isl_basic_map_partial_lexmax(
4075 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4076 struct isl_set
**empty
)
4078 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4081 struct isl_map
*isl_basic_map_partial_lexmin(
4082 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4083 struct isl_set
**empty
)
4085 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4088 struct isl_set
*isl_basic_set_partial_lexmin(
4089 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4090 struct isl_set
**empty
)
4092 return (struct isl_set
*)
4093 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4097 struct isl_set
*isl_basic_set_partial_lexmax(
4098 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4099 struct isl_set
**empty
)
4101 return (struct isl_set
*)
4102 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4106 /* Given a basic map "bmap", compute the lexicograhically minimal
4107 * (or maximal) image element for each domain element in dom.
4108 * Set *empty to those elements in dom that do not have an image element.
4110 * We first make sure the basic sets in dom are disjoint and then
4111 * simply collect the results over each of the basic sets separately.
4112 * We could probably improve the efficiency a bit by moving the union
4113 * domain down into the parametric integer programming.
4115 static __isl_give isl_map
*basic_map_partial_lexopt(
4116 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4117 __isl_give isl_set
**empty
, int max
)
4120 struct isl_map
*res
;
4122 dom
= isl_set_make_disjoint(dom
);
4126 if (isl_set_fast_is_empty(dom
)) {
4127 res
= isl_map_empty_like_basic_map(bmap
);
4128 *empty
= isl_set_empty_like(dom
);
4130 isl_basic_map_free(bmap
);
4134 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4135 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4137 for (i
= 1; i
< dom
->n
; ++i
) {
4138 struct isl_map
*res_i
;
4139 struct isl_set
*empty_i
;
4141 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4142 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4144 res
= isl_map_union_disjoint(res
, res_i
);
4145 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4149 isl_basic_map_free(bmap
);
4154 isl_basic_map_free(bmap
);
4158 /* Given a map "map", compute the lexicograhically minimal
4159 * (or maximal) image element for each domain element in dom.
4160 * Set *empty to those elements in dom that do not have an image element.
4162 * We first compute the lexicographically minimal or maximal element
4163 * in the first basic map. This results in a partial solution "res"
4164 * and a subset "todo" of dom that still need to be handled.
4165 * We then consider each of the remaining maps in "map" and successively
4166 * improve both "res" and "todo".
4168 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4169 * Assume we are computing the lexicographical maximum.
4170 * We first intersect basic map i with a relation that maps elements
4171 * to elements that are lexicographically larger than the image elements
4172 * in res^k and the compute the maximum image element of this intersection.
4173 * The result ("better") corresponds to those image elements in basic map i
4174 * that are better than what we had before. The remainder ("keep") are the
4175 * domain elements for which the image element in res_k was better.
4176 * We also compute the lexicographical maximum of basic map i in todo^k.
4177 * res^i is the result of the operation + better + those elements in
4178 * res^k that we should keep
4179 * todo^i is the remainder of the maximum operation on todo^k.
4181 static __isl_give isl_map
*isl_map_partial_lexopt(
4182 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4183 __isl_give isl_set
**empty
, int max
)
4186 struct isl_map
*res
;
4187 struct isl_set
*todo
;
4192 if (isl_map_fast_is_empty(map
)) {
4200 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4201 isl_set_copy(dom
), &todo
, max
);
4203 for (i
= 1; i
< map
->n
; ++i
) {
4205 struct isl_map
*better
;
4206 struct isl_set
*keep
;
4207 struct isl_map
*res_i
;
4208 struct isl_set
*todo_i
;
4209 struct isl_dim
*dim
= isl_map_get_dim(res
);
4211 dim
= isl_dim_range(dim
);
4213 lt
= isl_map_lex_lt(dim
);
4215 lt
= isl_map_lex_gt(dim
);
4216 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4217 lt
= isl_map_intersect(lt
,
4218 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4219 better
= isl_map_partial_lexopt(lt
,
4220 isl_map_domain(isl_map_copy(res
)),
4223 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4224 todo
, &todo_i
, max
);
4226 res
= isl_map_intersect_domain(res
, keep
);
4227 res
= isl_map_union_disjoint(res
, res_i
);
4228 res
= isl_map_union_disjoint(res
, better
);
4249 __isl_give isl_map
*isl_map_partial_lexmax(
4250 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4251 __isl_give isl_set
**empty
)
4253 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4256 __isl_give isl_map
*isl_map_partial_lexmin(
4257 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4258 __isl_give isl_set
**empty
)
4260 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4263 __isl_give isl_set
*isl_set_partial_lexmin(
4264 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4265 __isl_give isl_set
**empty
)
4267 return (struct isl_set
*)
4268 isl_map_partial_lexmin((struct isl_map
*)set
,
4272 __isl_give isl_set
*isl_set_partial_lexmax(
4273 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4274 __isl_give isl_set
**empty
)
4276 return (struct isl_set
*)
4277 isl_map_partial_lexmax((struct isl_map
*)set
,
4281 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4283 struct isl_basic_set
*dom
= NULL
;
4284 struct isl_dim
*dom_dim
;
4288 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4289 dom
= isl_basic_set_universe(dom_dim
);
4290 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4292 isl_basic_map_free(bmap
);
4296 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4298 return isl_basic_map_lexopt(bmap
, 0);
4301 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4303 return isl_basic_map_lexopt(bmap
, 1);
4306 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4308 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4311 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4313 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4316 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4318 struct isl_set
*dom
= NULL
;
4319 struct isl_dim
*dom_dim
;
4323 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4324 dom
= isl_set_universe(dom_dim
);
4325 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4331 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4333 return isl_map_lexopt(map
, 0);
4336 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4338 return isl_map_lexopt(map
, 1);
4341 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4343 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4346 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4348 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4351 static struct isl_map
*isl_map_reset_dim(struct isl_map
*map
,
4352 struct isl_dim
*dim
)
4359 for (i
= 0; i
< map
->n
; ++i
) {
4360 isl_dim_free(map
->p
[i
]->dim
);
4361 map
->p
[i
]->dim
= isl_dim_copy(dim
);
4363 isl_dim_free(map
->dim
);
4373 static struct isl_set
*isl_set_reset_dim(struct isl_set
*set
,
4374 struct isl_dim
*dim
)
4376 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
4379 /* Apply a preimage specified by "mat" on the parameters of "bset".
4380 * bset is assumed to have only parameters and divs.
4382 static struct isl_basic_set
*basic_set_parameter_preimage(
4383 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4390 bset
->dim
= isl_dim_cow(bset
->dim
);
4394 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4396 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4398 bset
->dim
->nparam
= 0;
4399 bset
->dim
->n_out
= nparam
;
4400 bset
= isl_basic_set_preimage(bset
, mat
);
4402 bset
->dim
->nparam
= bset
->dim
->n_out
;
4403 bset
->dim
->n_out
= 0;
4408 isl_basic_set_free(bset
);
4412 /* Apply a preimage specified by "mat" on the parameters of "set".
4413 * set is assumed to have only parameters and divs.
4415 static struct isl_set
*set_parameter_preimage(
4416 struct isl_set
*set
, struct isl_mat
*mat
)
4418 struct isl_dim
*dim
= NULL
;
4424 dim
= isl_dim_copy(set
->dim
);
4425 dim
= isl_dim_cow(dim
);
4429 nparam
= isl_set_dim(set
, isl_dim_param
);
4431 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4434 dim
->n_out
= nparam
;
4435 isl_set_reset_dim(set
, dim
);
4436 set
= isl_set_preimage(set
, mat
);
4439 dim
= isl_dim_copy(set
->dim
);
4440 dim
= isl_dim_cow(dim
);
4443 dim
->nparam
= dim
->n_out
;
4445 isl_set_reset_dim(set
, dim
);
4455 /* Intersect the basic set "bset" with the affine space specified by the
4456 * equalities in "eq".
4458 static struct isl_basic_set
*basic_set_append_equalities(
4459 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4467 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4472 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4473 for (i
= 0; i
< eq
->n_row
; ++i
) {
4474 k
= isl_basic_set_alloc_equality(bset
);
4477 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4478 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4482 bset
= isl_basic_set_gauss(bset
, NULL
);
4483 bset
= isl_basic_set_finalize(bset
);
4488 isl_basic_set_free(bset
);
4492 /* Intersect the set "set" with the affine space specified by the
4493 * equalities in "eq".
4495 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4503 for (i
= 0; i
< set
->n
; ++i
) {
4504 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4517 /* Project the given basic set onto its parameter domain, possibly introducing
4518 * new, explicit, existential variables in the constraints.
4519 * The input has parameters and (possibly implicit) existential variables.
4520 * The output has the same parameters, but only
4521 * explicit existentially quantified variables.
4523 * The actual projection is performed by pip, but pip doesn't seem
4524 * to like equalities very much, so we first remove the equalities
4525 * among the parameters by performing a variable compression on
4526 * the parameters. Afterward, an inverse transformation is performed
4527 * and the equalities among the parameters are inserted back in.
4529 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4533 struct isl_mat
*T
, *T2
;
4534 struct isl_set
*set
;
4535 unsigned nparam
, n_div
;
4537 bset
= isl_basic_set_cow(bset
);
4541 if (bset
->n_eq
== 0)
4542 return isl_basic_set_lexmin(bset
);
4544 isl_basic_set_gauss(bset
, NULL
);
4546 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4547 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
4549 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
4550 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
4553 if (i
== bset
->n_eq
)
4554 return isl_basic_set_lexmin(bset
);
4556 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
4558 eq
= isl_mat_cow(eq
);
4559 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
4560 if (T
&& T
->n_col
== 0) {
4564 bset
= isl_basic_set_set_to_empty(bset
);
4565 return isl_set_from_basic_set(bset
);
4567 bset
= basic_set_parameter_preimage(bset
, T
);
4569 set
= isl_basic_set_lexmin(bset
);
4570 set
= set_parameter_preimage(set
, T2
);
4571 set
= set_append_equalities(set
, eq
);
4575 /* Compute an explicit representation for all the existentially
4576 * quantified variables.
4577 * The input and output dimensions are first turned into parameters.
4578 * compute_divs then returns a map with the same parameters and
4579 * no input or output dimensions and the dimension specification
4580 * is reset to that of the input.
4582 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
4584 struct isl_basic_set
*bset
;
4585 struct isl_set
*set
;
4586 struct isl_map
*map
;
4587 struct isl_dim
*dim
, *orig_dim
= NULL
;
4592 bmap
= isl_basic_map_cow(bmap
);
4596 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4597 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4598 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4599 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
4603 orig_dim
= bmap
->dim
;
4605 bset
= (struct isl_basic_set
*)bmap
;
4607 set
= parameter_compute_divs(bset
);
4608 map
= (struct isl_map
*)set
;
4609 map
= isl_map_reset_dim(map
, orig_dim
);
4613 isl_basic_map_free(bmap
);
4617 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
4625 off
= isl_dim_total(bmap
->dim
);
4626 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4627 if (isl_int_is_zero(bmap
->div
[i
][0]))
4629 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
4635 static int map_divs_known(__isl_keep isl_map
*map
)
4642 for (i
= 0; i
< map
->n
; ++i
) {
4643 int known
= basic_map_divs_known(map
->p
[i
]);
4651 /* If bmap contains any unknown divs, then compute explicit
4652 * expressions for them. However, this computation may be
4653 * quite expensive, so first try to remove divs that aren't
4656 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
4660 struct isl_map
*map
;
4662 known
= basic_map_divs_known(bmap
);
4666 return isl_map_from_basic_map(bmap
);
4668 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4670 known
= basic_map_divs_known(bmap
);
4674 return isl_map_from_basic_map(bmap
);
4676 map
= compute_divs(bmap
);
4679 isl_basic_map_free(bmap
);
4683 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
4687 struct isl_map
*res
;
4694 known
= map_divs_known(map
);
4702 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
4703 for (i
= 1 ; i
< map
->n
; ++i
) {
4705 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
4706 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4707 res
= isl_map_union_disjoint(res
, r2
);
4709 res
= isl_map_union(res
, r2
);
4716 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
4718 return (struct isl_set
*)
4719 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
4722 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
4724 return (struct isl_set
*)
4725 isl_map_compute_divs((struct isl_map
*)set
);
4728 struct isl_set
*isl_map_domain(struct isl_map
*map
)
4731 struct isl_set
*set
;
4736 map
= isl_map_cow(map
);
4740 set
= (struct isl_set
*)map
;
4741 set
->dim
= isl_dim_domain(set
->dim
);
4744 for (i
= 0; i
< map
->n
; ++i
) {
4745 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
4749 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4750 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4757 struct isl_map
*isl_map_union_disjoint(
4758 struct isl_map
*map1
, struct isl_map
*map2
)
4762 struct isl_map
*map
= NULL
;
4776 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4778 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
4779 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
4780 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4782 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
4783 map1
->n
+ map2
->n
, flags
);
4786 for (i
= 0; i
< map1
->n
; ++i
) {
4787 map
= isl_map_add_basic_map(map
,
4788 isl_basic_map_copy(map1
->p
[i
]));
4792 for (i
= 0; i
< map2
->n
; ++i
) {
4793 map
= isl_map_add_basic_map(map
,
4794 isl_basic_map_copy(map2
->p
[i
]));
4808 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
4810 map1
= isl_map_union_disjoint(map1
, map2
);
4814 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
4818 struct isl_set
*isl_set_union_disjoint(
4819 struct isl_set
*set1
, struct isl_set
*set2
)
4821 return (struct isl_set
*)
4822 isl_map_union_disjoint(
4823 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4826 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
4828 return (struct isl_set
*)
4829 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
4832 struct isl_map
*isl_map_intersect_range(
4833 struct isl_map
*map
, struct isl_set
*set
)
4836 struct isl_map
*result
;
4842 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
4843 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
4844 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4846 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
4847 map
->n
* set
->n
, flags
);
4850 for (i
= 0; i
< map
->n
; ++i
)
4851 for (j
= 0; j
< set
->n
; ++j
) {
4852 result
= isl_map_add_basic_map(result
,
4853 isl_basic_map_intersect_range(
4854 isl_basic_map_copy(map
->p
[i
]),
4855 isl_basic_set_copy(set
->p
[j
])));
4868 struct isl_map
*isl_map_intersect_domain(
4869 struct isl_map
*map
, struct isl_set
*set
)
4871 return isl_map_reverse(
4872 isl_map_intersect_range(isl_map_reverse(map
), set
));
4875 struct isl_map
*isl_map_apply_domain(
4876 struct isl_map
*map1
, struct isl_map
*map2
)
4880 map1
= isl_map_reverse(map1
);
4881 map1
= isl_map_apply_range(map1
, map2
);
4882 return isl_map_reverse(map1
);
4889 struct isl_map
*isl_map_apply_range(
4890 struct isl_map
*map1
, struct isl_map
*map2
)
4892 struct isl_dim
*dim_result
;
4893 struct isl_map
*result
;
4899 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
4900 isl_dim_copy(map2
->dim
));
4902 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
4905 for (i
= 0; i
< map1
->n
; ++i
)
4906 for (j
= 0; j
< map2
->n
; ++j
) {
4907 result
= isl_map_add_basic_map(result
,
4908 isl_basic_map_apply_range(
4909 isl_basic_map_copy(map1
->p
[i
]),
4910 isl_basic_map_copy(map2
->p
[j
])));
4916 if (result
&& result
->n
<= 1)
4917 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
4926 * returns range - domain
4928 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
4931 struct isl_basic_set
*bset
;
4938 dim
= isl_basic_map_n_in(bmap
);
4939 nparam
= isl_basic_map_n_param(bmap
);
4940 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
4941 bset
= isl_basic_set_from_basic_map(bmap
);
4942 bset
= isl_basic_set_cow(bset
);
4943 dims
= isl_basic_set_get_dim(bset
);
4944 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
4945 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
4946 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
4947 for (i
= 0; i
< dim
; ++i
) {
4948 int j
= isl_basic_map_alloc_equality(
4949 (struct isl_basic_map
*)bset
);
4952 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
4953 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
4954 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
4955 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
4957 return isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
4959 isl_basic_map_free(bmap
);
4964 * returns range - domain
4966 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
4970 struct isl_set
*result
;
4975 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
4976 dim
= isl_map_get_dim(map
);
4977 dim
= isl_dim_domain(dim
);
4978 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
4981 for (i
= 0; i
< map
->n
; ++i
)
4982 result
= isl_set_add_basic_set(result
,
4983 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
4991 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
4993 struct isl_basic_map
*bmap
;
5001 nparam
= dims
->nparam
;
5003 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5007 for (i
= 0; i
< dim
; ++i
) {
5008 int j
= isl_basic_map_alloc_equality(bmap
);
5011 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5012 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5013 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5015 return isl_basic_map_finalize(bmap
);
5017 isl_basic_map_free(bmap
);
5021 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5023 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5026 return basic_map_identity(dim
);
5029 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5031 if (!model
|| !model
->dim
)
5033 isl_assert(model
->ctx
,
5034 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5035 return basic_map_identity(isl_dim_copy(model
->dim
));
5038 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5040 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5041 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5044 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5046 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5049 return map_identity(dim
);
5052 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5054 if (!model
|| !model
->dim
)
5056 isl_assert(model
->ctx
,
5057 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5058 return map_identity(isl_dim_copy(model
->dim
));
5061 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5063 if (!model
|| !model
->dim
)
5065 isl_assert(model
->ctx
,
5066 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5067 return map_identity(isl_dim_copy(model
->dim
));
5070 /* Construct a basic set with all set dimensions having only non-negative
5073 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5078 struct isl_basic_set
*bset
;
5082 nparam
= dims
->nparam
;
5084 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5087 for (i
= 0; i
< dim
; ++i
) {
5088 int k
= isl_basic_set_alloc_inequality(bset
);
5091 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5092 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5096 isl_basic_set_free(bset
);
5100 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5101 enum isl_dim_type type
, unsigned first
, unsigned n
)
5104 isl_basic_set
*nonneg
= NULL
;
5105 isl_basic_set
*neg
= NULL
;
5112 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5114 for (i
= 0; i
< n
; ++i
) {
5118 nonneg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5119 k
= isl_basic_set_alloc_inequality(nonneg
);
5122 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5123 isl_int_set_si(nonneg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], 1);
5125 neg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5126 k
= isl_basic_set_alloc_inequality(neg
);
5129 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5130 isl_int_set_si(neg
->ineq
[k
][0], -1);
5131 isl_int_set_si(neg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], -1);
5133 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5138 isl_basic_set_free(nonneg
);
5139 isl_basic_set_free(neg
);
5144 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5146 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5149 int isl_basic_map_is_subset(
5150 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5153 struct isl_map
*map1
;
5154 struct isl_map
*map2
;
5156 if (!bmap1
|| !bmap2
)
5159 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5160 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5162 is_subset
= isl_map_is_subset(map1
, map2
);
5170 int isl_basic_map_is_equal(
5171 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5175 if (!bmap1
|| !bmap2
)
5177 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5180 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5184 int isl_basic_set_is_equal(
5185 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5187 return isl_basic_map_is_equal(
5188 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5191 int isl_map_is_empty(struct isl_map
*map
)
5198 for (i
= 0; i
< map
->n
; ++i
) {
5199 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5208 int isl_map_fast_is_empty(struct isl_map
*map
)
5210 return map
? map
->n
== 0 : -1;
5213 int isl_set_fast_is_empty(struct isl_set
*set
)
5215 return set
? set
->n
== 0 : -1;
5218 int isl_set_is_empty(struct isl_set
*set
)
5220 return isl_map_is_empty((struct isl_map
*)set
);
5223 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5229 is_subset
= isl_map_is_subset(map1
, map2
);
5232 is_subset
= isl_map_is_subset(map2
, map1
);
5236 int isl_basic_map_is_strict_subset(
5237 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5241 if (!bmap1
|| !bmap2
)
5243 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5246 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5247 if (is_subset
== -1)
5252 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5258 is_subset
= isl_map_is_subset(map1
, map2
);
5261 is_subset
= isl_map_is_subset(map2
, map1
);
5262 if (is_subset
== -1)
5267 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5269 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5272 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5276 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5279 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5283 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5286 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5293 for (i
= 0; i
< map
->n
; ++i
) {
5294 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5302 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5304 return isl_map_fast_is_universe((isl_map
*) set
);
5307 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5309 struct isl_basic_set
*bset
= NULL
;
5310 struct isl_vec
*sample
= NULL
;
5317 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5320 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5321 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5322 copy
= isl_basic_map_remove_redundancies(copy
);
5323 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5324 isl_basic_map_free(copy
);
5328 total
= 1 + isl_basic_map_total_dim(bmap
);
5329 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5330 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5336 isl_vec_free(bmap
->sample
);
5337 bmap
->sample
= NULL
;
5338 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5341 sample
= isl_basic_set_sample_vec(bset
);
5344 empty
= sample
->size
== 0;
5345 isl_vec_free(bmap
->sample
);
5346 bmap
->sample
= sample
;
5348 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5353 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5357 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5360 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5364 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5367 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5369 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5372 struct isl_map
*isl_basic_map_union(
5373 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5375 struct isl_map
*map
;
5376 if (!bmap1
|| !bmap2
)
5379 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5381 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5384 map
= isl_map_add_basic_map(map
, bmap1
);
5385 map
= isl_map_add_basic_map(map
, bmap2
);
5388 isl_basic_map_free(bmap1
);
5389 isl_basic_map_free(bmap2
);
5393 struct isl_set
*isl_basic_set_union(
5394 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5396 return (struct isl_set
*)isl_basic_map_union(
5397 (struct isl_basic_map
*)bset1
,
5398 (struct isl_basic_map
*)bset2
);
5401 /* Order divs such that any div only depends on previous divs */
5402 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5410 off
= isl_dim_total(bmap
->dim
);
5412 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5414 if (isl_int_is_zero(bmap
->div
[i
][0]))
5416 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
5420 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
5426 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
5428 return (struct isl_basic_set
*)
5429 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
5432 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
5439 for (i
= 0; i
< map
->n
; ++i
) {
5440 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
5451 /* Look for a div in dst that corresponds to the div "div" in src.
5452 * The divs before "div" in src and dst are assumed to be the same.
5454 * Returns -1 if no corresponding div was found and the position
5455 * of the corresponding div in dst otherwise.
5457 static int find_div(struct isl_basic_map
*dst
,
5458 struct isl_basic_map
*src
, unsigned div
)
5462 unsigned total
= isl_dim_total(src
->dim
);
5464 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
5465 for (i
= div
; i
< dst
->n_div
; ++i
)
5466 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
5467 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
5468 dst
->n_div
- div
) == -1)
5473 struct isl_basic_map
*isl_basic_map_align_divs(
5474 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
5477 unsigned total
= isl_dim_total(src
->dim
);
5482 if (src
->n_div
== 0)
5485 for (i
= 0; i
< src
->n_div
; ++i
)
5486 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
5488 src
= isl_basic_map_order_divs(src
);
5489 dst
= isl_basic_map_cow(dst
);
5490 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
5491 src
->n_div
, 0, 2 * src
->n_div
);
5494 for (i
= 0; i
< src
->n_div
; ++i
) {
5495 int j
= find_div(dst
, src
, i
);
5497 j
= isl_basic_map_alloc_div(dst
);
5500 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
5501 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
5502 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
5506 isl_basic_map_swap_div(dst
, i
, j
);
5510 isl_basic_map_free(dst
);
5514 struct isl_basic_set
*isl_basic_set_align_divs(
5515 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
5517 return (struct isl_basic_set
*)isl_basic_map_align_divs(
5518 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
5521 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
5529 map
= isl_map_compute_divs(map
);
5530 map
= isl_map_cow(map
);
5534 for (i
= 1; i
< map
->n
; ++i
)
5535 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
5536 for (i
= 1; i
< map
->n
; ++i
)
5537 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
5539 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5543 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
5545 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
5548 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
5552 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
5553 map
= isl_map_intersect_domain(map
, set
);
5554 set
= isl_map_range(map
);
5562 /* There is no need to cow as removing empty parts doesn't change
5563 * the meaning of the set.
5565 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
5572 for (i
= map
->n
-1; i
>= 0; --i
) {
5573 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
5575 isl_basic_map_free(map
->p
[i
]);
5576 if (i
!= map
->n
-1) {
5577 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5578 map
->p
[i
] = map
->p
[map
->n
-1];
5586 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
5588 return (struct isl_set
*)
5589 isl_map_remove_empty_parts((struct isl_map
*)set
);
5592 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
5594 struct isl_basic_map
*bmap
;
5595 if (!map
|| map
->n
== 0)
5597 bmap
= map
->p
[map
->n
-1];
5598 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
5599 return isl_basic_map_copy(bmap
);
5602 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
5604 return (struct isl_basic_set
*)
5605 isl_map_copy_basic_map((struct isl_map
*)set
);
5608 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
5609 __isl_keep isl_basic_map
*bmap
)
5615 for (i
= map
->n
-1; i
>= 0; --i
) {
5616 if (map
->p
[i
] != bmap
)
5618 map
= isl_map_cow(map
);
5621 isl_basic_map_free(map
->p
[i
]);
5622 if (i
!= map
->n
-1) {
5623 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
5624 map
->p
[i
] = map
->p
[map
->n
-1];
5635 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
5636 struct isl_basic_set
*bset
)
5638 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
5639 (struct isl_basic_map
*)bset
);
5642 /* Given two basic sets bset1 and bset2, compute the maximal difference
5643 * between the values of dimension pos in bset1 and those in bset2
5644 * for any common value of the parameters and dimensions preceding pos.
5646 static enum isl_lp_result
basic_set_maximal_difference_at(
5647 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
5648 int pos
, isl_int
*opt
)
5650 struct isl_dim
*dims
;
5651 struct isl_basic_map
*bmap1
= NULL
;
5652 struct isl_basic_map
*bmap2
= NULL
;
5653 struct isl_ctx
*ctx
;
5654 struct isl_vec
*obj
;
5657 unsigned dim1
, dim2
;
5658 enum isl_lp_result res
;
5660 if (!bset1
|| !bset2
)
5661 return isl_lp_error
;
5663 nparam
= isl_basic_set_n_param(bset1
);
5664 dim1
= isl_basic_set_n_dim(bset1
);
5665 dim2
= isl_basic_set_n_dim(bset2
);
5666 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
5667 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
5668 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
5669 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
5670 if (!bmap1
|| !bmap2
)
5672 bmap1
= isl_basic_map_cow(bmap1
);
5673 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
5674 pos
, (dim1
- pos
) + (dim2
- pos
),
5675 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
5676 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
5679 total
= isl_basic_map_total_dim(bmap1
);
5681 obj
= isl_vec_alloc(ctx
, 1 + total
);
5682 isl_seq_clr(obj
->block
.data
, 1 + total
);
5683 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
5684 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
5687 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
5689 isl_basic_map_free(bmap1
);
5693 isl_basic_map_free(bmap1
);
5694 isl_basic_map_free(bmap2
);
5695 return isl_lp_error
;
5698 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5699 * for any common value of the parameters and dimensions preceding pos
5700 * in both basic sets, the values of dimension pos in bset1 are
5701 * smaller or larger than those in bset2.
5704 * 1 if bset1 follows bset2
5705 * -1 if bset1 precedes bset2
5706 * 0 if bset1 and bset2 are incomparable
5707 * -2 if some error occurred.
5709 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
5710 struct isl_basic_set
*bset2
, int pos
)
5713 enum isl_lp_result res
;
5718 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5720 if (res
== isl_lp_empty
)
5722 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5723 res
== isl_lp_unbounded
)
5725 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5734 /* Given two basic sets bset1 and bset2, check whether
5735 * for any common value of the parameters and dimensions preceding pos
5736 * there is a value of dimension pos in bset1 that is larger
5737 * than a value of the same dimension in bset2.
5740 * 1 if there exists such a pair
5741 * 0 if there is no such pair, but there is a pair of equal values
5743 * -2 if some error occurred.
5745 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
5746 __isl_keep isl_basic_set
*bset2
, int pos
)
5749 enum isl_lp_result res
;
5754 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5756 if (res
== isl_lp_empty
)
5758 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5759 res
== isl_lp_unbounded
)
5761 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5763 else if (res
== isl_lp_ok
)
5772 /* Given two sets set1 and set2, check whether
5773 * for any common value of the parameters and dimensions preceding pos
5774 * there is a value of dimension pos in set1 that is larger
5775 * than a value of the same dimension in set2.
5778 * 1 if there exists such a pair
5779 * 0 if there is no such pair, but there is a pair of equal values
5781 * -2 if some error occurred.
5783 int isl_set_follows_at(__isl_keep isl_set
*set1
,
5784 __isl_keep isl_set
*set2
, int pos
)
5792 for (i
= 0; i
< set1
->n
; ++i
)
5793 for (j
= 0; j
< set2
->n
; ++j
) {
5795 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
5796 if (f
== 1 || f
== -2)
5805 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
5806 unsigned pos
, isl_int
*val
)
5814 total
= isl_basic_map_total_dim(bmap
);
5815 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
5816 for (; d
+1 > pos
; --d
)
5817 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
5821 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
5823 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
5825 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
5828 isl_int_neg(*val
, bmap
->eq
[i
][0]);
5834 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
5835 unsigned pos
, isl_int
*val
)
5847 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
5850 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
5851 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
5852 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
5853 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5857 isl_int_set(*val
, v
);
5863 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
5864 unsigned pos
, isl_int
*val
)
5866 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
5870 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
5873 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
5876 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
5877 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5879 if (pos
>= isl_basic_map_dim(bmap
, type
))
5881 return isl_basic_map_fast_has_fixed_var(bmap
,
5882 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
5885 int isl_map_fast_is_fixed(struct isl_map
*map
,
5886 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5888 if (pos
>= isl_map_dim(map
, type
))
5890 return isl_map_fast_has_fixed_var(map
,
5891 map_offset(map
, type
) - 1 + pos
, val
);
5894 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5895 * then return this fixed value in *val.
5897 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
5900 return isl_basic_set_fast_has_fixed_var(bset
,
5901 isl_basic_set_n_param(bset
) + dim
, val
);
5904 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5905 * then return this fixed value in *val.
5907 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
5909 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
5912 /* Check if input variable in has fixed value and if so and if val is not NULL,
5913 * then return this fixed value in *val.
5915 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
5917 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
5920 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5921 * and if val is not NULL, then return this lower bound in *val.
5923 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
5924 unsigned dim
, isl_int
*val
)
5926 int i
, i_eq
= -1, i_ineq
= -1;
5933 total
= isl_basic_set_total_dim(bset
);
5934 nparam
= isl_basic_set_n_param(bset
);
5935 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5936 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
5942 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5943 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
5945 if (i_eq
!= -1 || i_ineq
!= -1)
5949 if (i_eq
== -1 && i_ineq
== -1)
5951 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
5952 /* The coefficient should always be one due to normalization. */
5953 if (!isl_int_is_one(c
[1+nparam
+dim
]))
5955 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
5957 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
5958 total
- nparam
- dim
- 1) != -1)
5961 isl_int_neg(*val
, c
[0]);
5965 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
5966 unsigned dim
, isl_int
*val
)
5978 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5982 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5984 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
5985 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
5987 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5991 isl_int_set(*val
, v
);
6002 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6004 const struct constraint
*c1
= (const struct constraint
*)p1
;
6005 const struct constraint
*c2
= (const struct constraint
*)p2
;
6006 unsigned size
= isl_min(c1
->size
, c2
->size
);
6007 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6010 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6011 struct isl_basic_map
*bmap
)
6014 struct constraint
*c
;
6019 total
= isl_basic_map_total_dim(bmap
);
6020 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6023 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6025 c
[i
].c
= bmap
->ineq
[i
];
6027 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6028 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6029 bmap
->ineq
[i
] = c
[i
].c
;
6033 isl_basic_map_free(bmap
);
6037 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6038 __isl_take isl_basic_set
*bset
)
6040 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6041 (struct isl_basic_map
*)bset
);
6044 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6048 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6050 bmap
= isl_basic_map_remove_redundancies(bmap
);
6051 bmap
= isl_basic_map_sort_constraints(bmap
);
6052 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6056 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6058 return (struct isl_basic_set
*)isl_basic_map_normalize(
6059 (struct isl_basic_map
*)bset
);
6062 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6063 const __isl_keep isl_basic_map
*bmap2
)
6070 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6071 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6072 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6073 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6074 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6075 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6076 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6077 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6079 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6081 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6083 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6084 return bmap1
->n_eq
- bmap2
->n_eq
;
6085 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6086 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6087 if (bmap1
->n_div
!= bmap2
->n_div
)
6088 return bmap1
->n_div
- bmap2
->n_div
;
6089 total
= isl_basic_map_total_dim(bmap1
);
6090 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6091 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6095 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6096 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6100 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6101 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6108 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6109 __isl_keep isl_basic_map
*bmap2
)
6111 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6114 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6115 __isl_keep isl_basic_set
*bset2
)
6117 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6118 (isl_basic_map
*)bset2
);
6121 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6123 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6124 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6126 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6129 /* We normalize in place, but if anything goes wrong we need
6130 * to return NULL, so we need to make sure we don't change the
6131 * meaning of any possible other copies of map.
6133 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6136 struct isl_basic_map
*bmap
;
6140 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6142 for (i
= 0; i
< map
->n
; ++i
) {
6143 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6146 isl_basic_map_free(map
->p
[i
]);
6149 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6150 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6151 map
= isl_map_remove_empty_parts(map
);
6154 for (i
= map
->n
- 1; i
>= 1; --i
) {
6155 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6157 isl_basic_map_free(map
->p
[i
-1]);
6158 for (j
= i
; j
< map
->n
; ++j
)
6159 map
->p
[j
-1] = map
->p
[j
];
6169 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6171 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6174 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6184 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6187 map1
= isl_map_copy(map1
);
6188 map2
= isl_map_copy(map2
);
6189 map1
= isl_map_normalize(map1
);
6190 map2
= isl_map_normalize(map2
);
6193 equal
= map1
->n
== map2
->n
;
6194 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6195 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6208 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6210 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6211 (struct isl_map
*)set2
);
6214 /* Return an interval that ranges from min to max (inclusive)
6216 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6217 isl_int min
, isl_int max
)
6220 struct isl_basic_set
*bset
= NULL
;
6222 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6226 k
= isl_basic_set_alloc_inequality(bset
);
6229 isl_int_set_si(bset
->ineq
[k
][1], 1);
6230 isl_int_neg(bset
->ineq
[k
][0], min
);
6232 k
= isl_basic_set_alloc_inequality(bset
);
6235 isl_int_set_si(bset
->ineq
[k
][1], -1);
6236 isl_int_set(bset
->ineq
[k
][0], max
);
6240 isl_basic_set_free(bset
);
6244 /* Return the Cartesian product of the basic sets in list (in the given order).
6246 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6254 struct isl_basic_set
*product
= NULL
;
6258 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6259 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6260 nparam
= isl_basic_set_n_param(list
->p
[0]);
6261 dim
= isl_basic_set_n_dim(list
->p
[0]);
6262 extra
= list
->p
[0]->n_div
;
6263 n_eq
= list
->p
[0]->n_eq
;
6264 n_ineq
= list
->p
[0]->n_ineq
;
6265 for (i
= 1; i
< list
->n
; ++i
) {
6266 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6267 isl_assert(list
->ctx
,
6268 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6269 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6270 extra
+= list
->p
[i
]->n_div
;
6271 n_eq
+= list
->p
[i
]->n_eq
;
6272 n_ineq
+= list
->p
[i
]->n_ineq
;
6274 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6279 for (i
= 0; i
< list
->n
; ++i
) {
6280 isl_basic_set_add_constraints(product
,
6281 isl_basic_set_copy(list
->p
[i
]), dim
);
6282 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6284 isl_basic_set_list_free(list
);
6287 isl_basic_set_free(product
);
6288 isl_basic_set_list_free(list
);
6292 struct isl_basic_map
*isl_basic_map_product(
6293 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6295 struct isl_dim
*dim_result
= NULL
;
6296 struct isl_basic_map
*bmap
;
6297 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6298 struct isl_dim_map
*dim_map1
, *dim_map2
;
6300 if (!bmap1
|| !bmap2
)
6303 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6304 bmap2
->dim
, isl_dim_param
), goto error
);
6305 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6306 isl_dim_copy(bmap2
->dim
));
6308 in1
= isl_basic_map_n_in(bmap1
);
6309 in2
= isl_basic_map_n_in(bmap2
);
6310 out1
= isl_basic_map_n_out(bmap1
);
6311 out2
= isl_basic_map_n_out(bmap2
);
6312 nparam
= isl_basic_map_n_param(bmap1
);
6314 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6315 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6316 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6317 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6318 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6319 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6320 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6321 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6322 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6323 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6324 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6326 bmap
= isl_basic_map_alloc_dim(dim_result
,
6327 bmap1
->n_div
+ bmap2
->n_div
,
6328 bmap1
->n_eq
+ bmap2
->n_eq
,
6329 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6330 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6331 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6332 bmap
= isl_basic_map_simplify(bmap
);
6333 return isl_basic_map_finalize(bmap
);
6335 isl_basic_map_free(bmap1
);
6336 isl_basic_map_free(bmap2
);
6340 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6342 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6345 struct isl_map
*result
;
6351 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6352 map2
->dim
, isl_dim_param
), goto error
);
6354 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6355 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6356 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6358 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6359 isl_dim_copy(map2
->dim
)),
6360 map1
->n
* map2
->n
, flags
);
6363 for (i
= 0; i
< map1
->n
; ++i
)
6364 for (j
= 0; j
< map2
->n
; ++j
) {
6365 struct isl_basic_map
*part
;
6366 part
= isl_basic_map_product(
6367 isl_basic_map_copy(map1
->p
[i
]),
6368 isl_basic_map_copy(map2
->p
[j
]));
6369 if (isl_basic_map_is_empty(part
))
6370 isl_basic_map_free(part
);
6372 result
= isl_map_add_basic_map(result
, part
);
6385 /* Given two set A and B, construct its Cartesian product A x B.
6387 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6389 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6390 (struct isl_map
*)set2
);
6393 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
6396 uint32_t hash
= isl_hash_init();
6401 bset
= isl_basic_set_copy(bset
);
6402 bset
= isl_basic_set_normalize(bset
);
6405 total
= isl_basic_set_total_dim(bset
);
6406 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
6407 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6409 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
6410 isl_hash_hash(hash
, c_hash
);
6412 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
6413 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6415 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
6416 isl_hash_hash(hash
, c_hash
);
6418 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
6419 for (i
= 0; i
< bset
->n_div
; ++i
) {
6421 if (isl_int_is_zero(bset
->div
[i
][0]))
6423 isl_hash_byte(hash
, i
& 0xFF);
6424 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
6425 isl_hash_hash(hash
, c_hash
);
6427 isl_basic_set_free(bset
);
6431 uint32_t isl_set_get_hash(struct isl_set
*set
)
6438 set
= isl_set_copy(set
);
6439 set
= isl_set_normalize(set
);
6443 hash
= isl_hash_init();
6444 for (i
= 0; i
< set
->n
; ++i
) {
6446 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
6447 isl_hash_hash(hash
, bset_hash
);
6455 /* Check if the value for dimension dim is completely determined
6456 * by the values of the other parameters and variables.
6457 * That is, check if dimension dim is involved in an equality.
6459 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
6466 nparam
= isl_basic_set_n_param(bset
);
6467 for (i
= 0; i
< bset
->n_eq
; ++i
)
6468 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
6473 /* Check if the value for dimension dim is completely determined
6474 * by the values of the other parameters and variables.
6475 * That is, check if dimension dim is involved in an equality
6476 * for each of the subsets.
6478 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
6484 for (i
= 0; i
< set
->n
; ++i
) {
6486 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
6493 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
6494 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
6501 for (i
= 0; i
< map
->n
; ++i
)
6502 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
6508 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
6509 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
6516 for (i
= 0; i
< set
->n
; ++i
)
6517 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
6523 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
6525 struct isl_dim
*dim
;
6530 if (bset
->n_div
== 0)
6533 bset
= isl_basic_set_cow(bset
);
6537 dim
= isl_basic_set_get_dim(bset
);
6538 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
6541 isl_dim_free(bset
->dim
);
6545 bset
= isl_basic_set_finalize(bset
);
6549 isl_basic_set_free(bset
);
6553 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
6556 struct isl_dim
*dim
;
6559 set
= isl_set_align_divs(set
);
6563 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
6566 set
= isl_set_cow(set
);
6570 n_div
= set
->p
[0]->n_div
;
6571 dim
= isl_set_get_dim(set
);
6572 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
6575 isl_dim_free(set
->dim
);
6578 for (i
= 0; i
< set
->n
; ++i
) {
6579 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
6590 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
6592 struct isl_dim
*dim
;
6593 struct isl_basic_map
*bmap
;
6600 set
= isl_set_align_divs(set
);
6605 dim
= isl_set_get_dim(set
);
6606 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
6608 return isl_map_identity(dim
);
6611 n_div
= set
->p
[0]->n_div
;
6612 dim
= isl_dim_map(dim
);
6613 n_param
= isl_dim_size(dim
, isl_dim_param
);
6614 n_set
= isl_dim_size(dim
, isl_dim_in
);
6615 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
6616 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
6617 for (i
= 0; i
< n_set
; ++i
)
6618 bmap
= var_equal(bmap
, i
);
6620 total
= n_param
+ n_set
+ n_set
+ n_div
;
6621 for (i
= 0; i
< n_div
; ++i
) {
6622 k
= isl_basic_map_alloc_inequality(bmap
);
6625 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
6626 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
6627 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
6628 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
6629 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
6630 set
->p
[0]->div
[i
][0]);
6632 l
= isl_basic_map_alloc_inequality(bmap
);
6635 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
6636 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
6637 set
->p
[0]->div
[i
][0]);
6638 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
6642 return isl_map_from_basic_map(bmap
);
6645 isl_basic_map_free(bmap
);
6649 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
6657 dim
= isl_basic_set_total_dim(bset
);
6658 size
+= bset
->n_eq
* (1 + dim
);
6659 size
+= bset
->n_ineq
* (1 + dim
);
6660 size
+= bset
->n_div
* (2 + dim
);
6665 int isl_set_size(__isl_keep isl_set
*set
)
6673 for (i
= 0; i
< set
->n
; ++i
)
6674 size
+= isl_basic_set_size(set
->p
[i
]);
6679 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
6680 enum isl_dim_type type
, unsigned pos
)
6688 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
6690 pos
+= isl_basic_map_offset(bmap
, type
);
6692 for (i
= 0; i
< bmap
->n_eq
; ++i
)
6693 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
6697 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6698 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
6705 return lower
&& upper
;
6708 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
6709 enum isl_dim_type type
, unsigned pos
)
6716 for (i
= 0; i
< map
->n
; ++i
) {
6718 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
6719 if (bounded
< 0 || !bounded
)
6726 /* Return 1 if the specified dim is involved in both an upper bound
6727 * and a lower bound.
6729 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
6730 enum isl_dim_type type
, unsigned pos
)
6732 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
6735 /* For each of the "n" variables starting at "first", determine
6736 * the sign of the variable and put the results in the first "n"
6737 * elements of the array "signs".
6739 * 1 means that the variable is non-negative
6740 * -1 means that the variable is non-positive
6741 * 0 means the variable attains both positive and negative values.
6743 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
6744 unsigned first
, unsigned n
, int *signs
)
6746 isl_vec
*bound
= NULL
;
6747 struct isl_tab
*tab
= NULL
;
6748 struct isl_tab_undo
*snap
;
6751 if (!bset
|| !signs
)
6754 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
6755 tab
= isl_tab_from_basic_set(bset
);
6759 isl_seq_clr(bound
->el
, bound
->size
);
6760 isl_int_set_si(bound
->el
[0], -1);
6762 snap
= isl_tab_snap(tab
);
6763 for (i
= 0; i
< n
; ++i
) {
6766 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
6767 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
6770 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
6771 if (isl_tab_rollback(tab
, snap
) < 0)
6779 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
6780 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
6783 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
6784 if (isl_tab_rollback(tab
, snap
) < 0)
6787 signs
[i
] = empty
? -1 : 0;
6791 isl_vec_free(bound
);
6795 isl_vec_free(bound
);
6799 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
6800 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
6802 if (!bset
|| !signs
)
6804 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
6807 first
+= pos(bset
->dim
, type
) - 1;
6808 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
6811 /* Check if the given map is single-valued.
6816 * and check if the result is a subset of the identity mapping.
6818 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
6824 test
= isl_map_reverse(isl_map_copy(map
));
6825 test
= isl_map_apply_range(test
, isl_map_copy(map
));
6827 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
6829 sv
= isl_map_is_subset(test
, id
);
6837 int isl_map_is_bijective(__isl_keep isl_map
*map
)
6841 sv
= isl_map_is_single_valued(map
);
6845 map
= isl_map_copy(map
);
6846 map
= isl_map_reverse(map
);
6847 sv
= isl_map_is_single_valued(map
);
6853 int isl_set_is_singleton(__isl_keep isl_set
*set
)
6855 return isl_map_is_single_valued((isl_map
*)set
);
6858 int isl_map_is_translation(__isl_keep isl_map
*map
)
6863 delta
= isl_map_deltas(isl_map_copy(map
));
6864 ok
= isl_set_is_singleton(delta
);
6865 isl_set_free(delta
);
6870 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
6872 if (isl_seq_first_non_zero(p
, pos
) != -1)
6874 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
6879 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
6888 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
6891 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
6892 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
6893 for (j
= 0; j
< nvar
; ++j
) {
6894 int lower
= 0, upper
= 0;
6895 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6896 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
6898 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
6904 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6905 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
6907 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
6909 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
6914 if (!lower
|| !upper
)
6921 int isl_set_is_box(__isl_keep isl_set
*set
)
6928 return isl_basic_set_is_box(set
->p
[0]);