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 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
254 return isl_dim_copy(bmap
->dim
);
257 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
261 return isl_dim_copy(bset
->dim
);
264 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
268 return isl_dim_copy(map
->dim
);
271 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
275 return isl_dim_copy(set
->dim
);
278 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
279 __isl_take isl_basic_map
*bmap
,
280 enum isl_dim_type type
, unsigned pos
, const char *s
)
284 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
289 isl_basic_map_free(bmap
);
293 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
294 enum isl_dim_type type
, unsigned pos
, const char *s
)
301 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
305 for (i
= 0; i
< map
->n
; ++i
) {
306 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
317 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
318 __isl_take isl_basic_set
*bset
,
319 enum isl_dim_type type
, unsigned pos
, const char *s
)
321 return (isl_basic_set
*)isl_basic_map_set_dim_name(
322 (isl_basic_map
*)bset
, type
, pos
, s
);
325 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
326 enum isl_dim_type type
, unsigned pos
, const char *s
)
328 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
331 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
335 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
338 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
339 struct isl_basic_map
*bmap
, unsigned extra
,
340 unsigned n_eq
, unsigned n_ineq
)
343 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
348 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
349 if (isl_blk_is_error(bmap
->block
))
352 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
357 bmap
->block2
= isl_blk_empty();
360 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
361 if (isl_blk_is_error(bmap
->block2
))
364 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
369 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
370 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
372 for (i
= 0; i
< extra
; ++i
)
373 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
377 bmap
->c_size
= n_eq
+ n_ineq
;
378 bmap
->eq
= bmap
->ineq
+ n_ineq
;
387 isl_basic_map_free(bmap
);
391 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
392 unsigned nparam
, unsigned dim
, unsigned extra
,
393 unsigned n_eq
, unsigned n_ineq
)
395 struct isl_basic_map
*bmap
;
396 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
397 return (struct isl_basic_set
*)bmap
;
400 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
401 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
403 struct isl_basic_map
*bmap
;
406 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
407 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
408 return (struct isl_basic_set
*)bmap
;
411 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
412 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
414 struct isl_basic_map
*bmap
;
418 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
423 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
429 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
430 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
431 unsigned n_eq
, unsigned n_ineq
)
433 struct isl_basic_map
*bmap
;
436 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
440 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
444 static void dup_constraints(
445 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
448 unsigned total
= isl_basic_map_total_dim(src
);
450 for (i
= 0; i
< src
->n_eq
; ++i
) {
451 int j
= isl_basic_map_alloc_equality(dst
);
452 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
455 for (i
= 0; i
< src
->n_ineq
; ++i
) {
456 int j
= isl_basic_map_alloc_inequality(dst
);
457 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
460 for (i
= 0; i
< src
->n_div
; ++i
) {
461 int j
= isl_basic_map_alloc_div(dst
);
462 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
464 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
467 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
469 struct isl_basic_map
*dup
;
473 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
474 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
477 dup_constraints(dup
, bmap
);
478 dup
->flags
= bmap
->flags
;
479 dup
->sample
= isl_vec_copy(bmap
->sample
);
483 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
485 struct isl_basic_map
*dup
;
487 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
488 return (struct isl_basic_set
*)dup
;
491 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
496 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
500 return isl_basic_set_dup(bset
);
503 struct isl_set
*isl_set_copy(struct isl_set
*set
)
512 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
517 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
521 bmap
= isl_basic_map_dup(bmap
);
523 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
527 struct isl_map
*isl_map_copy(struct isl_map
*map
)
536 void isl_basic_map_free(struct isl_basic_map
*bmap
)
544 isl_ctx_deref(bmap
->ctx
);
546 isl_blk_free(bmap
->ctx
, bmap
->block2
);
548 isl_blk_free(bmap
->ctx
, bmap
->block
);
549 isl_vec_free(bmap
->sample
);
550 isl_dim_free(bmap
->dim
);
554 void isl_basic_set_free(struct isl_basic_set
*bset
)
556 isl_basic_map_free((struct isl_basic_map
*)bset
);
559 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
561 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
564 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
570 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
571 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
573 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
574 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
575 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
576 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
577 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
578 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
580 int j
= isl_basic_map_alloc_inequality(bmap
);
584 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
585 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
592 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
593 bmap
->extra
- bmap
->n_div
);
597 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
599 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
602 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
606 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
611 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
613 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
616 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
621 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
623 if (pos
!= bmap
->n_eq
- 1) {
625 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
626 bmap
->eq
[bmap
->n_eq
- 1] = t
;
632 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
634 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
637 void isl_basic_map_inequality_to_equality(
638 struct isl_basic_map
*bmap
, unsigned pos
)
643 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
644 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
649 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
650 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
651 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
652 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
655 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
657 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
660 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
666 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
667 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
668 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
669 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
670 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
671 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
672 1 + isl_basic_map_total_dim(bmap
),
673 bmap
->extra
- bmap
->n_div
);
674 return bmap
->n_ineq
++;
677 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
679 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
682 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
686 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
691 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
693 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
696 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
701 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
703 if (pos
!= bmap
->n_ineq
- 1) {
705 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
706 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
707 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
713 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
715 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
718 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
723 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
726 k
= isl_basic_map_alloc_equality(bmap
);
729 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
732 isl_basic_map_free(bmap
);
736 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
739 return (isl_basic_set
*)
740 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
743 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
748 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
751 k
= isl_basic_map_alloc_inequality(bmap
);
754 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
757 isl_basic_map_free(bmap
);
761 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
764 return (isl_basic_set
*)
765 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
768 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
772 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
773 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
774 1 + 1 + isl_basic_map_total_dim(bmap
),
775 bmap
->extra
- bmap
->n_div
);
776 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
777 return bmap
->n_div
++;
780 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
782 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
785 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
789 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
794 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
796 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
799 /* Copy constraint from src to dst, putting the vars of src at offset
800 * dim_off in dst and the divs of src at offset div_off in dst.
801 * If both sets are actually map, then dim_off applies to the input
804 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
805 struct isl_basic_map
*src_map
, isl_int
*src
,
806 unsigned in_off
, unsigned out_off
, unsigned div_off
)
808 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
809 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
810 unsigned src_in
= isl_basic_map_n_in(src_map
);
811 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
812 unsigned src_out
= isl_basic_map_n_out(src_map
);
813 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
814 isl_int_set(dst
[0], src
[0]);
815 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
816 if (dst_nparam
> src_nparam
)
817 isl_seq_clr(dst
+1+src_nparam
,
818 dst_nparam
- src_nparam
);
819 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
820 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
822 isl_min(dst_in
-in_off
, src_in
));
823 if (dst_in
-in_off
> src_in
)
824 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
825 dst_in
- in_off
- src_in
);
826 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
827 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
828 src
+1+src_nparam
+src_in
,
829 isl_min(dst_out
-out_off
, src_out
));
830 if (dst_out
-out_off
> src_out
)
831 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
832 dst_out
- out_off
- src_out
);
833 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
834 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
835 src
+1+src_nparam
+src_in
+src_out
,
836 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
837 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
838 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
839 div_off
+src_map
->n_div
,
840 dst_map
->n_div
- div_off
- src_map
->n_div
);
843 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
844 struct isl_basic_map
*src_map
, isl_int
*src
,
845 unsigned in_off
, unsigned out_off
, unsigned div_off
)
847 isl_int_set(dst
[0], src
[0]);
848 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
851 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
852 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
857 if (!bmap1
|| !bmap2
)
860 div_off
= bmap1
->n_div
;
862 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
863 int i1
= isl_basic_map_alloc_equality(bmap1
);
866 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
867 i_pos
, o_pos
, div_off
);
870 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
871 int i1
= isl_basic_map_alloc_inequality(bmap1
);
874 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
875 i_pos
, o_pos
, div_off
);
878 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
879 int i1
= isl_basic_map_alloc_div(bmap1
);
882 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
883 i_pos
, o_pos
, div_off
);
886 isl_basic_map_free(bmap2
);
891 isl_basic_map_free(bmap1
);
892 isl_basic_map_free(bmap2
);
896 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
897 struct isl_dim_map
*dim_map
)
901 for (i
= 0; i
< dim_map
->len
; ++i
) {
902 if (dim_map
->pos
[i
] < 0)
903 isl_int_set_si(dst
[i
], 0);
905 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
909 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
910 struct isl_dim_map
*dim_map
)
912 isl_int_set(dst
[0], src
[0]);
913 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
916 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
917 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
921 if (!src
|| !dst
|| !dim_map
)
924 for (i
= 0; i
< src
->n_eq
; ++i
) {
925 int i1
= isl_basic_map_alloc_equality(dst
);
928 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
931 for (i
= 0; i
< src
->n_ineq
; ++i
) {
932 int i1
= isl_basic_map_alloc_inequality(dst
);
935 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
938 for (i
= 0; i
< src
->n_div
; ++i
) {
939 int i1
= isl_basic_map_alloc_div(dst
);
942 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
946 isl_basic_map_free(src
);
951 isl_basic_map_free(src
);
952 isl_basic_map_free(dst
);
956 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
957 struct isl_basic_set
*bset2
, unsigned pos
)
959 return (struct isl_basic_set
*)
960 add_constraints((struct isl_basic_map
*)bset1
,
961 (struct isl_basic_map
*)bset2
, 0, pos
);
964 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
965 struct isl_dim
*dim
, unsigned extra
,
966 unsigned n_eq
, unsigned n_ineq
)
968 struct isl_basic_map
*ext
;
978 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
979 base
->extra
>= base
->n_div
+ extra
;
981 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
982 room_for_ineq(base
, n_ineq
)) {
987 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
988 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
989 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
990 extra
+= base
->extra
;
992 n_ineq
+= base
->n_ineq
;
994 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1000 ext
->sample
= isl_vec_copy(base
->sample
);
1001 flags
= base
->flags
;
1002 ext
= add_constraints(ext
, base
, 0, 0);
1005 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1012 isl_basic_map_free(base
);
1016 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1017 struct isl_dim
*dim
, unsigned extra
,
1018 unsigned n_eq
, unsigned n_ineq
)
1020 return (struct isl_basic_set
*)
1021 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1022 extra
, n_eq
, n_ineq
);
1025 struct isl_basic_map
*isl_basic_map_extend_constraints(
1026 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1030 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1034 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1035 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1036 unsigned n_eq
, unsigned n_ineq
)
1038 struct isl_basic_map
*bmap
;
1039 struct isl_dim
*dim
;
1043 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1047 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1050 isl_basic_map_free(base
);
1054 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1055 unsigned nparam
, unsigned dim
, unsigned extra
,
1056 unsigned n_eq
, unsigned n_ineq
)
1058 return (struct isl_basic_set
*)
1059 isl_basic_map_extend((struct isl_basic_map
*)base
,
1060 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1063 struct isl_basic_set
*isl_basic_set_extend_constraints(
1064 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1066 return (struct isl_basic_set
*)
1067 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1071 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1073 return (struct isl_basic_set
*)
1074 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1077 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1082 if (bmap
->ref
> 1) {
1084 bmap
= isl_basic_map_dup(bmap
);
1087 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1091 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1099 return isl_set_dup(set
);
1102 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1110 return isl_map_dup(map
);
1113 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1114 unsigned a_len
, unsigned b_len
)
1116 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1117 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1118 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1121 struct isl_basic_set
*isl_basic_set_swap_vars(
1122 struct isl_basic_set
*bset
, unsigned n
)
1132 nparam
= isl_basic_set_n_param(bset
);
1133 dim
= isl_basic_set_n_dim(bset
);
1134 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1139 bset
= isl_basic_set_cow(bset
);
1143 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1144 if (isl_blk_is_error(blk
))
1147 for (i
= 0; i
< bset
->n_eq
; ++i
)
1149 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1151 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1153 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1155 for (i
= 0; i
< bset
->n_div
; ++i
)
1157 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1159 isl_blk_free(bset
->ctx
, blk
);
1161 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1162 return isl_basic_set_gauss(bset
, NULL
);
1164 isl_basic_set_free(bset
);
1168 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1171 set
= isl_set_cow(set
);
1175 for (i
= 0; i
< set
->n
; ++i
) {
1176 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1182 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1186 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1192 total
= isl_basic_map_total_dim(bmap
);
1193 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1194 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1196 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1198 i
= isl_basic_map_alloc_equality(bmap
);
1202 isl_int_set_si(bmap
->eq
[i
][0], 1);
1203 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1204 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1205 isl_vec_free(bmap
->sample
);
1206 bmap
->sample
= NULL
;
1207 return isl_basic_map_finalize(bmap
);
1209 isl_basic_map_free(bmap
);
1213 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1215 return (struct isl_basic_set
*)
1216 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1219 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1222 unsigned off
= isl_dim_total(bmap
->dim
);
1223 isl_int
*t
= bmap
->div
[a
];
1224 bmap
->div
[a
] = bmap
->div
[b
];
1227 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1228 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1230 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1231 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1233 for (i
= 0; i
< bmap
->n_div
; ++i
)
1234 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1235 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1238 /* Eliminate the specified n dimensions starting at first from the
1239 * constraints using Fourier-Motzkin. The dimensions themselves
1242 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1243 enum isl_dim_type type
, unsigned first
, unsigned n
)
1252 map
= isl_map_cow(map
);
1255 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1256 first
+= pos(map
->dim
, type
) - 1;
1258 for (i
= 0; i
< map
->n
; ++i
) {
1259 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1269 /* Eliminate the specified n dimensions starting at first from the
1270 * constraints using Fourier-Motzkin. The dimensions themselves
1273 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1274 enum isl_dim_type type
, unsigned first
, unsigned n
)
1276 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1279 /* Eliminate the specified n dimensions starting at first from the
1280 * constraints using Fourier-Motzkin. The dimensions themselves
1283 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1284 unsigned first
, unsigned n
)
1286 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1289 /* Project out n dimensions starting at first using Fourier-Motzkin */
1290 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1291 unsigned first
, unsigned n
)
1293 set
= isl_set_eliminate_dims(set
, first
, n
);
1294 set
= isl_set_drop_dims(set
, first
, n
);
1298 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1300 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1308 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1317 set
= isl_set_cow(set
);
1321 for (i
= 0; i
< set
->n
; ++i
) {
1322 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1332 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1333 enum isl_dim_type type
, unsigned first
, unsigned n
)
1337 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1341 bmap
= isl_basic_map_eliminate_vars(bmap
,
1342 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1345 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1347 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1350 isl_basic_map_free(bmap
);
1354 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1355 enum isl_dim_type type
, unsigned first
, unsigned n
)
1357 return (isl_basic_set
*)
1358 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1361 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1362 enum isl_dim_type type
, unsigned first
, unsigned n
)
1369 map
= isl_map_cow(map
);
1372 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1374 for (i
= 0; i
< map
->n
; ++i
) {
1375 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1376 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1380 map
= isl_map_drop(map
, type
, first
, n
);
1387 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1388 enum isl_dim_type type
, unsigned first
, unsigned n
)
1390 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1393 /* Project out n inputs starting at first using Fourier-Motzkin */
1394 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1395 unsigned first
, unsigned n
)
1397 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1400 /* Project out n dimensions starting at first using Fourier-Motzkin */
1401 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1402 unsigned first
, unsigned n
)
1404 unsigned nparam
= isl_basic_set_n_param(bset
);
1405 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1406 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1410 static void dump_term(struct isl_basic_map
*bmap
,
1411 isl_int c
, int pos
, FILE *out
)
1414 unsigned in
= isl_basic_map_n_in(bmap
);
1415 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1416 unsigned nparam
= isl_basic_map_n_param(bmap
);
1418 isl_int_print(out
, c
, 0);
1420 if (!isl_int_is_one(c
))
1421 isl_int_print(out
, c
, 0);
1422 if (pos
< 1 + nparam
) {
1423 name
= isl_dim_get_name(bmap
->dim
,
1424 isl_dim_param
, pos
- 1);
1426 fprintf(out
, "%s", name
);
1428 fprintf(out
, "p%d", pos
- 1);
1429 } else if (pos
< 1 + nparam
+ in
)
1430 fprintf(out
, "i%d", pos
- 1 - nparam
);
1431 else if (pos
< 1 + nparam
+ dim
)
1432 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1434 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1438 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1439 int sign
, FILE *out
)
1443 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1447 for (i
= 0, first
= 1; i
< len
; ++i
) {
1448 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1451 fprintf(out
, " + ");
1453 isl_int_abs(v
, c
[i
]);
1454 dump_term(bmap
, v
, i
, out
);
1461 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1462 const char *op
, FILE *out
, int indent
)
1466 fprintf(out
, "%*s", indent
, "");
1468 dump_constraint_sign(bmap
, c
, 1, out
);
1469 fprintf(out
, " %s ", op
);
1470 dump_constraint_sign(bmap
, c
, -1, out
);
1474 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1475 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1477 fprintf(out
, "%*s", indent
, "");
1478 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1483 static void dump_constraints(struct isl_basic_map
*bmap
,
1484 isl_int
**c
, unsigned n
,
1485 const char *op
, FILE *out
, int indent
)
1489 for (i
= 0; i
< n
; ++i
)
1490 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1493 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1497 unsigned total
= isl_basic_map_total_dim(bmap
);
1499 for (j
= 0; j
< 1 + total
; ++j
) {
1500 if (isl_int_is_zero(exp
[j
]))
1502 if (!first
&& isl_int_is_pos(exp
[j
]))
1504 dump_term(bmap
, exp
[j
], j
, out
);
1509 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1513 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1514 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1516 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1517 fprintf(out
, "%*s", indent
, "");
1518 fprintf(out
, "e%d = [(", i
);
1519 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1521 isl_int_print(out
, bmap
->div
[i
][0], 0);
1522 fprintf(out
, "]\n");
1526 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1529 fprintf(out
, "null basic set\n");
1533 fprintf(out
, "%*s", indent
, "");
1534 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1535 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1536 bset
->extra
, bset
->flags
);
1537 dump((struct isl_basic_map
*)bset
, out
, indent
);
1540 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1543 fprintf(out
, "null basic map\n");
1547 fprintf(out
, "%*s", indent
, "");
1548 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1549 "flags: %x, n_name: %d\n",
1551 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1552 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1553 dump(bmap
, out
, indent
);
1556 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1561 total
= isl_basic_map_total_dim(bmap
);
1562 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1563 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1564 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1565 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1569 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1571 struct isl_set
*set
;
1575 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1576 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1577 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1578 sizeof(struct isl_set
) +
1579 (n
- 1) * sizeof(struct isl_basic_set
*));
1583 set
->ctx
= dim
->ctx
;
1584 isl_ctx_ref(set
->ctx
);
1596 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1597 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1599 struct isl_set
*set
;
1600 struct isl_dim
*dims
;
1602 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1606 set
= isl_set_alloc_dim(dims
, n
, flags
);
1610 /* Make sure "map" has room for at least "n" more basic maps.
1612 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1615 struct isl_map
*grown
= NULL
;
1619 isl_assert(map
->ctx
, n
>= 0, goto error
);
1620 if (map
->n
+ n
<= map
->size
)
1622 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1625 for (i
= 0; i
< map
->n
; ++i
) {
1626 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1634 isl_map_free(grown
);
1639 /* Make sure "set" has room for at least "n" more basic sets.
1641 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1643 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1646 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1649 struct isl_set
*dup
;
1654 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1657 for (i
= 0; i
< set
->n
; ++i
)
1658 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1662 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1664 struct isl_set
*set
;
1669 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1671 isl_basic_set_free(bset
);
1674 return isl_set_add_basic_set(set
, bset
);
1677 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1679 struct isl_map
*map
;
1684 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1686 isl_basic_map_free(bmap
);
1689 return isl_map_add_basic_map(map
, bmap
);
1692 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1693 __isl_take isl_basic_set
*bset
)
1695 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1696 (struct isl_basic_map
*)bset
);
1699 void isl_set_free(struct isl_set
*set
)
1709 isl_ctx_deref(set
->ctx
);
1710 for (i
= 0; i
< set
->n
; ++i
)
1711 isl_basic_set_free(set
->p
[i
]);
1712 isl_dim_free(set
->dim
);
1716 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1721 fprintf(out
, "null set\n");
1725 fprintf(out
, "%*s", indent
, "");
1726 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1727 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1729 for (i
= 0; i
< set
->n
; ++i
) {
1730 fprintf(out
, "%*s", indent
, "");
1731 fprintf(out
, "basic set %d:\n", i
);
1732 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1736 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1741 fprintf(out
, "null map\n");
1745 fprintf(out
, "%*s", indent
, "");
1746 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1747 "flags: %x, n_name: %d\n",
1748 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1749 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1750 for (i
= 0; i
< map
->n
; ++i
) {
1751 fprintf(out
, "%*s", indent
, "");
1752 fprintf(out
, "basic map %d:\n", i
);
1753 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1757 struct isl_basic_map
*isl_basic_map_intersect_domain(
1758 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1760 struct isl_basic_map
*bmap_domain
;
1761 struct isl_dim
*dim
;
1766 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1767 bset
->dim
, isl_dim_param
), goto error
);
1769 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1770 isl_assert(bset
->ctx
,
1771 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1773 bmap
= isl_basic_map_cow(bmap
);
1776 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1777 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1778 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1779 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1780 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1782 bmap
= isl_basic_map_simplify(bmap
);
1783 return isl_basic_map_finalize(bmap
);
1785 isl_basic_map_free(bmap
);
1786 isl_basic_set_free(bset
);
1790 struct isl_basic_map
*isl_basic_map_intersect_range(
1791 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1793 struct isl_basic_map
*bmap_range
;
1798 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1799 bset
->dim
, isl_dim_param
), goto error
);
1801 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1802 isl_assert(bset
->ctx
,
1803 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1805 bmap
= isl_basic_map_cow(bmap
);
1808 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1809 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1810 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1811 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1813 bmap
= isl_basic_map_simplify(bmap
);
1814 return isl_basic_map_finalize(bmap
);
1816 isl_basic_map_free(bmap
);
1817 isl_basic_set_free(bset
);
1821 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1827 total
= 1 + isl_basic_map_total_dim(bmap
);
1828 if (total
!= vec
->size
)
1833 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1834 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1835 if (!isl_int_is_zero(s
)) {
1841 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1842 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1843 if (isl_int_is_neg(s
)) {
1854 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1856 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1859 struct isl_basic_map
*isl_basic_map_intersect(
1860 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1862 struct isl_vec
*sample
= NULL
;
1864 if (!bmap1
|| !bmap2
)
1867 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1868 bmap2
->dim
, isl_dim_param
), goto error
);
1869 if (isl_dim_total(bmap1
->dim
) ==
1870 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1871 isl_dim_total(bmap2
->dim
) !=
1872 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1873 return isl_basic_map_intersect(bmap2
, bmap1
);
1875 if (isl_dim_total(bmap2
->dim
) !=
1876 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1877 isl_assert(bmap1
->ctx
,
1878 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1880 if (bmap1
->sample
&&
1881 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1882 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1883 sample
= isl_vec_copy(bmap1
->sample
);
1884 else if (bmap2
->sample
&&
1885 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1886 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1887 sample
= isl_vec_copy(bmap2
->sample
);
1889 bmap1
= isl_basic_map_cow(bmap1
);
1892 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1893 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1894 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1897 isl_vec_free(sample
);
1899 isl_vec_free(bmap1
->sample
);
1900 bmap1
->sample
= sample
;
1903 bmap1
= isl_basic_map_simplify(bmap1
);
1904 return isl_basic_map_finalize(bmap1
);
1907 isl_vec_free(sample
);
1908 isl_basic_map_free(bmap1
);
1909 isl_basic_map_free(bmap2
);
1913 struct isl_basic_set
*isl_basic_set_intersect(
1914 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1916 return (struct isl_basic_set
*)
1917 isl_basic_map_intersect(
1918 (struct isl_basic_map
*)bset1
,
1919 (struct isl_basic_map
*)bset2
);
1922 /* Special case of isl_map_intersect, where both map1 and map2
1923 * are convex, without any divs and such that either map1 or map2
1924 * contains a single constraint. This constraint is then simply
1925 * added to the other map.
1927 static __isl_give isl_map
*map_intersect_add_constraint(
1928 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
1930 struct isl_basic_map
*bmap1
;
1931 struct isl_basic_map
*bmap2
;
1933 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
1934 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
1935 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
1936 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
1938 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
1939 return isl_map_intersect(map2
, map1
);
1941 isl_assert(map2
->ctx
,
1942 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
1944 map1
= isl_map_cow(map1
);
1947 if (isl_map_fast_is_empty(map1
)) {
1951 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
1952 if (map2
->p
[0]->n_eq
== 1)
1953 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
1955 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
1956 map2
->p
[0]->ineq
[0]);
1958 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
1959 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
1963 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
1964 isl_basic_map_free(map1
->p
[0]);
1977 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1980 struct isl_map
*result
;
1986 if (isl_map_fast_is_empty(map1
)) {
1990 if (isl_map_fast_is_empty(map2
)) {
1995 if (map1
->n
== 1 && map2
->n
== 1 &&
1996 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
1997 isl_dim_equal(map1
->dim
, map2
->dim
) &&
1998 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
1999 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2000 return map_intersect_add_constraint(map1
, map2
);
2001 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2002 map2
->dim
, isl_dim_param
), goto error
);
2003 if (isl_dim_total(map1
->dim
) ==
2004 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2005 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2006 return isl_map_intersect(map2
, map1
);
2008 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2009 isl_assert(map1
->ctx
,
2010 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2012 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2013 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2014 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2016 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2017 map1
->n
* map2
->n
, flags
);
2020 for (i
= 0; i
< map1
->n
; ++i
)
2021 for (j
= 0; j
< map2
->n
; ++j
) {
2022 struct isl_basic_map
*part
;
2023 part
= isl_basic_map_intersect(
2024 isl_basic_map_copy(map1
->p
[i
]),
2025 isl_basic_map_copy(map2
->p
[j
]));
2026 if (isl_basic_map_is_empty(part
))
2027 isl_basic_map_free(part
);
2029 result
= isl_map_add_basic_map(result
, part
);
2042 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2044 return (struct isl_set
*)
2045 isl_map_intersect((struct isl_map
*)set1
,
2046 (struct isl_map
*)set2
);
2049 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2051 struct isl_dim
*dim
;
2052 struct isl_basic_set
*bset
;
2057 bmap
= isl_basic_map_cow(bmap
);
2060 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2061 in
= isl_basic_map_n_in(bmap
);
2062 bset
= isl_basic_set_from_basic_map(bmap
);
2063 bset
= isl_basic_set_swap_vars(bset
, in
);
2064 return isl_basic_map_from_basic_set(bset
, dim
);
2067 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2068 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2070 struct isl_dim
*res_dim
;
2071 struct isl_basic_map
*res
;
2072 struct isl_dim_map
*dim_map
;
2073 unsigned total
, off
;
2074 enum isl_dim_type t
;
2082 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2084 total
= isl_basic_map_total_dim(bmap
) + n
;
2085 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2087 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2089 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2091 unsigned size
= isl_basic_map_dim(bmap
, t
);
2092 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2094 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2095 pos
, size
- pos
, off
+ pos
+ n
);
2097 off
+= isl_dim_size(res_dim
, t
);
2099 isl_dim_map_div(dim_map
, bmap
, off
);
2101 res
= isl_basic_map_alloc_dim(res_dim
,
2102 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2103 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2104 res
= isl_basic_map_simplify(res
);
2105 return isl_basic_map_finalize(res
);
2108 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2109 enum isl_dim_type type
, unsigned n
)
2113 return isl_basic_map_insert(bmap
, type
,
2114 isl_basic_map_dim(bmap
, type
), n
);
2117 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2118 enum isl_dim_type type
, unsigned n
)
2122 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2123 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2125 isl_basic_set_free(bset
);
2129 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2130 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2137 map
= isl_map_cow(map
);
2141 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2145 for (i
= 0; i
< map
->n
; ++i
) {
2146 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2157 __isl_give isl_map
*isl_map_add(__isl_take isl_map
*map
,
2158 enum isl_dim_type type
, unsigned n
)
2162 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2165 __isl_give isl_set
*isl_set_add(__isl_take isl_set
*set
,
2166 enum isl_dim_type type
, unsigned n
)
2170 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2171 return (isl_set
*)isl_map_add((isl_map
*)set
, type
, n
);
2177 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2178 __isl_take isl_basic_map
*bmap
,
2179 enum isl_dim_type dst_type
, unsigned dst_pos
,
2180 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2183 struct isl_dim_map
*dim_map
;
2184 struct isl_basic_map
*res
;
2185 enum isl_dim_type t
;
2186 unsigned total
, off
;
2193 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2196 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2199 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2201 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2202 pos(bmap
->dim
, src_type
) + src_pos
+
2203 ((src_type
< dst_type
) ? n
: 0)) {
2204 bmap
= isl_basic_map_cow(bmap
);
2208 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2209 src_type
, src_pos
, n
);
2213 bmap
= isl_basic_map_finalize(bmap
);
2218 total
= isl_basic_map_total_dim(bmap
);
2219 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2222 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2223 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2224 if (t
== dst_type
) {
2225 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2228 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2231 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2232 dst_pos
, size
- dst_pos
, off
);
2233 off
+= size
- dst_pos
;
2234 } else if (t
== src_type
) {
2235 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2238 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2239 src_pos
+ n
, size
- src_pos
- n
, off
);
2240 off
+= size
- src_pos
- n
;
2242 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2246 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2248 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2249 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2250 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2252 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2253 src_type
, src_pos
, n
);
2257 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2258 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2259 bmap
= isl_basic_map_finalize(bmap
);
2263 isl_basic_map_free(bmap
);
2267 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2268 enum isl_dim_type dst_type
, unsigned dst_pos
,
2269 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2271 return (isl_basic_set
*)isl_basic_map_move_dims(
2272 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2275 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2276 enum isl_dim_type dst_type
, unsigned dst_pos
,
2277 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2281 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2282 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2283 src_type
, src_pos
, n
);
2289 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2290 enum isl_dim_type dst_type
, unsigned dst_pos
,
2291 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2300 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2303 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2306 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2308 map
= isl_map_cow(map
);
2312 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2316 for (i
= 0; i
< map
->n
; ++i
) {
2317 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2319 src_type
, src_pos
, n
);
2330 /* Move the specified dimensions to the last columns right before
2331 * the divs. Don't change the dimension specification of bmap.
2332 * That's the responsibility of the caller.
2334 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2335 enum isl_dim_type type
, unsigned first
, unsigned n
)
2337 struct isl_dim_map
*dim_map
;
2338 struct isl_basic_map
*res
;
2339 enum isl_dim_type t
;
2340 unsigned total
, off
;
2344 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2347 total
= isl_basic_map_total_dim(bmap
);
2348 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2351 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2352 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2354 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2357 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2358 first
, n
, total
- bmap
->n_div
- n
);
2359 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2360 first
+ n
, size
- (first
+ n
), off
);
2361 off
+= size
- (first
+ n
);
2363 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2367 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2369 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2370 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2371 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2375 /* Turn the n dimensions of type type, starting at first
2376 * into existentially quantified variables.
2378 __isl_give isl_basic_map
*isl_basic_map_project_out(
2379 __isl_take isl_basic_map
*bmap
,
2380 enum isl_dim_type type
, unsigned first
, unsigned n
)
2393 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2394 return isl_basic_map_remove(bmap
, type
, first
, n
);
2396 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2399 bmap
= move_last(bmap
, type
, first
, n
);
2400 bmap
= isl_basic_map_cow(bmap
);
2404 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2405 old
= bmap
->block2
.data
;
2406 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2407 (bmap
->extra
+ n
) * (1 + row_size
));
2408 if (!bmap
->block2
.data
)
2410 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2413 for (i
= 0; i
< n
; ++i
) {
2414 new_div
[i
] = bmap
->block2
.data
+
2415 (bmap
->extra
+ i
) * (1 + row_size
);
2416 isl_seq_clr(new_div
[i
], 1 + row_size
);
2418 for (i
= 0; i
< bmap
->extra
; ++i
)
2419 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2421 bmap
->div
= new_div
;
2425 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2428 bmap
= isl_basic_map_simplify(bmap
);
2429 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2430 return isl_basic_map_finalize(bmap
);
2432 isl_basic_map_free(bmap
);
2436 /* Turn the n dimensions of type type, starting at first
2437 * into existentially quantified variables.
2439 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2440 enum isl_dim_type type
, unsigned first
, unsigned n
)
2442 return (isl_basic_set
*)isl_basic_map_project_out(
2443 (isl_basic_map
*)bset
, type
, first
, n
);
2446 /* Turn the n dimensions of type type, starting at first
2447 * into existentially quantified variables.
2449 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2450 enum isl_dim_type type
, unsigned first
, unsigned n
)
2460 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2462 map
= isl_map_cow(map
);
2466 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2470 for (i
= 0; i
< map
->n
; ++i
) {
2471 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2482 /* Turn the n dimensions of type type, starting at first
2483 * into existentially quantified variables.
2485 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2486 enum isl_dim_type type
, unsigned first
, unsigned n
)
2488 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2491 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2495 for (i
= 0; i
< n
; ++i
) {
2496 j
= isl_basic_map_alloc_div(bmap
);
2499 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2503 isl_basic_map_free(bmap
);
2507 struct isl_basic_map
*isl_basic_map_apply_range(
2508 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2510 struct isl_dim
*dim_result
= NULL
;
2511 struct isl_basic_map
*bmap
;
2512 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2513 struct isl_dim_map
*dim_map1
, *dim_map2
;
2515 if (!bmap1
|| !bmap2
)
2518 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2519 isl_dim_copy(bmap2
->dim
));
2521 n_in
= isl_basic_map_n_in(bmap1
);
2522 n_out
= isl_basic_map_n_out(bmap2
);
2523 n
= isl_basic_map_n_out(bmap1
);
2524 nparam
= isl_basic_map_n_param(bmap1
);
2526 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2527 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2528 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2529 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2530 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2531 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2532 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2533 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2534 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2535 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2536 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2538 bmap
= isl_basic_map_alloc_dim(dim_result
,
2539 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2540 bmap1
->n_eq
+ bmap2
->n_eq
,
2541 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2542 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2543 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2544 bmap
= add_divs(bmap
, n
);
2545 bmap
= isl_basic_map_simplify(bmap
);
2546 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2547 return isl_basic_map_finalize(bmap
);
2549 isl_basic_map_free(bmap1
);
2550 isl_basic_map_free(bmap2
);
2554 struct isl_basic_set
*isl_basic_set_apply(
2555 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2560 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2563 return (struct isl_basic_set
*)
2564 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2566 isl_basic_set_free(bset
);
2567 isl_basic_map_free(bmap
);
2571 struct isl_basic_map
*isl_basic_map_apply_domain(
2572 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2574 if (!bmap1
|| !bmap2
)
2577 isl_assert(bmap1
->ctx
,
2578 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2579 isl_assert(bmap1
->ctx
,
2580 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2583 bmap1
= isl_basic_map_reverse(bmap1
);
2584 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2585 return isl_basic_map_reverse(bmap1
);
2587 isl_basic_map_free(bmap1
);
2588 isl_basic_map_free(bmap2
);
2592 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2593 * A \cap B -> f(A) + f(B)
2595 struct isl_basic_map
*isl_basic_map_sum(
2596 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2598 unsigned n_in
, n_out
, nparam
, total
, pos
;
2599 struct isl_basic_map
*bmap
= NULL
;
2600 struct isl_dim_map
*dim_map1
, *dim_map2
;
2603 if (!bmap1
|| !bmap2
)
2606 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2609 nparam
= isl_basic_map_n_param(bmap1
);
2610 n_in
= isl_basic_map_n_in(bmap1
);
2611 n_out
= isl_basic_map_n_out(bmap1
);
2613 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2614 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2615 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2616 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2617 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2618 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2619 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2620 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2621 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2622 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2623 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2625 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2626 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2627 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2628 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2629 for (i
= 0; i
< n_out
; ++i
) {
2630 int j
= isl_basic_map_alloc_equality(bmap
);
2633 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2634 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2635 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2636 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2638 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2639 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2640 bmap
= add_divs(bmap
, 2 * n_out
);
2642 bmap
= isl_basic_map_simplify(bmap
);
2643 return isl_basic_map_finalize(bmap
);
2645 isl_basic_map_free(bmap
);
2646 isl_basic_map_free(bmap1
);
2647 isl_basic_map_free(bmap2
);
2651 /* Given two maps A -> f(A) and B -> g(B), construct a map
2652 * A \cap B -> f(A) + f(B)
2654 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2656 struct isl_map
*result
;
2662 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2664 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2665 map1
->n
* map2
->n
, 0);
2668 for (i
= 0; i
< map1
->n
; ++i
)
2669 for (j
= 0; j
< map2
->n
; ++j
) {
2670 struct isl_basic_map
*part
;
2671 part
= isl_basic_map_sum(
2672 isl_basic_map_copy(map1
->p
[i
]),
2673 isl_basic_map_copy(map2
->p
[j
]));
2674 if (isl_basic_map_is_empty(part
))
2675 isl_basic_map_free(part
);
2677 result
= isl_map_add_basic_map(result
, part
);
2690 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2691 __isl_take isl_set
*set2
)
2693 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2696 /* Given a basic map A -> f(A), construct A -> -f(A).
2698 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2703 bmap
= isl_basic_map_cow(bmap
);
2707 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2708 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2709 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2710 for (j
= 0; j
< n
; ++j
)
2711 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2712 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2713 for (j
= 0; j
< n
; ++j
)
2714 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2715 for (i
= 0; i
< bmap
->n_div
; ++i
)
2716 for (j
= 0; j
< n
; ++j
)
2717 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2718 return isl_basic_map_finalize(bmap
);
2721 /* Given a map A -> f(A), construct A -> -f(A).
2723 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2727 map
= isl_map_cow(map
);
2731 for (i
= 0; i
< map
->n
; ++i
) {
2732 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2743 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2745 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2748 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2749 * A -> floor(f(A)/d).
2751 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2754 unsigned n_in
, n_out
, nparam
, total
, pos
;
2755 struct isl_basic_map
*result
= NULL
;
2756 struct isl_dim_map
*dim_map
;
2762 nparam
= isl_basic_map_n_param(bmap
);
2763 n_in
= isl_basic_map_n_in(bmap
);
2764 n_out
= isl_basic_map_n_out(bmap
);
2766 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2767 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2768 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2769 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2770 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2771 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2773 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2774 bmap
->n_div
+ n_out
,
2775 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2776 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2777 result
= add_divs(result
, n_out
);
2778 for (i
= 0; i
< n_out
; ++i
) {
2780 j
= isl_basic_map_alloc_inequality(result
);
2783 isl_seq_clr(result
->ineq
[j
], 1+total
);
2784 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2785 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2786 j
= isl_basic_map_alloc_inequality(result
);
2789 isl_seq_clr(result
->ineq
[j
], 1+total
);
2790 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2791 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2792 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2795 result
= isl_basic_map_simplify(result
);
2796 return isl_basic_map_finalize(result
);
2798 isl_basic_map_free(result
);
2802 /* Given a map A -> f(A) and an integer d, construct a map
2803 * A -> floor(f(A)/d).
2805 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2809 map
= isl_map_cow(map
);
2813 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2814 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2815 for (i
= 0; i
< map
->n
; ++i
) {
2816 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2827 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2833 i
= isl_basic_map_alloc_equality(bmap
);
2836 nparam
= isl_basic_map_n_param(bmap
);
2837 n_in
= isl_basic_map_n_in(bmap
);
2838 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2839 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2840 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2841 return isl_basic_map_finalize(bmap
);
2843 isl_basic_map_free(bmap
);
2847 /* Add a constraints to "bmap" expressing i_pos < o_pos
2849 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2855 i
= isl_basic_map_alloc_inequality(bmap
);
2858 nparam
= isl_basic_map_n_param(bmap
);
2859 n_in
= isl_basic_map_n_in(bmap
);
2860 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2861 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2862 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2863 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2864 return isl_basic_map_finalize(bmap
);
2866 isl_basic_map_free(bmap
);
2870 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2872 static __isl_give isl_basic_map
*var_less_or_equal(
2873 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2879 i
= isl_basic_map_alloc_inequality(bmap
);
2882 nparam
= isl_basic_map_n_param(bmap
);
2883 n_in
= isl_basic_map_n_in(bmap
);
2884 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2885 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2886 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2887 return isl_basic_map_finalize(bmap
);
2889 isl_basic_map_free(bmap
);
2893 /* Add a constraints to "bmap" expressing i_pos > o_pos
2895 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2901 i
= isl_basic_map_alloc_inequality(bmap
);
2904 nparam
= isl_basic_map_n_param(bmap
);
2905 n_in
= isl_basic_map_n_in(bmap
);
2906 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2907 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2908 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2909 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2910 return isl_basic_map_finalize(bmap
);
2912 isl_basic_map_free(bmap
);
2916 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2918 static __isl_give isl_basic_map
*var_more_or_equal(
2919 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2925 i
= isl_basic_map_alloc_inequality(bmap
);
2928 nparam
= isl_basic_map_n_param(bmap
);
2929 n_in
= isl_basic_map_n_in(bmap
);
2930 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2931 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2932 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2933 return isl_basic_map_finalize(bmap
);
2935 isl_basic_map_free(bmap
);
2939 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2942 struct isl_basic_map
*bmap
;
2943 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2946 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2947 bmap
= var_equal(bmap
, i
);
2948 return isl_basic_map_finalize(bmap
);
2951 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
2953 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2956 struct isl_basic_map
*bmap
;
2957 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2960 for (i
= 0; i
< pos
&& bmap
; ++i
)
2961 bmap
= var_equal(bmap
, i
);
2963 bmap
= var_less(bmap
, pos
);
2964 return isl_basic_map_finalize(bmap
);
2967 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
2969 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
2970 __isl_take isl_dim
*dim
, unsigned pos
)
2973 isl_basic_map
*bmap
;
2975 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2976 for (i
= 0; i
< pos
; ++i
)
2977 bmap
= var_equal(bmap
, i
);
2978 bmap
= var_less_or_equal(bmap
, pos
);
2979 return isl_basic_map_finalize(bmap
);
2982 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2984 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2987 struct isl_basic_map
*bmap
;
2988 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2991 for (i
= 0; i
< pos
&& bmap
; ++i
)
2992 bmap
= var_equal(bmap
, i
);
2994 bmap
= var_more(bmap
, pos
);
2995 return isl_basic_map_finalize(bmap
);
2998 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3000 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3001 __isl_take isl_dim
*dim
, unsigned pos
)
3004 isl_basic_map
*bmap
;
3006 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3007 for (i
= 0; i
< pos
; ++i
)
3008 bmap
= var_equal(bmap
, i
);
3009 bmap
= var_more_or_equal(bmap
, pos
);
3010 return isl_basic_map_finalize(bmap
);
3013 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3014 unsigned n
, int equal
)
3016 struct isl_map
*map
;
3019 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3021 for (i
= 0; i
+ 1 < n
; ++i
)
3022 map
= isl_map_add_basic_map(map
,
3023 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3026 map
= isl_map_add_basic_map(map
,
3027 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3029 map
= isl_map_add_basic_map(map
,
3030 isl_basic_map_less_at(dims
, n
- 1));
3037 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3041 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3044 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3046 return map_lex_lte_first(dim
, n
, 0);
3049 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3051 return map_lex_lte_first(dim
, n
, 1);
3054 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3056 return map_lex_lte(isl_dim_map(set_dim
), 0);
3059 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3061 return map_lex_lte(isl_dim_map(set_dim
), 1);
3064 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3065 unsigned n
, int equal
)
3067 struct isl_map
*map
;
3070 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3072 for (i
= 0; i
+ 1 < n
; ++i
)
3073 map
= isl_map_add_basic_map(map
,
3074 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3077 map
= isl_map_add_basic_map(map
,
3078 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3080 map
= isl_map_add_basic_map(map
,
3081 isl_basic_map_more_at(dims
, n
- 1));
3088 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3092 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3095 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3097 return map_lex_gte_first(dim
, n
, 0);
3100 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3102 return map_lex_gte_first(dim
, n
, 1);
3105 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3107 return map_lex_gte(isl_dim_map(set_dim
), 0);
3110 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3112 return map_lex_gte(isl_dim_map(set_dim
), 1);
3115 struct isl_basic_map
*isl_basic_map_from_basic_set(
3116 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3118 struct isl_basic_map
*bmap
;
3120 bset
= isl_basic_set_cow(bset
);
3124 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3125 isl_dim_free(bset
->dim
);
3126 bmap
= (struct isl_basic_map
*) bset
;
3128 return isl_basic_map_finalize(bmap
);
3130 isl_basic_set_free(bset
);
3135 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3139 if (bmap
->dim
->n_in
== 0)
3140 return (struct isl_basic_set
*)bmap
;
3141 bmap
= isl_basic_map_cow(bmap
);
3144 bmap
->dim
= isl_dim_cow(bmap
->dim
);
3147 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
3148 bmap
->dim
->n_in
= 0;
3149 bmap
= isl_basic_map_finalize(bmap
);
3150 return (struct isl_basic_set
*)bmap
;
3152 isl_basic_map_free(bmap
);
3156 /* For a div d = floor(f/m), add the constraints
3159 * -(f-(n-1)) + m d >= 0
3161 * Note that the second constraint is the negation of
3165 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3166 unsigned pos
, isl_int
*div
)
3169 unsigned total
= isl_basic_map_total_dim(bmap
);
3171 i
= isl_basic_map_alloc_inequality(bmap
);
3174 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3175 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3177 j
= isl_basic_map_alloc_inequality(bmap
);
3180 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3181 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3182 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3186 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3187 unsigned pos
, isl_int
*div
)
3189 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3193 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3195 unsigned total
= isl_basic_map_total_dim(bmap
);
3196 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3198 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3202 struct isl_basic_set
*isl_basic_map_underlying_set(
3203 struct isl_basic_map
*bmap
)
3207 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
3208 return (struct isl_basic_set
*)bmap
;
3209 bmap
= isl_basic_map_cow(bmap
);
3212 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3215 bmap
->extra
-= bmap
->n_div
;
3217 bmap
= isl_basic_map_finalize(bmap
);
3218 return (struct isl_basic_set
*)bmap
;
3223 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3224 __isl_take isl_basic_set
*bset
)
3226 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3229 struct isl_basic_map
*isl_basic_map_overlying_set(
3230 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3232 struct isl_basic_map
*bmap
;
3233 struct isl_ctx
*ctx
;
3240 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3241 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3242 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3244 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3245 isl_basic_map_free(like
);
3246 return (struct isl_basic_map
*)bset
;
3248 bset
= isl_basic_set_cow(bset
);
3251 total
= bset
->dim
->n_out
+ bset
->extra
;
3252 bmap
= (struct isl_basic_map
*)bset
;
3253 isl_dim_free(bmap
->dim
);
3254 bmap
->dim
= isl_dim_copy(like
->dim
);
3257 bmap
->n_div
= like
->n_div
;
3258 bmap
->extra
+= like
->n_div
;
3261 ltotal
= total
- bmap
->extra
+ like
->extra
;
3264 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3265 bmap
->extra
* (1 + 1 + total
));
3266 if (isl_blk_is_error(bmap
->block2
))
3268 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3272 for (i
= 0; i
< bmap
->extra
; ++i
)
3273 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3274 for (i
= 0; i
< like
->n_div
; ++i
) {
3275 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3276 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3278 bmap
= isl_basic_map_extend_constraints(bmap
,
3279 0, 2 * like
->n_div
);
3280 for (i
= 0; i
< like
->n_div
; ++i
) {
3281 if (isl_int_is_zero(bmap
->div
[i
][0]))
3283 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3287 isl_basic_map_free(like
);
3288 bmap
= isl_basic_map_simplify(bmap
);
3289 bmap
= isl_basic_map_finalize(bmap
);
3292 isl_basic_map_free(like
);
3293 isl_basic_set_free(bset
);
3297 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3298 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3300 return (struct isl_basic_set
*)
3301 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3304 struct isl_set
*isl_set_from_underlying_set(
3305 struct isl_set
*set
, struct isl_basic_set
*like
)
3311 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3313 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3314 isl_basic_set_free(like
);
3317 set
= isl_set_cow(set
);
3320 for (i
= 0; i
< set
->n
; ++i
) {
3321 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3322 isl_basic_set_copy(like
));
3326 isl_dim_free(set
->dim
);
3327 set
->dim
= isl_dim_copy(like
->dim
);
3330 isl_basic_set_free(like
);
3333 isl_basic_set_free(like
);
3338 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3342 map
= isl_map_cow(map
);
3345 map
->dim
= isl_dim_cow(map
->dim
);
3349 for (i
= 1; i
< map
->n
; ++i
)
3350 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3352 for (i
= 0; i
< map
->n
; ++i
) {
3353 map
->p
[i
] = (struct isl_basic_map
*)
3354 isl_basic_map_underlying_set(map
->p
[i
]);
3359 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3361 isl_dim_free(map
->dim
);
3362 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3366 return (struct isl_set
*)map
;
3372 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3374 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3377 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3379 struct isl_basic_set
*domain
;
3384 n_in
= isl_basic_map_n_in(bmap
);
3385 n_out
= isl_basic_map_n_out(bmap
);
3386 domain
= isl_basic_set_from_basic_map(bmap
);
3387 return isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3390 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3392 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3395 struct isl_set
*isl_map_range(struct isl_map
*map
)
3398 struct isl_set
*set
;
3402 if (isl_map_dim(map
, isl_dim_in
) == 0)
3403 return (isl_set
*)map
;
3405 map
= isl_map_cow(map
);
3409 set
= (struct isl_set
*) map
;
3410 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3413 for (i
= 0; i
< map
->n
; ++i
) {
3414 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3418 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3419 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3426 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3429 struct isl_map
*map
= NULL
;
3431 set
= isl_set_cow(set
);
3434 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3435 map
= (struct isl_map
*)set
;
3436 for (i
= 0; i
< set
->n
; ++i
) {
3437 map
->p
[i
] = isl_basic_map_from_basic_set(
3438 set
->p
[i
], isl_dim_copy(dim
));
3442 isl_dim_free(map
->dim
);
3451 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3453 return (struct isl_map
*)set
;
3456 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3458 return isl_map_reverse(isl_map_from_range(set
));;
3461 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3462 __isl_take isl_set
*range
)
3464 return isl_map_product(isl_map_from_domain(domain
),
3465 isl_map_from_range(range
));
3468 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3471 struct isl_set
*set
= NULL
;
3475 map
= isl_map_cow(map
);
3478 map
->dim
= isl_dim_cow(map
->dim
);
3481 map
->dim
->n_out
+= map
->dim
->n_in
;
3483 set
= (struct isl_set
*)map
;
3484 for (i
= 0; i
< map
->n
; ++i
) {
3485 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3495 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3497 struct isl_map
*map
;
3501 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3502 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3503 sizeof(struct isl_map
) +
3504 (n
- 1) * sizeof(struct isl_basic_map
*));
3508 map
->ctx
= dim
->ctx
;
3509 isl_ctx_ref(map
->ctx
);
3521 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
3522 unsigned nparam
, unsigned in
, unsigned out
, int n
,
3525 struct isl_map
*map
;
3526 struct isl_dim
*dims
;
3528 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
3532 map
= isl_map_alloc_dim(dims
, n
, flags
);
3536 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
3538 struct isl_basic_map
*bmap
;
3539 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
3540 bmap
= isl_basic_map_set_to_empty(bmap
);
3544 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
3546 struct isl_basic_set
*bset
;
3547 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
3548 bset
= isl_basic_set_set_to_empty(bset
);
3552 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
3554 struct isl_basic_map
*bmap
;
3557 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3558 bmap
= isl_basic_map_set_to_empty(bmap
);
3562 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
3564 struct isl_basic_map
*bmap
;
3567 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3568 bmap
= isl_basic_map_set_to_empty(bmap
);
3572 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
3574 struct isl_basic_set
*bset
;
3577 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3578 bset
= isl_basic_set_set_to_empty(bset
);
3582 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
3584 struct isl_basic_map
*bmap
;
3585 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
3589 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
3591 struct isl_basic_set
*bset
;
3592 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
3596 __isl_give isl_basic_map
*isl_basic_map_universe_like(
3597 __isl_keep isl_basic_map
*model
)
3601 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3604 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
3608 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3611 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
3612 __isl_keep isl_set
*model
)
3616 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3619 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
3621 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3624 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
3628 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3631 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
3635 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3638 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
3640 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3643 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
3647 return isl_set_empty(isl_dim_copy(model
->dim
));
3650 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
3652 struct isl_map
*map
;
3655 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3656 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
3660 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
3662 struct isl_set
*set
;
3665 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3666 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
3670 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
3674 return isl_set_universe(isl_dim_copy(model
->dim
));
3677 struct isl_map
*isl_map_dup(struct isl_map
*map
)
3680 struct isl_map
*dup
;
3684 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
3685 for (i
= 0; i
< map
->n
; ++i
)
3686 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
3690 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
3691 __isl_take isl_basic_map
*bmap
)
3695 if (isl_basic_map_fast_is_empty(bmap
)) {
3696 isl_basic_map_free(bmap
);
3699 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
3700 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
3701 map
->p
[map
->n
] = bmap
;
3703 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3709 isl_basic_map_free(bmap
);
3713 void isl_map_free(struct isl_map
*map
)
3723 isl_ctx_deref(map
->ctx
);
3724 for (i
= 0; i
< map
->n
; ++i
)
3725 isl_basic_map_free(map
->p
[i
]);
3726 isl_dim_free(map
->dim
);
3730 struct isl_map
*isl_map_extend(struct isl_map
*base
,
3731 unsigned nparam
, unsigned n_in
, unsigned n_out
)
3735 base
= isl_map_cow(base
);
3739 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
3742 for (i
= 0; i
< base
->n
; ++i
) {
3743 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
3744 isl_dim_copy(base
->dim
), 0, 0, 0);
3754 struct isl_set
*isl_set_extend(struct isl_set
*base
,
3755 unsigned nparam
, unsigned dim
)
3757 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
3761 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
3762 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
3766 bmap
= isl_basic_map_cow(bmap
);
3767 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3768 j
= isl_basic_map_alloc_equality(bmap
);
3771 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3772 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3773 isl_int_set_si(bmap
->eq
[j
][0], value
);
3774 bmap
= isl_basic_map_simplify(bmap
);
3775 return isl_basic_map_finalize(bmap
);
3777 isl_basic_map_free(bmap
);
3781 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
3782 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
3786 bmap
= isl_basic_map_cow(bmap
);
3787 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3788 j
= isl_basic_map_alloc_equality(bmap
);
3791 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3792 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3793 isl_int_set(bmap
->eq
[j
][0], value
);
3794 bmap
= isl_basic_map_simplify(bmap
);
3795 return isl_basic_map_finalize(bmap
);
3797 isl_basic_map_free(bmap
);
3801 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
3802 enum isl_dim_type type
, unsigned pos
, int value
)
3806 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3807 return isl_basic_map_fix_pos_si(bmap
,
3808 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3810 isl_basic_map_free(bmap
);
3814 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
3815 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3819 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3820 return isl_basic_map_fix_pos(bmap
,
3821 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3823 isl_basic_map_free(bmap
);
3827 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
3828 enum isl_dim_type type
, unsigned pos
, int value
)
3830 return (struct isl_basic_set
*)
3831 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3835 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
3836 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3838 return (struct isl_basic_set
*)
3839 isl_basic_map_fix((struct isl_basic_map
*)bset
,
3843 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
3844 unsigned input
, int value
)
3846 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
3849 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
3850 unsigned dim
, int value
)
3852 return (struct isl_basic_set
*)
3853 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3854 isl_dim_set
, dim
, value
);
3857 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
3858 enum isl_dim_type type
, unsigned pos
, int value
)
3862 map
= isl_map_cow(map
);
3866 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3867 for (i
= 0; i
< map
->n
; ++i
) {
3868 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
3872 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3879 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
3880 enum isl_dim_type type
, unsigned pos
, int value
)
3882 return (struct isl_set
*)
3883 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
3886 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
3887 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3891 map
= isl_map_cow(map
);
3895 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3896 for (i
= 0; i
< map
->n
; ++i
) {
3897 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
3901 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3908 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
3909 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3911 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
3914 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
3915 unsigned input
, int value
)
3917 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
3920 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
3922 return (struct isl_set
*)
3923 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
3926 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
3927 __isl_take isl_basic_map
*bmap
,
3928 enum isl_dim_type type
, unsigned pos
, int value
)
3934 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3935 pos
+= isl_basic_map_offset(bmap
, type
);
3936 bmap
= isl_basic_map_cow(bmap
);
3937 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
3938 j
= isl_basic_map_alloc_inequality(bmap
);
3941 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
3942 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
3943 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
3944 bmap
= isl_basic_map_simplify(bmap
);
3945 return isl_basic_map_finalize(bmap
);
3947 isl_basic_map_free(bmap
);
3951 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
3952 unsigned dim
, isl_int value
)
3956 bset
= isl_basic_set_cow(bset
);
3957 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
3958 j
= isl_basic_set_alloc_inequality(bset
);
3961 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
3962 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
3963 isl_int_neg(bset
->ineq
[j
][0], value
);
3964 bset
= isl_basic_set_simplify(bset
);
3965 return isl_basic_set_finalize(bset
);
3967 isl_basic_set_free(bset
);
3971 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
3972 enum isl_dim_type type
, unsigned pos
, int value
)
3976 map
= isl_map_cow(map
);
3980 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3981 for (i
= 0; i
< map
->n
; ++i
) {
3982 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
3987 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3994 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
3995 enum isl_dim_type type
, unsigned pos
, int value
)
3997 return (struct isl_set
*)
3998 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4001 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4006 set
= isl_set_cow(set
);
4010 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4011 for (i
= 0; i
< set
->n
; ++i
) {
4012 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4022 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4026 map
= isl_map_cow(map
);
4030 map
->dim
= isl_dim_reverse(map
->dim
);
4033 for (i
= 0; i
< map
->n
; ++i
) {
4034 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4038 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4045 static struct isl_map
*isl_basic_map_partial_lexopt(
4046 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4047 struct isl_set
**empty
, int max
)
4051 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4052 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4054 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4056 isl_basic_map_free(bmap
);
4057 isl_basic_set_free(dom
);
4063 struct isl_map
*isl_basic_map_partial_lexmax(
4064 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4065 struct isl_set
**empty
)
4067 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4070 struct isl_map
*isl_basic_map_partial_lexmin(
4071 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4072 struct isl_set
**empty
)
4074 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4077 struct isl_set
*isl_basic_set_partial_lexmin(
4078 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4079 struct isl_set
**empty
)
4081 return (struct isl_set
*)
4082 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4086 struct isl_set
*isl_basic_set_partial_lexmax(
4087 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4088 struct isl_set
**empty
)
4090 return (struct isl_set
*)
4091 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4095 /* Given a basic map "bmap", compute the lexicograhically minimal
4096 * (or maximal) image element for each domain element in dom.
4097 * Set *empty to those elements in dom that do not have an image element.
4099 * We first make sure the basic sets in dom are disjoint and then
4100 * simply collect the results over each of the basic sets separately.
4101 * We could probably improve the efficiency a bit by moving the union
4102 * domain down into the parametric integer programming.
4104 static __isl_give isl_map
*basic_map_partial_lexopt(
4105 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4106 __isl_give isl_set
**empty
, int max
)
4109 struct isl_map
*res
;
4111 dom
= isl_set_make_disjoint(dom
);
4115 if (isl_set_fast_is_empty(dom
)) {
4116 res
= isl_map_empty_like_basic_map(bmap
);
4117 *empty
= isl_set_empty_like(dom
);
4119 isl_basic_map_free(bmap
);
4123 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4124 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4126 for (i
= 1; i
< dom
->n
; ++i
) {
4127 struct isl_map
*res_i
;
4128 struct isl_set
*empty_i
;
4130 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4131 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4133 res
= isl_map_union_disjoint(res
, res_i
);
4134 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4138 isl_basic_map_free(bmap
);
4143 isl_basic_map_free(bmap
);
4147 /* Given a map "map", compute the lexicograhically minimal
4148 * (or maximal) image element for each domain element in dom.
4149 * Set *empty to those elements in dom that do not have an image element.
4151 * We first compute the lexicographically minimal or maximal element
4152 * in the first basic map. This results in a partial solution "res"
4153 * and a subset "todo" of dom that still need to be handled.
4154 * We then consider each of the remaining maps in "map" and successively
4155 * improve both "res" and "todo".
4157 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4158 * Assume we are computing the lexicographical maximum.
4159 * We first intersect basic map i with a relation that maps elements
4160 * to elements that are lexicographically larger than the image elements
4161 * in res^k and the compute the maximum image element of this intersection.
4162 * The result ("better") corresponds to those image elements in basic map i
4163 * that are better than what we had before. The remainder ("keep") are the
4164 * domain elements for which the image element in res_k was better.
4165 * We also compute the lexicographical maximum of basic map i in todo^k.
4166 * res^i is the result of the operation + better + those elements in
4167 * res^k that we should keep
4168 * todo^i is the remainder of the maximum operation on todo^k.
4170 static __isl_give isl_map
*isl_map_partial_lexopt(
4171 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4172 __isl_give isl_set
**empty
, int max
)
4175 struct isl_map
*res
;
4176 struct isl_set
*todo
;
4181 if (isl_map_fast_is_empty(map
)) {
4189 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4190 isl_set_copy(dom
), &todo
, max
);
4192 for (i
= 1; i
< map
->n
; ++i
) {
4194 struct isl_map
*better
;
4195 struct isl_set
*keep
;
4196 struct isl_map
*res_i
;
4197 struct isl_set
*todo_i
;
4198 struct isl_dim
*dim
= isl_map_get_dim(res
);
4200 dim
= isl_dim_range(dim
);
4202 lt
= isl_map_lex_lt(dim
);
4204 lt
= isl_map_lex_gt(dim
);
4205 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4206 lt
= isl_map_intersect(lt
,
4207 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4208 better
= isl_map_partial_lexopt(lt
,
4209 isl_map_domain(isl_map_copy(res
)),
4212 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4213 todo
, &todo_i
, max
);
4215 res
= isl_map_intersect_domain(res
, keep
);
4216 res
= isl_map_union_disjoint(res
, res_i
);
4217 res
= isl_map_union_disjoint(res
, better
);
4238 __isl_give isl_map
*isl_map_partial_lexmax(
4239 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4240 __isl_give isl_set
**empty
)
4242 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4245 __isl_give isl_map
*isl_map_partial_lexmin(
4246 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4247 __isl_give isl_set
**empty
)
4249 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4252 __isl_give isl_set
*isl_set_partial_lexmin(
4253 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4254 __isl_give isl_set
**empty
)
4256 return (struct isl_set
*)
4257 isl_map_partial_lexmin((struct isl_map
*)set
,
4261 __isl_give isl_set
*isl_set_partial_lexmax(
4262 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4263 __isl_give isl_set
**empty
)
4265 return (struct isl_set
*)
4266 isl_map_partial_lexmax((struct isl_map
*)set
,
4270 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4272 struct isl_basic_set
*dom
= NULL
;
4273 struct isl_dim
*dom_dim
;
4277 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4278 dom
= isl_basic_set_universe(dom_dim
);
4279 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4281 isl_basic_map_free(bmap
);
4285 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4287 return isl_basic_map_lexopt(bmap
, 0);
4290 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4292 return isl_basic_map_lexopt(bmap
, 1);
4295 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4297 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4300 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4302 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4305 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4307 struct isl_set
*dom
= NULL
;
4308 struct isl_dim
*dom_dim
;
4312 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4313 dom
= isl_set_universe(dom_dim
);
4314 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4320 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4322 return isl_map_lexopt(map
, 0);
4325 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4327 return isl_map_lexopt(map
, 1);
4330 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4332 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4335 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4337 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4340 static struct isl_map
*isl_map_reset_dim(struct isl_map
*map
,
4341 struct isl_dim
*dim
)
4348 for (i
= 0; i
< map
->n
; ++i
) {
4349 isl_dim_free(map
->p
[i
]->dim
);
4350 map
->p
[i
]->dim
= isl_dim_copy(dim
);
4352 isl_dim_free(map
->dim
);
4362 static struct isl_set
*isl_set_reset_dim(struct isl_set
*set
,
4363 struct isl_dim
*dim
)
4365 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
4368 /* Apply a preimage specified by "mat" on the parameters of "bset".
4369 * bset is assumed to have only parameters and divs.
4371 static struct isl_basic_set
*basic_set_parameter_preimage(
4372 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4379 bset
->dim
= isl_dim_cow(bset
->dim
);
4383 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4385 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4387 bset
->dim
->nparam
= 0;
4388 bset
->dim
->n_out
= nparam
;
4389 bset
= isl_basic_set_preimage(bset
, mat
);
4391 bset
->dim
->nparam
= bset
->dim
->n_out
;
4392 bset
->dim
->n_out
= 0;
4397 isl_basic_set_free(bset
);
4401 /* Apply a preimage specified by "mat" on the parameters of "set".
4402 * set is assumed to have only parameters and divs.
4404 static struct isl_set
*set_parameter_preimage(
4405 struct isl_set
*set
, struct isl_mat
*mat
)
4407 struct isl_dim
*dim
= NULL
;
4413 dim
= isl_dim_copy(set
->dim
);
4414 dim
= isl_dim_cow(dim
);
4418 nparam
= isl_set_dim(set
, isl_dim_param
);
4420 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4423 dim
->n_out
= nparam
;
4424 isl_set_reset_dim(set
, dim
);
4425 set
= isl_set_preimage(set
, mat
);
4428 dim
= isl_dim_copy(set
->dim
);
4429 dim
= isl_dim_cow(dim
);
4432 dim
->nparam
= dim
->n_out
;
4434 isl_set_reset_dim(set
, dim
);
4444 /* Intersect the basic set "bset" with the affine space specified by the
4445 * equalities in "eq".
4447 static struct isl_basic_set
*basic_set_append_equalities(
4448 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4456 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4461 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4462 for (i
= 0; i
< eq
->n_row
; ++i
) {
4463 k
= isl_basic_set_alloc_equality(bset
);
4466 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4467 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4471 bset
= isl_basic_set_gauss(bset
, NULL
);
4472 bset
= isl_basic_set_finalize(bset
);
4477 isl_basic_set_free(bset
);
4481 /* Intersect the set "set" with the affine space specified by the
4482 * equalities in "eq".
4484 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4492 for (i
= 0; i
< set
->n
; ++i
) {
4493 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4506 /* Project the given basic set onto its parameter domain, possibly introducing
4507 * new, explicit, existential variables in the constraints.
4508 * The input has parameters and (possibly implicit) existential variables.
4509 * The output has the same parameters, but only
4510 * explicit existentially quantified variables.
4512 * The actual projection is performed by pip, but pip doesn't seem
4513 * to like equalities very much, so we first remove the equalities
4514 * among the parameters by performing a variable compression on
4515 * the parameters. Afterward, an inverse transformation is performed
4516 * and the equalities among the parameters are inserted back in.
4518 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4522 struct isl_mat
*T
, *T2
;
4523 struct isl_set
*set
;
4524 unsigned nparam
, n_div
;
4526 bset
= isl_basic_set_cow(bset
);
4530 if (bset
->n_eq
== 0)
4531 return isl_basic_set_lexmin(bset
);
4533 isl_basic_set_gauss(bset
, NULL
);
4535 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4536 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
4538 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
4539 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
4542 if (i
== bset
->n_eq
)
4543 return isl_basic_set_lexmin(bset
);
4545 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
4547 eq
= isl_mat_cow(eq
);
4548 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
4549 if (T
&& T
->n_col
== 0) {
4553 bset
= isl_basic_set_set_to_empty(bset
);
4554 return isl_set_from_basic_set(bset
);
4556 bset
= basic_set_parameter_preimage(bset
, T
);
4558 set
= isl_basic_set_lexmin(bset
);
4559 set
= set_parameter_preimage(set
, T2
);
4560 set
= set_append_equalities(set
, eq
);
4564 /* Compute an explicit representation for all the existentially
4565 * quantified variables.
4566 * The input and output dimensions are first turned into parameters.
4567 * compute_divs then returns a map with the same parameters and
4568 * no input or output dimensions and the dimension specification
4569 * is reset to that of the input.
4571 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
4573 struct isl_basic_set
*bset
;
4574 struct isl_set
*set
;
4575 struct isl_map
*map
;
4576 struct isl_dim
*dim
, *orig_dim
= NULL
;
4581 bmap
= isl_basic_map_cow(bmap
);
4585 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4586 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4587 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4588 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
4592 orig_dim
= bmap
->dim
;
4594 bset
= (struct isl_basic_set
*)bmap
;
4596 set
= parameter_compute_divs(bset
);
4597 map
= (struct isl_map
*)set
;
4598 map
= isl_map_reset_dim(map
, orig_dim
);
4602 isl_basic_map_free(bmap
);
4606 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
4614 off
= isl_dim_total(bmap
->dim
);
4615 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4616 if (isl_int_is_zero(bmap
->div
[i
][0]))
4618 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
4624 static int map_divs_known(__isl_keep isl_map
*map
)
4631 for (i
= 0; i
< map
->n
; ++i
) {
4632 int known
= basic_map_divs_known(map
->p
[i
]);
4640 /* If bmap contains any unknown divs, then compute explicit
4641 * expressions for them. However, this computation may be
4642 * quite expensive, so first try to remove divs that aren't
4645 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
4649 struct isl_map
*map
;
4651 known
= basic_map_divs_known(bmap
);
4655 return isl_map_from_basic_map(bmap
);
4657 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4659 known
= basic_map_divs_known(bmap
);
4663 return isl_map_from_basic_map(bmap
);
4665 map
= compute_divs(bmap
);
4668 isl_basic_map_free(bmap
);
4672 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
4676 struct isl_map
*res
;
4683 known
= map_divs_known(map
);
4691 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
4692 for (i
= 1 ; i
< map
->n
; ++i
) {
4694 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
4695 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4696 res
= isl_map_union_disjoint(res
, r2
);
4698 res
= isl_map_union(res
, r2
);
4705 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
4707 return (struct isl_set
*)
4708 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
4711 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
4713 return (struct isl_set
*)
4714 isl_map_compute_divs((struct isl_map
*)set
);
4717 struct isl_set
*isl_map_domain(struct isl_map
*map
)
4720 struct isl_set
*set
;
4725 map
= isl_map_cow(map
);
4729 set
= (struct isl_set
*)map
;
4730 set
->dim
= isl_dim_domain(set
->dim
);
4733 for (i
= 0; i
< map
->n
; ++i
) {
4734 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
4738 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4739 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4746 struct isl_map
*isl_map_union_disjoint(
4747 struct isl_map
*map1
, struct isl_map
*map2
)
4751 struct isl_map
*map
= NULL
;
4765 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4767 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
4768 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
4769 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4771 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
4772 map1
->n
+ map2
->n
, flags
);
4775 for (i
= 0; i
< map1
->n
; ++i
) {
4776 map
= isl_map_add_basic_map(map
,
4777 isl_basic_map_copy(map1
->p
[i
]));
4781 for (i
= 0; i
< map2
->n
; ++i
) {
4782 map
= isl_map_add_basic_map(map
,
4783 isl_basic_map_copy(map2
->p
[i
]));
4797 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
4799 map1
= isl_map_union_disjoint(map1
, map2
);
4803 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
4807 struct isl_set
*isl_set_union_disjoint(
4808 struct isl_set
*set1
, struct isl_set
*set2
)
4810 return (struct isl_set
*)
4811 isl_map_union_disjoint(
4812 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4815 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
4817 return (struct isl_set
*)
4818 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
4821 struct isl_map
*isl_map_intersect_range(
4822 struct isl_map
*map
, struct isl_set
*set
)
4825 struct isl_map
*result
;
4831 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
4832 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
4833 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4835 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
4836 map
->n
* set
->n
, flags
);
4839 for (i
= 0; i
< map
->n
; ++i
)
4840 for (j
= 0; j
< set
->n
; ++j
) {
4841 result
= isl_map_add_basic_map(result
,
4842 isl_basic_map_intersect_range(
4843 isl_basic_map_copy(map
->p
[i
]),
4844 isl_basic_set_copy(set
->p
[j
])));
4857 struct isl_map
*isl_map_intersect_domain(
4858 struct isl_map
*map
, struct isl_set
*set
)
4860 return isl_map_reverse(
4861 isl_map_intersect_range(isl_map_reverse(map
), set
));
4864 struct isl_map
*isl_map_apply_domain(
4865 struct isl_map
*map1
, struct isl_map
*map2
)
4869 map1
= isl_map_reverse(map1
);
4870 map1
= isl_map_apply_range(map1
, map2
);
4871 return isl_map_reverse(map1
);
4878 struct isl_map
*isl_map_apply_range(
4879 struct isl_map
*map1
, struct isl_map
*map2
)
4881 struct isl_dim
*dim_result
;
4882 struct isl_map
*result
;
4888 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
4889 isl_dim_copy(map2
->dim
));
4891 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
4894 for (i
= 0; i
< map1
->n
; ++i
)
4895 for (j
= 0; j
< map2
->n
; ++j
) {
4896 result
= isl_map_add_basic_map(result
,
4897 isl_basic_map_apply_range(
4898 isl_basic_map_copy(map1
->p
[i
]),
4899 isl_basic_map_copy(map2
->p
[j
])));
4905 if (result
&& result
->n
<= 1)
4906 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
4915 * returns range - domain
4917 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
4920 struct isl_basic_set
*bset
;
4927 dim
= isl_basic_map_n_in(bmap
);
4928 nparam
= isl_basic_map_n_param(bmap
);
4929 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
4930 bset
= isl_basic_set_from_basic_map(bmap
);
4931 bset
= isl_basic_set_cow(bset
);
4932 dims
= isl_basic_set_get_dim(bset
);
4933 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
4934 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
4935 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
4936 for (i
= 0; i
< dim
; ++i
) {
4937 int j
= isl_basic_map_alloc_equality(
4938 (struct isl_basic_map
*)bset
);
4941 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
4942 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
4943 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
4944 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
4946 return isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
4948 isl_basic_map_free(bmap
);
4953 * returns range - domain
4955 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
4959 struct isl_set
*result
;
4964 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
4965 dim
= isl_map_get_dim(map
);
4966 dim
= isl_dim_domain(dim
);
4967 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
4970 for (i
= 0; i
< map
->n
; ++i
)
4971 result
= isl_set_add_basic_set(result
,
4972 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
4980 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
4982 struct isl_basic_map
*bmap
;
4990 nparam
= dims
->nparam
;
4992 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
4996 for (i
= 0; i
< dim
; ++i
) {
4997 int j
= isl_basic_map_alloc_equality(bmap
);
5000 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5001 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5002 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5004 return isl_basic_map_finalize(bmap
);
5006 isl_basic_map_free(bmap
);
5010 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5012 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5015 return basic_map_identity(dim
);
5018 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5020 if (!model
|| !model
->dim
)
5022 isl_assert(model
->ctx
,
5023 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5024 return basic_map_identity(isl_dim_copy(model
->dim
));
5027 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5029 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5030 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5033 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5035 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5038 return map_identity(dim
);
5041 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5043 if (!model
|| !model
->dim
)
5045 isl_assert(model
->ctx
,
5046 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5047 return map_identity(isl_dim_copy(model
->dim
));
5050 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5052 if (!model
|| !model
->dim
)
5054 isl_assert(model
->ctx
,
5055 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5056 return map_identity(isl_dim_copy(model
->dim
));
5059 /* Construct a basic set with all set dimensions having only non-negative
5062 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5067 struct isl_basic_set
*bset
;
5071 nparam
= dims
->nparam
;
5073 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5076 for (i
= 0; i
< dim
; ++i
) {
5077 int k
= isl_basic_set_alloc_inequality(bset
);
5080 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5081 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5085 isl_basic_set_free(bset
);
5089 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5090 enum isl_dim_type type
, unsigned first
, unsigned n
)
5093 isl_basic_set
*nonneg
= NULL
;
5094 isl_basic_set
*neg
= NULL
;
5101 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5103 for (i
= 0; i
< n
; ++i
) {
5107 nonneg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5108 k
= isl_basic_set_alloc_inequality(nonneg
);
5111 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5112 isl_int_set_si(nonneg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], 1);
5114 neg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5115 k
= isl_basic_set_alloc_inequality(neg
);
5118 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5119 isl_int_set_si(neg
->ineq
[k
][0], -1);
5120 isl_int_set_si(neg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], -1);
5122 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5127 isl_basic_set_free(nonneg
);
5128 isl_basic_set_free(neg
);
5133 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5135 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5138 int isl_basic_map_is_subset(
5139 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5142 struct isl_map
*map1
;
5143 struct isl_map
*map2
;
5145 if (!bmap1
|| !bmap2
)
5148 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5149 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5151 is_subset
= isl_map_is_subset(map1
, map2
);
5159 int isl_basic_map_is_equal(
5160 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5164 if (!bmap1
|| !bmap2
)
5166 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5169 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5173 int isl_basic_set_is_equal(
5174 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5176 return isl_basic_map_is_equal(
5177 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5180 int isl_map_is_empty(struct isl_map
*map
)
5187 for (i
= 0; i
< map
->n
; ++i
) {
5188 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5197 int isl_map_fast_is_empty(struct isl_map
*map
)
5199 return map
? map
->n
== 0 : -1;
5202 int isl_set_fast_is_empty(struct isl_set
*set
)
5204 return set
? set
->n
== 0 : -1;
5207 int isl_set_is_empty(struct isl_set
*set
)
5209 return isl_map_is_empty((struct isl_map
*)set
);
5212 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5218 is_subset
= isl_map_is_subset(map1
, map2
);
5221 is_subset
= isl_map_is_subset(map2
, map1
);
5225 int isl_basic_map_is_strict_subset(
5226 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5230 if (!bmap1
|| !bmap2
)
5232 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5235 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5236 if (is_subset
== -1)
5241 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5247 is_subset
= isl_map_is_subset(map1
, map2
);
5250 is_subset
= isl_map_is_subset(map2
, map1
);
5251 if (is_subset
== -1)
5256 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5258 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5261 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5265 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5268 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5272 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5275 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5280 return map
->n
== 1 && isl_basic_map_is_universe(map
->p
[0]);
5283 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5285 return isl_map_fast_is_universe((isl_map
*) set
);
5288 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5290 struct isl_basic_set
*bset
= NULL
;
5291 struct isl_vec
*sample
= NULL
;
5298 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5301 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5302 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5303 copy
= isl_basic_map_remove_redundancies(copy
);
5304 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5305 isl_basic_map_free(copy
);
5309 total
= 1 + isl_basic_map_total_dim(bmap
);
5310 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5311 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5317 isl_vec_free(bmap
->sample
);
5318 bmap
->sample
= NULL
;
5319 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5322 sample
= isl_basic_set_sample_vec(bset
);
5325 empty
= sample
->size
== 0;
5326 isl_vec_free(bmap
->sample
);
5327 bmap
->sample
= sample
;
5329 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5334 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5338 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5341 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5345 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5348 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5350 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5353 struct isl_map
*isl_basic_map_union(
5354 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5356 struct isl_map
*map
;
5357 if (!bmap1
|| !bmap2
)
5360 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5362 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5365 map
= isl_map_add_basic_map(map
, bmap1
);
5366 map
= isl_map_add_basic_map(map
, bmap2
);
5369 isl_basic_map_free(bmap1
);
5370 isl_basic_map_free(bmap2
);
5374 struct isl_set
*isl_basic_set_union(
5375 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5377 return (struct isl_set
*)isl_basic_map_union(
5378 (struct isl_basic_map
*)bset1
,
5379 (struct isl_basic_map
*)bset2
);
5382 /* Order divs such that any div only depends on previous divs */
5383 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5391 off
= isl_dim_total(bmap
->dim
);
5393 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5395 if (isl_int_is_zero(bmap
->div
[i
][0]))
5397 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
5401 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
5407 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
5409 return (struct isl_basic_set
*)
5410 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
5413 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
5420 for (i
= 0; i
< map
->n
; ++i
) {
5421 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
5432 /* Look for a div in dst that corresponds to the div "div" in src.
5433 * The divs before "div" in src and dst are assumed to be the same.
5435 * Returns -1 if no corresponding div was found and the position
5436 * of the corresponding div in dst otherwise.
5438 static int find_div(struct isl_basic_map
*dst
,
5439 struct isl_basic_map
*src
, unsigned div
)
5443 unsigned total
= isl_dim_total(src
->dim
);
5445 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
5446 for (i
= div
; i
< dst
->n_div
; ++i
)
5447 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
5448 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
5449 dst
->n_div
- div
) == -1)
5454 struct isl_basic_map
*isl_basic_map_align_divs(
5455 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
5458 unsigned total
= isl_dim_total(src
->dim
);
5463 if (src
->n_div
== 0)
5466 for (i
= 0; i
< src
->n_div
; ++i
)
5467 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
5469 src
= isl_basic_map_order_divs(src
);
5470 dst
= isl_basic_map_cow(dst
);
5471 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
5472 src
->n_div
, 0, 2 * src
->n_div
);
5475 for (i
= 0; i
< src
->n_div
; ++i
) {
5476 int j
= find_div(dst
, src
, i
);
5478 j
= isl_basic_map_alloc_div(dst
);
5481 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
5482 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
5483 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
5487 isl_basic_map_swap_div(dst
, i
, j
);
5491 isl_basic_map_free(dst
);
5495 struct isl_basic_set
*isl_basic_set_align_divs(
5496 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
5498 return (struct isl_basic_set
*)isl_basic_map_align_divs(
5499 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
5502 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
5510 map
= isl_map_compute_divs(map
);
5511 map
= isl_map_cow(map
);
5515 for (i
= 1; i
< map
->n
; ++i
)
5516 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
5517 for (i
= 1; i
< map
->n
; ++i
)
5518 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
5520 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5524 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
5526 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
5529 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
5533 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
5534 map
= isl_map_intersect_domain(map
, set
);
5535 set
= isl_map_range(map
);
5543 /* There is no need to cow as removing empty parts doesn't change
5544 * the meaning of the set.
5546 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
5553 for (i
= map
->n
-1; i
>= 0; --i
) {
5554 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
5556 isl_basic_map_free(map
->p
[i
]);
5557 if (i
!= map
->n
-1) {
5558 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5559 map
->p
[i
] = map
->p
[map
->n
-1];
5567 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
5569 return (struct isl_set
*)
5570 isl_map_remove_empty_parts((struct isl_map
*)set
);
5573 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
5575 struct isl_basic_map
*bmap
;
5576 if (!map
|| map
->n
== 0)
5578 bmap
= map
->p
[map
->n
-1];
5579 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
5580 return isl_basic_map_copy(bmap
);
5583 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
5585 return (struct isl_basic_set
*)
5586 isl_map_copy_basic_map((struct isl_map
*)set
);
5589 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
5590 __isl_keep isl_basic_map
*bmap
)
5596 for (i
= map
->n
-1; i
>= 0; --i
) {
5597 if (map
->p
[i
] != bmap
)
5599 map
= isl_map_cow(map
);
5602 isl_basic_map_free(map
->p
[i
]);
5603 if (i
!= map
->n
-1) {
5604 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
5605 map
->p
[i
] = map
->p
[map
->n
-1];
5616 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
5617 struct isl_basic_set
*bset
)
5619 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
5620 (struct isl_basic_map
*)bset
);
5623 /* Given two basic sets bset1 and bset2, compute the maximal difference
5624 * between the values of dimension pos in bset1 and those in bset2
5625 * for any common value of the parameters and dimensions preceding pos.
5627 static enum isl_lp_result
basic_set_maximal_difference_at(
5628 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
5629 int pos
, isl_int
*opt
)
5631 struct isl_dim
*dims
;
5632 struct isl_basic_map
*bmap1
= NULL
;
5633 struct isl_basic_map
*bmap2
= NULL
;
5634 struct isl_ctx
*ctx
;
5635 struct isl_vec
*obj
;
5638 unsigned dim1
, dim2
;
5639 enum isl_lp_result res
;
5641 if (!bset1
|| !bset2
)
5642 return isl_lp_error
;
5644 nparam
= isl_basic_set_n_param(bset1
);
5645 dim1
= isl_basic_set_n_dim(bset1
);
5646 dim2
= isl_basic_set_n_dim(bset2
);
5647 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
5648 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
5649 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
5650 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
5651 if (!bmap1
|| !bmap2
)
5653 bmap1
= isl_basic_map_cow(bmap1
);
5654 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
5655 pos
, (dim1
- pos
) + (dim2
- pos
),
5656 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
5657 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
5660 total
= isl_basic_map_total_dim(bmap1
);
5662 obj
= isl_vec_alloc(ctx
, 1 + total
);
5663 isl_seq_clr(obj
->block
.data
, 1 + total
);
5664 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
5665 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
5668 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
5670 isl_basic_map_free(bmap1
);
5674 isl_basic_map_free(bmap1
);
5675 isl_basic_map_free(bmap2
);
5676 return isl_lp_error
;
5679 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5680 * for any common value of the parameters and dimensions preceding pos
5681 * in both basic sets, the values of dimension pos in bset1 are
5682 * smaller or larger than those in bset2.
5685 * 1 if bset1 follows bset2
5686 * -1 if bset1 precedes bset2
5687 * 0 if bset1 and bset2 are incomparable
5688 * -2 if some error occurred.
5690 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
5691 struct isl_basic_set
*bset2
, int pos
)
5694 enum isl_lp_result res
;
5699 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5701 if (res
== isl_lp_empty
)
5703 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5704 res
== isl_lp_unbounded
)
5706 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5715 /* Given two basic sets bset1 and bset2, check whether
5716 * for any common value of the parameters and dimensions preceding pos
5717 * there is a value of dimension pos in bset1 that is larger
5718 * than a value of the same dimension in bset2.
5721 * 1 if there exists such a pair
5722 * 0 if there is no such pair, but there is a pair of equal values
5724 * -2 if some error occurred.
5726 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
5727 __isl_keep isl_basic_set
*bset2
, int pos
)
5730 enum isl_lp_result res
;
5735 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5737 if (res
== isl_lp_empty
)
5739 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5740 res
== isl_lp_unbounded
)
5742 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5744 else if (res
== isl_lp_ok
)
5753 /* Given two sets set1 and set2, check whether
5754 * for any common value of the parameters and dimensions preceding pos
5755 * there is a value of dimension pos in set1 that is larger
5756 * than a value of the same dimension in set2.
5759 * 1 if there exists such a pair
5760 * 0 if there is no such pair, but there is a pair of equal values
5762 * -2 if some error occurred.
5764 int isl_set_follows_at(__isl_keep isl_set
*set1
,
5765 __isl_keep isl_set
*set2
, int pos
)
5773 for (i
= 0; i
< set1
->n
; ++i
)
5774 for (j
= 0; j
< set2
->n
; ++j
) {
5776 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
5777 if (f
== 1 || f
== -2)
5786 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
5787 unsigned pos
, isl_int
*val
)
5795 total
= isl_basic_map_total_dim(bmap
);
5796 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
5797 for (; d
+1 > pos
; --d
)
5798 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
5802 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
5804 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
5806 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
5809 isl_int_neg(*val
, bmap
->eq
[i
][0]);
5815 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
5816 unsigned pos
, isl_int
*val
)
5828 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
5831 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
5832 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
5833 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
5834 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5838 isl_int_set(*val
, v
);
5844 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
5845 unsigned pos
, isl_int
*val
)
5847 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
5851 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
5854 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
5857 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
5858 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5860 if (pos
>= isl_basic_map_dim(bmap
, type
))
5862 return isl_basic_map_fast_has_fixed_var(bmap
,
5863 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
5866 int isl_map_fast_is_fixed(struct isl_map
*map
,
5867 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5869 if (pos
>= isl_map_dim(map
, type
))
5871 return isl_map_fast_has_fixed_var(map
,
5872 map_offset(map
, type
) - 1 + pos
, val
);
5875 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5876 * then return this fixed value in *val.
5878 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
5881 return isl_basic_set_fast_has_fixed_var(bset
,
5882 isl_basic_set_n_param(bset
) + dim
, val
);
5885 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5886 * then return this fixed value in *val.
5888 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
5890 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
5893 /* Check if input variable in has fixed value and if so and if val is not NULL,
5894 * then return this fixed value in *val.
5896 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
5898 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
5901 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5902 * and if val is not NULL, then return this lower bound in *val.
5904 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
5905 unsigned dim
, isl_int
*val
)
5907 int i
, i_eq
= -1, i_ineq
= -1;
5914 total
= isl_basic_set_total_dim(bset
);
5915 nparam
= isl_basic_set_n_param(bset
);
5916 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5917 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
5923 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5924 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
5926 if (i_eq
!= -1 || i_ineq
!= -1)
5930 if (i_eq
== -1 && i_ineq
== -1)
5932 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
5933 /* The coefficient should always be one due to normalization. */
5934 if (!isl_int_is_one(c
[1+nparam
+dim
]))
5936 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
5938 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
5939 total
- nparam
- dim
- 1) != -1)
5942 isl_int_neg(*val
, c
[0]);
5946 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
5947 unsigned dim
, isl_int
*val
)
5959 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5963 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5965 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
5966 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
5968 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5972 isl_int_set(*val
, v
);
5983 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
5985 const struct constraint
*c1
= (const struct constraint
*)p1
;
5986 const struct constraint
*c2
= (const struct constraint
*)p2
;
5987 unsigned size
= isl_min(c1
->size
, c2
->size
);
5988 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
5991 static struct isl_basic_map
*isl_basic_map_sort_constraints(
5992 struct isl_basic_map
*bmap
)
5995 struct constraint
*c
;
6000 total
= isl_basic_map_total_dim(bmap
);
6001 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6004 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6006 c
[i
].c
= bmap
->ineq
[i
];
6008 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6009 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6010 bmap
->ineq
[i
] = c
[i
].c
;
6014 isl_basic_map_free(bmap
);
6018 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6019 __isl_take isl_basic_set
*bset
)
6021 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6022 (struct isl_basic_map
*)bset
);
6025 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6029 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6031 bmap
= isl_basic_map_remove_redundancies(bmap
);
6032 bmap
= isl_basic_map_sort_constraints(bmap
);
6033 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6037 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6039 return (struct isl_basic_set
*)isl_basic_map_normalize(
6040 (struct isl_basic_map
*)bset
);
6043 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
6044 const struct isl_basic_map
*bmap2
)
6051 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6052 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6053 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6054 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6055 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6056 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6057 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6058 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6060 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6062 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6064 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6065 return bmap1
->n_eq
- bmap2
->n_eq
;
6066 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6067 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6068 if (bmap1
->n_div
!= bmap2
->n_div
)
6069 return bmap1
->n_div
- bmap2
->n_div
;
6070 total
= isl_basic_map_total_dim(bmap1
);
6071 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6072 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6076 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6077 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6081 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6082 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6089 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
6090 struct isl_basic_map
*bmap2
)
6092 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6095 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6096 __isl_keep isl_basic_set
*bset2
)
6098 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6099 (isl_basic_map
*)bset2
);
6102 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6104 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6105 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6107 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6110 /* We normalize in place, but if anything goes wrong we need
6111 * to return NULL, so we need to make sure we don't change the
6112 * meaning of any possible other copies of map.
6114 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6117 struct isl_basic_map
*bmap
;
6121 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6123 for (i
= 0; i
< map
->n
; ++i
) {
6124 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6127 isl_basic_map_free(map
->p
[i
]);
6130 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6131 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6132 map
= isl_map_remove_empty_parts(map
);
6135 for (i
= map
->n
- 1; i
>= 1; --i
) {
6136 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6138 isl_basic_map_free(map
->p
[i
-1]);
6139 for (j
= i
; j
< map
->n
; ++j
)
6140 map
->p
[j
-1] = map
->p
[j
];
6150 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6152 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6155 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6165 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6168 map1
= isl_map_copy(map1
);
6169 map2
= isl_map_copy(map2
);
6170 map1
= isl_map_normalize(map1
);
6171 map2
= isl_map_normalize(map2
);
6174 equal
= map1
->n
== map2
->n
;
6175 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6176 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6189 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6191 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6192 (struct isl_map
*)set2
);
6195 /* Return an interval that ranges from min to max (inclusive)
6197 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6198 isl_int min
, isl_int max
)
6201 struct isl_basic_set
*bset
= NULL
;
6203 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6207 k
= isl_basic_set_alloc_inequality(bset
);
6210 isl_int_set_si(bset
->ineq
[k
][1], 1);
6211 isl_int_neg(bset
->ineq
[k
][0], min
);
6213 k
= isl_basic_set_alloc_inequality(bset
);
6216 isl_int_set_si(bset
->ineq
[k
][1], -1);
6217 isl_int_set(bset
->ineq
[k
][0], max
);
6221 isl_basic_set_free(bset
);
6225 /* Return the Cartesian product of the basic sets in list (in the given order).
6227 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6235 struct isl_basic_set
*product
= NULL
;
6239 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6240 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6241 nparam
= isl_basic_set_n_param(list
->p
[0]);
6242 dim
= isl_basic_set_n_dim(list
->p
[0]);
6243 extra
= list
->p
[0]->n_div
;
6244 n_eq
= list
->p
[0]->n_eq
;
6245 n_ineq
= list
->p
[0]->n_ineq
;
6246 for (i
= 1; i
< list
->n
; ++i
) {
6247 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6248 isl_assert(list
->ctx
,
6249 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6250 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6251 extra
+= list
->p
[i
]->n_div
;
6252 n_eq
+= list
->p
[i
]->n_eq
;
6253 n_ineq
+= list
->p
[i
]->n_ineq
;
6255 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6260 for (i
= 0; i
< list
->n
; ++i
) {
6261 isl_basic_set_add_constraints(product
,
6262 isl_basic_set_copy(list
->p
[i
]), dim
);
6263 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6265 isl_basic_set_list_free(list
);
6268 isl_basic_set_free(product
);
6269 isl_basic_set_list_free(list
);
6273 struct isl_basic_map
*isl_basic_map_product(
6274 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6276 struct isl_dim
*dim_result
= NULL
;
6277 struct isl_basic_map
*bmap
;
6278 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6279 struct isl_dim_map
*dim_map1
, *dim_map2
;
6281 if (!bmap1
|| !bmap2
)
6284 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6285 bmap2
->dim
, isl_dim_param
), goto error
);
6286 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6287 isl_dim_copy(bmap2
->dim
));
6289 in1
= isl_basic_map_n_in(bmap1
);
6290 in2
= isl_basic_map_n_in(bmap2
);
6291 out1
= isl_basic_map_n_out(bmap1
);
6292 out2
= isl_basic_map_n_out(bmap2
);
6293 nparam
= isl_basic_map_n_param(bmap1
);
6295 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6296 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6297 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6298 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6299 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6300 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6301 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6302 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6303 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6304 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6305 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6307 bmap
= isl_basic_map_alloc_dim(dim_result
,
6308 bmap1
->n_div
+ bmap2
->n_div
,
6309 bmap1
->n_eq
+ bmap2
->n_eq
,
6310 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6311 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6312 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6313 bmap
= isl_basic_map_simplify(bmap
);
6314 return isl_basic_map_finalize(bmap
);
6316 isl_basic_map_free(bmap1
);
6317 isl_basic_map_free(bmap2
);
6321 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6323 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6326 struct isl_map
*result
;
6332 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6333 map2
->dim
, isl_dim_param
), goto error
);
6335 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6336 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6337 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6339 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6340 isl_dim_copy(map2
->dim
)),
6341 map1
->n
* map2
->n
, flags
);
6344 for (i
= 0; i
< map1
->n
; ++i
)
6345 for (j
= 0; j
< map2
->n
; ++j
) {
6346 struct isl_basic_map
*part
;
6347 part
= isl_basic_map_product(
6348 isl_basic_map_copy(map1
->p
[i
]),
6349 isl_basic_map_copy(map2
->p
[j
]));
6350 if (isl_basic_map_is_empty(part
))
6351 isl_basic_map_free(part
);
6353 result
= isl_map_add_basic_map(result
, part
);
6366 /* Given two set A and B, construct its Cartesian product A x B.
6368 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6370 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6371 (struct isl_map
*)set2
);
6374 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
6377 uint32_t hash
= isl_hash_init();
6382 bset
= isl_basic_set_copy(bset
);
6383 bset
= isl_basic_set_normalize(bset
);
6386 total
= isl_basic_set_total_dim(bset
);
6387 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
6388 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6390 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
6391 isl_hash_hash(hash
, c_hash
);
6393 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
6394 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6396 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
6397 isl_hash_hash(hash
, c_hash
);
6399 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
6400 for (i
= 0; i
< bset
->n_div
; ++i
) {
6402 if (isl_int_is_zero(bset
->div
[i
][0]))
6404 isl_hash_byte(hash
, i
& 0xFF);
6405 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
6406 isl_hash_hash(hash
, c_hash
);
6408 isl_basic_set_free(bset
);
6412 uint32_t isl_set_get_hash(struct isl_set
*set
)
6419 set
= isl_set_copy(set
);
6420 set
= isl_set_normalize(set
);
6424 hash
= isl_hash_init();
6425 for (i
= 0; i
< set
->n
; ++i
) {
6427 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
6428 isl_hash_hash(hash
, bset_hash
);
6436 /* Check if the value for dimension dim is completely determined
6437 * by the values of the other parameters and variables.
6438 * That is, check if dimension dim is involved in an equality.
6440 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
6447 nparam
= isl_basic_set_n_param(bset
);
6448 for (i
= 0; i
< bset
->n_eq
; ++i
)
6449 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
6454 /* Check if the value for dimension dim is completely determined
6455 * by the values of the other parameters and variables.
6456 * That is, check if dimension dim is involved in an equality
6457 * for each of the subsets.
6459 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
6465 for (i
= 0; i
< set
->n
; ++i
) {
6467 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
6474 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
6475 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
6482 for (i
= 0; i
< map
->n
; ++i
)
6483 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
6489 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
6490 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
6497 for (i
= 0; i
< set
->n
; ++i
)
6498 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
6504 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
6506 struct isl_dim
*dim
;
6511 if (bset
->n_div
== 0)
6514 bset
= isl_basic_set_cow(bset
);
6518 dim
= isl_basic_set_get_dim(bset
);
6519 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
6522 isl_dim_free(bset
->dim
);
6526 bset
= isl_basic_set_finalize(bset
);
6530 isl_basic_set_free(bset
);
6534 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
6537 struct isl_dim
*dim
;
6540 set
= isl_set_align_divs(set
);
6544 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
6547 set
= isl_set_cow(set
);
6551 n_div
= set
->p
[0]->n_div
;
6552 dim
= isl_set_get_dim(set
);
6553 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
6556 isl_dim_free(set
->dim
);
6559 for (i
= 0; i
< set
->n
; ++i
) {
6560 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
6571 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
6573 struct isl_dim
*dim
;
6574 struct isl_basic_map
*bmap
;
6581 set
= isl_set_align_divs(set
);
6586 dim
= isl_set_get_dim(set
);
6587 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
6589 return isl_map_identity(dim
);
6592 n_div
= set
->p
[0]->n_div
;
6593 dim
= isl_dim_map(dim
);
6594 n_param
= isl_dim_size(dim
, isl_dim_param
);
6595 n_set
= isl_dim_size(dim
, isl_dim_in
);
6596 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
6597 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
6598 for (i
= 0; i
< n_set
; ++i
)
6599 bmap
= var_equal(bmap
, i
);
6601 total
= n_param
+ n_set
+ n_set
+ n_div
;
6602 for (i
= 0; i
< n_div
; ++i
) {
6603 k
= isl_basic_map_alloc_inequality(bmap
);
6606 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
6607 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
6608 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
6609 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
6610 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
6611 set
->p
[0]->div
[i
][0]);
6613 l
= isl_basic_map_alloc_inequality(bmap
);
6616 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
6617 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
6618 set
->p
[0]->div
[i
][0]);
6619 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
6623 return isl_map_from_basic_map(bmap
);
6626 isl_basic_map_free(bmap
);
6630 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
6638 dim
= isl_basic_set_total_dim(bset
);
6639 size
+= bset
->n_eq
* (1 + dim
);
6640 size
+= bset
->n_ineq
* (1 + dim
);
6641 size
+= bset
->n_div
* (2 + dim
);
6646 int isl_set_size(__isl_keep isl_set
*set
)
6654 for (i
= 0; i
< set
->n
; ++i
)
6655 size
+= isl_basic_set_size(set
->p
[i
]);
6660 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
6661 enum isl_dim_type type
, unsigned pos
)
6669 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
6671 pos
+= isl_basic_map_offset(bmap
, type
);
6673 for (i
= 0; i
< bmap
->n_eq
; ++i
)
6674 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
6678 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6679 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
6686 return lower
&& upper
;
6689 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
6690 enum isl_dim_type type
, unsigned pos
)
6697 for (i
= 0; i
< map
->n
; ++i
) {
6699 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
6700 if (bounded
< 0 || !bounded
)
6707 /* Return 1 if the specified dim is involved in both an upper bound
6708 * and a lower bound.
6710 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
6711 enum isl_dim_type type
, unsigned pos
)
6713 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
6716 /* For each of the "n" variables starting at "first", determine
6717 * the sign of the variable and put the results in the first "n"
6718 * elements of the array "signs".
6720 * 1 means that the variable is non-negative
6721 * -1 means that the variable is non-positive
6722 * 0 means the variable attains both positive and negative values.
6724 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
6725 unsigned first
, unsigned n
, int *signs
)
6727 isl_vec
*bound
= NULL
;
6728 struct isl_tab
*tab
= NULL
;
6729 struct isl_tab_undo
*snap
;
6732 if (!bset
|| !signs
)
6735 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
6736 tab
= isl_tab_from_basic_set(bset
);
6740 isl_seq_clr(bound
->el
, bound
->size
);
6741 isl_int_set_si(bound
->el
[0], -1);
6743 snap
= isl_tab_snap(tab
);
6744 for (i
= 0; i
< n
; ++i
) {
6747 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
6748 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
6751 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
6752 if (isl_tab_rollback(tab
, snap
) < 0)
6760 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
6761 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
6764 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
6765 if (isl_tab_rollback(tab
, snap
) < 0)
6768 signs
[i
] = empty
? -1 : 0;
6772 isl_vec_free(bound
);
6776 isl_vec_free(bound
);
6780 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
6781 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
6783 if (!bset
|| !signs
)
6785 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
6788 first
+= pos(bset
->dim
, type
) - 1;
6789 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
6792 /* Check if the given map is single-valued.
6797 * and check if the result is a subset of the identity mapping.
6799 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
6805 test
= isl_map_reverse(isl_map_copy(map
));
6806 test
= isl_map_apply_range(test
, isl_map_copy(map
));
6808 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
6810 sv
= isl_map_is_subset(test
, id
);
6818 int isl_set_is_singleton(__isl_keep isl_set
*set
)
6820 return isl_map_is_single_valued((isl_map
*)set
);
6823 int isl_map_is_translation(__isl_keep isl_map
*map
)
6828 delta
= isl_map_deltas(isl_map_copy(map
));
6829 ok
= isl_set_is_singleton(delta
);
6830 isl_set_free(delta
);
6835 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
6837 if (isl_seq_first_non_zero(p
, pos
) != -1)
6839 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
6844 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
6853 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
6856 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
6857 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
6858 for (j
= 0; j
< nvar
; ++j
) {
6859 int lower
= 0, upper
= 0;
6860 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6861 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
6863 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
6869 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6870 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
6872 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
6874 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
6879 if (!lower
|| !upper
)
6886 int isl_set_is_box(__isl_keep isl_set
*set
)
6893 return isl_basic_set_is_box(set
->p
[0]);