2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_ctx_private.h>
17 #include <isl_map_private.h>
19 #include "isl_space_private.h"
20 #include "isl_equalities.h"
21 #include <isl_list_private.h>
26 #include "isl_map_piplib.h"
27 #include <isl_reordering.h>
28 #include "isl_sample.h"
31 #include <isl_mat_private.h>
32 #include <isl_dim_map.h>
33 #include <isl_local_space_private.h>
34 #include <isl_aff_private.h>
35 #include <isl_options_private.h>
37 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
40 case isl_dim_param
: return dim
->nparam
;
41 case isl_dim_in
: return dim
->n_in
;
42 case isl_dim_out
: return dim
->n_out
;
43 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
48 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
51 case isl_dim_param
: return 1;
52 case isl_dim_in
: return 1 + dim
->nparam
;
53 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
58 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
59 enum isl_dim_type type
)
64 case isl_dim_cst
: return 1;
67 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
68 case isl_dim_div
: return bmap
->n_div
;
69 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
74 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
76 return map
? n(map
->dim
, type
) : 0;
79 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
81 return set
? n(set
->dim
, type
) : 0;
84 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
85 enum isl_dim_type type
)
87 isl_space
*dim
= bmap
->dim
;
89 case isl_dim_cst
: return 0;
90 case isl_dim_param
: return 1;
91 case isl_dim_in
: return 1 + dim
->nparam
;
92 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
93 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
98 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
99 enum isl_dim_type type
)
101 return isl_basic_map_offset(bset
, type
);
104 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
106 return pos(map
->dim
, type
);
109 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
110 enum isl_dim_type type
)
112 return isl_basic_map_dim(bset
, type
);
115 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
117 return isl_basic_set_dim(bset
, isl_dim_set
);
120 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
122 return isl_basic_set_dim(bset
, isl_dim_param
);
125 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
129 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
132 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
134 return isl_set_dim(set
, isl_dim_set
);
137 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
139 return isl_set_dim(set
, isl_dim_param
);
142 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
144 return bmap
? bmap
->dim
->n_in
: 0;
147 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
149 return bmap
? bmap
->dim
->n_out
: 0;
152 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
154 return bmap
? bmap
->dim
->nparam
: 0;
157 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
159 return bmap
? bmap
->n_div
: 0;
162 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
164 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
167 unsigned isl_map_n_in(const struct isl_map
*map
)
169 return map
? map
->dim
->n_in
: 0;
172 unsigned isl_map_n_out(const struct isl_map
*map
)
174 return map
? map
->dim
->n_out
: 0;
177 unsigned isl_map_n_param(const struct isl_map
*map
)
179 return map
? map
->dim
->nparam
: 0;
182 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
187 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
190 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
193 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
194 struct isl_basic_set
*bset
)
199 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
202 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
205 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
210 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
213 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
216 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
217 struct isl_basic_set
*bset
)
222 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
225 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
228 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
230 return bmap
? bmap
->ctx
: NULL
;
233 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
235 return bset
? bset
->ctx
: NULL
;
238 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
240 return map
? map
->ctx
: NULL
;
243 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
245 return set
? set
->ctx
: NULL
;
248 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
252 return isl_space_copy(bmap
->dim
);
255 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
259 return isl_space_copy(bset
->dim
);
262 /* Extract the divs in "bmap" as a matrix.
264 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
275 ctx
= isl_basic_map_get_ctx(bmap
);
276 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
277 cols
= 1 + 1 + total
+ bmap
->n_div
;
278 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
282 for (i
= 0; i
< bmap
->n_div
; ++i
)
283 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
288 __isl_give isl_local_space
*isl_basic_map_get_local_space(
289 __isl_keep isl_basic_map
*bmap
)
296 div
= isl_basic_map_get_divs(bmap
);
297 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
300 __isl_give isl_local_space
*isl_basic_set_get_local_space(
301 __isl_keep isl_basic_set
*bset
)
303 return isl_basic_map_get_local_space(bset
);
306 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
307 __isl_take isl_local_space
*ls
)
316 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
317 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
318 n_div
, 0, 2 * n_div
);
320 for (i
= 0; i
< n_div
; ++i
)
321 if (isl_basic_map_alloc_div(bmap
) < 0)
324 for (i
= 0; i
< n_div
; ++i
) {
325 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
326 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
330 isl_local_space_free(ls
);
333 isl_local_space_free(ls
);
334 isl_basic_map_free(bmap
);
338 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
339 __isl_take isl_local_space
*ls
)
341 return isl_basic_map_from_local_space(ls
);
344 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
348 return isl_space_copy(map
->dim
);
351 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
355 return isl_space_copy(set
->dim
);
358 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
359 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
361 bmap
= isl_basic_map_cow(bmap
);
364 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
367 bmap
= isl_basic_map_finalize(bmap
);
370 isl_basic_map_free(bmap
);
374 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
375 __isl_take isl_basic_set
*bset
, const char *s
)
377 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
380 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
381 enum isl_dim_type type
)
383 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
386 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
387 enum isl_dim_type type
, const char *s
)
391 map
= isl_map_cow(map
);
395 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
399 for (i
= 0; i
< map
->n
; ++i
) {
400 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
411 /* Does the input or output tuple have a name?
413 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
415 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
418 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
419 enum isl_dim_type type
)
421 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
424 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
427 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
430 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
431 enum isl_dim_type type
, __isl_take isl_id
*id
)
433 map
= isl_map_cow(map
);
435 return isl_id_free(id
);
437 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
439 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
442 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
443 __isl_take isl_id
*id
)
445 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
448 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
449 enum isl_dim_type type
)
451 map
= isl_map_cow(map
);
455 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
457 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
460 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
462 return isl_map_reset_tuple_id(set
, isl_dim_set
);
465 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
467 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
470 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
471 enum isl_dim_type type
)
473 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
476 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
478 return isl_map_has_tuple_id(set
, isl_dim_set
);
481 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
483 return isl_map_get_tuple_id(set
, isl_dim_set
);
486 /* Does the set tuple have a name?
488 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
490 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
494 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
496 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
499 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
501 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
504 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
505 enum isl_dim_type type
, unsigned pos
)
507 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
510 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
511 enum isl_dim_type type
, unsigned pos
)
513 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
516 /* Does the given dimension have a name?
518 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
519 enum isl_dim_type type
, unsigned pos
)
521 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
524 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
525 enum isl_dim_type type
, unsigned pos
)
527 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
530 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
531 enum isl_dim_type type
, unsigned pos
)
533 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
536 /* Does the given dimension have a name?
538 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
539 enum isl_dim_type type
, unsigned pos
)
541 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
544 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
545 __isl_take isl_basic_map
*bmap
,
546 enum isl_dim_type type
, unsigned pos
, const char *s
)
548 bmap
= isl_basic_map_cow(bmap
);
551 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
554 return isl_basic_map_finalize(bmap
);
556 isl_basic_map_free(bmap
);
560 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
561 enum isl_dim_type type
, unsigned pos
, const char *s
)
565 map
= isl_map_cow(map
);
569 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
573 for (i
= 0; i
< map
->n
; ++i
) {
574 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
585 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
586 __isl_take isl_basic_set
*bset
,
587 enum isl_dim_type type
, unsigned pos
, const char *s
)
589 return (isl_basic_set
*)isl_basic_map_set_dim_name(
590 (isl_basic_map
*)bset
, type
, pos
, s
);
593 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
594 enum isl_dim_type type
, unsigned pos
, const char *s
)
596 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
599 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
600 enum isl_dim_type type
, unsigned pos
)
602 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
605 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
606 enum isl_dim_type type
, unsigned pos
)
608 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
611 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
612 enum isl_dim_type type
, unsigned pos
)
614 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
617 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
618 enum isl_dim_type type
, unsigned pos
)
620 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
623 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
624 enum isl_dim_type type
, unsigned pos
)
626 return isl_map_has_dim_id(set
, type
, pos
);
629 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
630 enum isl_dim_type type
, unsigned pos
)
632 return isl_map_get_dim_id(set
, type
, pos
);
635 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
636 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
638 map
= isl_map_cow(map
);
640 return isl_id_free(id
);
642 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
644 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
647 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
648 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
650 return isl_map_set_dim_id(set
, type
, pos
, id
);
653 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
654 __isl_keep isl_id
*id
)
658 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
661 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
662 __isl_keep isl_id
*id
)
664 return isl_map_find_dim_by_id(set
, type
, id
);
667 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
672 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
675 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
678 return isl_map_find_dim_by_name(set
, type
, name
);
681 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
685 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
688 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
690 return isl_basic_map_is_rational(bset
);
693 /* Is this basic set a parameter domain?
695 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
699 return isl_space_is_params(bset
->dim
);
702 /* Is this set a parameter domain?
704 int isl_set_is_params(__isl_keep isl_set
*set
)
708 return isl_space_is_params(set
->dim
);
711 /* Is this map actually a parameter domain?
712 * Users should never call this function. Outside of isl,
713 * a map can never be a parameter domain.
715 int isl_map_is_params(__isl_keep isl_map
*map
)
719 return isl_space_is_params(map
->dim
);
722 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
723 struct isl_basic_map
*bmap
, unsigned extra
,
724 unsigned n_eq
, unsigned n_ineq
)
727 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
732 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
733 if (isl_blk_is_error(bmap
->block
))
736 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
741 bmap
->block2
= isl_blk_empty();
744 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
745 if (isl_blk_is_error(bmap
->block2
))
748 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
753 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
754 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
756 for (i
= 0; i
< extra
; ++i
)
757 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
761 bmap
->c_size
= n_eq
+ n_ineq
;
762 bmap
->eq
= bmap
->ineq
+ n_ineq
;
771 isl_basic_map_free(bmap
);
775 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
776 unsigned nparam
, unsigned dim
, unsigned extra
,
777 unsigned n_eq
, unsigned n_ineq
)
779 struct isl_basic_map
*bmap
;
782 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
786 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
787 return (struct isl_basic_set
*)bmap
;
790 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
791 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
793 struct isl_basic_map
*bmap
;
796 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
797 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
798 return (struct isl_basic_set
*)bmap
;
804 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
805 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
807 struct isl_basic_map
*bmap
;
811 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
816 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
822 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
823 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
824 unsigned n_eq
, unsigned n_ineq
)
826 struct isl_basic_map
*bmap
;
829 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
833 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
837 static void dup_constraints(
838 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
841 unsigned total
= isl_basic_map_total_dim(src
);
843 for (i
= 0; i
< src
->n_eq
; ++i
) {
844 int j
= isl_basic_map_alloc_equality(dst
);
845 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
848 for (i
= 0; i
< src
->n_ineq
; ++i
) {
849 int j
= isl_basic_map_alloc_inequality(dst
);
850 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
853 for (i
= 0; i
< src
->n_div
; ++i
) {
854 int j
= isl_basic_map_alloc_div(dst
);
855 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
857 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
860 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
862 struct isl_basic_map
*dup
;
866 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
867 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
870 dup_constraints(dup
, bmap
);
871 dup
->flags
= bmap
->flags
;
872 dup
->sample
= isl_vec_copy(bmap
->sample
);
876 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
878 struct isl_basic_map
*dup
;
880 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
881 return (struct isl_basic_set
*)dup
;
884 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
889 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
893 return isl_basic_set_dup(bset
);
896 struct isl_set
*isl_set_copy(struct isl_set
*set
)
905 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
910 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
914 bmap
= isl_basic_map_dup(bmap
);
916 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
920 struct isl_map
*isl_map_copy(struct isl_map
*map
)
929 void *isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
937 isl_ctx_deref(bmap
->ctx
);
939 isl_blk_free(bmap
->ctx
, bmap
->block2
);
941 isl_blk_free(bmap
->ctx
, bmap
->block
);
942 isl_vec_free(bmap
->sample
);
943 isl_space_free(bmap
->dim
);
949 void *isl_basic_set_free(struct isl_basic_set
*bset
)
951 return isl_basic_map_free((struct isl_basic_map
*)bset
);
954 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
956 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
959 __isl_give isl_map
*isl_map_align_params_map_map_and(
960 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
961 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
962 __isl_take isl_map
*map2
))
966 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
967 return fn(map1
, map2
);
968 if (!isl_space_has_named_params(map1
->dim
) ||
969 !isl_space_has_named_params(map2
->dim
))
970 isl_die(map1
->ctx
, isl_error_invalid
,
971 "unaligned unnamed parameters", goto error
);
972 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
973 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
974 return fn(map1
, map2
);
981 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
982 __isl_keep isl_map
*map2
,
983 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
989 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
990 return fn(map1
, map2
);
991 if (!isl_space_has_named_params(map1
->dim
) ||
992 !isl_space_has_named_params(map2
->dim
))
993 isl_die(map1
->ctx
, isl_error_invalid
,
994 "unaligned unnamed parameters", return -1);
995 map1
= isl_map_copy(map1
);
996 map2
= isl_map_copy(map2
);
997 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
998 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1005 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1007 struct isl_ctx
*ctx
;
1011 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1012 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1014 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1015 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1016 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1017 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1018 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1019 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1021 int j
= isl_basic_map_alloc_inequality(bmap
);
1025 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1026 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1033 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1034 bmap
->extra
- bmap
->n_div
);
1035 return bmap
->n_eq
++;
1038 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1040 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1043 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1047 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1052 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1054 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1057 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1062 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1064 if (pos
!= bmap
->n_eq
- 1) {
1066 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1067 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1073 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1075 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1078 void isl_basic_map_inequality_to_equality(
1079 struct isl_basic_map
*bmap
, unsigned pos
)
1083 t
= bmap
->ineq
[pos
];
1084 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1085 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1090 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1091 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1092 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1093 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1096 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1098 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1101 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1103 struct isl_ctx
*ctx
;
1107 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1108 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1109 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1110 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1111 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1112 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1113 1 + isl_basic_map_total_dim(bmap
),
1114 bmap
->extra
- bmap
->n_div
);
1115 return bmap
->n_ineq
++;
1118 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1120 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1123 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1127 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1132 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1134 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1137 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1142 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1144 if (pos
!= bmap
->n_ineq
- 1) {
1145 t
= bmap
->ineq
[pos
];
1146 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1147 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1148 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1154 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1156 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1159 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1164 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1167 k
= isl_basic_map_alloc_equality(bmap
);
1170 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1173 isl_basic_map_free(bmap
);
1177 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1180 return (isl_basic_set
*)
1181 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1184 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1189 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1192 k
= isl_basic_map_alloc_inequality(bmap
);
1195 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1198 isl_basic_map_free(bmap
);
1202 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1205 return (isl_basic_set
*)
1206 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1209 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1213 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1214 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1215 1 + 1 + isl_basic_map_total_dim(bmap
),
1216 bmap
->extra
- bmap
->n_div
);
1217 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1218 return bmap
->n_div
++;
1221 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1223 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1226 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1230 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1235 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1237 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1240 /* Copy constraint from src to dst, putting the vars of src at offset
1241 * dim_off in dst and the divs of src at offset div_off in dst.
1242 * If both sets are actually map, then dim_off applies to the input
1245 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1246 struct isl_basic_map
*src_map
, isl_int
*src
,
1247 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1249 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1250 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1251 unsigned src_in
= isl_basic_map_n_in(src_map
);
1252 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1253 unsigned src_out
= isl_basic_map_n_out(src_map
);
1254 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1255 isl_int_set(dst
[0], src
[0]);
1256 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1257 if (dst_nparam
> src_nparam
)
1258 isl_seq_clr(dst
+1+src_nparam
,
1259 dst_nparam
- src_nparam
);
1260 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1261 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1263 isl_min(dst_in
-in_off
, src_in
));
1264 if (dst_in
-in_off
> src_in
)
1265 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1266 dst_in
- in_off
- src_in
);
1267 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1268 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1269 src
+1+src_nparam
+src_in
,
1270 isl_min(dst_out
-out_off
, src_out
));
1271 if (dst_out
-out_off
> src_out
)
1272 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1273 dst_out
- out_off
- src_out
);
1274 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1275 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1276 src
+1+src_nparam
+src_in
+src_out
,
1277 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1278 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1279 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1280 div_off
+src_map
->n_div
,
1281 dst_map
->n_div
- div_off
- src_map
->n_div
);
1284 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1285 struct isl_basic_map
*src_map
, isl_int
*src
,
1286 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1288 isl_int_set(dst
[0], src
[0]);
1289 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1292 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1293 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1298 if (!bmap1
|| !bmap2
)
1301 div_off
= bmap1
->n_div
;
1303 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1304 int i1
= isl_basic_map_alloc_equality(bmap1
);
1307 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1308 i_pos
, o_pos
, div_off
);
1311 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1312 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1315 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1316 i_pos
, o_pos
, div_off
);
1319 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1320 int i1
= isl_basic_map_alloc_div(bmap1
);
1323 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1324 i_pos
, o_pos
, div_off
);
1327 isl_basic_map_free(bmap2
);
1332 isl_basic_map_free(bmap1
);
1333 isl_basic_map_free(bmap2
);
1337 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1338 struct isl_basic_set
*bset2
, unsigned pos
)
1340 return (struct isl_basic_set
*)
1341 add_constraints((struct isl_basic_map
*)bset1
,
1342 (struct isl_basic_map
*)bset2
, 0, pos
);
1345 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1346 __isl_take isl_space
*dim
, unsigned extra
,
1347 unsigned n_eq
, unsigned n_ineq
)
1349 struct isl_basic_map
*ext
;
1359 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1360 base
->extra
>= base
->n_div
+ extra
;
1362 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1363 room_for_ineq(base
, n_ineq
)) {
1364 isl_space_free(dim
);
1368 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1369 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1370 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1371 extra
+= base
->extra
;
1373 n_ineq
+= base
->n_ineq
;
1375 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1381 ext
->sample
= isl_vec_copy(base
->sample
);
1382 flags
= base
->flags
;
1383 ext
= add_constraints(ext
, base
, 0, 0);
1386 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1392 isl_space_free(dim
);
1393 isl_basic_map_free(base
);
1397 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1398 __isl_take isl_space
*dim
, unsigned extra
,
1399 unsigned n_eq
, unsigned n_ineq
)
1401 return (struct isl_basic_set
*)
1402 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1403 extra
, n_eq
, n_ineq
);
1406 struct isl_basic_map
*isl_basic_map_extend_constraints(
1407 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1411 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1415 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1416 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1417 unsigned n_eq
, unsigned n_ineq
)
1419 struct isl_basic_map
*bmap
;
1424 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1428 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1431 isl_basic_map_free(base
);
1435 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1436 unsigned nparam
, unsigned dim
, unsigned extra
,
1437 unsigned n_eq
, unsigned n_ineq
)
1439 return (struct isl_basic_set
*)
1440 isl_basic_map_extend((struct isl_basic_map
*)base
,
1441 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1444 struct isl_basic_set
*isl_basic_set_extend_constraints(
1445 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1447 return (struct isl_basic_set
*)
1448 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1452 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1454 return (struct isl_basic_set
*)
1455 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1458 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1463 if (bmap
->ref
> 1) {
1465 bmap
= isl_basic_map_dup(bmap
);
1468 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1472 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1480 return isl_set_dup(set
);
1483 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1491 return isl_map_dup(map
);
1494 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1495 unsigned a_len
, unsigned b_len
)
1497 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1498 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1499 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1502 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1503 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1511 isl_assert(bmap
->ctx
,
1512 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1514 if (n1
== 0 || n2
== 0)
1517 bmap
= isl_basic_map_cow(bmap
);
1521 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1522 if (isl_blk_is_error(blk
))
1525 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1527 bmap
->eq
[i
] + pos
, n1
, n2
);
1529 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1531 bmap
->ineq
[i
] + pos
, n1
, n2
);
1533 for (i
= 0; i
< bmap
->n_div
; ++i
)
1535 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1537 isl_blk_free(bmap
->ctx
, blk
);
1539 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1540 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1541 return isl_basic_map_finalize(bmap
);
1543 isl_basic_map_free(bmap
);
1547 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1548 __isl_take isl_basic_set
*bset
, unsigned n
)
1553 nparam
= isl_basic_set_n_param(bset
);
1554 dim
= isl_basic_set_n_dim(bset
);
1555 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1557 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1559 isl_basic_set_free(bset
);
1563 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1569 total
= isl_basic_map_total_dim(bmap
);
1570 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1571 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1573 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1575 i
= isl_basic_map_alloc_equality(bmap
);
1579 isl_int_set_si(bmap
->eq
[i
][0], 1);
1580 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1581 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1582 isl_vec_free(bmap
->sample
);
1583 bmap
->sample
= NULL
;
1584 return isl_basic_map_finalize(bmap
);
1586 isl_basic_map_free(bmap
);
1590 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1592 return (struct isl_basic_set
*)
1593 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1596 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1599 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1600 isl_int
*t
= bmap
->div
[a
];
1601 bmap
->div
[a
] = bmap
->div
[b
];
1604 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1605 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1607 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1608 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1610 for (i
= 0; i
< bmap
->n_div
; ++i
)
1611 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1612 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1615 /* Eliminate the specified n dimensions starting at first from the
1616 * constraints, without removing the dimensions from the space.
1617 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1619 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1620 enum isl_dim_type type
, unsigned first
, unsigned n
)
1629 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1630 isl_die(map
->ctx
, isl_error_invalid
,
1631 "index out of bounds", goto error
);
1633 map
= isl_map_cow(map
);
1637 for (i
= 0; i
< map
->n
; ++i
) {
1638 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1648 /* Eliminate the specified n dimensions starting at first from the
1649 * constraints, without removing the dimensions from the space.
1650 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1652 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1653 enum isl_dim_type type
, unsigned first
, unsigned n
)
1655 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1658 /* Eliminate the specified n dimensions starting at first from the
1659 * constraints, without removing the dimensions from the space.
1660 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1662 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1663 unsigned first
, unsigned n
)
1665 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1668 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1669 __isl_take isl_basic_map
*bmap
)
1673 bmap
= isl_basic_map_eliminate_vars(bmap
,
1674 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1678 return isl_basic_map_finalize(bmap
);
1681 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1682 __isl_take isl_basic_set
*bset
)
1684 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1685 (struct isl_basic_map
*)bset
);
1688 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1697 map
= isl_map_cow(map
);
1701 for (i
= 0; i
< map
->n
; ++i
) {
1702 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1712 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1714 return isl_map_remove_divs(set
);
1717 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1718 enum isl_dim_type type
, unsigned first
, unsigned n
)
1722 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1724 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1726 bmap
= isl_basic_map_eliminate_vars(bmap
,
1727 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1730 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1732 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1735 isl_basic_map_free(bmap
);
1739 /* Return true if the definition of the given div (recursively) involves
1740 * any of the given variables.
1742 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1743 unsigned first
, unsigned n
)
1746 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1748 if (isl_int_is_zero(bmap
->div
[div
][0]))
1750 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1753 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1754 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1756 if (div_involves_vars(bmap
, i
, first
, n
))
1763 /* Try and add a lower and/or upper bound on "div" to "bmap"
1764 * based on inequality "i".
1765 * "total" is the total number of variables (excluding the divs).
1766 * "v" is a temporary object that can be used during the calculations.
1767 * If "lb" is set, then a lower bound should be constructed.
1768 * If "ub" is set, then an upper bound should be constructed.
1770 * The calling function has already checked that the inequality does not
1771 * reference "div", but we still need to check that the inequality is
1772 * of the right form. We'll consider the case where we want to construct
1773 * a lower bound. The construction of upper bounds is similar.
1775 * Let "div" be of the form
1777 * q = floor((a + f(x))/d)
1779 * We essentially check if constraint "i" is of the form
1783 * so that we can use it to derive a lower bound on "div".
1784 * However, we allow a slightly more general form
1788 * with the condition that the coefficients of g(x) - f(x) are all
1790 * Rewriting this constraint as
1794 * adding a + f(x) to both sides and dividing by d, we obtain
1796 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1798 * Taking the floor on both sides, we obtain
1800 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1804 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1806 * In the case of an upper bound, we construct the constraint
1808 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1811 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1812 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1813 unsigned total
, isl_int v
, int lb
, int ub
)
1817 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1819 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1820 bmap
->div
[div
][1 + 1 + j
]);
1821 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1824 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1825 bmap
->div
[div
][1 + 1 + j
]);
1826 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1832 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1834 int k
= isl_basic_map_alloc_inequality(bmap
);
1837 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1838 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1839 bmap
->div
[div
][1 + j
]);
1840 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1841 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1843 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1846 int k
= isl_basic_map_alloc_inequality(bmap
);
1849 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1850 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1851 bmap
->div
[div
][1 + j
]);
1852 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1853 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1855 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1860 isl_basic_map_free(bmap
);
1864 /* This function is called right before "div" is eliminated from "bmap"
1865 * using Fourier-Motzkin.
1866 * Look through the constraints of "bmap" for constraints on the argument
1867 * of the integer division and use them to construct constraints on the
1868 * integer division itself. These constraints can then be combined
1869 * during the Fourier-Motzkin elimination.
1870 * Note that it is only useful to introduce lower bounds on "div"
1871 * if "bmap" already contains upper bounds on "div" as the newly
1872 * introduce lower bounds can then be combined with the pre-existing
1873 * upper bounds. Similarly for upper bounds.
1874 * We therefore first check if "bmap" contains any lower and/or upper bounds
1877 * It is interesting to note that the introduction of these constraints
1878 * can indeed lead to more accurate results, even when compared to
1879 * deriving constraints on the argument of "div" from constraints on "div".
1880 * Consider, for example, the set
1882 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1884 * The second constraint can be rewritten as
1886 * 2 * [(-i-2j+3)/4] + k >= 0
1888 * from which we can derive
1890 * -i - 2j + 3 >= -2k
1896 * Combined with the first constraint, we obtain
1898 * -3 <= 3 + 2k or k >= -3
1900 * If, on the other hand we derive a constraint on [(i+2j)/4] from
1901 * the first constraint, we obtain
1903 * [(i + 2j)/4] >= [-3/4] = -1
1905 * Combining this constraint with the second constraint, we obtain
1909 static __isl_give isl_basic_map
*insert_bounds_on_div(
1910 __isl_take isl_basic_map
*bmap
, int div
)
1913 int check_lb
, check_ub
;
1920 if (isl_int_is_zero(bmap
->div
[div
][0]))
1923 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1927 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
1928 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
1935 if (!check_lb
&& !check_ub
)
1940 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
1941 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
1944 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
1945 check_lb
, check_ub
);
1953 /* Remove all divs (recursively) involving any of the given dimensions
1954 * in their definitions.
1956 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
1957 __isl_take isl_basic_map
*bmap
,
1958 enum isl_dim_type type
, unsigned first
, unsigned n
)
1964 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1966 first
+= isl_basic_map_offset(bmap
, type
);
1968 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1969 if (!div_involves_vars(bmap
, i
, first
, n
))
1971 bmap
= insert_bounds_on_div(bmap
, i
);
1972 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
1980 isl_basic_map_free(bmap
);
1984 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
1985 __isl_take isl_basic_set
*bset
,
1986 enum isl_dim_type type
, unsigned first
, unsigned n
)
1988 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
1991 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
1992 enum isl_dim_type type
, unsigned first
, unsigned n
)
2001 map
= isl_map_cow(map
);
2005 for (i
= 0; i
< map
->n
; ++i
) {
2006 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2017 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2018 enum isl_dim_type type
, unsigned first
, unsigned n
)
2020 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2024 /* Does the desciption of "bmap" depend on the specified dimensions?
2025 * We also check whether the dimensions appear in any of the div definitions.
2026 * In principle there is no need for this check. If the dimensions appear
2027 * in a div definition, they also appear in the defining constraints of that
2030 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2031 enum isl_dim_type type
, unsigned first
, unsigned n
)
2038 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2039 isl_die(bmap
->ctx
, isl_error_invalid
,
2040 "index out of bounds", return -1);
2042 first
+= isl_basic_map_offset(bmap
, type
);
2043 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2044 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2046 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2047 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2049 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2050 if (isl_int_is_zero(bmap
->div
[i
][0]))
2052 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2059 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2060 enum isl_dim_type type
, unsigned first
, unsigned n
)
2067 if (first
+ n
> isl_map_dim(map
, type
))
2068 isl_die(map
->ctx
, isl_error_invalid
,
2069 "index out of bounds", return -1);
2071 for (i
= 0; i
< map
->n
; ++i
) {
2072 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2074 if (involves
< 0 || involves
)
2081 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2082 enum isl_dim_type type
, unsigned first
, unsigned n
)
2084 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2087 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2088 enum isl_dim_type type
, unsigned first
, unsigned n
)
2090 return isl_map_involves_dims(set
, type
, first
, n
);
2093 /* Return true if the definition of the given div is unknown or depends
2096 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2099 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2101 if (isl_int_is_zero(bmap
->div
[div
][0]))
2104 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2105 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2107 if (div_is_unknown(bmap
, i
))
2114 /* Remove all divs that are unknown or defined in terms of unknown divs.
2116 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2117 __isl_take isl_basic_map
*bmap
)
2124 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2125 if (!div_is_unknown(bmap
, i
))
2127 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2136 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2145 map
= isl_map_cow(map
);
2149 for (i
= 0; i
< map
->n
; ++i
) {
2150 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2160 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2162 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2165 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2166 __isl_take isl_basic_set
*bset
,
2167 enum isl_dim_type type
, unsigned first
, unsigned n
)
2169 return (isl_basic_set
*)
2170 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2173 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2174 enum isl_dim_type type
, unsigned first
, unsigned n
)
2181 map
= isl_map_cow(map
);
2184 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2186 for (i
= 0; i
< map
->n
; ++i
) {
2187 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2188 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2192 map
= isl_map_drop(map
, type
, first
, n
);
2199 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2200 enum isl_dim_type type
, unsigned first
, unsigned n
)
2202 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2205 /* Project out n inputs starting at first using Fourier-Motzkin */
2206 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2207 unsigned first
, unsigned n
)
2209 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2212 static void dump_term(struct isl_basic_map
*bmap
,
2213 isl_int c
, int pos
, FILE *out
)
2216 unsigned in
= isl_basic_map_n_in(bmap
);
2217 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2218 unsigned nparam
= isl_basic_map_n_param(bmap
);
2220 isl_int_print(out
, c
, 0);
2222 if (!isl_int_is_one(c
))
2223 isl_int_print(out
, c
, 0);
2224 if (pos
< 1 + nparam
) {
2225 name
= isl_space_get_dim_name(bmap
->dim
,
2226 isl_dim_param
, pos
- 1);
2228 fprintf(out
, "%s", name
);
2230 fprintf(out
, "p%d", pos
- 1);
2231 } else if (pos
< 1 + nparam
+ in
)
2232 fprintf(out
, "i%d", pos
- 1 - nparam
);
2233 else if (pos
< 1 + nparam
+ dim
)
2234 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2236 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2240 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2241 int sign
, FILE *out
)
2245 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2249 for (i
= 0, first
= 1; i
< len
; ++i
) {
2250 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2253 fprintf(out
, " + ");
2255 isl_int_abs(v
, c
[i
]);
2256 dump_term(bmap
, v
, i
, out
);
2263 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2264 const char *op
, FILE *out
, int indent
)
2268 fprintf(out
, "%*s", indent
, "");
2270 dump_constraint_sign(bmap
, c
, 1, out
);
2271 fprintf(out
, " %s ", op
);
2272 dump_constraint_sign(bmap
, c
, -1, out
);
2276 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2277 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2279 fprintf(out
, "%*s", indent
, "");
2280 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2285 static void dump_constraints(struct isl_basic_map
*bmap
,
2286 isl_int
**c
, unsigned n
,
2287 const char *op
, FILE *out
, int indent
)
2291 for (i
= 0; i
< n
; ++i
)
2292 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2295 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2299 unsigned total
= isl_basic_map_total_dim(bmap
);
2301 for (j
= 0; j
< 1 + total
; ++j
) {
2302 if (isl_int_is_zero(exp
[j
]))
2304 if (!first
&& isl_int_is_pos(exp
[j
]))
2306 dump_term(bmap
, exp
[j
], j
, out
);
2311 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2315 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2316 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2318 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2319 fprintf(out
, "%*s", indent
, "");
2320 fprintf(out
, "e%d = [(", i
);
2321 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2323 isl_int_print(out
, bmap
->div
[i
][0], 0);
2324 fprintf(out
, "]\n");
2328 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2329 FILE *out
, int indent
)
2332 fprintf(out
, "null basic set\n");
2336 fprintf(out
, "%*s", indent
, "");
2337 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2338 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2339 bset
->extra
, bset
->flags
);
2340 dump((struct isl_basic_map
*)bset
, out
, indent
);
2343 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2344 FILE *out
, int indent
)
2347 fprintf(out
, "null basic map\n");
2351 fprintf(out
, "%*s", indent
, "");
2352 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2353 "flags: %x, n_name: %d\n",
2355 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2356 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2357 dump(bmap
, out
, indent
);
2360 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2365 total
= isl_basic_map_total_dim(bmap
);
2366 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2367 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2368 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2369 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2373 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2376 struct isl_set
*set
;
2380 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2381 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2382 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2383 sizeof(struct isl_set
) +
2384 (n
- 1) * sizeof(struct isl_basic_set
*));
2388 set
->ctx
= dim
->ctx
;
2389 isl_ctx_ref(set
->ctx
);
2397 isl_space_free(dim
);
2401 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2402 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2404 struct isl_set
*set
;
2407 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2411 set
= isl_set_alloc_space(dims
, n
, flags
);
2415 /* Make sure "map" has room for at least "n" more basic maps.
2417 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2420 struct isl_map
*grown
= NULL
;
2424 isl_assert(map
->ctx
, n
>= 0, goto error
);
2425 if (map
->n
+ n
<= map
->size
)
2427 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2430 for (i
= 0; i
< map
->n
; ++i
) {
2431 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2439 isl_map_free(grown
);
2444 /* Make sure "set" has room for at least "n" more basic sets.
2446 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2448 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2451 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2454 struct isl_set
*dup
;
2459 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2462 for (i
= 0; i
< set
->n
; ++i
)
2463 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2467 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2469 return isl_map_from_basic_map(bset
);
2472 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2474 struct isl_map
*map
;
2479 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2480 return isl_map_add_basic_map(map
, bmap
);
2483 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2484 __isl_take isl_basic_set
*bset
)
2486 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2487 (struct isl_basic_map
*)bset
);
2490 void *isl_set_free(__isl_take isl_set
*set
)
2500 isl_ctx_deref(set
->ctx
);
2501 for (i
= 0; i
< set
->n
; ++i
)
2502 isl_basic_set_free(set
->p
[i
]);
2503 isl_space_free(set
->dim
);
2509 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2514 fprintf(out
, "null set\n");
2518 fprintf(out
, "%*s", indent
, "");
2519 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2520 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2522 for (i
= 0; i
< set
->n
; ++i
) {
2523 fprintf(out
, "%*s", indent
, "");
2524 fprintf(out
, "basic set %d:\n", i
);
2525 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2529 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2534 fprintf(out
, "null map\n");
2538 fprintf(out
, "%*s", indent
, "");
2539 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2540 "flags: %x, n_name: %d\n",
2541 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2542 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2543 for (i
= 0; i
< map
->n
; ++i
) {
2544 fprintf(out
, "%*s", indent
, "");
2545 fprintf(out
, "basic map %d:\n", i
);
2546 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2550 struct isl_basic_map
*isl_basic_map_intersect_domain(
2551 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2553 struct isl_basic_map
*bmap_domain
;
2558 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2559 bset
->dim
, isl_dim_param
), goto error
);
2561 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2562 isl_assert(bset
->ctx
,
2563 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2565 bmap
= isl_basic_map_cow(bmap
);
2568 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2569 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2570 bmap_domain
= isl_basic_map_from_domain(bset
);
2571 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2573 bmap
= isl_basic_map_simplify(bmap
);
2574 return isl_basic_map_finalize(bmap
);
2576 isl_basic_map_free(bmap
);
2577 isl_basic_set_free(bset
);
2581 struct isl_basic_map
*isl_basic_map_intersect_range(
2582 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2584 struct isl_basic_map
*bmap_range
;
2589 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2590 bset
->dim
, isl_dim_param
), goto error
);
2592 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2593 isl_assert(bset
->ctx
,
2594 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2596 if (isl_basic_set_is_universe(bset
)) {
2597 isl_basic_set_free(bset
);
2601 bmap
= isl_basic_map_cow(bmap
);
2604 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2605 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2606 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2607 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2609 bmap
= isl_basic_map_simplify(bmap
);
2610 return isl_basic_map_finalize(bmap
);
2612 isl_basic_map_free(bmap
);
2613 isl_basic_set_free(bset
);
2617 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2623 total
= 1 + isl_basic_map_total_dim(bmap
);
2624 if (total
!= vec
->size
)
2629 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2630 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2631 if (!isl_int_is_zero(s
)) {
2637 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2638 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2639 if (isl_int_is_neg(s
)) {
2650 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2652 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2655 struct isl_basic_map
*isl_basic_map_intersect(
2656 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2658 struct isl_vec
*sample
= NULL
;
2660 if (!bmap1
|| !bmap2
)
2663 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2664 bmap2
->dim
, isl_dim_param
), goto error
);
2665 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2666 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2667 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2668 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2669 return isl_basic_map_intersect(bmap2
, bmap1
);
2671 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2672 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2673 isl_assert(bmap1
->ctx
,
2674 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2676 if (bmap1
->sample
&&
2677 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2678 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2679 sample
= isl_vec_copy(bmap1
->sample
);
2680 else if (bmap2
->sample
&&
2681 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2682 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2683 sample
= isl_vec_copy(bmap2
->sample
);
2685 bmap1
= isl_basic_map_cow(bmap1
);
2688 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2689 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2690 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2693 isl_vec_free(sample
);
2695 isl_vec_free(bmap1
->sample
);
2696 bmap1
->sample
= sample
;
2699 bmap1
= isl_basic_map_simplify(bmap1
);
2700 return isl_basic_map_finalize(bmap1
);
2703 isl_vec_free(sample
);
2704 isl_basic_map_free(bmap1
);
2705 isl_basic_map_free(bmap2
);
2709 struct isl_basic_set
*isl_basic_set_intersect(
2710 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2712 return (struct isl_basic_set
*)
2713 isl_basic_map_intersect(
2714 (struct isl_basic_map
*)bset1
,
2715 (struct isl_basic_map
*)bset2
);
2718 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2719 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2721 return isl_basic_set_intersect(bset1
, bset2
);
2724 /* Special case of isl_map_intersect, where both map1 and map2
2725 * are convex, without any divs and such that either map1 or map2
2726 * contains a single constraint. This constraint is then simply
2727 * added to the other map.
2729 static __isl_give isl_map
*map_intersect_add_constraint(
2730 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2732 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2733 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2734 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2735 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2737 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2738 return isl_map_intersect(map2
, map1
);
2740 isl_assert(map2
->ctx
,
2741 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2743 map1
= isl_map_cow(map1
);
2746 if (isl_map_plain_is_empty(map1
)) {
2750 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2751 if (map2
->p
[0]->n_eq
== 1)
2752 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2754 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2755 map2
->p
[0]->ineq
[0]);
2757 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2758 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2762 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2763 isl_basic_map_free(map1
->p
[0]);
2776 /* map2 may be either a parameter domain or a map living in the same
2779 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2780 __isl_take isl_map
*map2
)
2783 struct isl_map
*result
;
2789 if ((isl_map_plain_is_empty(map1
) ||
2790 isl_map_plain_is_universe(map2
)) &&
2791 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2795 if ((isl_map_plain_is_empty(map2
) ||
2796 isl_map_plain_is_universe(map1
)) &&
2797 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2802 if (map1
->n
== 1 && map2
->n
== 1 &&
2803 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2804 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2805 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2806 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2807 return map_intersect_add_constraint(map1
, map2
);
2809 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2810 isl_space_dim(map2
->dim
, isl_dim_param
))
2811 isl_assert(map1
->ctx
,
2812 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2814 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2815 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2816 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2818 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2819 map1
->n
* map2
->n
, flags
);
2822 for (i
= 0; i
< map1
->n
; ++i
)
2823 for (j
= 0; j
< map2
->n
; ++j
) {
2824 struct isl_basic_map
*part
;
2825 part
= isl_basic_map_intersect(
2826 isl_basic_map_copy(map1
->p
[i
]),
2827 isl_basic_map_copy(map2
->p
[j
]));
2828 if (isl_basic_map_is_empty(part
) < 0)
2830 result
= isl_map_add_basic_map(result
, part
);
2843 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2844 __isl_take isl_map
*map2
)
2848 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2849 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2850 "spaces don't match", goto error
);
2851 return map_intersect_internal(map1
, map2
);
2858 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2859 __isl_take isl_map
*map2
)
2861 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2864 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2866 return (struct isl_set
*)
2867 isl_map_intersect((struct isl_map
*)set1
,
2868 (struct isl_map
*)set2
);
2871 /* map_intersect_internal accepts intersections
2872 * with parameter domains, so we can just call that function.
2874 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2875 __isl_take isl_set
*params
)
2877 return map_intersect_internal(map
, params
);
2880 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2881 __isl_take isl_map
*map2
)
2883 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2886 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2887 __isl_take isl_set
*params
)
2889 return isl_map_intersect_params(set
, params
);
2892 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2895 struct isl_basic_set
*bset
;
2900 bmap
= isl_basic_map_cow(bmap
);
2903 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
2904 in
= isl_basic_map_n_in(bmap
);
2905 bset
= isl_basic_set_from_basic_map(bmap
);
2906 bset
= isl_basic_set_swap_vars(bset
, in
);
2907 return isl_basic_map_from_basic_set(bset
, dim
);
2910 static __isl_give isl_basic_map
*basic_map_space_reset(
2911 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
2915 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
2918 space
= isl_basic_map_get_space(bmap
);
2919 space
= isl_space_reset(space
, type
);
2920 bmap
= isl_basic_map_reset_space(bmap
, space
);
2924 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
2925 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2926 unsigned pos
, unsigned n
)
2929 struct isl_basic_map
*res
;
2930 struct isl_dim_map
*dim_map
;
2931 unsigned total
, off
;
2932 enum isl_dim_type t
;
2935 return basic_map_space_reset(bmap
, type
);
2940 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
2942 total
= isl_basic_map_total_dim(bmap
) + n
;
2943 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2945 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2947 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2949 unsigned size
= isl_basic_map_dim(bmap
, t
);
2950 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2952 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2953 pos
, size
- pos
, off
+ pos
+ n
);
2955 off
+= isl_space_dim(res_dim
, t
);
2957 isl_dim_map_div(dim_map
, bmap
, off
);
2959 res
= isl_basic_map_alloc_space(res_dim
,
2960 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2961 if (isl_basic_map_is_rational(bmap
))
2962 res
= isl_basic_map_set_rational(res
);
2963 if (isl_basic_map_plain_is_empty(bmap
)) {
2964 isl_basic_map_free(bmap
);
2965 return isl_basic_map_set_to_empty(res
);
2967 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
2968 return isl_basic_map_finalize(res
);
2971 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
2972 __isl_take isl_basic_set
*bset
,
2973 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2975 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
2978 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2979 enum isl_dim_type type
, unsigned n
)
2983 return isl_basic_map_insert_dims(bmap
, type
,
2984 isl_basic_map_dim(bmap
, type
), n
);
2987 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2988 enum isl_dim_type type
, unsigned n
)
2992 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2993 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2995 isl_basic_set_free(bset
);
2999 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3000 enum isl_dim_type type
)
3004 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3007 space
= isl_map_get_space(map
);
3008 space
= isl_space_reset(space
, type
);
3009 map
= isl_map_reset_space(map
, space
);
3013 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3014 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3019 return map_space_reset(map
, type
);
3021 map
= isl_map_cow(map
);
3025 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3029 for (i
= 0; i
< map
->n
; ++i
) {
3030 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3041 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3042 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3044 return isl_map_insert_dims(set
, type
, pos
, n
);
3047 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3048 enum isl_dim_type type
, unsigned n
)
3052 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3055 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3056 enum isl_dim_type type
, unsigned n
)
3060 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3061 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3067 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3068 __isl_take isl_basic_map
*bmap
,
3069 enum isl_dim_type dst_type
, unsigned dst_pos
,
3070 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3072 struct isl_dim_map
*dim_map
;
3073 struct isl_basic_map
*res
;
3074 enum isl_dim_type t
;
3075 unsigned total
, off
;
3082 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3085 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3088 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3090 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3091 pos(bmap
->dim
, src_type
) + src_pos
+
3092 ((src_type
< dst_type
) ? n
: 0)) {
3093 bmap
= isl_basic_map_cow(bmap
);
3097 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3098 src_type
, src_pos
, n
);
3102 bmap
= isl_basic_map_finalize(bmap
);
3107 total
= isl_basic_map_total_dim(bmap
);
3108 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3111 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3112 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3113 if (t
== dst_type
) {
3114 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3117 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3120 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3121 dst_pos
, size
- dst_pos
, off
);
3122 off
+= size
- dst_pos
;
3123 } else if (t
== src_type
) {
3124 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3127 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3128 src_pos
+ n
, size
- src_pos
- n
, off
);
3129 off
+= size
- src_pos
- n
;
3131 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3135 isl_dim_map_div(dim_map
, bmap
, off
);
3137 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3138 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3139 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3141 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3142 src_type
, src_pos
, n
);
3146 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3147 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3148 bmap
= isl_basic_map_finalize(bmap
);
3152 isl_basic_map_free(bmap
);
3156 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3157 enum isl_dim_type dst_type
, unsigned dst_pos
,
3158 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3160 return (isl_basic_set
*)isl_basic_map_move_dims(
3161 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3164 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3165 enum isl_dim_type dst_type
, unsigned dst_pos
,
3166 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3170 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3171 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3172 src_type
, src_pos
, n
);
3178 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3179 enum isl_dim_type dst_type
, unsigned dst_pos
,
3180 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3189 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3192 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3195 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3197 map
= isl_map_cow(map
);
3201 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3205 for (i
= 0; i
< map
->n
; ++i
) {
3206 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3208 src_type
, src_pos
, n
);
3219 /* Move the specified dimensions to the last columns right before
3220 * the divs. Don't change the dimension specification of bmap.
3221 * That's the responsibility of the caller.
3223 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3224 enum isl_dim_type type
, unsigned first
, unsigned n
)
3226 struct isl_dim_map
*dim_map
;
3227 struct isl_basic_map
*res
;
3228 enum isl_dim_type t
;
3229 unsigned total
, off
;
3233 if (pos(bmap
->dim
, type
) + first
+ n
==
3234 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3237 total
= isl_basic_map_total_dim(bmap
);
3238 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3241 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3242 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3244 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3247 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3248 first
, n
, total
- bmap
->n_div
- n
);
3249 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3250 first
+ n
, size
- (first
+ n
), off
);
3251 off
+= size
- (first
+ n
);
3253 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3257 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3259 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3260 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3261 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3265 /* Turn the n dimensions of type type, starting at first
3266 * into existentially quantified variables.
3268 __isl_give isl_basic_map
*isl_basic_map_project_out(
3269 __isl_take isl_basic_map
*bmap
,
3270 enum isl_dim_type type
, unsigned first
, unsigned n
)
3278 return basic_map_space_reset(bmap
, type
);
3283 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3284 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3286 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3289 bmap
= move_last(bmap
, type
, first
, n
);
3290 bmap
= isl_basic_map_cow(bmap
);
3294 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3295 old
= bmap
->block2
.data
;
3296 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3297 (bmap
->extra
+ n
) * (1 + row_size
));
3298 if (!bmap
->block2
.data
)
3300 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3303 for (i
= 0; i
< n
; ++i
) {
3304 new_div
[i
] = bmap
->block2
.data
+
3305 (bmap
->extra
+ i
) * (1 + row_size
);
3306 isl_seq_clr(new_div
[i
], 1 + row_size
);
3308 for (i
= 0; i
< bmap
->extra
; ++i
)
3309 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3311 bmap
->div
= new_div
;
3315 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3318 bmap
= isl_basic_map_simplify(bmap
);
3319 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3320 return isl_basic_map_finalize(bmap
);
3322 isl_basic_map_free(bmap
);
3326 /* Turn the n dimensions of type type, starting at first
3327 * into existentially quantified variables.
3329 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3330 enum isl_dim_type type
, unsigned first
, unsigned n
)
3332 return (isl_basic_set
*)isl_basic_map_project_out(
3333 (isl_basic_map
*)bset
, type
, first
, n
);
3336 /* Turn the n dimensions of type type, starting at first
3337 * into existentially quantified variables.
3339 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3340 enum isl_dim_type type
, unsigned first
, unsigned n
)
3348 return map_space_reset(map
, type
);
3350 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3352 map
= isl_map_cow(map
);
3356 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3360 for (i
= 0; i
< map
->n
; ++i
) {
3361 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3372 /* Turn the n dimensions of type type, starting at first
3373 * into existentially quantified variables.
3375 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3376 enum isl_dim_type type
, unsigned first
, unsigned n
)
3378 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3381 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3385 for (i
= 0; i
< n
; ++i
) {
3386 j
= isl_basic_map_alloc_div(bmap
);
3389 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3393 isl_basic_map_free(bmap
);
3397 struct isl_basic_map
*isl_basic_map_apply_range(
3398 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3400 isl_space
*dim_result
= NULL
;
3401 struct isl_basic_map
*bmap
;
3402 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3403 struct isl_dim_map
*dim_map1
, *dim_map2
;
3405 if (!bmap1
|| !bmap2
)
3408 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3409 isl_space_copy(bmap2
->dim
));
3411 n_in
= isl_basic_map_n_in(bmap1
);
3412 n_out
= isl_basic_map_n_out(bmap2
);
3413 n
= isl_basic_map_n_out(bmap1
);
3414 nparam
= isl_basic_map_n_param(bmap1
);
3416 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3417 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3418 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3419 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3420 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3421 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3422 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3423 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3424 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3425 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3426 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3428 bmap
= isl_basic_map_alloc_space(dim_result
,
3429 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3430 bmap1
->n_eq
+ bmap2
->n_eq
,
3431 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3432 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3433 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3434 bmap
= add_divs(bmap
, n
);
3435 bmap
= isl_basic_map_simplify(bmap
);
3436 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3437 return isl_basic_map_finalize(bmap
);
3439 isl_basic_map_free(bmap1
);
3440 isl_basic_map_free(bmap2
);
3444 struct isl_basic_set
*isl_basic_set_apply(
3445 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3450 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3453 return (struct isl_basic_set
*)
3454 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3456 isl_basic_set_free(bset
);
3457 isl_basic_map_free(bmap
);
3461 struct isl_basic_map
*isl_basic_map_apply_domain(
3462 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3464 if (!bmap1
|| !bmap2
)
3467 isl_assert(bmap1
->ctx
,
3468 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3469 isl_assert(bmap1
->ctx
,
3470 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3473 bmap1
= isl_basic_map_reverse(bmap1
);
3474 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3475 return isl_basic_map_reverse(bmap1
);
3477 isl_basic_map_free(bmap1
);
3478 isl_basic_map_free(bmap2
);
3482 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3483 * A \cap B -> f(A) + f(B)
3485 struct isl_basic_map
*isl_basic_map_sum(
3486 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3488 unsigned n_in
, n_out
, nparam
, total
, pos
;
3489 struct isl_basic_map
*bmap
= NULL
;
3490 struct isl_dim_map
*dim_map1
, *dim_map2
;
3493 if (!bmap1
|| !bmap2
)
3496 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3499 nparam
= isl_basic_map_n_param(bmap1
);
3500 n_in
= isl_basic_map_n_in(bmap1
);
3501 n_out
= isl_basic_map_n_out(bmap1
);
3503 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3504 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3505 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3506 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3507 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3508 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3509 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3510 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3511 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3512 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3513 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3515 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3516 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3517 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3518 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3519 for (i
= 0; i
< n_out
; ++i
) {
3520 int j
= isl_basic_map_alloc_equality(bmap
);
3523 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3524 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3525 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3526 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3528 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3529 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3530 bmap
= add_divs(bmap
, 2 * n_out
);
3532 bmap
= isl_basic_map_simplify(bmap
);
3533 return isl_basic_map_finalize(bmap
);
3535 isl_basic_map_free(bmap
);
3536 isl_basic_map_free(bmap1
);
3537 isl_basic_map_free(bmap2
);
3541 /* Given two maps A -> f(A) and B -> g(B), construct a map
3542 * A \cap B -> f(A) + f(B)
3544 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3546 struct isl_map
*result
;
3552 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3554 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3555 map1
->n
* map2
->n
, 0);
3558 for (i
= 0; i
< map1
->n
; ++i
)
3559 for (j
= 0; j
< map2
->n
; ++j
) {
3560 struct isl_basic_map
*part
;
3561 part
= isl_basic_map_sum(
3562 isl_basic_map_copy(map1
->p
[i
]),
3563 isl_basic_map_copy(map2
->p
[j
]));
3564 if (isl_basic_map_is_empty(part
))
3565 isl_basic_map_free(part
);
3567 result
= isl_map_add_basic_map(result
, part
);
3580 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3581 __isl_take isl_set
*set2
)
3583 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3586 /* Given a basic map A -> f(A), construct A -> -f(A).
3588 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3593 bmap
= isl_basic_map_cow(bmap
);
3597 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3598 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3599 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3600 for (j
= 0; j
< n
; ++j
)
3601 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3602 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3603 for (j
= 0; j
< n
; ++j
)
3604 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3605 for (i
= 0; i
< bmap
->n_div
; ++i
)
3606 for (j
= 0; j
< n
; ++j
)
3607 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3608 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3609 return isl_basic_map_finalize(bmap
);
3612 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3614 return isl_basic_map_neg(bset
);
3617 /* Given a map A -> f(A), construct A -> -f(A).
3619 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3623 map
= isl_map_cow(map
);
3627 for (i
= 0; i
< map
->n
; ++i
) {
3628 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3639 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3641 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3644 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3645 * A -> floor(f(A)/d).
3647 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3650 unsigned n_in
, n_out
, nparam
, total
, pos
;
3651 struct isl_basic_map
*result
= NULL
;
3652 struct isl_dim_map
*dim_map
;
3658 nparam
= isl_basic_map_n_param(bmap
);
3659 n_in
= isl_basic_map_n_in(bmap
);
3660 n_out
= isl_basic_map_n_out(bmap
);
3662 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3663 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3664 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3665 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3666 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3667 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3669 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3670 bmap
->n_div
+ n_out
,
3671 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3672 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3673 result
= add_divs(result
, n_out
);
3674 for (i
= 0; i
< n_out
; ++i
) {
3676 j
= isl_basic_map_alloc_inequality(result
);
3679 isl_seq_clr(result
->ineq
[j
], 1+total
);
3680 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3681 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3682 j
= isl_basic_map_alloc_inequality(result
);
3685 isl_seq_clr(result
->ineq
[j
], 1+total
);
3686 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3687 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3688 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3691 result
= isl_basic_map_simplify(result
);
3692 return isl_basic_map_finalize(result
);
3694 isl_basic_map_free(result
);
3698 /* Given a map A -> f(A) and an integer d, construct a map
3699 * A -> floor(f(A)/d).
3701 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3705 map
= isl_map_cow(map
);
3709 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3710 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3711 for (i
= 0; i
< map
->n
; ++i
) {
3712 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3723 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3729 i
= isl_basic_map_alloc_equality(bmap
);
3732 nparam
= isl_basic_map_n_param(bmap
);
3733 n_in
= isl_basic_map_n_in(bmap
);
3734 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3735 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3736 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3737 return isl_basic_map_finalize(bmap
);
3739 isl_basic_map_free(bmap
);
3743 /* Add a constraints to "bmap" expressing i_pos < o_pos
3745 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3751 i
= isl_basic_map_alloc_inequality(bmap
);
3754 nparam
= isl_basic_map_n_param(bmap
);
3755 n_in
= isl_basic_map_n_in(bmap
);
3756 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3757 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3758 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3759 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3760 return isl_basic_map_finalize(bmap
);
3762 isl_basic_map_free(bmap
);
3766 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3768 static __isl_give isl_basic_map
*var_less_or_equal(
3769 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3775 i
= isl_basic_map_alloc_inequality(bmap
);
3778 nparam
= isl_basic_map_n_param(bmap
);
3779 n_in
= isl_basic_map_n_in(bmap
);
3780 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3781 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3782 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3783 return isl_basic_map_finalize(bmap
);
3785 isl_basic_map_free(bmap
);
3789 /* Add a constraints to "bmap" expressing i_pos > o_pos
3791 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3797 i
= isl_basic_map_alloc_inequality(bmap
);
3800 nparam
= isl_basic_map_n_param(bmap
);
3801 n_in
= isl_basic_map_n_in(bmap
);
3802 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3803 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3804 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3805 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3806 return isl_basic_map_finalize(bmap
);
3808 isl_basic_map_free(bmap
);
3812 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3814 static __isl_give isl_basic_map
*var_more_or_equal(
3815 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3821 i
= isl_basic_map_alloc_inequality(bmap
);
3824 nparam
= isl_basic_map_n_param(bmap
);
3825 n_in
= isl_basic_map_n_in(bmap
);
3826 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3827 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3828 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3829 return isl_basic_map_finalize(bmap
);
3831 isl_basic_map_free(bmap
);
3835 __isl_give isl_basic_map
*isl_basic_map_equal(
3836 __isl_take isl_space
*dim
, unsigned n_equal
)
3839 struct isl_basic_map
*bmap
;
3840 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3843 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3844 bmap
= var_equal(bmap
, i
);
3845 return isl_basic_map_finalize(bmap
);
3848 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3850 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
3854 struct isl_basic_map
*bmap
;
3855 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3858 for (i
= 0; i
< pos
&& bmap
; ++i
)
3859 bmap
= var_equal(bmap
, i
);
3861 bmap
= var_less(bmap
, pos
);
3862 return isl_basic_map_finalize(bmap
);
3865 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3867 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3868 __isl_take isl_space
*dim
, unsigned pos
)
3871 isl_basic_map
*bmap
;
3873 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3874 for (i
= 0; i
< pos
; ++i
)
3875 bmap
= var_equal(bmap
, i
);
3876 bmap
= var_less_or_equal(bmap
, pos
);
3877 return isl_basic_map_finalize(bmap
);
3880 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3882 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
3886 struct isl_basic_map
*bmap
;
3887 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3890 for (i
= 0; i
< pos
&& bmap
; ++i
)
3891 bmap
= var_equal(bmap
, i
);
3893 bmap
= var_more(bmap
, pos
);
3894 return isl_basic_map_finalize(bmap
);
3897 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3899 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3900 __isl_take isl_space
*dim
, unsigned pos
)
3903 isl_basic_map
*bmap
;
3905 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
3906 for (i
= 0; i
< pos
; ++i
)
3907 bmap
= var_equal(bmap
, i
);
3908 bmap
= var_more_or_equal(bmap
, pos
);
3909 return isl_basic_map_finalize(bmap
);
3912 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
3913 unsigned n
, int equal
)
3915 struct isl_map
*map
;
3918 if (n
== 0 && equal
)
3919 return isl_map_universe(dims
);
3921 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3923 for (i
= 0; i
+ 1 < n
; ++i
)
3924 map
= isl_map_add_basic_map(map
,
3925 isl_basic_map_less_at(isl_space_copy(dims
), i
));
3928 map
= isl_map_add_basic_map(map
,
3929 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3931 map
= isl_map_add_basic_map(map
,
3932 isl_basic_map_less_at(dims
, n
- 1));
3934 isl_space_free(dims
);
3939 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
3943 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3946 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
3948 return map_lex_lte_first(dim
, n
, 0);
3951 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
3953 return map_lex_lte_first(dim
, n
, 1);
3956 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
3958 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
3961 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
3963 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
3966 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
3967 unsigned n
, int equal
)
3969 struct isl_map
*map
;
3972 if (n
== 0 && equal
)
3973 return isl_map_universe(dims
);
3975 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
3977 for (i
= 0; i
+ 1 < n
; ++i
)
3978 map
= isl_map_add_basic_map(map
,
3979 isl_basic_map_more_at(isl_space_copy(dims
), i
));
3982 map
= isl_map_add_basic_map(map
,
3983 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3985 map
= isl_map_add_basic_map(map
,
3986 isl_basic_map_more_at(dims
, n
- 1));
3988 isl_space_free(dims
);
3993 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
3997 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4000 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4002 return map_lex_gte_first(dim
, n
, 0);
4005 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4007 return map_lex_gte_first(dim
, n
, 1);
4010 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4012 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4015 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4017 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4020 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4021 __isl_take isl_set
*set2
)
4024 map
= isl_map_lex_le(isl_set_get_space(set1
));
4025 map
= isl_map_intersect_domain(map
, set1
);
4026 map
= isl_map_intersect_range(map
, set2
);
4030 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4031 __isl_take isl_set
*set2
)
4034 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4035 map
= isl_map_intersect_domain(map
, set1
);
4036 map
= isl_map_intersect_range(map
, set2
);
4040 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4041 __isl_take isl_set
*set2
)
4044 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4045 map
= isl_map_intersect_domain(map
, set1
);
4046 map
= isl_map_intersect_range(map
, set2
);
4050 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4051 __isl_take isl_set
*set2
)
4054 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4055 map
= isl_map_intersect_domain(map
, set1
);
4056 map
= isl_map_intersect_range(map
, set2
);
4060 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4061 __isl_take isl_map
*map2
)
4064 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4065 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4066 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4070 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4071 __isl_take isl_map
*map2
)
4074 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4075 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4076 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4080 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4081 __isl_take isl_map
*map2
)
4084 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4085 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4086 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4090 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4091 __isl_take isl_map
*map2
)
4094 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4095 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4096 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4100 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4101 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4103 struct isl_basic_map
*bmap
;
4105 bset
= isl_basic_set_cow(bset
);
4109 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4110 isl_space_free(bset
->dim
);
4111 bmap
= (struct isl_basic_map
*) bset
;
4113 return isl_basic_map_finalize(bmap
);
4115 isl_basic_set_free(bset
);
4116 isl_space_free(dim
);
4120 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4124 if (bmap
->dim
->n_in
== 0)
4125 return (struct isl_basic_set
*)bmap
;
4126 bmap
= isl_basic_map_cow(bmap
);
4129 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4132 bmap
= isl_basic_map_finalize(bmap
);
4133 return (struct isl_basic_set
*)bmap
;
4135 isl_basic_map_free(bmap
);
4139 /* For a div d = floor(f/m), add the constraints
4142 * -(f-(n-1)) + m d >= 0
4144 * Note that the second constraint is the negation of
4148 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4149 unsigned pos
, isl_int
*div
)
4152 unsigned total
= isl_basic_map_total_dim(bmap
);
4154 i
= isl_basic_map_alloc_inequality(bmap
);
4157 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4158 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4160 j
= isl_basic_map_alloc_inequality(bmap
);
4163 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4164 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4165 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4169 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4170 unsigned pos
, isl_int
*div
)
4172 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4176 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4178 unsigned total
= isl_basic_map_total_dim(bmap
);
4179 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4181 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4185 struct isl_basic_set
*isl_basic_map_underlying_set(
4186 struct isl_basic_map
*bmap
)
4190 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4192 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4193 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4194 return (struct isl_basic_set
*)bmap
;
4195 bmap
= isl_basic_map_cow(bmap
);
4198 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4201 bmap
->extra
-= bmap
->n_div
;
4203 bmap
= isl_basic_map_finalize(bmap
);
4204 return (struct isl_basic_set
*)bmap
;
4209 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4210 __isl_take isl_basic_set
*bset
)
4212 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4215 struct isl_basic_map
*isl_basic_map_overlying_set(
4216 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4218 struct isl_basic_map
*bmap
;
4219 struct isl_ctx
*ctx
;
4226 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4227 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4228 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4230 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4231 isl_basic_map_free(like
);
4232 return (struct isl_basic_map
*)bset
;
4234 bset
= isl_basic_set_cow(bset
);
4237 total
= bset
->dim
->n_out
+ bset
->extra
;
4238 bmap
= (struct isl_basic_map
*)bset
;
4239 isl_space_free(bmap
->dim
);
4240 bmap
->dim
= isl_space_copy(like
->dim
);
4243 bmap
->n_div
= like
->n_div
;
4244 bmap
->extra
+= like
->n_div
;
4248 ltotal
= total
- bmap
->extra
+ like
->extra
;
4251 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4252 bmap
->extra
* (1 + 1 + total
));
4253 if (isl_blk_is_error(bmap
->block2
))
4255 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4259 for (i
= 0; i
< bmap
->extra
; ++i
)
4260 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4261 for (i
= 0; i
< like
->n_div
; ++i
) {
4262 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4263 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4265 bmap
= isl_basic_map_extend_constraints(bmap
,
4266 0, 2 * like
->n_div
);
4267 for (i
= 0; i
< like
->n_div
; ++i
) {
4268 if (isl_int_is_zero(bmap
->div
[i
][0]))
4270 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4274 isl_basic_map_free(like
);
4275 bmap
= isl_basic_map_simplify(bmap
);
4276 bmap
= isl_basic_map_finalize(bmap
);
4279 isl_basic_map_free(like
);
4280 isl_basic_set_free(bset
);
4284 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4285 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4287 return (struct isl_basic_set
*)
4288 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4291 struct isl_set
*isl_set_from_underlying_set(
4292 struct isl_set
*set
, struct isl_basic_set
*like
)
4298 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4300 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4301 isl_basic_set_free(like
);
4304 set
= isl_set_cow(set
);
4307 for (i
= 0; i
< set
->n
; ++i
) {
4308 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4309 isl_basic_set_copy(like
));
4313 isl_space_free(set
->dim
);
4314 set
->dim
= isl_space_copy(like
->dim
);
4317 isl_basic_set_free(like
);
4320 isl_basic_set_free(like
);
4325 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4329 map
= isl_map_cow(map
);
4332 map
->dim
= isl_space_cow(map
->dim
);
4336 for (i
= 1; i
< map
->n
; ++i
)
4337 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4339 for (i
= 0; i
< map
->n
; ++i
) {
4340 map
->p
[i
] = (struct isl_basic_map
*)
4341 isl_basic_map_underlying_set(map
->p
[i
]);
4346 map
->dim
= isl_space_underlying(map
->dim
, 0);
4348 isl_space_free(map
->dim
);
4349 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4353 return (struct isl_set
*)map
;
4359 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4361 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4364 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4365 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4367 bmap
= isl_basic_map_cow(bmap
);
4371 isl_space_free(bmap
->dim
);
4374 bmap
= isl_basic_map_finalize(bmap
);
4378 isl_basic_map_free(bmap
);
4379 isl_space_free(dim
);
4383 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4384 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4386 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4390 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4391 __isl_take isl_space
*dim
)
4395 map
= isl_map_cow(map
);
4399 for (i
= 0; i
< map
->n
; ++i
) {
4400 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4401 isl_space_copy(dim
));
4405 isl_space_free(map
->dim
);
4411 isl_space_free(dim
);
4415 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4416 __isl_take isl_space
*dim
)
4418 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4421 /* Compute the parameter domain of the given basic set.
4423 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4428 if (isl_basic_set_is_params(bset
))
4431 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4432 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4433 space
= isl_basic_set_get_space(bset
);
4434 space
= isl_space_params(space
);
4435 bset
= isl_basic_set_reset_space(bset
, space
);
4439 /* Compute the parameter domain of the given set.
4441 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4446 if (isl_set_is_params(set
))
4449 n
= isl_set_dim(set
, isl_dim_set
);
4450 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4451 space
= isl_set_get_space(set
);
4452 space
= isl_space_params(space
);
4453 set
= isl_set_reset_space(set
, space
);
4457 /* Construct a zero-dimensional set with the given parameter domain.
4459 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4462 space
= isl_set_get_space(set
);
4463 space
= isl_space_set_from_params(space
);
4464 set
= isl_set_reset_space(set
, space
);
4468 /* Compute the parameter domain of the given map.
4470 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4475 n
= isl_map_dim(map
, isl_dim_in
);
4476 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4477 n
= isl_map_dim(map
, isl_dim_out
);
4478 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4479 space
= isl_map_get_space(map
);
4480 space
= isl_space_params(space
);
4481 map
= isl_map_reset_space(map
, space
);
4485 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4488 struct isl_basic_set
*domain
;
4494 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4496 n_in
= isl_basic_map_n_in(bmap
);
4497 n_out
= isl_basic_map_n_out(bmap
);
4498 domain
= isl_basic_set_from_basic_map(bmap
);
4499 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4501 domain
= isl_basic_set_reset_space(domain
, dim
);
4506 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4510 return isl_space_may_be_set(bmap
->dim
);
4513 /* Is this basic map actually a set?
4514 * Users should never call this function. Outside of isl,
4515 * the type should indicate whether something is a set or a map.
4517 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4521 return isl_space_is_set(bmap
->dim
);
4524 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4528 if (isl_basic_map_is_set(bmap
))
4530 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4533 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4534 __isl_take isl_basic_map
*bmap
)
4538 isl_basic_map
*domain
;
4539 int nparam
, n_in
, n_out
;
4542 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4543 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4544 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4546 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4547 domain
= isl_basic_map_universe(dim
);
4549 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4550 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4551 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4553 total
= isl_basic_map_total_dim(bmap
);
4555 for (i
= 0; i
< n_in
; ++i
) {
4556 k
= isl_basic_map_alloc_equality(bmap
);
4559 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4560 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4561 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4564 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4565 return isl_basic_map_finalize(bmap
);
4567 isl_basic_map_free(bmap
);
4571 __isl_give isl_basic_map
*isl_basic_map_range_map(
4572 __isl_take isl_basic_map
*bmap
)
4576 isl_basic_map
*range
;
4577 int nparam
, n_in
, n_out
;
4580 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4581 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4582 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4584 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4585 range
= isl_basic_map_universe(dim
);
4587 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4588 bmap
= isl_basic_map_apply_range(bmap
, range
);
4589 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4591 total
= isl_basic_map_total_dim(bmap
);
4593 for (i
= 0; i
< n_out
; ++i
) {
4594 k
= isl_basic_map_alloc_equality(bmap
);
4597 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4598 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4599 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4602 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4603 return isl_basic_map_finalize(bmap
);
4605 isl_basic_map_free(bmap
);
4609 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4613 return isl_space_may_be_set(map
->dim
);
4616 /* Is this map actually a set?
4617 * Users should never call this function. Outside of isl,
4618 * the type should indicate whether something is a set or a map.
4620 int isl_map_is_set(__isl_keep isl_map
*map
)
4624 return isl_space_is_set(map
->dim
);
4627 struct isl_set
*isl_map_range(struct isl_map
*map
)
4630 struct isl_set
*set
;
4634 if (isl_map_is_set(map
))
4635 return (isl_set
*)map
;
4637 map
= isl_map_cow(map
);
4641 set
= (struct isl_set
*) map
;
4642 set
->dim
= isl_space_range(set
->dim
);
4645 for (i
= 0; i
< map
->n
; ++i
) {
4646 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4650 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4651 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4658 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4661 isl_space
*domain_dim
;
4663 map
= isl_map_cow(map
);
4667 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4668 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4669 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4672 for (i
= 0; i
< map
->n
; ++i
) {
4673 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4677 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4678 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4685 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4688 isl_space
*range_dim
;
4690 map
= isl_map_cow(map
);
4694 range_dim
= isl_space_range(isl_map_get_space(map
));
4695 range_dim
= isl_space_from_range(range_dim
);
4696 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4697 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4700 for (i
= 0; i
< map
->n
; ++i
) {
4701 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4705 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4706 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4713 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4714 __isl_take isl_space
*dim
)
4717 struct isl_map
*map
= NULL
;
4719 set
= isl_set_cow(set
);
4722 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4723 map
= (struct isl_map
*)set
;
4724 for (i
= 0; i
< set
->n
; ++i
) {
4725 map
->p
[i
] = isl_basic_map_from_basic_set(
4726 set
->p
[i
], isl_space_copy(dim
));
4730 isl_space_free(map
->dim
);
4734 isl_space_free(dim
);
4739 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4740 __isl_take isl_basic_set
*bset
)
4742 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4745 __isl_give isl_basic_map
*isl_basic_map_from_range(
4746 __isl_take isl_basic_set
*bset
)
4749 space
= isl_basic_set_get_space(bset
);
4750 space
= isl_space_from_range(space
);
4751 bset
= isl_basic_set_reset_space(bset
, space
);
4752 return (isl_basic_map
*)bset
;
4755 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4758 space
= isl_set_get_space(set
);
4759 space
= isl_space_from_range(space
);
4760 set
= isl_set_reset_space(set
, space
);
4761 return (struct isl_map
*)set
;
4764 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4766 return isl_map_reverse(isl_map_from_range(set
));
4769 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4770 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4772 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4775 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4776 __isl_take isl_set
*range
)
4778 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4781 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4784 struct isl_set
*set
= NULL
;
4788 map
= isl_map_cow(map
);
4791 map
->dim
= isl_space_as_set_space(map
->dim
);
4794 set
= (struct isl_set
*)map
;
4795 for (i
= 0; i
< map
->n
; ++i
) {
4796 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4806 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4809 struct isl_map
*map
;
4814 isl_die(dim
->ctx
, isl_error_internal
,
4815 "negative number of basic maps", goto error
);
4816 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4817 sizeof(struct isl_map
) +
4818 (n
- 1) * sizeof(struct isl_basic_map
*));
4822 map
->ctx
= dim
->ctx
;
4823 isl_ctx_ref(map
->ctx
);
4831 isl_space_free(dim
);
4835 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
4836 unsigned nparam
, unsigned in
, unsigned out
, int n
,
4839 struct isl_map
*map
;
4842 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
4846 map
= isl_map_alloc_space(dims
, n
, flags
);
4850 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
4852 struct isl_basic_map
*bmap
;
4853 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
4854 bmap
= isl_basic_map_set_to_empty(bmap
);
4858 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
4860 struct isl_basic_set
*bset
;
4861 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
4862 bset
= isl_basic_set_set_to_empty(bset
);
4866 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
4868 struct isl_basic_map
*bmap
;
4871 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4872 bmap
= isl_basic_map_set_to_empty(bmap
);
4876 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
4878 struct isl_basic_map
*bmap
;
4881 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4882 bmap
= isl_basic_map_set_to_empty(bmap
);
4886 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
4888 struct isl_basic_set
*bset
;
4891 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
4892 bset
= isl_basic_set_set_to_empty(bset
);
4896 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
4898 struct isl_basic_map
*bmap
;
4899 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
4900 bmap
= isl_basic_map_finalize(bmap
);
4904 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
4906 struct isl_basic_set
*bset
;
4907 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
4908 bset
= isl_basic_set_finalize(bset
);
4912 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
4915 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
4916 isl_basic_map
*bmap
;
4918 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
4919 for (i
= 0; i
< total
; ++i
) {
4920 int k
= isl_basic_map_alloc_inequality(bmap
);
4923 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
4924 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
4928 isl_basic_map_free(bmap
);
4932 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
4934 return isl_basic_map_nat_universe(dim
);
4937 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
4939 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
4942 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
4944 return isl_map_nat_universe(dim
);
4947 __isl_give isl_basic_map
*isl_basic_map_universe_like(
4948 __isl_keep isl_basic_map
*model
)
4952 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4955 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
4959 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4962 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
4963 __isl_keep isl_set
*model
)
4967 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
4970 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
4972 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4975 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
4979 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4982 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
4986 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
4989 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
4991 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
4994 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
4998 return isl_set_empty(isl_space_copy(model
->dim
));
5001 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5003 struct isl_map
*map
;
5006 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5007 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5011 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5013 struct isl_set
*set
;
5016 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5017 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5021 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5025 return isl_set_universe(isl_space_copy(model
->dim
));
5028 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5031 struct isl_map
*dup
;
5035 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5036 for (i
= 0; i
< map
->n
; ++i
)
5037 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5041 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5042 __isl_take isl_basic_map
*bmap
)
5046 if (isl_basic_map_plain_is_empty(bmap
)) {
5047 isl_basic_map_free(bmap
);
5050 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5051 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5052 map
->p
[map
->n
] = bmap
;
5054 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5060 isl_basic_map_free(bmap
);
5064 void *isl_map_free(struct isl_map
*map
)
5074 isl_ctx_deref(map
->ctx
);
5075 for (i
= 0; i
< map
->n
; ++i
)
5076 isl_basic_map_free(map
->p
[i
]);
5077 isl_space_free(map
->dim
);
5083 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5084 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5088 base
= isl_map_cow(base
);
5092 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5095 for (i
= 0; i
< base
->n
; ++i
) {
5096 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5097 isl_space_copy(base
->dim
), 0, 0, 0);
5107 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5108 unsigned nparam
, unsigned dim
)
5110 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5114 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5115 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5119 bmap
= isl_basic_map_cow(bmap
);
5120 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5121 j
= isl_basic_map_alloc_equality(bmap
);
5124 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5125 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5126 isl_int_set_si(bmap
->eq
[j
][0], value
);
5127 bmap
= isl_basic_map_simplify(bmap
);
5128 return isl_basic_map_finalize(bmap
);
5130 isl_basic_map_free(bmap
);
5134 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5135 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5139 bmap
= isl_basic_map_cow(bmap
);
5140 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5141 j
= isl_basic_map_alloc_equality(bmap
);
5144 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5145 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5146 isl_int_set(bmap
->eq
[j
][0], value
);
5147 bmap
= isl_basic_map_simplify(bmap
);
5148 return isl_basic_map_finalize(bmap
);
5150 isl_basic_map_free(bmap
);
5154 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5155 enum isl_dim_type type
, unsigned pos
, int value
)
5159 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5160 return isl_basic_map_fix_pos_si(bmap
,
5161 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5163 isl_basic_map_free(bmap
);
5167 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5168 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5172 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5173 return isl_basic_map_fix_pos(bmap
,
5174 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5176 isl_basic_map_free(bmap
);
5180 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5181 enum isl_dim_type type
, unsigned pos
, int value
)
5183 return (struct isl_basic_set
*)
5184 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5188 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5189 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5191 return (struct isl_basic_set
*)
5192 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5196 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5197 unsigned input
, int value
)
5199 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5202 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5203 unsigned dim
, int value
)
5205 return (struct isl_basic_set
*)
5206 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5207 isl_dim_set
, dim
, value
);
5210 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5212 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5219 isl_basic_map_free(map
->p
[i
]);
5220 if (i
!= map
->n
- 1) {
5221 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5222 map
->p
[i
] = map
->p
[map
->n
- 1];
5229 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5230 enum isl_dim_type type
, unsigned pos
, int value
)
5234 map
= isl_map_cow(map
);
5238 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5239 for (i
= map
->n
- 1; i
>= 0; --i
) {
5240 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5241 if (remove_if_empty(map
, i
) < 0)
5244 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5251 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5252 enum isl_dim_type type
, unsigned pos
, int value
)
5254 return (struct isl_set
*)
5255 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5258 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5259 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5263 map
= isl_map_cow(map
);
5267 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5268 for (i
= 0; i
< map
->n
; ++i
) {
5269 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5273 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5280 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5281 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5283 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5286 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5287 unsigned input
, int value
)
5289 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5292 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5294 return (struct isl_set
*)
5295 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5298 static __isl_give isl_basic_map
*basic_map_bound_si(
5299 __isl_take isl_basic_map
*bmap
,
5300 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5306 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5307 pos
+= isl_basic_map_offset(bmap
, type
);
5308 bmap
= isl_basic_map_cow(bmap
);
5309 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5310 j
= isl_basic_map_alloc_inequality(bmap
);
5313 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5315 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5316 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5318 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5319 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5321 bmap
= isl_basic_map_simplify(bmap
);
5322 return isl_basic_map_finalize(bmap
);
5324 isl_basic_map_free(bmap
);
5328 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5329 __isl_take isl_basic_map
*bmap
,
5330 enum isl_dim_type type
, unsigned pos
, int value
)
5332 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5335 /* Constrain the values of the given dimension to be no greater than "value".
5337 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5338 __isl_take isl_basic_map
*bmap
,
5339 enum isl_dim_type type
, unsigned pos
, int value
)
5341 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5344 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5345 unsigned dim
, isl_int value
)
5349 bset
= isl_basic_set_cow(bset
);
5350 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5351 j
= isl_basic_set_alloc_inequality(bset
);
5354 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5355 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5356 isl_int_neg(bset
->ineq
[j
][0], value
);
5357 bset
= isl_basic_set_simplify(bset
);
5358 return isl_basic_set_finalize(bset
);
5360 isl_basic_set_free(bset
);
5364 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5365 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5369 map
= isl_map_cow(map
);
5373 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5374 for (i
= 0; i
< map
->n
; ++i
) {
5375 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5376 type
, pos
, value
, upper
);
5380 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5387 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5388 enum isl_dim_type type
, unsigned pos
, int value
)
5390 return map_bound_si(map
, type
, pos
, value
, 0);
5393 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5394 enum isl_dim_type type
, unsigned pos
, int value
)
5396 return map_bound_si(map
, type
, pos
, value
, 1);
5399 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5400 enum isl_dim_type type
, unsigned pos
, int value
)
5402 return (struct isl_set
*)
5403 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5406 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5407 enum isl_dim_type type
, unsigned pos
, int value
)
5409 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5412 /* Bound the given variable of "bmap" from below (or above is "upper"
5413 * is set) to "value".
5415 static __isl_give isl_basic_map
*basic_map_bound(
5416 __isl_take isl_basic_map
*bmap
,
5417 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5423 if (pos
>= isl_basic_map_dim(bmap
, type
))
5424 isl_die(bmap
->ctx
, isl_error_invalid
,
5425 "index out of bounds", goto error
);
5426 pos
+= isl_basic_map_offset(bmap
, type
);
5427 bmap
= isl_basic_map_cow(bmap
);
5428 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5429 j
= isl_basic_map_alloc_inequality(bmap
);
5432 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5434 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5435 isl_int_set(bmap
->ineq
[j
][0], value
);
5437 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5438 isl_int_neg(bmap
->ineq
[j
][0], value
);
5440 bmap
= isl_basic_map_simplify(bmap
);
5441 return isl_basic_map_finalize(bmap
);
5443 isl_basic_map_free(bmap
);
5447 /* Bound the given variable of "map" from below (or above is "upper"
5448 * is set) to "value".
5450 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5451 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5455 map
= isl_map_cow(map
);
5459 if (pos
>= isl_map_dim(map
, type
))
5460 isl_die(map
->ctx
, isl_error_invalid
,
5461 "index out of bounds", goto error
);
5462 for (i
= map
->n
- 1; i
>= 0; --i
) {
5463 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5464 if (remove_if_empty(map
, i
) < 0)
5467 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5474 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5475 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5477 return map_bound(map
, type
, pos
, value
, 0);
5480 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5481 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5483 return map_bound(map
, type
, pos
, value
, 1);
5486 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5487 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5489 return isl_map_lower_bound(set
, type
, pos
, value
);
5492 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5493 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5495 return isl_map_upper_bound(set
, type
, pos
, value
);
5498 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5503 set
= isl_set_cow(set
);
5507 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5508 for (i
= 0; i
< set
->n
; ++i
) {
5509 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5519 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5523 map
= isl_map_cow(map
);
5527 map
->dim
= isl_space_reverse(map
->dim
);
5530 for (i
= 0; i
< map
->n
; ++i
) {
5531 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5535 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5542 static struct isl_map
*isl_basic_map_partial_lexopt(
5543 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5544 struct isl_set
**empty
, int max
)
5548 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5549 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5551 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5553 isl_basic_map_free(bmap
);
5554 isl_basic_set_free(dom
);
5560 struct isl_map
*isl_basic_map_partial_lexmax(
5561 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5562 struct isl_set
**empty
)
5564 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5567 struct isl_map
*isl_basic_map_partial_lexmin(
5568 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5569 struct isl_set
**empty
)
5571 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5574 struct isl_set
*isl_basic_set_partial_lexmin(
5575 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5576 struct isl_set
**empty
)
5578 return (struct isl_set
*)
5579 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5583 struct isl_set
*isl_basic_set_partial_lexmax(
5584 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5585 struct isl_set
**empty
)
5587 return (struct isl_set
*)
5588 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5592 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5593 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5594 __isl_give isl_set
**empty
)
5596 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5599 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5600 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5601 __isl_give isl_set
**empty
)
5603 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5606 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5607 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5608 __isl_give isl_set
**empty
)
5610 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5613 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5614 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5615 __isl_give isl_set
**empty
)
5617 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5620 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5621 __isl_take isl_basic_map
*bmap
, int max
)
5623 isl_basic_set
*dom
= NULL
;
5624 isl_space
*dom_space
;
5628 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5629 dom
= isl_basic_set_universe(dom_space
);
5630 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5632 isl_basic_map_free(bmap
);
5636 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5637 __isl_take isl_basic_map
*bmap
)
5639 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5643 #define TYPE isl_pw_multi_aff
5645 #define SUFFIX _pw_multi_aff
5647 #define EMPTY isl_pw_multi_aff_empty
5649 #define ADD isl_pw_multi_aff_union_add
5650 #include "isl_map_lexopt_templ.c"
5652 /* Given a map "map", compute the lexicographically minimal
5653 * (or maximal) image element for each domain element in dom,
5654 * in the form of an isl_pw_multi_aff.
5655 * Set *empty to those elements in dom that do not have an image element.
5657 * We first compute the lexicographically minimal or maximal element
5658 * in the first basic map. This results in a partial solution "res"
5659 * and a subset "todo" of dom that still need to be handled.
5660 * We then consider each of the remaining maps in "map" and successively
5661 * update both "res" and "todo".
5663 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5664 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5665 __isl_give isl_set
**empty
, int max
)
5668 isl_pw_multi_aff
*res
;
5674 if (isl_map_plain_is_empty(map
)) {
5679 return isl_pw_multi_aff_from_map(map
);
5682 res
= basic_map_partial_lexopt_pw_multi_aff(
5683 isl_basic_map_copy(map
->p
[0]),
5684 isl_set_copy(dom
), &todo
, max
);
5686 for (i
= 1; i
< map
->n
; ++i
) {
5687 isl_pw_multi_aff
*res_i
;
5690 res_i
= basic_map_partial_lexopt_pw_multi_aff(
5691 isl_basic_map_copy(map
->p
[i
]),
5692 isl_set_copy(dom
), &todo_i
, max
);
5695 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
5697 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
5699 todo
= isl_set_intersect(todo
, todo_i
);
5720 #define TYPE isl_map
5724 #define EMPTY isl_map_empty
5726 #define ADD isl_map_union_disjoint
5727 #include "isl_map_lexopt_templ.c"
5729 /* Given a map "map", compute the lexicographically minimal
5730 * (or maximal) image element for each domain element in dom.
5731 * Set *empty to those elements in dom that do not have an image element.
5733 * We first compute the lexicographically minimal or maximal element
5734 * in the first basic map. This results in a partial solution "res"
5735 * and a subset "todo" of dom that still need to be handled.
5736 * We then consider each of the remaining maps in "map" and successively
5737 * update both "res" and "todo".
5739 * Let res^k and todo^k be the results after k steps and let i = k + 1.
5740 * Assume we are computing the lexicographical maximum.
5741 * We first compute the lexicographically maximal element in basic map i.
5742 * This results in a partial solution res_i and a subset todo_i.
5743 * Then we combine these results with those obtain for the first k basic maps
5744 * to obtain a result that is valid for the first k+1 basic maps.
5745 * In particular, the set where there is no solution is the set where
5746 * there is no solution for the first k basic maps and also no solution
5747 * for the ith basic map, i.e.,
5749 * todo^i = todo^k * todo_i
5751 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
5752 * solutions, arbitrarily breaking ties in favor of res^k.
5753 * That is, when res^k(a) >= res_i(a), we pick res^k and
5754 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
5755 * the lexicographic order.)
5756 * In practice, we compute
5758 * res^k * (res_i . "<=")
5762 * res_i * (res^k . "<")
5764 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
5765 * where only one of res^k and res_i provides a solution and we simply pick
5772 * Note that we only compute these intersections when dom(res^k) intersects
5773 * dom(res_i). Otherwise, the only effect of these intersections is to
5774 * potentially break up res^k and res_i into smaller pieces.
5775 * We want to avoid such splintering as much as possible.
5776 * In fact, an earlier implementation of this function would look for
5777 * better results in the domain of res^k and for extra results in todo^k,
5778 * but this would always result in a splintering according to todo^k,
5779 * even when the domain of basic map i is disjoint from the domains of
5780 * the previous basic maps.
5782 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
5783 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5784 __isl_give isl_set
**empty
, int max
)
5787 struct isl_map
*res
;
5788 struct isl_set
*todo
;
5793 if (isl_map_plain_is_empty(map
)) {
5801 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
5802 isl_set_copy(dom
), &todo
, max
);
5804 for (i
= 1; i
< map
->n
; ++i
) {
5808 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
5810 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
5811 isl_set_copy(dom
), &todo_i
, max
);
5814 lt
= isl_map_lex_lt(isl_space_copy(dim
));
5815 le
= isl_map_lex_le(dim
);
5817 lt
= isl_map_lex_gt(isl_space_copy(dim
));
5818 le
= isl_map_lex_ge(dim
);
5820 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
5821 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
5822 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
5823 le
= isl_map_intersect(le
, isl_map_copy(res
));
5825 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
5826 res
= isl_map_intersect_domain(res
,
5827 isl_set_copy(todo_i
));
5828 res_i
= isl_map_intersect_domain(res_i
,
5829 isl_set_copy(todo
));
5832 res
= isl_map_union_disjoint(res
, res_i
);
5833 res
= isl_map_union_disjoint(res
, lt
);
5834 res
= isl_map_union_disjoint(res
, le
);
5836 todo
= isl_set_intersect(todo
, todo_i
);
5856 __isl_give isl_map
*isl_map_partial_lexmax(
5857 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5858 __isl_give isl_set
**empty
)
5860 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
5863 __isl_give isl_map
*isl_map_partial_lexmin(
5864 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5865 __isl_give isl_set
**empty
)
5867 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
5870 __isl_give isl_set
*isl_set_partial_lexmin(
5871 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5872 __isl_give isl_set
**empty
)
5874 return (struct isl_set
*)
5875 isl_map_partial_lexmin((struct isl_map
*)set
,
5879 __isl_give isl_set
*isl_set_partial_lexmax(
5880 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
5881 __isl_give isl_set
**empty
)
5883 return (struct isl_set
*)
5884 isl_map_partial_lexmax((struct isl_map
*)set
,
5888 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
5890 struct isl_basic_set
*dom
= NULL
;
5895 dom_dim
= isl_space_domain(isl_space_copy(bmap
->dim
));
5896 dom
= isl_basic_set_universe(dom_dim
);
5897 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
5899 isl_basic_map_free(bmap
);
5903 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
5905 return isl_basic_map_lexopt(bmap
, 0);
5908 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
5910 return isl_basic_map_lexopt(bmap
, 1);
5913 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
5915 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
5918 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
5920 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
5923 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
5925 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
5928 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
5930 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
5933 /* Extract the first and only affine expression from list
5934 * and then add it to *pwaff with the given dom.
5935 * This domain is known to be disjoint from other domains
5936 * because of the way isl_basic_map_foreach_lexmax works.
5938 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
5939 __isl_take isl_aff_list
*list
, void *user
)
5941 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
5943 isl_pw_aff
**pwaff
= user
;
5944 isl_pw_aff
*pwaff_i
;
5946 if (isl_aff_list_n_aff(list
) != 1)
5947 isl_die(ctx
, isl_error_internal
,
5948 "expecting single element list", goto error
);
5950 aff
= isl_aff_list_get_aff(list
, 0);
5951 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
5953 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
5955 isl_aff_list_free(list
);
5959 isl_basic_set_free(dom
);
5960 isl_aff_list_free(list
);
5964 /* Given a basic map with one output dimension, compute the minimum or
5965 * maximum of that dimension as an isl_pw_aff.
5967 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
5968 * call update_dim_opt on each leaf of the result.
5970 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
5973 isl_space
*dim
= isl_basic_map_get_space(bmap
);
5977 dim
= isl_space_from_domain(isl_space_domain(dim
));
5978 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
5979 pwaff
= isl_pw_aff_empty(dim
);
5981 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
5983 return isl_pw_aff_free(pwaff
);
5988 /* Compute the minimum or maximum of the given output dimension
5989 * as a function of the parameters and the input dimensions,
5990 * but independently of the other output dimensions.
5992 * We first project out the other output dimension and then compute
5993 * the "lexicographic" maximum in each basic map, combining the results
5994 * using isl_pw_aff_union_max.
5996 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6003 n_out
= isl_map_dim(map
, isl_dim_out
);
6004 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6005 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6010 isl_space
*dim
= isl_map_get_space(map
);
6011 dim
= isl_space_domain(isl_space_from_range(dim
));
6013 return isl_pw_aff_empty(dim
);
6016 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6017 for (i
= 1; i
< map
->n
; ++i
) {
6018 isl_pw_aff
*pwaff_i
;
6020 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6021 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6029 /* Compute the maximum of the given output dimension as a function of the
6030 * parameters and input dimensions, but independently of
6031 * the other output dimensions.
6033 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6035 return map_dim_opt(map
, pos
, 1);
6038 /* Compute the minimum or maximum of the given set dimension
6039 * as a function of the parameters,
6040 * but independently of the other set dimensions.
6042 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6045 return map_dim_opt(set
, pos
, max
);
6048 /* Compute the maximum of the given set dimension as a function of the
6049 * parameters, but independently of the other set dimensions.
6051 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6053 return set_dim_opt(set
, pos
, 1);
6056 /* Compute the minimum of the given set dimension as a function of the
6057 * parameters, but independently of the other set dimensions.
6059 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6061 return set_dim_opt(set
, pos
, 0);
6064 /* Apply a preimage specified by "mat" on the parameters of "bset".
6065 * bset is assumed to have only parameters and divs.
6067 static struct isl_basic_set
*basic_set_parameter_preimage(
6068 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6075 bset
->dim
= isl_space_cow(bset
->dim
);
6079 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6081 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6083 bset
->dim
->nparam
= 0;
6084 bset
->dim
->n_out
= nparam
;
6085 bset
= isl_basic_set_preimage(bset
, mat
);
6087 bset
->dim
->nparam
= bset
->dim
->n_out
;
6088 bset
->dim
->n_out
= 0;
6093 isl_basic_set_free(bset
);
6097 /* Apply a preimage specified by "mat" on the parameters of "set".
6098 * set is assumed to have only parameters and divs.
6100 static struct isl_set
*set_parameter_preimage(
6101 struct isl_set
*set
, struct isl_mat
*mat
)
6103 isl_space
*dim
= NULL
;
6109 dim
= isl_space_copy(set
->dim
);
6110 dim
= isl_space_cow(dim
);
6114 nparam
= isl_set_dim(set
, isl_dim_param
);
6116 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6119 dim
->n_out
= nparam
;
6120 isl_set_reset_space(set
, dim
);
6121 set
= isl_set_preimage(set
, mat
);
6124 dim
= isl_space_copy(set
->dim
);
6125 dim
= isl_space_cow(dim
);
6128 dim
->nparam
= dim
->n_out
;
6130 isl_set_reset_space(set
, dim
);
6133 isl_space_free(dim
);
6140 /* Intersect the basic set "bset" with the affine space specified by the
6141 * equalities in "eq".
6143 static struct isl_basic_set
*basic_set_append_equalities(
6144 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6152 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6157 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6158 for (i
= 0; i
< eq
->n_row
; ++i
) {
6159 k
= isl_basic_set_alloc_equality(bset
);
6162 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6163 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6167 bset
= isl_basic_set_gauss(bset
, NULL
);
6168 bset
= isl_basic_set_finalize(bset
);
6173 isl_basic_set_free(bset
);
6177 /* Intersect the set "set" with the affine space specified by the
6178 * equalities in "eq".
6180 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6188 for (i
= 0; i
< set
->n
; ++i
) {
6189 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6202 /* Project the given basic set onto its parameter domain, possibly introducing
6203 * new, explicit, existential variables in the constraints.
6204 * The input has parameters and (possibly implicit) existential variables.
6205 * The output has the same parameters, but only
6206 * explicit existentially quantified variables.
6208 * The actual projection is performed by pip, but pip doesn't seem
6209 * to like equalities very much, so we first remove the equalities
6210 * among the parameters by performing a variable compression on
6211 * the parameters. Afterward, an inverse transformation is performed
6212 * and the equalities among the parameters are inserted back in.
6214 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6218 struct isl_mat
*T
, *T2
;
6219 struct isl_set
*set
;
6220 unsigned nparam
, n_div
;
6222 bset
= isl_basic_set_cow(bset
);
6226 if (bset
->n_eq
== 0)
6227 return isl_basic_set_lexmin(bset
);
6229 isl_basic_set_gauss(bset
, NULL
);
6231 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6232 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6234 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6235 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6238 if (i
== bset
->n_eq
)
6239 return isl_basic_set_lexmin(bset
);
6241 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6243 eq
= isl_mat_cow(eq
);
6244 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6245 if (T
&& T
->n_col
== 0) {
6249 bset
= isl_basic_set_set_to_empty(bset
);
6250 return isl_set_from_basic_set(bset
);
6252 bset
= basic_set_parameter_preimage(bset
, T
);
6254 set
= isl_basic_set_lexmin(bset
);
6255 set
= set_parameter_preimage(set
, T2
);
6256 set
= set_append_equalities(set
, eq
);
6260 /* Compute an explicit representation for all the existentially
6261 * quantified variables.
6262 * The input and output dimensions are first turned into parameters.
6263 * compute_divs then returns a map with the same parameters and
6264 * no input or output dimensions and the dimension specification
6265 * is reset to that of the input.
6267 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6269 struct isl_basic_set
*bset
;
6270 struct isl_set
*set
;
6271 struct isl_map
*map
;
6272 isl_space
*dim
, *orig_dim
= NULL
;
6277 bmap
= isl_basic_map_cow(bmap
);
6281 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6282 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6283 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6284 dim
= isl_space_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
6288 orig_dim
= bmap
->dim
;
6290 bset
= (struct isl_basic_set
*)bmap
;
6292 set
= parameter_compute_divs(bset
);
6293 map
= (struct isl_map
*)set
;
6294 map
= isl_map_reset_space(map
, orig_dim
);
6298 isl_basic_map_free(bmap
);
6302 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6310 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6311 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6312 if (isl_int_is_zero(bmap
->div
[i
][0]))
6314 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6320 static int map_divs_known(__isl_keep isl_map
*map
)
6327 for (i
= 0; i
< map
->n
; ++i
) {
6328 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6336 /* If bmap contains any unknown divs, then compute explicit
6337 * expressions for them. However, this computation may be
6338 * quite expensive, so first try to remove divs that aren't
6341 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6344 struct isl_map
*map
;
6346 known
= isl_basic_map_divs_known(bmap
);
6350 return isl_map_from_basic_map(bmap
);
6352 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6354 known
= isl_basic_map_divs_known(bmap
);
6358 return isl_map_from_basic_map(bmap
);
6360 map
= compute_divs(bmap
);
6363 isl_basic_map_free(bmap
);
6367 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6371 struct isl_map
*res
;
6378 known
= map_divs_known(map
);
6386 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6387 for (i
= 1 ; i
< map
->n
; ++i
) {
6389 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6390 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6391 res
= isl_map_union_disjoint(res
, r2
);
6393 res
= isl_map_union(res
, r2
);
6400 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6402 return (struct isl_set
*)
6403 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6406 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6408 return (struct isl_set
*)
6409 isl_map_compute_divs((struct isl_map
*)set
);
6412 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6415 struct isl_set
*set
;
6420 map
= isl_map_cow(map
);
6424 set
= (struct isl_set
*)map
;
6425 set
->dim
= isl_space_domain(set
->dim
);
6428 for (i
= 0; i
< map
->n
; ++i
) {
6429 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6433 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6434 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6441 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6442 __isl_take isl_map
*map2
)
6446 struct isl_map
*map
= NULL
;
6460 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
6462 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6463 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6464 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6466 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
6467 map1
->n
+ map2
->n
, flags
);
6470 for (i
= 0; i
< map1
->n
; ++i
) {
6471 map
= isl_map_add_basic_map(map
,
6472 isl_basic_map_copy(map1
->p
[i
]));
6476 for (i
= 0; i
< map2
->n
; ++i
) {
6477 map
= isl_map_add_basic_map(map
,
6478 isl_basic_map_copy(map2
->p
[i
]));
6492 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
6493 __isl_take isl_map
*map2
)
6495 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
6498 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
6500 map1
= isl_map_union_disjoint(map1
, map2
);
6504 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
6508 struct isl_set
*isl_set_union_disjoint(
6509 struct isl_set
*set1
, struct isl_set
*set2
)
6511 return (struct isl_set
*)
6512 isl_map_union_disjoint(
6513 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
6516 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
6518 return (struct isl_set
*)
6519 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
6522 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
6523 __isl_take isl_set
*set
)
6526 struct isl_map
*result
;
6532 if (!isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
))
6533 isl_die(set
->ctx
, isl_error_invalid
,
6534 "parameters don't match", goto error
);
6536 if (isl_space_dim(set
->dim
, isl_dim_set
) != 0 &&
6537 !isl_map_compatible_range(map
, set
))
6538 isl_die(set
->ctx
, isl_error_invalid
,
6539 "incompatible spaces", goto error
);
6541 if (isl_set_plain_is_universe(set
)) {
6546 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
6547 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
6548 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6550 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
6551 map
->n
* set
->n
, flags
);
6554 for (i
= 0; i
< map
->n
; ++i
)
6555 for (j
= 0; j
< set
->n
; ++j
) {
6556 result
= isl_map_add_basic_map(result
,
6557 isl_basic_map_intersect_range(
6558 isl_basic_map_copy(map
->p
[i
]),
6559 isl_basic_set_copy(set
->p
[j
])));
6572 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
6573 __isl_take isl_set
*set
)
6575 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
6578 struct isl_map
*isl_map_intersect_domain(
6579 struct isl_map
*map
, struct isl_set
*set
)
6581 return isl_map_reverse(
6582 isl_map_intersect_range(isl_map_reverse(map
), set
));
6585 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
6586 __isl_take isl_map
*map2
)
6590 map1
= isl_map_reverse(map1
);
6591 map1
= isl_map_apply_range(map1
, map2
);
6592 return isl_map_reverse(map1
);
6599 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
6600 __isl_take isl_map
*map2
)
6602 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
6605 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
6606 __isl_take isl_map
*map2
)
6608 isl_space
*dim_result
;
6609 struct isl_map
*result
;
6615 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
6616 isl_space_copy(map2
->dim
));
6618 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
6621 for (i
= 0; i
< map1
->n
; ++i
)
6622 for (j
= 0; j
< map2
->n
; ++j
) {
6623 result
= isl_map_add_basic_map(result
,
6624 isl_basic_map_apply_range(
6625 isl_basic_map_copy(map1
->p
[i
]),
6626 isl_basic_map_copy(map2
->p
[j
])));
6632 if (result
&& result
->n
<= 1)
6633 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
6641 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
6642 __isl_take isl_map
*map2
)
6644 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
6648 * returns range - domain
6650 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
6652 isl_space
*dims
, *target_dim
;
6653 struct isl_basic_set
*bset
;
6660 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
6661 bmap
->dim
, isl_dim_out
),
6663 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
6664 dim
= isl_basic_map_n_in(bmap
);
6665 nparam
= isl_basic_map_n_param(bmap
);
6666 bset
= isl_basic_set_from_basic_map(bmap
);
6667 bset
= isl_basic_set_cow(bset
);
6668 dims
= isl_basic_set_get_space(bset
);
6669 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
6670 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
6671 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
6672 for (i
= 0; i
< dim
; ++i
) {
6673 int j
= isl_basic_map_alloc_equality(
6674 (struct isl_basic_map
*)bset
);
6677 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
6678 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
6679 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
6680 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
6682 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
6683 bset
= isl_basic_set_reset_space(bset
, target_dim
);
6686 isl_basic_map_free(bmap
);
6691 * returns range - domain
6693 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
6697 struct isl_set
*result
;
6702 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
6703 map
->dim
, isl_dim_out
),
6705 dim
= isl_map_get_space(map
);
6706 dim
= isl_space_domain(dim
);
6707 result
= isl_set_alloc_space(dim
, map
->n
, 0);
6710 for (i
= 0; i
< map
->n
; ++i
)
6711 result
= isl_set_add_basic_set(result
,
6712 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
6721 * returns [domain -> range] -> range - domain
6723 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
6724 __isl_take isl_basic_map
*bmap
)
6728 isl_basic_map
*domain
;
6732 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
6733 isl_die(bmap
->ctx
, isl_error_invalid
,
6734 "domain and range don't match", goto error
);
6736 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6737 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
6739 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
6740 domain
= isl_basic_map_universe(dim
);
6742 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
6743 bmap
= isl_basic_map_apply_range(bmap
, domain
);
6744 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
6746 total
= isl_basic_map_total_dim(bmap
);
6748 for (i
= 0; i
< n
; ++i
) {
6749 k
= isl_basic_map_alloc_equality(bmap
);
6752 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
6753 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
6754 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
6755 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
6758 bmap
= isl_basic_map_gauss(bmap
, NULL
);
6759 return isl_basic_map_finalize(bmap
);
6761 isl_basic_map_free(bmap
);
6766 * returns [domain -> range] -> range - domain
6768 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
6771 isl_space
*domain_dim
;
6776 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
6777 isl_die(map
->ctx
, isl_error_invalid
,
6778 "domain and range don't match", goto error
);
6780 map
= isl_map_cow(map
);
6784 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
6785 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
6786 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
6789 for (i
= 0; i
< map
->n
; ++i
) {
6790 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
6794 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6801 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
6803 struct isl_basic_map
*bmap
;
6811 nparam
= dims
->nparam
;
6813 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
6817 for (i
= 0; i
< dim
; ++i
) {
6818 int j
= isl_basic_map_alloc_equality(bmap
);
6821 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6822 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
6823 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
6825 return isl_basic_map_finalize(bmap
);
6827 isl_basic_map_free(bmap
);
6831 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
6835 if (dim
->n_in
!= dim
->n_out
)
6836 isl_die(dim
->ctx
, isl_error_invalid
,
6837 "number of input and output dimensions needs to be "
6838 "the same", goto error
);
6839 return basic_map_identity(dim
);
6841 isl_space_free(dim
);
6845 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
6847 if (!model
|| !model
->dim
)
6849 return isl_basic_map_identity(isl_space_copy(model
->dim
));
6852 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
6854 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
6857 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
6859 if (!model
|| !model
->dim
)
6861 return isl_map_identity(isl_space_copy(model
->dim
));
6864 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
6866 if (!model
|| !model
->dim
)
6868 return isl_map_identity(isl_space_copy(model
->dim
));
6871 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
6873 isl_space
*dim
= isl_set_get_space(set
);
6875 id
= isl_map_identity(isl_space_map_from_set(dim
));
6876 return isl_map_intersect_range(id
, set
);
6879 /* Construct a basic set with all set dimensions having only non-negative
6882 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
6883 __isl_take isl_space
*space
)
6888 struct isl_basic_set
*bset
;
6892 nparam
= space
->nparam
;
6894 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
6897 for (i
= 0; i
< dim
; ++i
) {
6898 int k
= isl_basic_set_alloc_inequality(bset
);
6901 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
6902 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
6906 isl_basic_set_free(bset
);
6910 /* Construct the half-space x_pos >= 0.
6912 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
6916 isl_basic_set
*nonneg
;
6918 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6919 k
= isl_basic_set_alloc_inequality(nonneg
);
6922 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
6923 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
6925 return isl_basic_set_finalize(nonneg
);
6927 isl_basic_set_free(nonneg
);
6931 /* Construct the half-space x_pos <= -1.
6933 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
6938 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
6939 k
= isl_basic_set_alloc_inequality(neg
);
6942 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
6943 isl_int_set_si(neg
->ineq
[k
][0], -1);
6944 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
6946 return isl_basic_set_finalize(neg
);
6948 isl_basic_set_free(neg
);
6952 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
6953 enum isl_dim_type type
, unsigned first
, unsigned n
)
6956 isl_basic_set
*nonneg
;
6964 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
6966 for (i
= 0; i
< n
; ++i
) {
6967 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
6968 pos(set
->dim
, type
) + first
+ i
);
6969 neg
= neg_halfspace(isl_set_get_space(set
),
6970 pos(set
->dim
, type
) + first
+ i
);
6972 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
6981 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
6982 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
6989 if (isl_set_plain_is_empty(set
)) {
6994 return fn(set
, signs
, user
);
6997 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
6999 half
= isl_set_intersect(half
, isl_set_copy(set
));
7000 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7004 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7006 half
= isl_set_intersect(half
, set
);
7007 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7013 /* Call "fn" on the intersections of "set" with each of the orthants
7014 * (except for obviously empty intersections). The orthant is identified
7015 * by the signs array, with each entry having value 1 or -1 according
7016 * to the sign of the corresponding variable.
7018 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7019 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7029 if (isl_set_plain_is_empty(set
))
7032 nparam
= isl_set_dim(set
, isl_dim_param
);
7033 nvar
= isl_set_dim(set
, isl_dim_set
);
7035 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7037 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7045 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7047 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7050 int isl_basic_map_is_subset(
7051 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7054 struct isl_map
*map1
;
7055 struct isl_map
*map2
;
7057 if (!bmap1
|| !bmap2
)
7060 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7061 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7063 is_subset
= isl_map_is_subset(map1
, map2
);
7071 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7072 __isl_keep isl_basic_set
*bset2
)
7074 return isl_basic_map_is_subset(bset1
, bset2
);
7077 int isl_basic_map_is_equal(
7078 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7082 if (!bmap1
|| !bmap2
)
7084 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7087 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7091 int isl_basic_set_is_equal(
7092 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7094 return isl_basic_map_is_equal(
7095 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7098 int isl_map_is_empty(struct isl_map
*map
)
7105 for (i
= 0; i
< map
->n
; ++i
) {
7106 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7115 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7117 return map
? map
->n
== 0 : -1;
7120 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7122 return isl_map_plain_is_empty(map
);
7125 int isl_set_plain_is_empty(struct isl_set
*set
)
7127 return set
? set
->n
== 0 : -1;
7130 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7132 return isl_set_plain_is_empty(set
);
7135 int isl_set_is_empty(struct isl_set
*set
)
7137 return isl_map_is_empty((struct isl_map
*)set
);
7140 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7145 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7148 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7153 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7156 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7162 is_subset
= isl_map_is_subset(map1
, map2
);
7165 is_subset
= isl_map_is_subset(map2
, map1
);
7169 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7171 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7174 int isl_basic_map_is_strict_subset(
7175 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7179 if (!bmap1
|| !bmap2
)
7181 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7184 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7185 if (is_subset
== -1)
7190 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7196 is_subset
= isl_map_is_subset(map1
, map2
);
7199 is_subset
= isl_map_is_subset(map2
, map1
);
7200 if (is_subset
== -1)
7205 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7207 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7210 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7214 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7217 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7221 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7224 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7231 for (i
= 0; i
< map
->n
; ++i
) {
7232 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7240 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7242 return isl_map_plain_is_universe((isl_map
*) set
);
7245 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7247 return isl_set_plain_is_universe(set
);
7250 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7252 struct isl_basic_set
*bset
= NULL
;
7253 struct isl_vec
*sample
= NULL
;
7260 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7263 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7264 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7265 copy
= isl_basic_map_remove_redundancies(copy
);
7266 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
7267 isl_basic_map_free(copy
);
7271 total
= 1 + isl_basic_map_total_dim(bmap
);
7272 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7273 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7279 isl_vec_free(bmap
->sample
);
7280 bmap
->sample
= NULL
;
7281 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7284 sample
= isl_basic_set_sample_vec(bset
);
7287 empty
= sample
->size
== 0;
7288 isl_vec_free(bmap
->sample
);
7289 bmap
->sample
= sample
;
7291 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7296 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7300 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7303 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7305 return isl_basic_map_plain_is_empty(bmap
);
7308 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7312 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7315 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7317 return isl_basic_set_plain_is_empty(bset
);
7320 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7322 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7325 struct isl_map
*isl_basic_map_union(
7326 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7328 struct isl_map
*map
;
7329 if (!bmap1
|| !bmap2
)
7332 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7334 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7337 map
= isl_map_add_basic_map(map
, bmap1
);
7338 map
= isl_map_add_basic_map(map
, bmap2
);
7341 isl_basic_map_free(bmap1
);
7342 isl_basic_map_free(bmap2
);
7346 struct isl_set
*isl_basic_set_union(
7347 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7349 return (struct isl_set
*)isl_basic_map_union(
7350 (struct isl_basic_map
*)bset1
,
7351 (struct isl_basic_map
*)bset2
);
7354 /* Order divs such that any div only depends on previous divs */
7355 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7363 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7365 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7367 if (isl_int_is_zero(bmap
->div
[i
][0]))
7369 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7373 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7379 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7381 return (struct isl_basic_set
*)
7382 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7385 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7392 for (i
= 0; i
< map
->n
; ++i
) {
7393 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7404 /* Apply the expansion computed by isl_merge_divs.
7405 * The expansion itself is given by "exp" while the resulting
7406 * list of divs is given by "div".
7408 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7409 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7414 bset
= isl_basic_set_cow(bset
);
7418 if (div
->n_row
< bset
->n_div
)
7419 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
7420 "not an expansion", goto error
);
7422 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
7423 div
->n_row
- bset
->n_div
, 0,
7424 2 * (div
->n_row
- bset
->n_div
));
7426 n_div
= bset
->n_div
;
7427 for (i
= n_div
; i
< div
->n_row
; ++i
)
7428 if (isl_basic_set_alloc_div(bset
) < 0)
7432 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
7433 if (j
>= 0 && exp
[j
] == i
) {
7435 isl_basic_map_swap_div(bset
, i
, j
);
7438 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
7439 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
7447 isl_basic_set_free(bset
);
7452 /* Look for a div in dst that corresponds to the div "div" in src.
7453 * The divs before "div" in src and dst are assumed to be the same.
7455 * Returns -1 if no corresponding div was found and the position
7456 * of the corresponding div in dst otherwise.
7458 static int find_div(struct isl_basic_map
*dst
,
7459 struct isl_basic_map
*src
, unsigned div
)
7463 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7465 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
7466 for (i
= div
; i
< dst
->n_div
; ++i
)
7467 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
7468 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
7469 dst
->n_div
- div
) == -1)
7474 struct isl_basic_map
*isl_basic_map_align_divs(
7475 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
7478 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
7483 if (src
->n_div
== 0)
7486 for (i
= 0; i
< src
->n_div
; ++i
)
7487 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
7489 src
= isl_basic_map_order_divs(src
);
7490 dst
= isl_basic_map_cow(dst
);
7491 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
7492 src
->n_div
, 0, 2 * src
->n_div
);
7495 for (i
= 0; i
< src
->n_div
; ++i
) {
7496 int j
= find_div(dst
, src
, i
);
7498 j
= isl_basic_map_alloc_div(dst
);
7501 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
7502 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
7503 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
7507 isl_basic_map_swap_div(dst
, i
, j
);
7511 isl_basic_map_free(dst
);
7515 struct isl_basic_set
*isl_basic_set_align_divs(
7516 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
7518 return (struct isl_basic_set
*)isl_basic_map_align_divs(
7519 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
7522 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
7530 map
= isl_map_compute_divs(map
);
7531 map
= isl_map_cow(map
);
7535 for (i
= 1; i
< map
->n
; ++i
)
7536 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
7537 for (i
= 1; i
< map
->n
; ++i
)
7538 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
7540 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7544 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
7546 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
7549 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
7550 __isl_take isl_map
*map
)
7554 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
7555 map
= isl_map_intersect_domain(map
, set
);
7556 set
= isl_map_range(map
);
7564 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
7565 __isl_take isl_map
*map
)
7567 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
7570 /* There is no need to cow as removing empty parts doesn't change
7571 * the meaning of the set.
7573 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
7580 for (i
= map
->n
- 1; i
>= 0; --i
)
7581 remove_if_empty(map
, i
);
7586 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
7588 return (struct isl_set
*)
7589 isl_map_remove_empty_parts((struct isl_map
*)set
);
7592 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
7594 struct isl_basic_map
*bmap
;
7595 if (!map
|| map
->n
== 0)
7597 bmap
= map
->p
[map
->n
-1];
7598 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
7599 return isl_basic_map_copy(bmap
);
7602 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
7604 return (struct isl_basic_set
*)
7605 isl_map_copy_basic_map((struct isl_map
*)set
);
7608 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
7609 __isl_keep isl_basic_map
*bmap
)
7615 for (i
= map
->n
-1; i
>= 0; --i
) {
7616 if (map
->p
[i
] != bmap
)
7618 map
= isl_map_cow(map
);
7621 isl_basic_map_free(map
->p
[i
]);
7622 if (i
!= map
->n
-1) {
7623 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
7624 map
->p
[i
] = map
->p
[map
->n
-1];
7635 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
7636 struct isl_basic_set
*bset
)
7638 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
7639 (struct isl_basic_map
*)bset
);
7642 /* Given two basic sets bset1 and bset2, compute the maximal difference
7643 * between the values of dimension pos in bset1 and those in bset2
7644 * for any common value of the parameters and dimensions preceding pos.
7646 static enum isl_lp_result
basic_set_maximal_difference_at(
7647 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
7648 int pos
, isl_int
*opt
)
7651 struct isl_basic_map
*bmap1
= NULL
;
7652 struct isl_basic_map
*bmap2
= NULL
;
7653 struct isl_ctx
*ctx
;
7654 struct isl_vec
*obj
;
7657 unsigned dim1
, dim2
;
7658 enum isl_lp_result res
;
7660 if (!bset1
|| !bset2
)
7661 return isl_lp_error
;
7663 nparam
= isl_basic_set_n_param(bset1
);
7664 dim1
= isl_basic_set_n_dim(bset1
);
7665 dim2
= isl_basic_set_n_dim(bset2
);
7666 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
7667 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
7668 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
7669 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
7670 if (!bmap1
|| !bmap2
)
7672 bmap1
= isl_basic_map_cow(bmap1
);
7673 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
7674 pos
, (dim1
- pos
) + (dim2
- pos
),
7675 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
7676 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
7679 total
= isl_basic_map_total_dim(bmap1
);
7681 obj
= isl_vec_alloc(ctx
, 1 + total
);
7682 isl_seq_clr(obj
->block
.data
, 1 + total
);
7683 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
7684 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
7687 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
7689 isl_basic_map_free(bmap1
);
7693 isl_basic_map_free(bmap1
);
7694 isl_basic_map_free(bmap2
);
7695 return isl_lp_error
;
7698 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
7699 * for any common value of the parameters and dimensions preceding pos
7700 * in both basic sets, the values of dimension pos in bset1 are
7701 * smaller or larger than those in bset2.
7704 * 1 if bset1 follows bset2
7705 * -1 if bset1 precedes bset2
7706 * 0 if bset1 and bset2 are incomparable
7707 * -2 if some error occurred.
7709 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
7710 struct isl_basic_set
*bset2
, int pos
)
7713 enum isl_lp_result res
;
7718 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7720 if (res
== isl_lp_empty
)
7722 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7723 res
== isl_lp_unbounded
)
7725 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7734 /* Given two basic sets bset1 and bset2, check whether
7735 * for any common value of the parameters and dimensions preceding pos
7736 * there is a value of dimension pos in bset1 that is larger
7737 * than a value of the same dimension in bset2.
7740 * 1 if there exists such a pair
7741 * 0 if there is no such pair, but there is a pair of equal values
7743 * -2 if some error occurred.
7745 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
7746 __isl_keep isl_basic_set
*bset2
, int pos
)
7749 enum isl_lp_result res
;
7754 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
7756 if (res
== isl_lp_empty
)
7758 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
7759 res
== isl_lp_unbounded
)
7761 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
7763 else if (res
== isl_lp_ok
)
7772 /* Given two sets set1 and set2, check whether
7773 * for any common value of the parameters and dimensions preceding pos
7774 * there is a value of dimension pos in set1 that is larger
7775 * than a value of the same dimension in set2.
7778 * 1 if there exists such a pair
7779 * 0 if there is no such pair, but there is a pair of equal values
7781 * -2 if some error occurred.
7783 int isl_set_follows_at(__isl_keep isl_set
*set1
,
7784 __isl_keep isl_set
*set2
, int pos
)
7792 for (i
= 0; i
< set1
->n
; ++i
)
7793 for (j
= 0; j
< set2
->n
; ++j
) {
7795 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
7796 if (f
== 1 || f
== -2)
7805 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
7806 unsigned pos
, isl_int
*val
)
7814 total
= isl_basic_map_total_dim(bmap
);
7815 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
7816 for (; d
+1 > pos
; --d
)
7817 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
7821 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
7823 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
7825 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
7828 isl_int_neg(*val
, bmap
->eq
[i
][0]);
7834 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
7835 unsigned pos
, isl_int
*val
)
7847 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
7850 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
7851 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
7852 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
7853 if (fixed
== 1 && isl_int_ne(tmp
, v
))
7857 isl_int_set(*val
, v
);
7863 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
7864 unsigned pos
, isl_int
*val
)
7866 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
7870 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
7873 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
7876 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
7877 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7879 if (pos
>= isl_basic_map_dim(bmap
, type
))
7881 return isl_basic_map_plain_has_fixed_var(bmap
,
7882 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
7885 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
7886 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7888 if (pos
>= isl_map_dim(map
, type
))
7890 return isl_map_plain_has_fixed_var(map
,
7891 map_offset(map
, type
) - 1 + pos
, val
);
7894 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
7895 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7897 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
7900 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
7901 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
7903 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
7906 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7907 * then return this fixed value in *val.
7909 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
7910 unsigned dim
, isl_int
*val
)
7912 return isl_basic_set_plain_has_fixed_var(bset
,
7913 isl_basic_set_n_param(bset
) + dim
, val
);
7916 /* Check if dimension dim has fixed value and if so and if val is not NULL,
7917 * then return this fixed value in *val.
7919 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
7920 unsigned dim
, isl_int
*val
)
7922 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
7925 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
7926 unsigned dim
, isl_int
*val
)
7928 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
7931 /* Check if input variable in has fixed value and if so and if val is not NULL,
7932 * then return this fixed value in *val.
7934 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
7935 unsigned in
, isl_int
*val
)
7937 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
7940 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7941 * and if val is not NULL, then return this lower bound in *val.
7943 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7944 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
7946 int i
, i_eq
= -1, i_ineq
= -1;
7953 total
= isl_basic_set_total_dim(bset
);
7954 nparam
= isl_basic_set_n_param(bset
);
7955 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7956 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
7962 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7963 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
7965 if (i_eq
!= -1 || i_ineq
!= -1)
7969 if (i_eq
== -1 && i_ineq
== -1)
7971 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
7972 /* The coefficient should always be one due to normalization. */
7973 if (!isl_int_is_one(c
[1+nparam
+dim
]))
7975 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
7977 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
7978 total
- nparam
- dim
- 1) != -1)
7981 isl_int_neg(*val
, c
[0]);
7985 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
7986 unsigned dim
, isl_int
*val
)
7998 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8002 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8004 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8005 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8007 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8011 isl_int_set(*val
, v
);
8022 /* uset_gist depends on constraints without existentially quantified
8023 * variables sorting first.
8025 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8027 const struct constraint
*c1
= (const struct constraint
*)p1
;
8028 const struct constraint
*c2
= (const struct constraint
*)p2
;
8030 unsigned size
= isl_min(c1
->size
, c2
->size
);
8032 l1
= isl_seq_last_non_zero(c1
->c
, size
);
8033 l2
= isl_seq_last_non_zero(c2
->c
, size
);
8038 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
8041 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8042 struct isl_basic_map
*bmap
)
8045 struct constraint
*c
;
8050 total
= isl_basic_map_total_dim(bmap
);
8051 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8054 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8056 c
[i
].c
= bmap
->ineq
[i
];
8058 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8059 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8060 bmap
->ineq
[i
] = c
[i
].c
;
8064 isl_basic_map_free(bmap
);
8068 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8069 __isl_take isl_basic_set
*bset
)
8071 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8072 (struct isl_basic_map
*)bset
);
8075 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8079 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8081 bmap
= isl_basic_map_remove_redundancies(bmap
);
8082 bmap
= isl_basic_map_sort_constraints(bmap
);
8083 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8087 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8089 return (struct isl_basic_set
*)isl_basic_map_normalize(
8090 (struct isl_basic_map
*)bset
);
8093 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8094 const __isl_keep isl_basic_map
*bmap2
)
8101 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8102 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8103 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8104 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8105 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8106 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8107 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8108 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8109 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8110 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8111 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8113 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8115 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8117 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8118 return bmap1
->n_eq
- bmap2
->n_eq
;
8119 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8120 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8121 if (bmap1
->n_div
!= bmap2
->n_div
)
8122 return bmap1
->n_div
- bmap2
->n_div
;
8123 total
= isl_basic_map_total_dim(bmap1
);
8124 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8125 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8129 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8130 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8134 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8135 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8142 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8143 const __isl_keep isl_basic_set
*bset2
)
8145 return isl_basic_map_plain_cmp(bset1
, bset2
);
8148 int isl_set_plain_cmp(const __isl_keep isl_set
*set1
,
8149 const __isl_keep isl_set
*set2
)
8155 if (set1
->n
!= set2
->n
)
8156 return set1
->n
- set2
->n
;
8158 for (i
= 0; i
< set1
->n
; ++i
) {
8159 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8167 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8168 __isl_keep isl_basic_map
*bmap2
)
8170 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8173 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8174 __isl_keep isl_basic_set
*bset2
)
8176 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8177 (isl_basic_map
*)bset2
);
8180 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8182 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8183 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8185 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8188 /* We normalize in place, but if anything goes wrong we need
8189 * to return NULL, so we need to make sure we don't change the
8190 * meaning of any possible other copies of map.
8192 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8195 struct isl_basic_map
*bmap
;
8199 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8201 for (i
= 0; i
< map
->n
; ++i
) {
8202 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8205 isl_basic_map_free(map
->p
[i
]);
8208 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8209 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8210 map
= isl_map_remove_empty_parts(map
);
8213 for (i
= map
->n
- 1; i
>= 1; --i
) {
8214 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8216 isl_basic_map_free(map
->p
[i
-1]);
8217 for (j
= i
; j
< map
->n
; ++j
)
8218 map
->p
[j
-1] = map
->p
[j
];
8228 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8230 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8233 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8243 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8246 map1
= isl_map_copy(map1
);
8247 map2
= isl_map_copy(map2
);
8248 map1
= isl_map_normalize(map1
);
8249 map2
= isl_map_normalize(map2
);
8252 equal
= map1
->n
== map2
->n
;
8253 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8254 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8267 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8269 return isl_map_plain_is_equal(map1
, map2
);
8272 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8274 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8275 (struct isl_map
*)set2
);
8278 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8280 return isl_set_plain_is_equal(set1
, set2
);
8283 /* Return an interval that ranges from min to max (inclusive)
8285 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8286 isl_int min
, isl_int max
)
8289 struct isl_basic_set
*bset
= NULL
;
8291 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8295 k
= isl_basic_set_alloc_inequality(bset
);
8298 isl_int_set_si(bset
->ineq
[k
][1], 1);
8299 isl_int_neg(bset
->ineq
[k
][0], min
);
8301 k
= isl_basic_set_alloc_inequality(bset
);
8304 isl_int_set_si(bset
->ineq
[k
][1], -1);
8305 isl_int_set(bset
->ineq
[k
][0], max
);
8309 isl_basic_set_free(bset
);
8313 /* Return the Cartesian product of the basic sets in list (in the given order).
8315 __isl_give isl_basic_set
*isl_basic_set_list_product(
8316 __isl_take
struct isl_basic_set_list
*list
)
8324 struct isl_basic_set
*product
= NULL
;
8328 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8329 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8330 nparam
= isl_basic_set_n_param(list
->p
[0]);
8331 dim
= isl_basic_set_n_dim(list
->p
[0]);
8332 extra
= list
->p
[0]->n_div
;
8333 n_eq
= list
->p
[0]->n_eq
;
8334 n_ineq
= list
->p
[0]->n_ineq
;
8335 for (i
= 1; i
< list
->n
; ++i
) {
8336 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8337 isl_assert(list
->ctx
,
8338 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8339 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8340 extra
+= list
->p
[i
]->n_div
;
8341 n_eq
+= list
->p
[i
]->n_eq
;
8342 n_ineq
+= list
->p
[i
]->n_ineq
;
8344 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
8349 for (i
= 0; i
< list
->n
; ++i
) {
8350 isl_basic_set_add_constraints(product
,
8351 isl_basic_set_copy(list
->p
[i
]), dim
);
8352 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8354 isl_basic_set_list_free(list
);
8357 isl_basic_set_free(product
);
8358 isl_basic_set_list_free(list
);
8362 struct isl_basic_map
*isl_basic_map_product(
8363 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8365 isl_space
*dim_result
= NULL
;
8366 struct isl_basic_map
*bmap
;
8367 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
8368 struct isl_dim_map
*dim_map1
, *dim_map2
;
8370 if (!bmap1
|| !bmap2
)
8373 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
8374 bmap2
->dim
, isl_dim_param
), goto error
);
8375 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
8376 isl_space_copy(bmap2
->dim
));
8378 in1
= isl_basic_map_n_in(bmap1
);
8379 in2
= isl_basic_map_n_in(bmap2
);
8380 out1
= isl_basic_map_n_out(bmap1
);
8381 out2
= isl_basic_map_n_out(bmap2
);
8382 nparam
= isl_basic_map_n_param(bmap1
);
8384 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8385 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8386 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8387 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8388 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8389 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8390 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8391 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8392 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8393 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8394 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8396 bmap
= isl_basic_map_alloc_space(dim_result
,
8397 bmap1
->n_div
+ bmap2
->n_div
,
8398 bmap1
->n_eq
+ bmap2
->n_eq
,
8399 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8400 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8401 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8402 bmap
= isl_basic_map_simplify(bmap
);
8403 return isl_basic_map_finalize(bmap
);
8405 isl_basic_map_free(bmap1
);
8406 isl_basic_map_free(bmap2
);
8410 __isl_give isl_basic_map
*isl_basic_map_flat_product(
8411 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8413 isl_basic_map
*prod
;
8415 prod
= isl_basic_map_product(bmap1
, bmap2
);
8416 prod
= isl_basic_map_flatten(prod
);
8420 __isl_give isl_basic_set
*isl_basic_set_flat_product(
8421 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
8423 return isl_basic_map_flat_range_product(bset1
, bset2
);
8426 __isl_give isl_basic_map
*isl_basic_map_domain_product(
8427 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8429 isl_space
*space_result
= NULL
;
8430 isl_basic_map
*bmap
;
8431 unsigned in1
, in2
, out
, nparam
, total
, pos
;
8432 struct isl_dim_map
*dim_map1
, *dim_map2
;
8434 if (!bmap1
|| !bmap2
)
8437 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
8438 isl_space_copy(bmap2
->dim
));
8440 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8441 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
8442 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
8443 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
8445 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
8446 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8447 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8448 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8449 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8450 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8451 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
8452 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
8453 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
8454 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
8455 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8457 bmap
= isl_basic_map_alloc_space(space_result
,
8458 bmap1
->n_div
+ bmap2
->n_div
,
8459 bmap1
->n_eq
+ bmap2
->n_eq
,
8460 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8461 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8462 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8463 bmap
= isl_basic_map_simplify(bmap
);
8464 return isl_basic_map_finalize(bmap
);
8466 isl_basic_map_free(bmap1
);
8467 isl_basic_map_free(bmap2
);
8471 __isl_give isl_basic_map
*isl_basic_map_range_product(
8472 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8474 isl_space
*dim_result
= NULL
;
8475 isl_basic_map
*bmap
;
8476 unsigned in
, out1
, out2
, nparam
, total
, pos
;
8477 struct isl_dim_map
*dim_map1
, *dim_map2
;
8479 if (!bmap1
|| !bmap2
)
8482 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
8483 bmap2
->dim
, isl_dim_param
))
8484 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
8485 "parameters don't match", goto error
);
8487 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
8488 isl_space_copy(bmap2
->dim
));
8490 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
8491 out1
= isl_basic_map_n_out(bmap1
);
8492 out2
= isl_basic_map_n_out(bmap2
);
8493 nparam
= isl_basic_map_n_param(bmap1
);
8495 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
8496 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8497 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
8498 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
8499 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
8500 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
8501 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
8502 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
8503 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
8504 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
8505 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
8507 bmap
= isl_basic_map_alloc_space(dim_result
,
8508 bmap1
->n_div
+ bmap2
->n_div
,
8509 bmap1
->n_eq
+ bmap2
->n_eq
,
8510 bmap1
->n_ineq
+ bmap2
->n_ineq
);
8511 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
8512 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
8513 bmap
= isl_basic_map_simplify(bmap
);
8514 return isl_basic_map_finalize(bmap
);
8516 isl_basic_map_free(bmap1
);
8517 isl_basic_map_free(bmap2
);
8521 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
8522 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
8524 isl_basic_map
*prod
;
8526 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
8527 prod
= isl_basic_map_flatten_range(prod
);
8531 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
8532 __isl_take isl_map
*map2
,
8533 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
8534 __isl_take isl_space
*right
),
8535 __isl_give isl_basic_map
*(*basic_map_product
)(
8536 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
8539 struct isl_map
*result
;
8545 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
8546 map2
->dim
, isl_dim_param
), goto error
);
8548 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
8549 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
8550 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
8552 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
8553 isl_space_copy(map2
->dim
)),
8554 map1
->n
* map2
->n
, flags
);
8557 for (i
= 0; i
< map1
->n
; ++i
)
8558 for (j
= 0; j
< map2
->n
; ++j
) {
8559 struct isl_basic_map
*part
;
8560 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
8561 isl_basic_map_copy(map2
->p
[j
]));
8562 if (isl_basic_map_is_empty(part
))
8563 isl_basic_map_free(part
);
8565 result
= isl_map_add_basic_map(result
, part
);
8578 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
8580 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
8581 __isl_take isl_map
*map2
)
8583 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
8586 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
8587 __isl_take isl_map
*map2
)
8589 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
8592 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
8594 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
8595 __isl_take isl_map
*map2
)
8599 prod
= isl_map_product(map1
, map2
);
8600 prod
= isl_map_flatten(prod
);
8604 /* Given two set A and B, construct its Cartesian product A x B.
8606 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
8608 return isl_map_range_product(set1
, set2
);
8611 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
8612 __isl_take isl_set
*set2
)
8614 return isl_map_flat_range_product(set1
, set2
);
8617 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
8619 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
8620 __isl_take isl_map
*map2
)
8622 return map_product(map1
, map2
, &isl_space_domain_product
,
8623 &isl_basic_map_domain_product
);
8626 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
8628 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
8629 __isl_take isl_map
*map2
)
8631 return map_product(map1
, map2
, &isl_space_range_product
,
8632 &isl_basic_map_range_product
);
8635 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
8636 __isl_take isl_map
*map2
)
8638 return isl_map_align_params_map_map_and(map1
, map2
,
8639 &map_domain_product_aligned
);
8642 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
8643 __isl_take isl_map
*map2
)
8645 return isl_map_align_params_map_map_and(map1
, map2
,
8646 &map_range_product_aligned
);
8649 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
8651 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
8652 __isl_take isl_map
*map2
)
8656 prod
= isl_map_domain_product(map1
, map2
);
8657 prod
= isl_map_flatten_domain(prod
);
8661 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
8663 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
8664 __isl_take isl_map
*map2
)
8668 prod
= isl_map_range_product(map1
, map2
);
8669 prod
= isl_map_flatten_range(prod
);
8673 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
8676 uint32_t hash
= isl_hash_init();
8681 bmap
= isl_basic_map_copy(bmap
);
8682 bmap
= isl_basic_map_normalize(bmap
);
8685 total
= isl_basic_map_total_dim(bmap
);
8686 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
8687 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
8689 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
8690 isl_hash_hash(hash
, c_hash
);
8692 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
8693 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8695 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
8696 isl_hash_hash(hash
, c_hash
);
8698 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
8699 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8701 if (isl_int_is_zero(bmap
->div
[i
][0]))
8703 isl_hash_byte(hash
, i
& 0xFF);
8704 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
8705 isl_hash_hash(hash
, c_hash
);
8707 isl_basic_map_free(bmap
);
8711 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
8713 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
8716 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
8723 map
= isl_map_copy(map
);
8724 map
= isl_map_normalize(map
);
8728 hash
= isl_hash_init();
8729 for (i
= 0; i
< map
->n
; ++i
) {
8731 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
8732 isl_hash_hash(hash
, bmap_hash
);
8740 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
8742 return isl_map_get_hash((isl_map
*)set
);
8745 /* Check if the value for dimension dim is completely determined
8746 * by the values of the other parameters and variables.
8747 * That is, check if dimension dim is involved in an equality.
8749 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
8756 nparam
= isl_basic_set_n_param(bset
);
8757 for (i
= 0; i
< bset
->n_eq
; ++i
)
8758 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
8763 /* Check if the value for dimension dim is completely determined
8764 * by the values of the other parameters and variables.
8765 * That is, check if dimension dim is involved in an equality
8766 * for each of the subsets.
8768 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
8774 for (i
= 0; i
< set
->n
; ++i
) {
8776 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
8783 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
8785 return set
? set
->n
: 0;
8788 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
8789 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
8796 for (i
= 0; i
< map
->n
; ++i
)
8797 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
8803 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
8804 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
8811 for (i
= 0; i
< set
->n
; ++i
)
8812 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
8818 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
8825 bset
= isl_basic_set_cow(bset
);
8829 dim
= isl_basic_set_get_space(bset
);
8830 dim
= isl_space_lift(dim
, bset
->n_div
);
8833 isl_space_free(bset
->dim
);
8835 bset
->extra
-= bset
->n_div
;
8838 bset
= isl_basic_set_finalize(bset
);
8842 isl_basic_set_free(bset
);
8846 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
8852 set
= isl_set_align_divs(set
);
8857 set
= isl_set_cow(set
);
8861 n_div
= set
->p
[0]->n_div
;
8862 dim
= isl_set_get_space(set
);
8863 dim
= isl_space_lift(dim
, n_div
);
8866 isl_space_free(set
->dim
);
8869 for (i
= 0; i
< set
->n
; ++i
) {
8870 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
8881 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
8884 struct isl_basic_map
*bmap
;
8891 set
= isl_set_align_divs(set
);
8896 dim
= isl_set_get_space(set
);
8897 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
8899 return isl_map_identity(isl_space_map_from_set(dim
));
8902 n_div
= set
->p
[0]->n_div
;
8903 dim
= isl_space_map_from_set(dim
);
8904 n_param
= isl_space_dim(dim
, isl_dim_param
);
8905 n_set
= isl_space_dim(dim
, isl_dim_in
);
8906 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
8907 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
8908 for (i
= 0; i
< n_set
; ++i
)
8909 bmap
= var_equal(bmap
, i
);
8911 total
= n_param
+ n_set
+ n_set
+ n_div
;
8912 for (i
= 0; i
< n_div
; ++i
) {
8913 k
= isl_basic_map_alloc_inequality(bmap
);
8916 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
8917 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
8918 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
8919 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
8920 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
8921 set
->p
[0]->div
[i
][0]);
8923 l
= isl_basic_map_alloc_inequality(bmap
);
8926 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
8927 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
8928 set
->p
[0]->div
[i
][0]);
8929 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
8933 bmap
= isl_basic_map_simplify(bmap
);
8934 bmap
= isl_basic_map_finalize(bmap
);
8935 return isl_map_from_basic_map(bmap
);
8938 isl_basic_map_free(bmap
);
8942 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
8950 dim
= isl_basic_set_total_dim(bset
);
8951 size
+= bset
->n_eq
* (1 + dim
);
8952 size
+= bset
->n_ineq
* (1 + dim
);
8953 size
+= bset
->n_div
* (2 + dim
);
8958 int isl_set_size(__isl_keep isl_set
*set
)
8966 for (i
= 0; i
< set
->n
; ++i
)
8967 size
+= isl_basic_set_size(set
->p
[i
]);
8972 /* Check if there is any lower bound (if lower == 0) and/or upper
8973 * bound (if upper == 0) on the specified dim.
8975 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
8976 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
8983 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
8985 pos
+= isl_basic_map_offset(bmap
, type
);
8987 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8988 if (isl_int_is_zero(bmap
->div
[i
][0]))
8990 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
8994 for (i
= 0; i
< bmap
->n_eq
; ++i
)
8995 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
8998 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8999 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9006 return lower
&& upper
;
9009 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9010 enum isl_dim_type type
, unsigned pos
)
9012 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9015 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9016 enum isl_dim_type type
, unsigned pos
)
9018 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9021 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9022 enum isl_dim_type type
, unsigned pos
)
9024 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9027 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9028 enum isl_dim_type type
, unsigned pos
)
9035 for (i
= 0; i
< map
->n
; ++i
) {
9037 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9038 if (bounded
< 0 || !bounded
)
9045 /* Return 1 if the specified dim is involved in both an upper bound
9046 * and a lower bound.
9048 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9049 enum isl_dim_type type
, unsigned pos
)
9051 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9054 static int has_any_bound(__isl_keep isl_map
*map
,
9055 enum isl_dim_type type
, unsigned pos
,
9056 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9057 enum isl_dim_type type
, unsigned pos
))
9064 for (i
= 0; i
< map
->n
; ++i
) {
9066 bounded
= fn(map
->p
[i
], type
, pos
);
9067 if (bounded
< 0 || bounded
)
9074 /* Return 1 if the specified dim is involved in any lower bound.
9076 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9077 enum isl_dim_type type
, unsigned pos
)
9079 return has_any_bound(set
, type
, pos
,
9080 &isl_basic_map_dim_has_lower_bound
);
9083 /* Return 1 if the specified dim is involved in any upper bound.
9085 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9086 enum isl_dim_type type
, unsigned pos
)
9088 return has_any_bound(set
, type
, pos
,
9089 &isl_basic_map_dim_has_upper_bound
);
9092 /* For each of the "n" variables starting at "first", determine
9093 * the sign of the variable and put the results in the first "n"
9094 * elements of the array "signs".
9096 * 1 means that the variable is non-negative
9097 * -1 means that the variable is non-positive
9098 * 0 means the variable attains both positive and negative values.
9100 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9101 unsigned first
, unsigned n
, int *signs
)
9103 isl_vec
*bound
= NULL
;
9104 struct isl_tab
*tab
= NULL
;
9105 struct isl_tab_undo
*snap
;
9108 if (!bset
|| !signs
)
9111 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9112 tab
= isl_tab_from_basic_set(bset
, 0);
9116 isl_seq_clr(bound
->el
, bound
->size
);
9117 isl_int_set_si(bound
->el
[0], -1);
9119 snap
= isl_tab_snap(tab
);
9120 for (i
= 0; i
< n
; ++i
) {
9123 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9124 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9127 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9128 if (isl_tab_rollback(tab
, snap
) < 0)
9136 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9137 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9140 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9141 if (isl_tab_rollback(tab
, snap
) < 0)
9144 signs
[i
] = empty
? -1 : 0;
9148 isl_vec_free(bound
);
9152 isl_vec_free(bound
);
9156 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9157 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9159 if (!bset
|| !signs
)
9161 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9164 first
+= pos(bset
->dim
, type
) - 1;
9165 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9168 /* Check if the given basic map is obviously single-valued.
9169 * In particular, for each output dimension, check that there is
9170 * an equality that defines the output dimension in terms of
9171 * earlier dimensions.
9173 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9183 total
= 1 + isl_basic_map_total_dim(bmap
);
9184 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9185 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9187 for (i
= 0; i
< n_out
; ++i
) {
9188 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9189 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9191 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9192 total
- (o_out
+ i
+ 1)) == -1)
9195 if (j
>= bmap
->n_eq
)
9202 /* Check if the given basic map is single-valued.
9207 * and check if the result is a subset of the identity mapping.
9209 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9212 isl_basic_map
*test
;
9216 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9220 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9221 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9223 space
= isl_basic_map_get_space(bmap
);
9224 space
= isl_space_map_from_set(isl_space_range(space
));
9225 id
= isl_basic_map_identity(space
);
9227 sv
= isl_basic_map_is_subset(test
, id
);
9229 isl_basic_map_free(test
);
9230 isl_basic_map_free(id
);
9235 /* Check if the given map is obviously single-valued.
9237 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9246 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9249 /* Check if the given map is single-valued.
9254 * and check if the result is a subset of the identity mapping.
9256 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9263 sv
= isl_map_plain_is_single_valued(map
);
9267 test
= isl_map_reverse(isl_map_copy(map
));
9268 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9270 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9271 id
= isl_map_identity(dim
);
9273 sv
= isl_map_is_subset(test
, id
);
9281 int isl_map_is_injective(__isl_keep isl_map
*map
)
9285 map
= isl_map_copy(map
);
9286 map
= isl_map_reverse(map
);
9287 in
= isl_map_is_single_valued(map
);
9293 /* Check if the given map is obviously injective.
9295 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9299 map
= isl_map_copy(map
);
9300 map
= isl_map_reverse(map
);
9301 in
= isl_map_plain_is_single_valued(map
);
9307 int isl_map_is_bijective(__isl_keep isl_map
*map
)
9311 sv
= isl_map_is_single_valued(map
);
9315 return isl_map_is_injective(map
);
9318 int isl_set_is_singleton(__isl_keep isl_set
*set
)
9320 return isl_map_is_single_valued((isl_map
*)set
);
9323 int isl_map_is_translation(__isl_keep isl_map
*map
)
9328 delta
= isl_map_deltas(isl_map_copy(map
));
9329 ok
= isl_set_is_singleton(delta
);
9330 isl_set_free(delta
);
9335 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
9337 if (isl_seq_first_non_zero(p
, pos
) != -1)
9339 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
9344 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
9353 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
9356 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
9357 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
9358 for (j
= 0; j
< nvar
; ++j
) {
9359 int lower
= 0, upper
= 0;
9360 for (i
= 0; i
< bset
->n_eq
; ++i
) {
9361 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
9363 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
9369 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
9370 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
9372 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
9374 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
9379 if (!lower
|| !upper
)
9386 int isl_set_is_box(__isl_keep isl_set
*set
)
9393 return isl_basic_set_is_box(set
->p
[0]);
9396 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
9401 return isl_space_is_wrapping(bset
->dim
);
9404 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
9409 return isl_space_is_wrapping(set
->dim
);
9412 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
9414 bmap
= isl_basic_map_cow(bmap
);
9418 bmap
->dim
= isl_space_wrap(bmap
->dim
);
9422 bmap
= isl_basic_map_finalize(bmap
);
9424 return (isl_basic_set
*)bmap
;
9426 isl_basic_map_free(bmap
);
9430 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
9434 map
= isl_map_cow(map
);
9438 for (i
= 0; i
< map
->n
; ++i
) {
9439 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
9443 map
->dim
= isl_space_wrap(map
->dim
);
9447 return (isl_set
*)map
;
9453 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
9455 bset
= isl_basic_set_cow(bset
);
9459 bset
->dim
= isl_space_unwrap(bset
->dim
);
9463 bset
= isl_basic_set_finalize(bset
);
9465 return (isl_basic_map
*)bset
;
9467 isl_basic_set_free(bset
);
9471 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
9478 if (!isl_set_is_wrapping(set
))
9479 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
9482 set
= isl_set_cow(set
);
9486 for (i
= 0; i
< set
->n
; ++i
) {
9487 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
9492 set
->dim
= isl_space_unwrap(set
->dim
);
9496 return (isl_map
*)set
;
9502 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
9503 enum isl_dim_type type
)
9508 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
9511 bmap
= isl_basic_map_cow(bmap
);
9515 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
9519 bmap
= isl_basic_map_finalize(bmap
);
9523 isl_basic_map_free(bmap
);
9527 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
9528 enum isl_dim_type type
)
9535 if (!isl_space_is_named_or_nested(map
->dim
, type
))
9538 map
= isl_map_cow(map
);
9542 for (i
= 0; i
< map
->n
; ++i
) {
9543 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
9547 map
->dim
= isl_space_reset(map
->dim
, type
);
9557 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
9562 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
9565 bmap
= isl_basic_map_cow(bmap
);
9569 bmap
->dim
= isl_space_flatten(bmap
->dim
);
9573 bmap
= isl_basic_map_finalize(bmap
);
9577 isl_basic_map_free(bmap
);
9581 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
9583 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
9586 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
9587 __isl_take isl_basic_map
*bmap
)
9592 if (!bmap
->dim
->nested
[0])
9595 bmap
= isl_basic_map_cow(bmap
);
9599 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
9603 bmap
= isl_basic_map_finalize(bmap
);
9607 isl_basic_map_free(bmap
);
9611 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
9612 __isl_take isl_basic_map
*bmap
)
9617 if (!bmap
->dim
->nested
[1])
9620 bmap
= isl_basic_map_cow(bmap
);
9624 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
9628 bmap
= isl_basic_map_finalize(bmap
);
9632 isl_basic_map_free(bmap
);
9636 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
9643 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
9646 map
= isl_map_cow(map
);
9650 for (i
= 0; i
< map
->n
; ++i
) {
9651 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
9655 map
->dim
= isl_space_flatten(map
->dim
);
9665 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
9667 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
9670 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
9672 isl_space
*dim
, *flat_dim
;
9675 dim
= isl_set_get_space(set
);
9676 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
9677 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
9678 map
= isl_map_intersect_domain(map
, set
);
9683 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
9690 if (!map
->dim
->nested
[0])
9693 map
= isl_map_cow(map
);
9697 for (i
= 0; i
< map
->n
; ++i
) {
9698 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
9702 map
->dim
= isl_space_flatten_domain(map
->dim
);
9712 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
9719 if (!map
->dim
->nested
[1])
9722 map
= isl_map_cow(map
);
9726 for (i
= 0; i
< map
->n
; ++i
) {
9727 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
9731 map
->dim
= isl_space_flatten_range(map
->dim
);
9741 /* Reorder the dimensions of "bmap" according to the given dim_map
9742 * and set the dimension specification to "dim".
9744 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
9745 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
9750 bmap
= isl_basic_map_cow(bmap
);
9751 if (!bmap
|| !dim
|| !dim_map
)
9754 flags
= bmap
->flags
;
9755 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
9756 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
9757 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
9758 res
= isl_basic_map_alloc_space(dim
,
9759 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
9760 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
9763 res
= isl_basic_map_finalize(res
);
9767 isl_basic_map_free(bmap
);
9768 isl_space_free(dim
);
9772 /* Reorder the dimensions of "map" according to given reordering.
9774 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
9775 __isl_take isl_reordering
*r
)
9778 struct isl_dim_map
*dim_map
;
9780 map
= isl_map_cow(map
);
9781 dim_map
= isl_dim_map_from_reordering(r
);
9782 if (!map
|| !r
|| !dim_map
)
9785 for (i
= 0; i
< map
->n
; ++i
) {
9786 struct isl_dim_map
*dim_map_i
;
9788 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
9790 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
9791 isl_space_copy(r
->dim
), dim_map_i
);
9797 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
9799 isl_reordering_free(r
);
9805 isl_reordering_free(r
);
9809 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
9810 __isl_take isl_reordering
*r
)
9812 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
9815 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
9816 __isl_take isl_space
*model
)
9823 ctx
= isl_space_get_ctx(model
);
9824 if (!isl_space_has_named_params(model
))
9825 isl_die(ctx
, isl_error_invalid
,
9826 "model has unnamed parameters", goto error
);
9827 if (!isl_space_has_named_params(map
->dim
))
9828 isl_die(ctx
, isl_error_invalid
,
9829 "relation has unnamed parameters", goto error
);
9830 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
9831 isl_reordering
*exp
;
9833 model
= isl_space_drop_dims(model
, isl_dim_in
,
9834 0, isl_space_dim(model
, isl_dim_in
));
9835 model
= isl_space_drop_dims(model
, isl_dim_out
,
9836 0, isl_space_dim(model
, isl_dim_out
));
9837 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
9838 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
9839 map
= isl_map_realign(map
, exp
);
9842 isl_space_free(model
);
9845 isl_space_free(model
);
9850 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
9851 __isl_take isl_space
*model
)
9853 return isl_map_align_params(set
, model
);
9856 /* Align the parameters of "bmap" to those of "model", introducing
9857 * additional parameters if needed.
9859 __isl_give isl_basic_map
*isl_basic_map_align_params(
9860 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
9864 if (!bmap
|| !model
)
9867 ctx
= isl_space_get_ctx(model
);
9868 if (!isl_space_has_named_params(model
))
9869 isl_die(ctx
, isl_error_invalid
,
9870 "model has unnamed parameters", goto error
);
9871 if (!isl_space_has_named_params(bmap
->dim
))
9872 isl_die(ctx
, isl_error_invalid
,
9873 "relation has unnamed parameters", goto error
);
9874 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
9875 isl_reordering
*exp
;
9876 struct isl_dim_map
*dim_map
;
9878 model
= isl_space_drop_dims(model
, isl_dim_in
,
9879 0, isl_space_dim(model
, isl_dim_in
));
9880 model
= isl_space_drop_dims(model
, isl_dim_out
,
9881 0, isl_space_dim(model
, isl_dim_out
));
9882 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
9883 exp
= isl_reordering_extend_space(exp
,
9884 isl_basic_map_get_space(bmap
));
9885 dim_map
= isl_dim_map_from_reordering(exp
);
9886 bmap
= isl_basic_map_realign(bmap
,
9887 exp
? isl_space_copy(exp
->dim
) : NULL
,
9888 isl_dim_map_extend(dim_map
, bmap
));
9889 isl_reordering_free(exp
);
9893 isl_space_free(model
);
9896 isl_space_free(model
);
9897 isl_basic_map_free(bmap
);
9901 /* Align the parameters of "bset" to those of "model", introducing
9902 * additional parameters if needed.
9904 __isl_give isl_basic_set
*isl_basic_set_align_params(
9905 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
9907 return isl_basic_map_align_params(bset
, model
);
9910 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
9911 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9912 enum isl_dim_type c2
, enum isl_dim_type c3
,
9913 enum isl_dim_type c4
, enum isl_dim_type c5
)
9915 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9916 struct isl_mat
*mat
;
9922 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
9923 isl_basic_map_total_dim(bmap
) + 1);
9926 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9927 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9928 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9929 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9930 isl_int_set(mat
->row
[i
][pos
],
9931 bmap
->eq
[i
][off
+ k
]);
9939 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
9940 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
9941 enum isl_dim_type c2
, enum isl_dim_type c3
,
9942 enum isl_dim_type c4
, enum isl_dim_type c5
)
9944 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9945 struct isl_mat
*mat
;
9951 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
9952 isl_basic_map_total_dim(bmap
) + 1);
9955 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
9956 for (j
= 0, pos
= 0; j
< 5; ++j
) {
9957 int off
= isl_basic_map_offset(bmap
, c
[j
]);
9958 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
9959 isl_int_set(mat
->row
[i
][pos
],
9960 bmap
->ineq
[i
][off
+ k
]);
9968 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
9969 __isl_take isl_space
*dim
,
9970 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
9971 enum isl_dim_type c2
, enum isl_dim_type c3
,
9972 enum isl_dim_type c4
, enum isl_dim_type c5
)
9974 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
9975 isl_basic_map
*bmap
;
9981 if (!dim
|| !eq
|| !ineq
)
9984 if (eq
->n_col
!= ineq
->n_col
)
9985 isl_die(dim
->ctx
, isl_error_invalid
,
9986 "equalities and inequalities matrices should have "
9987 "same number of columns", goto error
);
9989 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
9991 if (eq
->n_col
< total
)
9992 isl_die(dim
->ctx
, isl_error_invalid
,
9993 "number of columns too small", goto error
);
9995 extra
= eq
->n_col
- total
;
9997 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
9998 eq
->n_row
, ineq
->n_row
);
10001 for (i
= 0; i
< extra
; ++i
) {
10002 k
= isl_basic_map_alloc_div(bmap
);
10005 isl_int_set_si(bmap
->div
[k
][0], 0);
10007 for (i
= 0; i
< eq
->n_row
; ++i
) {
10008 l
= isl_basic_map_alloc_equality(bmap
);
10011 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10012 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10013 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10014 isl_int_set(bmap
->eq
[l
][off
+ k
],
10020 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10021 l
= isl_basic_map_alloc_inequality(bmap
);
10024 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10025 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10026 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10027 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10028 ineq
->row
[i
][pos
]);
10034 isl_space_free(dim
);
10036 isl_mat_free(ineq
);
10040 isl_space_free(dim
);
10042 isl_mat_free(ineq
);
10046 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10047 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10048 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10050 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10051 c1
, c2
, c3
, c4
, isl_dim_in
);
10054 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10055 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10056 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10058 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10059 c1
, c2
, c3
, c4
, isl_dim_in
);
10062 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10063 __isl_take isl_space
*dim
,
10064 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10065 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10067 return (isl_basic_set
*)
10068 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10069 c1
, c2
, c3
, c4
, isl_dim_in
);
10072 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10077 return isl_space_can_zip(bmap
->dim
);
10080 int isl_map_can_zip(__isl_keep isl_map
*map
)
10085 return isl_space_can_zip(map
->dim
);
10088 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10089 * (A -> C) -> (B -> D).
10091 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10100 if (!isl_basic_map_can_zip(bmap
))
10101 isl_die(bmap
->ctx
, isl_error_invalid
,
10102 "basic map cannot be zipped", goto error
);
10103 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10104 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10105 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10106 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10107 bmap
= isl_basic_map_cow(bmap
);
10108 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10111 bmap
->dim
= isl_space_zip(bmap
->dim
);
10116 isl_basic_map_free(bmap
);
10120 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10121 * (A -> C) -> (B -> D).
10123 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10130 if (!isl_map_can_zip(map
))
10131 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10134 map
= isl_map_cow(map
);
10138 for (i
= 0; i
< map
->n
; ++i
) {
10139 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10144 map
->dim
= isl_space_zip(map
->dim
);
10154 /* Can we apply isl_basic_map_curry to "bmap"?
10155 * That is, does it have a nested relation in its domain?
10157 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10162 return isl_space_can_curry(bmap
->dim
);
10165 /* Can we apply isl_map_curry to "map"?
10166 * That is, does it have a nested relation in its domain?
10168 int isl_map_can_curry(__isl_keep isl_map
*map
)
10173 return isl_space_can_curry(map
->dim
);
10176 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10179 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10185 if (!isl_basic_map_can_curry(bmap
))
10186 isl_die(bmap
->ctx
, isl_error_invalid
,
10187 "basic map cannot be curried", goto error
);
10188 bmap
->dim
= isl_space_curry(bmap
->dim
);
10193 isl_basic_map_free(bmap
);
10197 /* Given a map (A -> B) -> C, return the corresponding map
10200 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10207 if (!isl_map_can_curry(map
))
10208 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10211 map
= isl_map_cow(map
);
10215 for (i
= 0; i
< map
->n
; ++i
) {
10216 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10221 map
->dim
= isl_space_curry(map
->dim
);
10231 /* Construct a basic map mapping the domain of the affine expression
10232 * to a one-dimensional range prescribed by the affine expression.
10234 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
10238 isl_local_space
*ls
;
10239 isl_basic_map
*bmap
;
10244 ls
= isl_aff_get_local_space(aff
);
10245 bmap
= isl_basic_map_from_local_space(ls
);
10246 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
10247 k
= isl_basic_map_alloc_equality(bmap
);
10251 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
10252 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
10253 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
10254 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
10255 aff
->v
->size
- (pos
+ 1));
10258 bmap
= isl_basic_map_finalize(bmap
);
10262 isl_basic_map_free(bmap
);
10266 /* Construct a map mapping the domain of the affine expression
10267 * to a one-dimensional range prescribed by the affine expression.
10269 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
10271 isl_basic_map
*bmap
;
10273 bmap
= isl_basic_map_from_aff(aff
);
10274 return isl_map_from_basic_map(bmap
);
10277 /* Construct a basic map mapping the domain the multi-affine expression
10278 * to its range, with each dimension in the range equated to the
10279 * corresponding affine expression.
10281 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
10282 __isl_take isl_multi_aff
*maff
)
10286 isl_basic_map
*bmap
;
10291 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
10292 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
10293 "invalid space", return isl_multi_aff_free(maff
));
10295 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
10296 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
10298 for (i
= 0; i
< maff
->n
; ++i
) {
10300 isl_basic_map
*bmap_i
;
10302 aff
= isl_aff_copy(maff
->p
[i
]);
10303 bmap_i
= isl_basic_map_from_aff(aff
);
10305 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10308 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
10310 isl_multi_aff_free(maff
);
10314 /* Construct a map mapping the domain the multi-affine expression
10315 * to its range, with each dimension in the range equated to the
10316 * corresponding affine expression.
10318 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
10320 isl_basic_map
*bmap
;
10322 bmap
= isl_basic_map_from_multi_aff(maff
);
10323 return isl_map_from_basic_map(bmap
);
10326 /* Construct a basic map mapping a domain in the given space to
10327 * to an n-dimensional range, with n the number of elements in the list,
10328 * where each coordinate in the range is prescribed by the
10329 * corresponding affine expression.
10330 * The domains of all affine expressions in the list are assumed to match
10333 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
10334 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
10338 isl_basic_map
*bmap
;
10343 dim
= isl_space_from_domain(domain_dim
);
10344 bmap
= isl_basic_map_universe(dim
);
10346 for (i
= 0; i
< list
->n
; ++i
) {
10348 isl_basic_map
*bmap_i
;
10350 aff
= isl_aff_copy(list
->p
[i
]);
10351 bmap_i
= isl_basic_map_from_aff(aff
);
10353 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
10356 isl_aff_list_free(list
);
10360 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
10361 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10363 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
10366 /* Construct a basic map where the given dimensions are equal to each other.
10368 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
10369 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10371 isl_basic_map
*bmap
= NULL
;
10377 if (pos1
>= isl_space_dim(space
, type1
))
10378 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10379 "index out of bounds", goto error
);
10380 if (pos2
>= isl_space_dim(space
, type2
))
10381 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
10382 "index out of bounds", goto error
);
10384 if (type1
== type2
&& pos1
== pos2
)
10385 return isl_basic_map_universe(space
);
10387 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
10388 i
= isl_basic_map_alloc_equality(bmap
);
10391 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10392 pos1
+= isl_basic_map_offset(bmap
, type1
);
10393 pos2
+= isl_basic_map_offset(bmap
, type2
);
10394 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
10395 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10396 bmap
= isl_basic_map_finalize(bmap
);
10397 isl_space_free(space
);
10400 isl_space_free(space
);
10401 isl_basic_map_free(bmap
);
10405 /* Add a constraint imposing that the given two dimensions are equal.
10407 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
10408 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10412 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
10414 bmap
= isl_basic_map_intersect(bmap
, eq
);
10419 /* Add a constraint imposing that the given two dimensions are equal.
10421 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
10422 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10424 isl_basic_map
*bmap
;
10426 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
10428 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10433 /* Add a constraint imposing that the given two dimensions have opposite values.
10435 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
10436 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10438 isl_basic_map
*bmap
= NULL
;
10444 if (pos1
>= isl_map_dim(map
, type1
))
10445 isl_die(map
->ctx
, isl_error_invalid
,
10446 "index out of bounds", goto error
);
10447 if (pos2
>= isl_map_dim(map
, type2
))
10448 isl_die(map
->ctx
, isl_error_invalid
,
10449 "index out of bounds", goto error
);
10451 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
10452 i
= isl_basic_map_alloc_equality(bmap
);
10455 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10456 pos1
+= isl_basic_map_offset(bmap
, type1
);
10457 pos2
+= isl_basic_map_offset(bmap
, type2
);
10458 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
10459 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
10460 bmap
= isl_basic_map_finalize(bmap
);
10462 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10466 isl_basic_map_free(bmap
);
10471 /* Add a constraint imposing that the value of the first dimension is
10472 * greater than or equal to that of the second.
10474 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
10475 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10478 isl_local_space
*ls
;
10483 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
10484 isl_die(bmap
->ctx
, isl_error_invalid
,
10485 "index out of bounds", return isl_basic_map_free(bmap
));
10486 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
10487 isl_die(bmap
->ctx
, isl_error_invalid
,
10488 "index out of bounds", return isl_basic_map_free(bmap
));
10490 if (type1
== type2
&& pos1
== pos2
)
10493 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
10494 c
= isl_inequality_alloc(ls
);
10495 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
10496 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
10497 bmap
= isl_basic_map_add_constraint(bmap
, c
);
10502 /* Add a constraint imposing that the value of the first dimension is
10503 * greater than that of the second.
10505 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
10506 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10508 isl_basic_map
*bmap
= NULL
;
10514 if (pos1
>= isl_map_dim(map
, type1
))
10515 isl_die(map
->ctx
, isl_error_invalid
,
10516 "index out of bounds", goto error
);
10517 if (pos2
>= isl_map_dim(map
, type2
))
10518 isl_die(map
->ctx
, isl_error_invalid
,
10519 "index out of bounds", goto error
);
10521 if (type1
== type2
&& pos1
== pos2
) {
10522 isl_space
*space
= isl_map_get_space(map
);
10524 return isl_map_empty(space
);
10527 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 0, 1);
10528 i
= isl_basic_map_alloc_inequality(bmap
);
10531 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
10532 pos1
+= isl_basic_map_offset(bmap
, type1
);
10533 pos2
+= isl_basic_map_offset(bmap
, type2
);
10534 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
10535 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
10536 isl_int_set_si(bmap
->ineq
[i
][0], -1);
10537 bmap
= isl_basic_map_finalize(bmap
);
10539 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
10543 isl_basic_map_free(bmap
);
10548 /* Add a constraint imposing that the value of the first dimension is
10549 * smaller than that of the second.
10551 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
10552 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
10554 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
10557 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
10561 isl_local_space
*ls
;
10566 if (!isl_basic_map_divs_known(bmap
))
10567 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
10568 "some divs are unknown", return NULL
);
10570 ls
= isl_basic_map_get_local_space(bmap
);
10571 div
= isl_local_space_get_div(ls
, pos
);
10572 isl_local_space_free(ls
);
10577 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
10580 return isl_basic_map_get_div(bset
, pos
);
10583 /* Plug in "subs" for dimension "type", "pos" of "bset".
10585 * Let i be the dimension to replace and let "subs" be of the form
10589 * Any integer division with a non-zero coefficient for i,
10591 * floor((a i + g)/m)
10595 * floor((a f + d g)/(m d))
10597 * Constraints of the form
10605 __isl_give isl_basic_set
*isl_basic_set_substitute(
10606 __isl_take isl_basic_set
*bset
,
10607 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10613 if (bset
&& isl_basic_set_plain_is_empty(bset
))
10616 bset
= isl_basic_set_cow(bset
);
10617 if (!bset
|| !subs
)
10620 ctx
= isl_basic_set_get_ctx(bset
);
10621 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
10622 isl_die(ctx
, isl_error_invalid
,
10623 "spaces don't match", goto error
);
10624 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
10625 isl_die(ctx
, isl_error_unsupported
,
10626 "cannot handle divs yet", goto error
);
10628 pos
+= isl_basic_set_offset(bset
, type
);
10632 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10633 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
10635 isl_int_set(v
, bset
->eq
[i
][pos
]);
10636 isl_int_set_si(bset
->eq
[i
][pos
], 0);
10637 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
10638 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10641 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10642 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
10644 isl_int_set(v
, bset
->ineq
[i
][pos
]);
10645 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
10646 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
10647 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10650 for (i
= 0; i
< bset
->n_div
; ++i
) {
10651 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
10653 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
10654 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
10655 isl_seq_combine(bset
->div
[i
] + 1,
10656 subs
->v
->el
[0], bset
->div
[i
] + 1,
10657 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
10658 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
10663 bset
= isl_basic_set_simplify(bset
);
10664 return isl_basic_set_finalize(bset
);
10666 isl_basic_set_free(bset
);
10670 /* Plug in "subs" for dimension "type", "pos" of "set".
10672 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
10673 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
10677 if (set
&& isl_set_plain_is_empty(set
))
10680 set
= isl_set_cow(set
);
10684 for (i
= set
->n
- 1; i
>= 0; --i
) {
10685 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
10686 if (remove_if_empty(set
, i
) < 0)