2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 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_lp_private.h>
25 #include <isl_reordering.h>
26 #include "isl_sample.h"
29 #include <isl_mat_private.h>
30 #include <isl_vec_private.h>
31 #include <isl_dim_map.h>
32 #include <isl_local_space_private.h>
33 #include <isl_aff_private.h>
34 #include <isl_options_private.h>
35 #include <isl_morph.h>
36 #include <isl_val_private.h>
37 #include <isl/deprecated/map_int.h>
38 #include <isl/deprecated/set_int.h>
40 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
43 case isl_dim_param
: return dim
->nparam
;
44 case isl_dim_in
: return dim
->n_in
;
45 case isl_dim_out
: return dim
->n_out
;
46 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
51 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
54 case isl_dim_param
: return 1;
55 case isl_dim_in
: return 1 + dim
->nparam
;
56 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
61 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
62 enum isl_dim_type type
)
67 case isl_dim_cst
: return 1;
70 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
71 case isl_dim_div
: return bmap
->n_div
;
72 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
77 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
79 return map
? n(map
->dim
, type
) : 0;
82 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
84 return set
? n(set
->dim
, type
) : 0;
87 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
88 enum isl_dim_type type
)
90 isl_space
*dim
= bmap
->dim
;
92 case isl_dim_cst
: return 0;
93 case isl_dim_param
: return 1;
94 case isl_dim_in
: return 1 + dim
->nparam
;
95 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
96 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
101 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
102 enum isl_dim_type type
)
104 return isl_basic_map_offset(bset
, type
);
107 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
109 return pos(map
->dim
, type
);
112 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
113 enum isl_dim_type type
)
115 return isl_basic_map_dim(bset
, type
);
118 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
120 return isl_basic_set_dim(bset
, isl_dim_set
);
123 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
125 return isl_basic_set_dim(bset
, isl_dim_param
);
128 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
132 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
135 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
137 return isl_set_dim(set
, isl_dim_set
);
140 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
142 return isl_set_dim(set
, isl_dim_param
);
145 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
147 return bmap
? bmap
->dim
->n_in
: 0;
150 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
152 return bmap
? bmap
->dim
->n_out
: 0;
155 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
157 return bmap
? bmap
->dim
->nparam
: 0;
160 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
162 return bmap
? bmap
->n_div
: 0;
165 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
167 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
170 unsigned isl_map_n_in(const struct isl_map
*map
)
172 return map
? map
->dim
->n_in
: 0;
175 unsigned isl_map_n_out(const struct isl_map
*map
)
177 return map
? map
->dim
->n_out
: 0;
180 unsigned isl_map_n_param(const struct isl_map
*map
)
182 return map
? map
->dim
->nparam
: 0;
185 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
190 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
193 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
196 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
197 struct isl_basic_set
*bset
)
202 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
205 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
208 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
213 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
216 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
219 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
220 struct isl_basic_set
*bset
)
225 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
228 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
231 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
233 return bmap
? bmap
->ctx
: NULL
;
236 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
238 return bset
? bset
->ctx
: NULL
;
241 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
243 return map
? map
->ctx
: NULL
;
246 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
248 return set
? set
->ctx
: NULL
;
251 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
255 return isl_space_copy(bmap
->dim
);
258 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
262 return isl_space_copy(bset
->dim
);
265 /* Extract the divs in "bmap" as a matrix.
267 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
278 ctx
= isl_basic_map_get_ctx(bmap
);
279 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
280 cols
= 1 + 1 + total
+ bmap
->n_div
;
281 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
285 for (i
= 0; i
< bmap
->n_div
; ++i
)
286 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
291 /* Extract the divs in "bset" as a matrix.
293 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
295 return isl_basic_map_get_divs(bset
);
298 __isl_give isl_local_space
*isl_basic_map_get_local_space(
299 __isl_keep isl_basic_map
*bmap
)
306 div
= isl_basic_map_get_divs(bmap
);
307 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
310 __isl_give isl_local_space
*isl_basic_set_get_local_space(
311 __isl_keep isl_basic_set
*bset
)
313 return isl_basic_map_get_local_space(bset
);
316 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
317 __isl_take isl_local_space
*ls
)
326 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
327 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
328 n_div
, 0, 2 * n_div
);
330 for (i
= 0; i
< n_div
; ++i
)
331 if (isl_basic_map_alloc_div(bmap
) < 0)
334 for (i
= 0; i
< n_div
; ++i
) {
335 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
336 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
340 isl_local_space_free(ls
);
343 isl_local_space_free(ls
);
344 isl_basic_map_free(bmap
);
348 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
349 __isl_take isl_local_space
*ls
)
351 return isl_basic_map_from_local_space(ls
);
354 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
358 return isl_space_copy(map
->dim
);
361 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
365 return isl_space_copy(set
->dim
);
368 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
369 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
371 bmap
= isl_basic_map_cow(bmap
);
374 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
377 bmap
= isl_basic_map_finalize(bmap
);
380 isl_basic_map_free(bmap
);
384 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
385 __isl_take isl_basic_set
*bset
, const char *s
)
387 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
390 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
391 enum isl_dim_type type
)
393 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
396 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
397 enum isl_dim_type type
, const char *s
)
401 map
= isl_map_cow(map
);
405 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
409 for (i
= 0; i
< map
->n
; ++i
) {
410 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
421 /* Replace the identifier of the tuple of type "type" by "id".
423 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
424 __isl_take isl_basic_map
*bmap
,
425 enum isl_dim_type type
, __isl_take isl_id
*id
)
427 bmap
= isl_basic_map_cow(bmap
);
429 return isl_id_free(id
);
430 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
432 return isl_basic_map_free(bmap
);
433 bmap
= isl_basic_map_finalize(bmap
);
437 /* Replace the identifier of the tuple by "id".
439 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
440 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
442 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
445 /* Does the input or output tuple have a name?
447 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
449 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
452 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
453 enum isl_dim_type type
)
455 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
458 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
461 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
464 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
465 enum isl_dim_type type
, __isl_take isl_id
*id
)
467 map
= isl_map_cow(map
);
469 return isl_id_free(id
);
471 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
473 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
476 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
477 __isl_take isl_id
*id
)
479 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
482 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
483 enum isl_dim_type type
)
485 map
= isl_map_cow(map
);
489 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
491 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
494 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
496 return isl_map_reset_tuple_id(set
, isl_dim_set
);
499 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
501 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
504 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
505 enum isl_dim_type type
)
507 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
510 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
512 return isl_map_has_tuple_id(set
, isl_dim_set
);
515 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
517 return isl_map_get_tuple_id(set
, isl_dim_set
);
520 /* Does the set tuple have a name?
522 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
524 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
528 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
530 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
533 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
535 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
538 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
539 enum isl_dim_type type
, unsigned pos
)
541 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
544 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
545 enum isl_dim_type type
, unsigned pos
)
547 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
550 /* Does the given dimension have a name?
552 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
553 enum isl_dim_type type
, unsigned pos
)
555 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
558 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
559 enum isl_dim_type type
, unsigned pos
)
561 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
564 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
565 enum isl_dim_type type
, unsigned pos
)
567 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
570 /* Does the given dimension have a name?
572 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
573 enum isl_dim_type type
, unsigned pos
)
575 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
578 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
579 __isl_take isl_basic_map
*bmap
,
580 enum isl_dim_type type
, unsigned pos
, const char *s
)
582 bmap
= isl_basic_map_cow(bmap
);
585 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
588 return isl_basic_map_finalize(bmap
);
590 isl_basic_map_free(bmap
);
594 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
595 enum isl_dim_type type
, unsigned pos
, const char *s
)
599 map
= isl_map_cow(map
);
603 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
607 for (i
= 0; i
< map
->n
; ++i
) {
608 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
619 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
620 __isl_take isl_basic_set
*bset
,
621 enum isl_dim_type type
, unsigned pos
, const char *s
)
623 return (isl_basic_set
*)isl_basic_map_set_dim_name(
624 (isl_basic_map
*)bset
, type
, pos
, s
);
627 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
628 enum isl_dim_type type
, unsigned pos
, const char *s
)
630 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
633 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
634 enum isl_dim_type type
, unsigned pos
)
636 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
639 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
640 enum isl_dim_type type
, unsigned pos
)
642 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
645 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
646 enum isl_dim_type type
, unsigned pos
)
648 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
651 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
652 enum isl_dim_type type
, unsigned pos
)
654 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
657 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
658 enum isl_dim_type type
, unsigned pos
)
660 return isl_map_has_dim_id(set
, type
, pos
);
663 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
664 enum isl_dim_type type
, unsigned pos
)
666 return isl_map_get_dim_id(set
, type
, pos
);
669 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
670 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
672 map
= isl_map_cow(map
);
674 return isl_id_free(id
);
676 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
678 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
681 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
682 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
684 return isl_map_set_dim_id(set
, type
, pos
, id
);
687 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
688 __isl_keep isl_id
*id
)
692 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
695 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
696 __isl_keep isl_id
*id
)
698 return isl_map_find_dim_by_id(set
, type
, id
);
701 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
706 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
709 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
712 return isl_map_find_dim_by_name(set
, type
, name
);
715 /* Reset the user pointer on all identifiers of parameters and tuples
716 * of the space of "map".
718 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
722 space
= isl_map_get_space(map
);
723 space
= isl_space_reset_user(space
);
724 map
= isl_map_reset_space(map
, space
);
729 /* Reset the user pointer on all identifiers of parameters and tuples
730 * of the space of "set".
732 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
734 return isl_map_reset_user(set
);
737 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
741 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
744 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
746 return isl_basic_map_is_rational(bset
);
749 /* Does "bmap" contain any rational points?
751 * If "bmap" has an equality for each dimension, equating the dimension
752 * to an integer constant, then it has no rational points, even if it
753 * is marked as rational.
755 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
757 int has_rational
= 1;
762 if (isl_basic_map_plain_is_empty(bmap
))
764 if (!isl_basic_map_is_rational(bmap
))
766 bmap
= isl_basic_map_copy(bmap
);
767 bmap
= isl_basic_map_implicit_equalities(bmap
);
770 total
= isl_basic_map_total_dim(bmap
);
771 if (bmap
->n_eq
== total
) {
773 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
774 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
777 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
778 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
780 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
788 isl_basic_map_free(bmap
);
793 /* Does "map" contain any rational points?
795 int isl_map_has_rational(__isl_keep isl_map
*map
)
802 for (i
= 0; i
< map
->n
; ++i
) {
803 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
804 if (has_rational
< 0)
812 /* Does "set" contain any rational points?
814 int isl_set_has_rational(__isl_keep isl_set
*set
)
816 return isl_map_has_rational(set
);
819 /* Is this basic set a parameter domain?
821 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
825 return isl_space_is_params(bset
->dim
);
828 /* Is this set a parameter domain?
830 int isl_set_is_params(__isl_keep isl_set
*set
)
834 return isl_space_is_params(set
->dim
);
837 /* Is this map actually a parameter domain?
838 * Users should never call this function. Outside of isl,
839 * a map can never be a parameter domain.
841 int isl_map_is_params(__isl_keep isl_map
*map
)
845 return isl_space_is_params(map
->dim
);
848 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
849 struct isl_basic_map
*bmap
, unsigned extra
,
850 unsigned n_eq
, unsigned n_ineq
)
853 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
858 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
859 if (isl_blk_is_error(bmap
->block
))
862 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
863 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
867 bmap
->block2
= isl_blk_empty();
870 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
871 if (isl_blk_is_error(bmap
->block2
))
874 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
879 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
880 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
882 for (i
= 0; i
< extra
; ++i
)
883 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
887 bmap
->c_size
= n_eq
+ n_ineq
;
888 bmap
->eq
= bmap
->ineq
+ n_ineq
;
897 isl_basic_map_free(bmap
);
901 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
902 unsigned nparam
, unsigned dim
, unsigned extra
,
903 unsigned n_eq
, unsigned n_ineq
)
905 struct isl_basic_map
*bmap
;
908 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
912 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
913 return (struct isl_basic_set
*)bmap
;
916 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
917 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
919 struct isl_basic_map
*bmap
;
922 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
923 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
924 return (struct isl_basic_set
*)bmap
;
930 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
931 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
933 struct isl_basic_map
*bmap
;
937 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
942 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
948 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
949 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
950 unsigned n_eq
, unsigned n_ineq
)
952 struct isl_basic_map
*bmap
;
955 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
959 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
963 static void dup_constraints(
964 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
967 unsigned total
= isl_basic_map_total_dim(src
);
969 for (i
= 0; i
< src
->n_eq
; ++i
) {
970 int j
= isl_basic_map_alloc_equality(dst
);
971 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
974 for (i
= 0; i
< src
->n_ineq
; ++i
) {
975 int j
= isl_basic_map_alloc_inequality(dst
);
976 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
979 for (i
= 0; i
< src
->n_div
; ++i
) {
980 int j
= isl_basic_map_alloc_div(dst
);
981 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
983 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
986 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
988 struct isl_basic_map
*dup
;
992 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
993 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
996 dup_constraints(dup
, bmap
);
997 dup
->flags
= bmap
->flags
;
998 dup
->sample
= isl_vec_copy(bmap
->sample
);
1002 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1004 struct isl_basic_map
*dup
;
1006 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
1007 return (struct isl_basic_set
*)dup
;
1010 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
1015 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1019 return isl_basic_set_dup(bset
);
1022 struct isl_set
*isl_set_copy(struct isl_set
*set
)
1031 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
1036 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1040 bmap
= isl_basic_map_dup(bmap
);
1042 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1046 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1055 void *isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1060 if (--bmap
->ref
> 0)
1063 isl_ctx_deref(bmap
->ctx
);
1065 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1067 isl_blk_free(bmap
->ctx
, bmap
->block
);
1068 isl_vec_free(bmap
->sample
);
1069 isl_space_free(bmap
->dim
);
1075 void *isl_basic_set_free(struct isl_basic_set
*bset
)
1077 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1080 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1082 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1085 __isl_give isl_map
*isl_map_align_params_map_map_and(
1086 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1087 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1088 __isl_take isl_map
*map2
))
1092 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1093 return fn(map1
, map2
);
1094 if (!isl_space_has_named_params(map1
->dim
) ||
1095 !isl_space_has_named_params(map2
->dim
))
1096 isl_die(map1
->ctx
, isl_error_invalid
,
1097 "unaligned unnamed parameters", goto error
);
1098 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1099 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1100 return fn(map1
, map2
);
1107 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1108 __isl_keep isl_map
*map2
,
1109 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1115 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1116 return fn(map1
, map2
);
1117 if (!isl_space_has_named_params(map1
->dim
) ||
1118 !isl_space_has_named_params(map2
->dim
))
1119 isl_die(map1
->ctx
, isl_error_invalid
,
1120 "unaligned unnamed parameters", return -1);
1121 map1
= isl_map_copy(map1
);
1122 map2
= isl_map_copy(map2
);
1123 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1124 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1131 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1133 struct isl_ctx
*ctx
;
1137 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1138 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1140 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1141 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1142 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1143 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1144 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1145 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1147 int j
= isl_basic_map_alloc_inequality(bmap
);
1151 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1152 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1159 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1160 bmap
->extra
- bmap
->n_div
);
1161 return bmap
->n_eq
++;
1164 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1166 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1169 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1173 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1178 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1180 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1183 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1188 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1190 if (pos
!= bmap
->n_eq
- 1) {
1192 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1193 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1199 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1201 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1204 /* Turn inequality "pos" of "bmap" into an equality.
1206 * In particular, we move the inequality in front of the equalities
1207 * and move the last inequality in the position of the moved inequality.
1208 * Note that isl_tab_make_equalities_explicit depends on this particular
1209 * change in the ordering of the constraints.
1211 void isl_basic_map_inequality_to_equality(
1212 struct isl_basic_map
*bmap
, unsigned pos
)
1216 t
= bmap
->ineq
[pos
];
1217 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1218 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1223 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1224 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1225 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1226 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1229 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1231 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1234 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1236 struct isl_ctx
*ctx
;
1240 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1241 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1242 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1243 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1244 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1245 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1246 1 + isl_basic_map_total_dim(bmap
),
1247 bmap
->extra
- bmap
->n_div
);
1248 return bmap
->n_ineq
++;
1251 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1253 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1256 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1260 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1265 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1267 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1270 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1275 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1277 if (pos
!= bmap
->n_ineq
- 1) {
1278 t
= bmap
->ineq
[pos
];
1279 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1280 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1281 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1287 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1289 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1292 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1297 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1300 k
= isl_basic_map_alloc_equality(bmap
);
1303 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1306 isl_basic_map_free(bmap
);
1310 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1313 return (isl_basic_set
*)
1314 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1317 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1322 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1325 k
= isl_basic_map_alloc_inequality(bmap
);
1328 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1331 isl_basic_map_free(bmap
);
1335 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1338 return (isl_basic_set
*)
1339 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1342 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1346 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1347 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1348 1 + 1 + isl_basic_map_total_dim(bmap
),
1349 bmap
->extra
- bmap
->n_div
);
1350 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1351 return bmap
->n_div
++;
1354 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1356 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1359 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1363 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1368 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1370 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1373 /* Copy constraint from src to dst, putting the vars of src at offset
1374 * dim_off in dst and the divs of src at offset div_off in dst.
1375 * If both sets are actually map, then dim_off applies to the input
1378 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1379 struct isl_basic_map
*src_map
, isl_int
*src
,
1380 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1382 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1383 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1384 unsigned src_in
= isl_basic_map_n_in(src_map
);
1385 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1386 unsigned src_out
= isl_basic_map_n_out(src_map
);
1387 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1388 isl_int_set(dst
[0], src
[0]);
1389 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1390 if (dst_nparam
> src_nparam
)
1391 isl_seq_clr(dst
+1+src_nparam
,
1392 dst_nparam
- src_nparam
);
1393 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1394 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1396 isl_min(dst_in
-in_off
, src_in
));
1397 if (dst_in
-in_off
> src_in
)
1398 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1399 dst_in
- in_off
- src_in
);
1400 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1401 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1402 src
+1+src_nparam
+src_in
,
1403 isl_min(dst_out
-out_off
, src_out
));
1404 if (dst_out
-out_off
> src_out
)
1405 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1406 dst_out
- out_off
- src_out
);
1407 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1408 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1409 src
+1+src_nparam
+src_in
+src_out
,
1410 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1411 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1412 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1413 div_off
+src_map
->n_div
,
1414 dst_map
->n_div
- div_off
- src_map
->n_div
);
1417 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1418 struct isl_basic_map
*src_map
, isl_int
*src
,
1419 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1421 isl_int_set(dst
[0], src
[0]);
1422 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1425 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1426 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1431 if (!bmap1
|| !bmap2
)
1434 div_off
= bmap1
->n_div
;
1436 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1437 int i1
= isl_basic_map_alloc_equality(bmap1
);
1440 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1441 i_pos
, o_pos
, div_off
);
1444 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1445 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1448 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1449 i_pos
, o_pos
, div_off
);
1452 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1453 int i1
= isl_basic_map_alloc_div(bmap1
);
1456 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1457 i_pos
, o_pos
, div_off
);
1460 isl_basic_map_free(bmap2
);
1465 isl_basic_map_free(bmap1
);
1466 isl_basic_map_free(bmap2
);
1470 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1471 struct isl_basic_set
*bset2
, unsigned pos
)
1473 return (struct isl_basic_set
*)
1474 add_constraints((struct isl_basic_map
*)bset1
,
1475 (struct isl_basic_map
*)bset2
, 0, pos
);
1478 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1479 __isl_take isl_space
*dim
, unsigned extra
,
1480 unsigned n_eq
, unsigned n_ineq
)
1482 struct isl_basic_map
*ext
;
1492 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1493 base
->extra
>= base
->n_div
+ extra
;
1495 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1496 room_for_ineq(base
, n_ineq
)) {
1497 isl_space_free(dim
);
1501 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1502 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1503 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1504 extra
+= base
->extra
;
1506 n_ineq
+= base
->n_ineq
;
1508 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1514 ext
->sample
= isl_vec_copy(base
->sample
);
1515 flags
= base
->flags
;
1516 ext
= add_constraints(ext
, base
, 0, 0);
1519 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1525 isl_space_free(dim
);
1526 isl_basic_map_free(base
);
1530 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1531 __isl_take isl_space
*dim
, unsigned extra
,
1532 unsigned n_eq
, unsigned n_ineq
)
1534 return (struct isl_basic_set
*)
1535 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1536 extra
, n_eq
, n_ineq
);
1539 struct isl_basic_map
*isl_basic_map_extend_constraints(
1540 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1544 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1548 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1549 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1550 unsigned n_eq
, unsigned n_ineq
)
1552 struct isl_basic_map
*bmap
;
1557 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1561 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1564 isl_basic_map_free(base
);
1568 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1569 unsigned nparam
, unsigned dim
, unsigned extra
,
1570 unsigned n_eq
, unsigned n_ineq
)
1572 return (struct isl_basic_set
*)
1573 isl_basic_map_extend((struct isl_basic_map
*)base
,
1574 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1577 struct isl_basic_set
*isl_basic_set_extend_constraints(
1578 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1580 return (struct isl_basic_set
*)
1581 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1585 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1587 return (struct isl_basic_set
*)
1588 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1591 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1596 if (bmap
->ref
> 1) {
1598 bmap
= isl_basic_map_dup(bmap
);
1601 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1605 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1613 return isl_set_dup(set
);
1616 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1624 return isl_map_dup(map
);
1627 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1628 unsigned a_len
, unsigned b_len
)
1630 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1631 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1632 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1635 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1636 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1644 isl_assert(bmap
->ctx
,
1645 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1647 if (n1
== 0 || n2
== 0)
1650 bmap
= isl_basic_map_cow(bmap
);
1654 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1655 if (isl_blk_is_error(blk
))
1658 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1660 bmap
->eq
[i
] + pos
, n1
, n2
);
1662 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1664 bmap
->ineq
[i
] + pos
, n1
, n2
);
1666 for (i
= 0; i
< bmap
->n_div
; ++i
)
1668 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1670 isl_blk_free(bmap
->ctx
, blk
);
1672 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1673 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1674 return isl_basic_map_finalize(bmap
);
1676 isl_basic_map_free(bmap
);
1680 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1681 __isl_take isl_basic_set
*bset
, unsigned n
)
1689 nparam
= isl_basic_set_n_param(bset
);
1690 dim
= isl_basic_set_n_dim(bset
);
1691 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1693 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1695 isl_basic_set_free(bset
);
1699 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1705 total
= isl_basic_map_total_dim(bmap
);
1706 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1707 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1709 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1711 i
= isl_basic_map_alloc_equality(bmap
);
1715 isl_int_set_si(bmap
->eq
[i
][0], 1);
1716 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1717 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1718 isl_vec_free(bmap
->sample
);
1719 bmap
->sample
= NULL
;
1720 return isl_basic_map_finalize(bmap
);
1722 isl_basic_map_free(bmap
);
1726 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1728 return (struct isl_basic_set
*)
1729 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1732 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1735 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1737 isl_int
*t
= bmap
->div
[a
];
1738 bmap
->div
[a
] = bmap
->div
[b
];
1742 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1743 * div definitions accordingly.
1745 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1748 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1750 swap_div(bmap
, a
, b
);
1752 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1753 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1755 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1756 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1758 for (i
= 0; i
< bmap
->n_div
; ++i
)
1759 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1760 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1763 /* Eliminate the specified n dimensions starting at first from the
1764 * constraints, without removing the dimensions from the space.
1765 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1767 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1768 enum isl_dim_type type
, unsigned first
, unsigned n
)
1777 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1778 isl_die(map
->ctx
, isl_error_invalid
,
1779 "index out of bounds", goto error
);
1781 map
= isl_map_cow(map
);
1785 for (i
= 0; i
< map
->n
; ++i
) {
1786 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1796 /* Eliminate the specified n dimensions starting at first from the
1797 * constraints, without removing the dimensions from the space.
1798 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1800 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1801 enum isl_dim_type type
, unsigned first
, unsigned n
)
1803 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1806 /* Eliminate the specified n dimensions starting at first from the
1807 * constraints, without removing the dimensions from the space.
1808 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1810 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1811 unsigned first
, unsigned n
)
1813 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1816 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1817 __isl_take isl_basic_map
*bmap
)
1821 bmap
= isl_basic_map_eliminate_vars(bmap
,
1822 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1826 return isl_basic_map_finalize(bmap
);
1829 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1830 __isl_take isl_basic_set
*bset
)
1832 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1833 (struct isl_basic_map
*)bset
);
1836 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1845 map
= isl_map_cow(map
);
1849 for (i
= 0; i
< map
->n
; ++i
) {
1850 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1860 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1862 return isl_map_remove_divs(set
);
1865 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1866 enum isl_dim_type type
, unsigned first
, unsigned n
)
1870 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1872 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1874 bmap
= isl_basic_map_eliminate_vars(bmap
,
1875 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1878 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1880 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1883 isl_basic_map_free(bmap
);
1887 /* Return true if the definition of the given div (recursively) involves
1888 * any of the given variables.
1890 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1891 unsigned first
, unsigned n
)
1894 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1896 if (isl_int_is_zero(bmap
->div
[div
][0]))
1898 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1901 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1902 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1904 if (div_involves_vars(bmap
, i
, first
, n
))
1911 /* Try and add a lower and/or upper bound on "div" to "bmap"
1912 * based on inequality "i".
1913 * "total" is the total number of variables (excluding the divs).
1914 * "v" is a temporary object that can be used during the calculations.
1915 * If "lb" is set, then a lower bound should be constructed.
1916 * If "ub" is set, then an upper bound should be constructed.
1918 * The calling function has already checked that the inequality does not
1919 * reference "div", but we still need to check that the inequality is
1920 * of the right form. We'll consider the case where we want to construct
1921 * a lower bound. The construction of upper bounds is similar.
1923 * Let "div" be of the form
1925 * q = floor((a + f(x))/d)
1927 * We essentially check if constraint "i" is of the form
1931 * so that we can use it to derive a lower bound on "div".
1932 * However, we allow a slightly more general form
1936 * with the condition that the coefficients of g(x) - f(x) are all
1938 * Rewriting this constraint as
1942 * adding a + f(x) to both sides and dividing by d, we obtain
1944 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1946 * Taking the floor on both sides, we obtain
1948 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1952 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1954 * In the case of an upper bound, we construct the constraint
1956 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1959 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1960 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1961 unsigned total
, isl_int v
, int lb
, int ub
)
1965 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1967 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1968 bmap
->div
[div
][1 + 1 + j
]);
1969 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1972 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1973 bmap
->div
[div
][1 + 1 + j
]);
1974 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1980 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1982 int k
= isl_basic_map_alloc_inequality(bmap
);
1985 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1986 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1987 bmap
->div
[div
][1 + j
]);
1988 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1989 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1991 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1994 int k
= isl_basic_map_alloc_inequality(bmap
);
1997 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1998 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1999 bmap
->div
[div
][1 + j
]);
2000 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2001 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2003 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2008 isl_basic_map_free(bmap
);
2012 /* This function is called right before "div" is eliminated from "bmap"
2013 * using Fourier-Motzkin.
2014 * Look through the constraints of "bmap" for constraints on the argument
2015 * of the integer division and use them to construct constraints on the
2016 * integer division itself. These constraints can then be combined
2017 * during the Fourier-Motzkin elimination.
2018 * Note that it is only useful to introduce lower bounds on "div"
2019 * if "bmap" already contains upper bounds on "div" as the newly
2020 * introduce lower bounds can then be combined with the pre-existing
2021 * upper bounds. Similarly for upper bounds.
2022 * We therefore first check if "bmap" contains any lower and/or upper bounds
2025 * It is interesting to note that the introduction of these constraints
2026 * can indeed lead to more accurate results, even when compared to
2027 * deriving constraints on the argument of "div" from constraints on "div".
2028 * Consider, for example, the set
2030 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2032 * The second constraint can be rewritten as
2034 * 2 * [(-i-2j+3)/4] + k >= 0
2036 * from which we can derive
2038 * -i - 2j + 3 >= -2k
2044 * Combined with the first constraint, we obtain
2046 * -3 <= 3 + 2k or k >= -3
2048 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2049 * the first constraint, we obtain
2051 * [(i + 2j)/4] >= [-3/4] = -1
2053 * Combining this constraint with the second constraint, we obtain
2057 static __isl_give isl_basic_map
*insert_bounds_on_div(
2058 __isl_take isl_basic_map
*bmap
, int div
)
2061 int check_lb
, check_ub
;
2068 if (isl_int_is_zero(bmap
->div
[div
][0]))
2071 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2075 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2076 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2083 if (!check_lb
&& !check_ub
)
2088 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2089 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2092 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2093 check_lb
, check_ub
);
2101 /* Remove all divs (recursively) involving any of the given dimensions
2102 * in their definitions.
2104 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2105 __isl_take isl_basic_map
*bmap
,
2106 enum isl_dim_type type
, unsigned first
, unsigned n
)
2112 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2114 first
+= isl_basic_map_offset(bmap
, type
);
2116 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2117 if (!div_involves_vars(bmap
, i
, first
, n
))
2119 bmap
= insert_bounds_on_div(bmap
, i
);
2120 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2128 isl_basic_map_free(bmap
);
2132 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2133 __isl_take isl_basic_set
*bset
,
2134 enum isl_dim_type type
, unsigned first
, unsigned n
)
2136 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2139 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2140 enum isl_dim_type type
, unsigned first
, unsigned n
)
2149 map
= isl_map_cow(map
);
2153 for (i
= 0; i
< map
->n
; ++i
) {
2154 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2165 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2166 enum isl_dim_type type
, unsigned first
, unsigned n
)
2168 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2172 /* Does the desciption of "bmap" depend on the specified dimensions?
2173 * We also check whether the dimensions appear in any of the div definitions.
2174 * In principle there is no need for this check. If the dimensions appear
2175 * in a div definition, they also appear in the defining constraints of that
2178 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2179 enum isl_dim_type type
, unsigned first
, unsigned n
)
2186 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2187 isl_die(bmap
->ctx
, isl_error_invalid
,
2188 "index out of bounds", return -1);
2190 first
+= isl_basic_map_offset(bmap
, type
);
2191 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2192 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2194 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2195 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2197 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2198 if (isl_int_is_zero(bmap
->div
[i
][0]))
2200 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2207 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2208 enum isl_dim_type type
, unsigned first
, unsigned n
)
2215 if (first
+ n
> isl_map_dim(map
, type
))
2216 isl_die(map
->ctx
, isl_error_invalid
,
2217 "index out of bounds", return -1);
2219 for (i
= 0; i
< map
->n
; ++i
) {
2220 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2222 if (involves
< 0 || involves
)
2229 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2230 enum isl_dim_type type
, unsigned first
, unsigned n
)
2232 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2235 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2236 enum isl_dim_type type
, unsigned first
, unsigned n
)
2238 return isl_map_involves_dims(set
, type
, first
, n
);
2241 /* Return true if the definition of the given div is unknown or depends
2244 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2247 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2249 if (isl_int_is_zero(bmap
->div
[div
][0]))
2252 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2253 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2255 if (div_is_unknown(bmap
, i
))
2262 /* Remove all divs that are unknown or defined in terms of unknown divs.
2264 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2265 __isl_take isl_basic_map
*bmap
)
2272 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2273 if (!div_is_unknown(bmap
, i
))
2275 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2284 /* Remove all divs that are unknown or defined in terms of unknown divs.
2286 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2287 __isl_take isl_basic_set
*bset
)
2289 return isl_basic_map_remove_unknown_divs(bset
);
2292 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2301 map
= isl_map_cow(map
);
2305 for (i
= 0; i
< map
->n
; ++i
) {
2306 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2316 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2318 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2321 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2322 __isl_take isl_basic_set
*bset
,
2323 enum isl_dim_type type
, unsigned first
, unsigned n
)
2325 return (isl_basic_set
*)
2326 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2329 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2330 enum isl_dim_type type
, unsigned first
, unsigned n
)
2337 map
= isl_map_cow(map
);
2340 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2342 for (i
= 0; i
< map
->n
; ++i
) {
2343 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2344 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2348 map
= isl_map_drop(map
, type
, first
, n
);
2355 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2356 enum isl_dim_type type
, unsigned first
, unsigned n
)
2358 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2361 /* Project out n inputs starting at first using Fourier-Motzkin */
2362 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2363 unsigned first
, unsigned n
)
2365 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2368 static void dump_term(struct isl_basic_map
*bmap
,
2369 isl_int c
, int pos
, FILE *out
)
2372 unsigned in
= isl_basic_map_n_in(bmap
);
2373 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2374 unsigned nparam
= isl_basic_map_n_param(bmap
);
2376 isl_int_print(out
, c
, 0);
2378 if (!isl_int_is_one(c
))
2379 isl_int_print(out
, c
, 0);
2380 if (pos
< 1 + nparam
) {
2381 name
= isl_space_get_dim_name(bmap
->dim
,
2382 isl_dim_param
, pos
- 1);
2384 fprintf(out
, "%s", name
);
2386 fprintf(out
, "p%d", pos
- 1);
2387 } else if (pos
< 1 + nparam
+ in
)
2388 fprintf(out
, "i%d", pos
- 1 - nparam
);
2389 else if (pos
< 1 + nparam
+ dim
)
2390 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2392 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2396 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2397 int sign
, FILE *out
)
2401 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2405 for (i
= 0, first
= 1; i
< len
; ++i
) {
2406 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2409 fprintf(out
, " + ");
2411 isl_int_abs(v
, c
[i
]);
2412 dump_term(bmap
, v
, i
, out
);
2419 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2420 const char *op
, FILE *out
, int indent
)
2424 fprintf(out
, "%*s", indent
, "");
2426 dump_constraint_sign(bmap
, c
, 1, out
);
2427 fprintf(out
, " %s ", op
);
2428 dump_constraint_sign(bmap
, c
, -1, out
);
2432 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2433 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2435 fprintf(out
, "%*s", indent
, "");
2436 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2441 static void dump_constraints(struct isl_basic_map
*bmap
,
2442 isl_int
**c
, unsigned n
,
2443 const char *op
, FILE *out
, int indent
)
2447 for (i
= 0; i
< n
; ++i
)
2448 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2451 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2455 unsigned total
= isl_basic_map_total_dim(bmap
);
2457 for (j
= 0; j
< 1 + total
; ++j
) {
2458 if (isl_int_is_zero(exp
[j
]))
2460 if (!first
&& isl_int_is_pos(exp
[j
]))
2462 dump_term(bmap
, exp
[j
], j
, out
);
2467 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2471 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2472 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2474 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2475 fprintf(out
, "%*s", indent
, "");
2476 fprintf(out
, "e%d = [(", i
);
2477 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2479 isl_int_print(out
, bmap
->div
[i
][0], 0);
2480 fprintf(out
, "]\n");
2484 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2485 FILE *out
, int indent
)
2488 fprintf(out
, "null basic set\n");
2492 fprintf(out
, "%*s", indent
, "");
2493 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2494 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2495 bset
->extra
, bset
->flags
);
2496 dump((struct isl_basic_map
*)bset
, out
, indent
);
2499 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2500 FILE *out
, int indent
)
2503 fprintf(out
, "null basic map\n");
2507 fprintf(out
, "%*s", indent
, "");
2508 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2509 "flags: %x, n_name: %d\n",
2511 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2512 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2513 dump(bmap
, out
, indent
);
2516 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2521 total
= isl_basic_map_total_dim(bmap
);
2522 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2523 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2524 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2525 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2529 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2532 struct isl_set
*set
;
2536 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2537 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2538 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2539 sizeof(struct isl_set
) +
2540 (n
- 1) * sizeof(struct isl_basic_set
*));
2544 set
->ctx
= dim
->ctx
;
2545 isl_ctx_ref(set
->ctx
);
2553 isl_space_free(dim
);
2557 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2558 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2560 struct isl_set
*set
;
2563 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2567 set
= isl_set_alloc_space(dims
, n
, flags
);
2571 /* Make sure "map" has room for at least "n" more basic maps.
2573 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2576 struct isl_map
*grown
= NULL
;
2580 isl_assert(map
->ctx
, n
>= 0, goto error
);
2581 if (map
->n
+ n
<= map
->size
)
2583 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2586 for (i
= 0; i
< map
->n
; ++i
) {
2587 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2595 isl_map_free(grown
);
2600 /* Make sure "set" has room for at least "n" more basic sets.
2602 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2604 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2607 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2610 struct isl_set
*dup
;
2615 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2618 for (i
= 0; i
< set
->n
; ++i
)
2619 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2623 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2625 return isl_map_from_basic_map(bset
);
2628 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2630 struct isl_map
*map
;
2635 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2636 return isl_map_add_basic_map(map
, bmap
);
2639 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2640 __isl_take isl_basic_set
*bset
)
2642 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2643 (struct isl_basic_map
*)bset
);
2646 void *isl_set_free(__isl_take isl_set
*set
)
2656 isl_ctx_deref(set
->ctx
);
2657 for (i
= 0; i
< set
->n
; ++i
)
2658 isl_basic_set_free(set
->p
[i
]);
2659 isl_space_free(set
->dim
);
2665 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2670 fprintf(out
, "null set\n");
2674 fprintf(out
, "%*s", indent
, "");
2675 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2676 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2678 for (i
= 0; i
< set
->n
; ++i
) {
2679 fprintf(out
, "%*s", indent
, "");
2680 fprintf(out
, "basic set %d:\n", i
);
2681 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2685 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2690 fprintf(out
, "null map\n");
2694 fprintf(out
, "%*s", indent
, "");
2695 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2696 "flags: %x, n_name: %d\n",
2697 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2698 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2699 for (i
= 0; i
< map
->n
; ++i
) {
2700 fprintf(out
, "%*s", indent
, "");
2701 fprintf(out
, "basic map %d:\n", i
);
2702 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2706 struct isl_basic_map
*isl_basic_map_intersect_domain(
2707 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2709 struct isl_basic_map
*bmap_domain
;
2714 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2715 bset
->dim
, isl_dim_param
), goto error
);
2717 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2718 isl_assert(bset
->ctx
,
2719 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2721 bmap
= isl_basic_map_cow(bmap
);
2724 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2725 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2726 bmap_domain
= isl_basic_map_from_domain(bset
);
2727 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2729 bmap
= isl_basic_map_simplify(bmap
);
2730 return isl_basic_map_finalize(bmap
);
2732 isl_basic_map_free(bmap
);
2733 isl_basic_set_free(bset
);
2737 struct isl_basic_map
*isl_basic_map_intersect_range(
2738 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2740 struct isl_basic_map
*bmap_range
;
2745 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2746 bset
->dim
, isl_dim_param
), goto error
);
2748 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2749 isl_assert(bset
->ctx
,
2750 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2752 if (isl_basic_set_is_universe(bset
)) {
2753 isl_basic_set_free(bset
);
2757 bmap
= isl_basic_map_cow(bmap
);
2760 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2761 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2762 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2763 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2765 bmap
= isl_basic_map_simplify(bmap
);
2766 return isl_basic_map_finalize(bmap
);
2768 isl_basic_map_free(bmap
);
2769 isl_basic_set_free(bset
);
2773 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2782 total
= 1 + isl_basic_map_total_dim(bmap
);
2783 if (total
!= vec
->size
)
2788 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2789 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2790 if (!isl_int_is_zero(s
)) {
2796 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2797 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2798 if (isl_int_is_neg(s
)) {
2809 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2811 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2814 struct isl_basic_map
*isl_basic_map_intersect(
2815 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2817 struct isl_vec
*sample
= NULL
;
2819 if (!bmap1
|| !bmap2
)
2822 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2823 bmap2
->dim
, isl_dim_param
), goto error
);
2824 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2825 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2826 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2827 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2828 return isl_basic_map_intersect(bmap2
, bmap1
);
2830 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2831 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2832 isl_assert(bmap1
->ctx
,
2833 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2835 if (bmap1
->sample
&&
2836 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2837 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2838 sample
= isl_vec_copy(bmap1
->sample
);
2839 else if (bmap2
->sample
&&
2840 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2841 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2842 sample
= isl_vec_copy(bmap2
->sample
);
2844 bmap1
= isl_basic_map_cow(bmap1
);
2847 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2848 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2849 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2852 isl_vec_free(sample
);
2854 isl_vec_free(bmap1
->sample
);
2855 bmap1
->sample
= sample
;
2858 bmap1
= isl_basic_map_simplify(bmap1
);
2859 return isl_basic_map_finalize(bmap1
);
2862 isl_vec_free(sample
);
2863 isl_basic_map_free(bmap1
);
2864 isl_basic_map_free(bmap2
);
2868 struct isl_basic_set
*isl_basic_set_intersect(
2869 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2871 return (struct isl_basic_set
*)
2872 isl_basic_map_intersect(
2873 (struct isl_basic_map
*)bset1
,
2874 (struct isl_basic_map
*)bset2
);
2877 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2878 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2880 return isl_basic_set_intersect(bset1
, bset2
);
2883 /* Special case of isl_map_intersect, where both map1 and map2
2884 * are convex, without any divs and such that either map1 or map2
2885 * contains a single constraint. This constraint is then simply
2886 * added to the other map.
2888 static __isl_give isl_map
*map_intersect_add_constraint(
2889 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2891 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2892 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2893 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2894 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2896 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2897 return isl_map_intersect(map2
, map1
);
2899 isl_assert(map2
->ctx
,
2900 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2902 map1
= isl_map_cow(map1
);
2905 if (isl_map_plain_is_empty(map1
)) {
2909 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2910 if (map2
->p
[0]->n_eq
== 1)
2911 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2913 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2914 map2
->p
[0]->ineq
[0]);
2916 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2917 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2921 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2922 isl_basic_map_free(map1
->p
[0]);
2935 /* map2 may be either a parameter domain or a map living in the same
2938 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2939 __isl_take isl_map
*map2
)
2948 if ((isl_map_plain_is_empty(map1
) ||
2949 isl_map_plain_is_universe(map2
)) &&
2950 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2954 if ((isl_map_plain_is_empty(map2
) ||
2955 isl_map_plain_is_universe(map1
)) &&
2956 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2961 if (map1
->n
== 1 && map2
->n
== 1 &&
2962 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2963 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2964 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2965 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2966 return map_intersect_add_constraint(map1
, map2
);
2968 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2969 isl_space_dim(map2
->dim
, isl_dim_param
))
2970 isl_assert(map1
->ctx
,
2971 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2973 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2974 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2975 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2977 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2978 map1
->n
* map2
->n
, flags
);
2981 for (i
= 0; i
< map1
->n
; ++i
)
2982 for (j
= 0; j
< map2
->n
; ++j
) {
2983 struct isl_basic_map
*part
;
2984 part
= isl_basic_map_intersect(
2985 isl_basic_map_copy(map1
->p
[i
]),
2986 isl_basic_map_copy(map2
->p
[j
]));
2987 if (isl_basic_map_is_empty(part
) < 0)
2988 part
= isl_basic_map_free(part
);
2989 result
= isl_map_add_basic_map(result
, part
);
3002 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3003 __isl_take isl_map
*map2
)
3007 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3008 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3009 "spaces don't match", goto error
);
3010 return map_intersect_internal(map1
, map2
);
3017 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3018 __isl_take isl_map
*map2
)
3020 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3023 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3025 return (struct isl_set
*)
3026 isl_map_intersect((struct isl_map
*)set1
,
3027 (struct isl_map
*)set2
);
3030 /* map_intersect_internal accepts intersections
3031 * with parameter domains, so we can just call that function.
3033 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3034 __isl_take isl_set
*params
)
3036 return map_intersect_internal(map
, params
);
3039 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3040 __isl_take isl_map
*map2
)
3042 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3045 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3046 __isl_take isl_set
*params
)
3048 return isl_map_intersect_params(set
, params
);
3051 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3054 struct isl_basic_set
*bset
;
3059 bmap
= isl_basic_map_cow(bmap
);
3062 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3063 in
= isl_basic_map_n_in(bmap
);
3064 bset
= isl_basic_set_from_basic_map(bmap
);
3065 bset
= isl_basic_set_swap_vars(bset
, in
);
3066 return isl_basic_map_from_basic_set(bset
, dim
);
3069 static __isl_give isl_basic_map
*basic_map_space_reset(
3070 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3076 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3079 space
= isl_basic_map_get_space(bmap
);
3080 space
= isl_space_reset(space
, type
);
3081 bmap
= isl_basic_map_reset_space(bmap
, space
);
3085 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3086 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3087 unsigned pos
, unsigned n
)
3090 struct isl_basic_map
*res
;
3091 struct isl_dim_map
*dim_map
;
3092 unsigned total
, off
;
3093 enum isl_dim_type t
;
3096 return basic_map_space_reset(bmap
, type
);
3101 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3103 total
= isl_basic_map_total_dim(bmap
) + n
;
3104 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3106 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3108 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3110 unsigned size
= isl_basic_map_dim(bmap
, t
);
3111 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3113 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3114 pos
, size
- pos
, off
+ pos
+ n
);
3116 off
+= isl_space_dim(res_dim
, t
);
3118 isl_dim_map_div(dim_map
, bmap
, off
);
3120 res
= isl_basic_map_alloc_space(res_dim
,
3121 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3122 if (isl_basic_map_is_rational(bmap
))
3123 res
= isl_basic_map_set_rational(res
);
3124 if (isl_basic_map_plain_is_empty(bmap
)) {
3125 isl_basic_map_free(bmap
);
3127 return isl_basic_map_set_to_empty(res
);
3129 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3130 return isl_basic_map_finalize(res
);
3133 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3134 __isl_take isl_basic_set
*bset
,
3135 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3137 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3140 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3141 enum isl_dim_type type
, unsigned n
)
3145 return isl_basic_map_insert_dims(bmap
, type
,
3146 isl_basic_map_dim(bmap
, type
), n
);
3149 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3150 enum isl_dim_type type
, unsigned n
)
3154 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3155 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3157 isl_basic_set_free(bset
);
3161 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3162 enum isl_dim_type type
)
3166 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3169 space
= isl_map_get_space(map
);
3170 space
= isl_space_reset(space
, type
);
3171 map
= isl_map_reset_space(map
, space
);
3175 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3176 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3181 return map_space_reset(map
, type
);
3183 map
= isl_map_cow(map
);
3187 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3191 for (i
= 0; i
< map
->n
; ++i
) {
3192 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3203 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3204 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3206 return isl_map_insert_dims(set
, type
, pos
, n
);
3209 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3210 enum isl_dim_type type
, unsigned n
)
3214 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3217 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3218 enum isl_dim_type type
, unsigned n
)
3222 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3223 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3229 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3230 __isl_take isl_basic_map
*bmap
,
3231 enum isl_dim_type dst_type
, unsigned dst_pos
,
3232 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3234 struct isl_dim_map
*dim_map
;
3235 struct isl_basic_map
*res
;
3236 enum isl_dim_type t
;
3237 unsigned total
, off
;
3244 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3247 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3250 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3252 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3253 pos(bmap
->dim
, src_type
) + src_pos
+
3254 ((src_type
< dst_type
) ? n
: 0)) {
3255 bmap
= isl_basic_map_cow(bmap
);
3259 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3260 src_type
, src_pos
, n
);
3264 bmap
= isl_basic_map_finalize(bmap
);
3269 total
= isl_basic_map_total_dim(bmap
);
3270 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3273 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3274 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3275 if (t
== dst_type
) {
3276 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3279 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3282 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3283 dst_pos
, size
- dst_pos
, off
);
3284 off
+= size
- dst_pos
;
3285 } else if (t
== src_type
) {
3286 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3289 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3290 src_pos
+ n
, size
- src_pos
- n
, off
);
3291 off
+= size
- src_pos
- n
;
3293 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3297 isl_dim_map_div(dim_map
, bmap
, off
);
3299 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3300 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3301 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3305 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3306 src_type
, src_pos
, n
);
3310 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3311 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3312 bmap
= isl_basic_map_finalize(bmap
);
3316 isl_basic_map_free(bmap
);
3320 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3321 enum isl_dim_type dst_type
, unsigned dst_pos
,
3322 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3324 return (isl_basic_set
*)isl_basic_map_move_dims(
3325 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3328 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3329 enum isl_dim_type dst_type
, unsigned dst_pos
,
3330 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3334 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3335 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3336 src_type
, src_pos
, n
);
3342 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3343 enum isl_dim_type dst_type
, unsigned dst_pos
,
3344 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3353 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3356 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3359 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3361 map
= isl_map_cow(map
);
3365 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3369 for (i
= 0; i
< map
->n
; ++i
) {
3370 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3372 src_type
, src_pos
, n
);
3383 /* Move the specified dimensions to the last columns right before
3384 * the divs. Don't change the dimension specification of bmap.
3385 * That's the responsibility of the caller.
3387 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3388 enum isl_dim_type type
, unsigned first
, unsigned n
)
3390 struct isl_dim_map
*dim_map
;
3391 struct isl_basic_map
*res
;
3392 enum isl_dim_type t
;
3393 unsigned total
, off
;
3397 if (pos(bmap
->dim
, type
) + first
+ n
==
3398 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3401 total
= isl_basic_map_total_dim(bmap
);
3402 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3405 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3406 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3408 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3411 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3412 first
, n
, total
- bmap
->n_div
- n
);
3413 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3414 first
+ n
, size
- (first
+ n
), off
);
3415 off
+= size
- (first
+ n
);
3417 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3421 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3423 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3424 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3425 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3429 /* Insert "n" rows in the divs of "bmap".
3431 * The number of columns is not changed, which means that the last
3432 * dimensions of "bmap" are being reintepreted as the new divs.
3433 * The space of "bmap" is not adjusted, however, which means
3434 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3435 * from the space of "bmap" is the responsibility of the caller.
3437 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3445 bmap
= isl_basic_map_cow(bmap
);
3449 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3450 old
= bmap
->block2
.data
;
3451 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3452 (bmap
->extra
+ n
) * (1 + row_size
));
3453 if (!bmap
->block2
.data
)
3454 return isl_basic_map_free(bmap
);
3455 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3457 return isl_basic_map_free(bmap
);
3458 for (i
= 0; i
< n
; ++i
) {
3459 new_div
[i
] = bmap
->block2
.data
+
3460 (bmap
->extra
+ i
) * (1 + row_size
);
3461 isl_seq_clr(new_div
[i
], 1 + row_size
);
3463 for (i
= 0; i
< bmap
->extra
; ++i
)
3464 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3466 bmap
->div
= new_div
;
3473 /* Turn the n dimensions of type type, starting at first
3474 * into existentially quantified variables.
3476 __isl_give isl_basic_map
*isl_basic_map_project_out(
3477 __isl_take isl_basic_map
*bmap
,
3478 enum isl_dim_type type
, unsigned first
, unsigned n
)
3481 return basic_map_space_reset(bmap
, type
);
3486 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3487 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3489 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3492 bmap
= move_last(bmap
, type
, first
, n
);
3493 bmap
= isl_basic_map_cow(bmap
);
3494 bmap
= insert_div_rows(bmap
, n
);
3498 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3501 bmap
= isl_basic_map_simplify(bmap
);
3502 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3503 return isl_basic_map_finalize(bmap
);
3505 isl_basic_map_free(bmap
);
3509 /* Turn the n dimensions of type type, starting at first
3510 * into existentially quantified variables.
3512 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3513 enum isl_dim_type type
, unsigned first
, unsigned n
)
3515 return (isl_basic_set
*)isl_basic_map_project_out(
3516 (isl_basic_map
*)bset
, type
, first
, n
);
3519 /* Turn the n dimensions of type type, starting at first
3520 * into existentially quantified variables.
3522 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3523 enum isl_dim_type type
, unsigned first
, unsigned n
)
3531 return map_space_reset(map
, type
);
3533 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3535 map
= isl_map_cow(map
);
3539 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3543 for (i
= 0; i
< map
->n
; ++i
) {
3544 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3555 /* Turn the n dimensions of type type, starting at first
3556 * into existentially quantified variables.
3558 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3559 enum isl_dim_type type
, unsigned first
, unsigned n
)
3561 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3564 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3568 for (i
= 0; i
< n
; ++i
) {
3569 j
= isl_basic_map_alloc_div(bmap
);
3572 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3576 isl_basic_map_free(bmap
);
3580 struct isl_basic_map
*isl_basic_map_apply_range(
3581 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3583 isl_space
*dim_result
= NULL
;
3584 struct isl_basic_map
*bmap
;
3585 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3586 struct isl_dim_map
*dim_map1
, *dim_map2
;
3588 if (!bmap1
|| !bmap2
)
3590 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3591 bmap2
->dim
, isl_dim_param
))
3592 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3593 "parameters don't match", goto error
);
3594 if (!isl_space_tuple_match(bmap1
->dim
, isl_dim_out
,
3595 bmap2
->dim
, isl_dim_in
))
3596 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3597 "spaces don't match", goto error
);
3599 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3600 isl_space_copy(bmap2
->dim
));
3602 n_in
= isl_basic_map_n_in(bmap1
);
3603 n_out
= isl_basic_map_n_out(bmap2
);
3604 n
= isl_basic_map_n_out(bmap1
);
3605 nparam
= isl_basic_map_n_param(bmap1
);
3607 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3608 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3609 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3610 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3611 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3612 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3613 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3614 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3615 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3616 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3617 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3619 bmap
= isl_basic_map_alloc_space(dim_result
,
3620 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3621 bmap1
->n_eq
+ bmap2
->n_eq
,
3622 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3623 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3624 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3625 bmap
= add_divs(bmap
, n
);
3626 bmap
= isl_basic_map_simplify(bmap
);
3627 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3628 return isl_basic_map_finalize(bmap
);
3630 isl_basic_map_free(bmap1
);
3631 isl_basic_map_free(bmap2
);
3635 struct isl_basic_set
*isl_basic_set_apply(
3636 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3641 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3644 return (struct isl_basic_set
*)
3645 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3647 isl_basic_set_free(bset
);
3648 isl_basic_map_free(bmap
);
3652 struct isl_basic_map
*isl_basic_map_apply_domain(
3653 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3655 if (!bmap1
|| !bmap2
)
3658 isl_assert(bmap1
->ctx
,
3659 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3660 isl_assert(bmap1
->ctx
,
3661 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3664 bmap1
= isl_basic_map_reverse(bmap1
);
3665 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3666 return isl_basic_map_reverse(bmap1
);
3668 isl_basic_map_free(bmap1
);
3669 isl_basic_map_free(bmap2
);
3673 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3674 * A \cap B -> f(A) + f(B)
3676 struct isl_basic_map
*isl_basic_map_sum(
3677 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3679 unsigned n_in
, n_out
, nparam
, total
, pos
;
3680 struct isl_basic_map
*bmap
= NULL
;
3681 struct isl_dim_map
*dim_map1
, *dim_map2
;
3684 if (!bmap1
|| !bmap2
)
3687 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3690 nparam
= isl_basic_map_n_param(bmap1
);
3691 n_in
= isl_basic_map_n_in(bmap1
);
3692 n_out
= isl_basic_map_n_out(bmap1
);
3694 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3695 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3696 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3697 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3698 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3699 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3700 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3701 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3702 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3703 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3704 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3706 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3707 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3708 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3709 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3710 for (i
= 0; i
< n_out
; ++i
) {
3711 int j
= isl_basic_map_alloc_equality(bmap
);
3714 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3715 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3716 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3717 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3719 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3720 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3721 bmap
= add_divs(bmap
, 2 * n_out
);
3723 bmap
= isl_basic_map_simplify(bmap
);
3724 return isl_basic_map_finalize(bmap
);
3726 isl_basic_map_free(bmap
);
3727 isl_basic_map_free(bmap1
);
3728 isl_basic_map_free(bmap2
);
3732 /* Given two maps A -> f(A) and B -> g(B), construct a map
3733 * A \cap B -> f(A) + f(B)
3735 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3737 struct isl_map
*result
;
3743 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3745 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3746 map1
->n
* map2
->n
, 0);
3749 for (i
= 0; i
< map1
->n
; ++i
)
3750 for (j
= 0; j
< map2
->n
; ++j
) {
3751 struct isl_basic_map
*part
;
3752 part
= isl_basic_map_sum(
3753 isl_basic_map_copy(map1
->p
[i
]),
3754 isl_basic_map_copy(map2
->p
[j
]));
3755 if (isl_basic_map_is_empty(part
))
3756 isl_basic_map_free(part
);
3758 result
= isl_map_add_basic_map(result
, part
);
3771 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3772 __isl_take isl_set
*set2
)
3774 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3777 /* Given a basic map A -> f(A), construct A -> -f(A).
3779 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3784 bmap
= isl_basic_map_cow(bmap
);
3788 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3789 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3790 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3791 for (j
= 0; j
< n
; ++j
)
3792 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3793 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3794 for (j
= 0; j
< n
; ++j
)
3795 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3796 for (i
= 0; i
< bmap
->n_div
; ++i
)
3797 for (j
= 0; j
< n
; ++j
)
3798 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3799 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3800 return isl_basic_map_finalize(bmap
);
3803 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3805 return isl_basic_map_neg(bset
);
3808 /* Given a map A -> f(A), construct A -> -f(A).
3810 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3814 map
= isl_map_cow(map
);
3818 for (i
= 0; i
< map
->n
; ++i
) {
3819 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3830 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3832 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3835 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3836 * A -> floor(f(A)/d).
3838 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3841 unsigned n_in
, n_out
, nparam
, total
, pos
;
3842 struct isl_basic_map
*result
= NULL
;
3843 struct isl_dim_map
*dim_map
;
3849 nparam
= isl_basic_map_n_param(bmap
);
3850 n_in
= isl_basic_map_n_in(bmap
);
3851 n_out
= isl_basic_map_n_out(bmap
);
3853 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3854 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3855 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3856 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3857 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3858 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3860 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3861 bmap
->n_div
+ n_out
,
3862 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3863 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3864 result
= add_divs(result
, n_out
);
3865 for (i
= 0; i
< n_out
; ++i
) {
3867 j
= isl_basic_map_alloc_inequality(result
);
3870 isl_seq_clr(result
->ineq
[j
], 1+total
);
3871 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3872 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3873 j
= isl_basic_map_alloc_inequality(result
);
3876 isl_seq_clr(result
->ineq
[j
], 1+total
);
3877 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3878 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3879 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3882 result
= isl_basic_map_simplify(result
);
3883 return isl_basic_map_finalize(result
);
3885 isl_basic_map_free(result
);
3889 /* Given a map A -> f(A) and an integer d, construct a map
3890 * A -> floor(f(A)/d).
3892 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3896 map
= isl_map_cow(map
);
3900 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3901 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3902 for (i
= 0; i
< map
->n
; ++i
) {
3903 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3914 /* Given a map A -> f(A) and an integer d, construct a map
3915 * A -> floor(f(A)/d).
3917 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
3918 __isl_take isl_val
*d
)
3922 if (!isl_val_is_int(d
))
3923 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
3924 "expecting integer denominator", goto error
);
3925 map
= isl_map_floordiv(map
, d
->n
);
3934 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3940 i
= isl_basic_map_alloc_equality(bmap
);
3943 nparam
= isl_basic_map_n_param(bmap
);
3944 n_in
= isl_basic_map_n_in(bmap
);
3945 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3946 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3947 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3948 return isl_basic_map_finalize(bmap
);
3950 isl_basic_map_free(bmap
);
3954 /* Add a constraints to "bmap" expressing i_pos < o_pos
3956 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3962 i
= isl_basic_map_alloc_inequality(bmap
);
3965 nparam
= isl_basic_map_n_param(bmap
);
3966 n_in
= isl_basic_map_n_in(bmap
);
3967 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3968 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3969 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3970 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3971 return isl_basic_map_finalize(bmap
);
3973 isl_basic_map_free(bmap
);
3977 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3979 static __isl_give isl_basic_map
*var_less_or_equal(
3980 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3986 i
= isl_basic_map_alloc_inequality(bmap
);
3989 nparam
= isl_basic_map_n_param(bmap
);
3990 n_in
= isl_basic_map_n_in(bmap
);
3991 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3992 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3993 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3994 return isl_basic_map_finalize(bmap
);
3996 isl_basic_map_free(bmap
);
4000 /* Add a constraints to "bmap" expressing i_pos > o_pos
4002 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
4008 i
= isl_basic_map_alloc_inequality(bmap
);
4011 nparam
= isl_basic_map_n_param(bmap
);
4012 n_in
= isl_basic_map_n_in(bmap
);
4013 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4014 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4015 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4016 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4017 return isl_basic_map_finalize(bmap
);
4019 isl_basic_map_free(bmap
);
4023 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4025 static __isl_give isl_basic_map
*var_more_or_equal(
4026 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4032 i
= isl_basic_map_alloc_inequality(bmap
);
4035 nparam
= isl_basic_map_n_param(bmap
);
4036 n_in
= isl_basic_map_n_in(bmap
);
4037 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4038 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4039 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4040 return isl_basic_map_finalize(bmap
);
4042 isl_basic_map_free(bmap
);
4046 __isl_give isl_basic_map
*isl_basic_map_equal(
4047 __isl_take isl_space
*dim
, unsigned n_equal
)
4050 struct isl_basic_map
*bmap
;
4051 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4054 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4055 bmap
= var_equal(bmap
, i
);
4056 return isl_basic_map_finalize(bmap
);
4059 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4061 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4065 struct isl_basic_map
*bmap
;
4066 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4069 for (i
= 0; i
< pos
&& bmap
; ++i
)
4070 bmap
= var_equal(bmap
, i
);
4072 bmap
= var_less(bmap
, pos
);
4073 return isl_basic_map_finalize(bmap
);
4076 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4078 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4079 __isl_take isl_space
*dim
, unsigned pos
)
4082 isl_basic_map
*bmap
;
4084 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4085 for (i
= 0; i
< pos
; ++i
)
4086 bmap
= var_equal(bmap
, i
);
4087 bmap
= var_less_or_equal(bmap
, pos
);
4088 return isl_basic_map_finalize(bmap
);
4091 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4093 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4097 struct isl_basic_map
*bmap
;
4098 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4101 for (i
= 0; i
< pos
&& bmap
; ++i
)
4102 bmap
= var_equal(bmap
, i
);
4104 bmap
= var_more(bmap
, pos
);
4105 return isl_basic_map_finalize(bmap
);
4108 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4110 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4111 __isl_take isl_space
*dim
, unsigned pos
)
4114 isl_basic_map
*bmap
;
4116 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4117 for (i
= 0; i
< pos
; ++i
)
4118 bmap
= var_equal(bmap
, i
);
4119 bmap
= var_more_or_equal(bmap
, pos
);
4120 return isl_basic_map_finalize(bmap
);
4123 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4124 unsigned n
, int equal
)
4126 struct isl_map
*map
;
4129 if (n
== 0 && equal
)
4130 return isl_map_universe(dims
);
4132 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4134 for (i
= 0; i
+ 1 < n
; ++i
)
4135 map
= isl_map_add_basic_map(map
,
4136 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4139 map
= isl_map_add_basic_map(map
,
4140 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4142 map
= isl_map_add_basic_map(map
,
4143 isl_basic_map_less_at(dims
, n
- 1));
4145 isl_space_free(dims
);
4150 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4154 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4157 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4159 return map_lex_lte_first(dim
, n
, 0);
4162 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4164 return map_lex_lte_first(dim
, n
, 1);
4167 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4169 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4172 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4174 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4177 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4178 unsigned n
, int equal
)
4180 struct isl_map
*map
;
4183 if (n
== 0 && equal
)
4184 return isl_map_universe(dims
);
4186 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4188 for (i
= 0; i
+ 1 < n
; ++i
)
4189 map
= isl_map_add_basic_map(map
,
4190 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4193 map
= isl_map_add_basic_map(map
,
4194 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4196 map
= isl_map_add_basic_map(map
,
4197 isl_basic_map_more_at(dims
, n
- 1));
4199 isl_space_free(dims
);
4204 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4208 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4211 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4213 return map_lex_gte_first(dim
, n
, 0);
4216 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4218 return map_lex_gte_first(dim
, n
, 1);
4221 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4223 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4226 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4228 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4231 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4232 __isl_take isl_set
*set2
)
4235 map
= isl_map_lex_le(isl_set_get_space(set1
));
4236 map
= isl_map_intersect_domain(map
, set1
);
4237 map
= isl_map_intersect_range(map
, set2
);
4241 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4242 __isl_take isl_set
*set2
)
4245 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4246 map
= isl_map_intersect_domain(map
, set1
);
4247 map
= isl_map_intersect_range(map
, set2
);
4251 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4252 __isl_take isl_set
*set2
)
4255 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4256 map
= isl_map_intersect_domain(map
, set1
);
4257 map
= isl_map_intersect_range(map
, set2
);
4261 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4262 __isl_take isl_set
*set2
)
4265 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4266 map
= isl_map_intersect_domain(map
, set1
);
4267 map
= isl_map_intersect_range(map
, set2
);
4271 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4272 __isl_take isl_map
*map2
)
4275 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4276 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4277 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4281 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4282 __isl_take isl_map
*map2
)
4285 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4286 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4287 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4291 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4292 __isl_take isl_map
*map2
)
4295 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4296 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4297 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4301 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4302 __isl_take isl_map
*map2
)
4305 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4306 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4307 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4311 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4312 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4314 struct isl_basic_map
*bmap
;
4316 bset
= isl_basic_set_cow(bset
);
4320 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4321 isl_space_free(bset
->dim
);
4322 bmap
= (struct isl_basic_map
*) bset
;
4324 return isl_basic_map_finalize(bmap
);
4326 isl_basic_set_free(bset
);
4327 isl_space_free(dim
);
4331 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4335 if (bmap
->dim
->n_in
== 0)
4336 return (struct isl_basic_set
*)bmap
;
4337 bmap
= isl_basic_map_cow(bmap
);
4340 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4343 bmap
= isl_basic_map_finalize(bmap
);
4344 return (struct isl_basic_set
*)bmap
;
4346 isl_basic_map_free(bmap
);
4350 /* For a div d = floor(f/m), add the constraints
4353 * -(f-(n-1)) + m d >= 0
4355 * Note that the second constraint is the negation of
4359 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4360 unsigned pos
, isl_int
*div
)
4363 unsigned total
= isl_basic_map_total_dim(bmap
);
4365 i
= isl_basic_map_alloc_inequality(bmap
);
4368 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4369 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4371 j
= isl_basic_map_alloc_inequality(bmap
);
4374 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4375 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4376 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4380 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4381 unsigned pos
, isl_int
*div
)
4383 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4387 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4389 unsigned total
= isl_basic_map_total_dim(bmap
);
4390 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4392 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4396 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4398 return isl_basic_map_add_div_constraints(bset
, div
);
4401 struct isl_basic_set
*isl_basic_map_underlying_set(
4402 struct isl_basic_map
*bmap
)
4406 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4408 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4409 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4410 return (struct isl_basic_set
*)bmap
;
4411 bmap
= isl_basic_map_cow(bmap
);
4414 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4417 bmap
->extra
-= bmap
->n_div
;
4419 bmap
= isl_basic_map_finalize(bmap
);
4420 return (struct isl_basic_set
*)bmap
;
4422 isl_basic_map_free(bmap
);
4426 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4427 __isl_take isl_basic_set
*bset
)
4429 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4432 struct isl_basic_map
*isl_basic_map_overlying_set(
4433 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4435 struct isl_basic_map
*bmap
;
4436 struct isl_ctx
*ctx
;
4443 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4444 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4445 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4447 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4448 isl_basic_map_free(like
);
4449 return (struct isl_basic_map
*)bset
;
4451 bset
= isl_basic_set_cow(bset
);
4454 total
= bset
->dim
->n_out
+ bset
->extra
;
4455 bmap
= (struct isl_basic_map
*)bset
;
4456 isl_space_free(bmap
->dim
);
4457 bmap
->dim
= isl_space_copy(like
->dim
);
4460 bmap
->n_div
= like
->n_div
;
4461 bmap
->extra
+= like
->n_div
;
4465 ltotal
= total
- bmap
->extra
+ like
->extra
;
4468 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4469 bmap
->extra
* (1 + 1 + total
));
4470 if (isl_blk_is_error(bmap
->block2
))
4472 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4476 for (i
= 0; i
< bmap
->extra
; ++i
)
4477 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4478 for (i
= 0; i
< like
->n_div
; ++i
) {
4479 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4480 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4482 bmap
= isl_basic_map_extend_constraints(bmap
,
4483 0, 2 * like
->n_div
);
4484 for (i
= 0; i
< like
->n_div
; ++i
) {
4487 if (isl_int_is_zero(bmap
->div
[i
][0]))
4489 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4490 bmap
= isl_basic_map_free(bmap
);
4493 isl_basic_map_free(like
);
4494 bmap
= isl_basic_map_simplify(bmap
);
4495 bmap
= isl_basic_map_finalize(bmap
);
4498 isl_basic_map_free(like
);
4499 isl_basic_set_free(bset
);
4503 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4504 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4506 return (struct isl_basic_set
*)
4507 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4510 struct isl_set
*isl_set_from_underlying_set(
4511 struct isl_set
*set
, struct isl_basic_set
*like
)
4517 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4519 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4520 isl_basic_set_free(like
);
4523 set
= isl_set_cow(set
);
4526 for (i
= 0; i
< set
->n
; ++i
) {
4527 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4528 isl_basic_set_copy(like
));
4532 isl_space_free(set
->dim
);
4533 set
->dim
= isl_space_copy(like
->dim
);
4536 isl_basic_set_free(like
);
4539 isl_basic_set_free(like
);
4544 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4548 map
= isl_map_cow(map
);
4551 map
->dim
= isl_space_cow(map
->dim
);
4555 for (i
= 1; i
< map
->n
; ++i
)
4556 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4558 for (i
= 0; i
< map
->n
; ++i
) {
4559 map
->p
[i
] = (struct isl_basic_map
*)
4560 isl_basic_map_underlying_set(map
->p
[i
]);
4565 map
->dim
= isl_space_underlying(map
->dim
, 0);
4567 isl_space_free(map
->dim
);
4568 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4572 return (struct isl_set
*)map
;
4578 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4580 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4583 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4584 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4586 bmap
= isl_basic_map_cow(bmap
);
4590 isl_space_free(bmap
->dim
);
4593 bmap
= isl_basic_map_finalize(bmap
);
4597 isl_basic_map_free(bmap
);
4598 isl_space_free(dim
);
4602 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4603 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4605 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4609 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4610 __isl_take isl_space
*dim
)
4614 map
= isl_map_cow(map
);
4618 for (i
= 0; i
< map
->n
; ++i
) {
4619 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4620 isl_space_copy(dim
));
4624 isl_space_free(map
->dim
);
4630 isl_space_free(dim
);
4634 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4635 __isl_take isl_space
*dim
)
4637 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4640 /* Compute the parameter domain of the given basic set.
4642 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4647 if (isl_basic_set_is_params(bset
))
4650 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4651 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4652 space
= isl_basic_set_get_space(bset
);
4653 space
= isl_space_params(space
);
4654 bset
= isl_basic_set_reset_space(bset
, space
);
4658 /* Construct a zero-dimensional basic set with the given parameter domain.
4660 __isl_give isl_basic_set
*isl_basic_set_from_params(
4661 __isl_take isl_basic_set
*bset
)
4664 space
= isl_basic_set_get_space(bset
);
4665 space
= isl_space_set_from_params(space
);
4666 bset
= isl_basic_set_reset_space(bset
, space
);
4670 /* Compute the parameter domain of the given set.
4672 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4677 if (isl_set_is_params(set
))
4680 n
= isl_set_dim(set
, isl_dim_set
);
4681 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4682 space
= isl_set_get_space(set
);
4683 space
= isl_space_params(space
);
4684 set
= isl_set_reset_space(set
, space
);
4688 /* Construct a zero-dimensional set with the given parameter domain.
4690 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4693 space
= isl_set_get_space(set
);
4694 space
= isl_space_set_from_params(space
);
4695 set
= isl_set_reset_space(set
, space
);
4699 /* Compute the parameter domain of the given map.
4701 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4706 n
= isl_map_dim(map
, isl_dim_in
);
4707 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4708 n
= isl_map_dim(map
, isl_dim_out
);
4709 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4710 space
= isl_map_get_space(map
);
4711 space
= isl_space_params(space
);
4712 map
= isl_map_reset_space(map
, space
);
4716 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4719 struct isl_basic_set
*domain
;
4725 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4727 n_in
= isl_basic_map_n_in(bmap
);
4728 n_out
= isl_basic_map_n_out(bmap
);
4729 domain
= isl_basic_set_from_basic_map(bmap
);
4730 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4732 domain
= isl_basic_set_reset_space(domain
, dim
);
4737 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4741 return isl_space_may_be_set(bmap
->dim
);
4744 /* Is this basic map actually a set?
4745 * Users should never call this function. Outside of isl,
4746 * the type should indicate whether something is a set or a map.
4748 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4752 return isl_space_is_set(bmap
->dim
);
4755 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4759 if (isl_basic_map_is_set(bmap
))
4761 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4764 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4765 __isl_take isl_basic_map
*bmap
)
4769 isl_basic_map
*domain
;
4770 int nparam
, n_in
, n_out
;
4773 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4774 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4775 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4777 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4778 domain
= isl_basic_map_universe(dim
);
4780 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4781 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4782 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4784 total
= isl_basic_map_total_dim(bmap
);
4786 for (i
= 0; i
< n_in
; ++i
) {
4787 k
= isl_basic_map_alloc_equality(bmap
);
4790 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4791 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4792 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4795 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4796 return isl_basic_map_finalize(bmap
);
4798 isl_basic_map_free(bmap
);
4802 __isl_give isl_basic_map
*isl_basic_map_range_map(
4803 __isl_take isl_basic_map
*bmap
)
4807 isl_basic_map
*range
;
4808 int nparam
, n_in
, n_out
;
4811 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4812 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4813 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4815 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4816 range
= isl_basic_map_universe(dim
);
4818 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4819 bmap
= isl_basic_map_apply_range(bmap
, range
);
4820 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4822 total
= isl_basic_map_total_dim(bmap
);
4824 for (i
= 0; i
< n_out
; ++i
) {
4825 k
= isl_basic_map_alloc_equality(bmap
);
4828 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4829 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4830 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4833 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4834 return isl_basic_map_finalize(bmap
);
4836 isl_basic_map_free(bmap
);
4840 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4844 return isl_space_may_be_set(map
->dim
);
4847 /* Is this map actually a set?
4848 * Users should never call this function. Outside of isl,
4849 * the type should indicate whether something is a set or a map.
4851 int isl_map_is_set(__isl_keep isl_map
*map
)
4855 return isl_space_is_set(map
->dim
);
4858 struct isl_set
*isl_map_range(struct isl_map
*map
)
4861 struct isl_set
*set
;
4865 if (isl_map_is_set(map
))
4866 return (isl_set
*)map
;
4868 map
= isl_map_cow(map
);
4872 set
= (struct isl_set
*) map
;
4873 set
->dim
= isl_space_range(set
->dim
);
4876 for (i
= 0; i
< map
->n
; ++i
) {
4877 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4881 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4882 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4889 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4893 map
= isl_map_cow(map
);
4897 map
->dim
= isl_space_domain_map(map
->dim
);
4900 for (i
= 0; i
< map
->n
; ++i
) {
4901 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4905 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4906 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4913 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4916 isl_space
*range_dim
;
4918 map
= isl_map_cow(map
);
4922 range_dim
= isl_space_range(isl_map_get_space(map
));
4923 range_dim
= isl_space_from_range(range_dim
);
4924 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4925 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4928 for (i
= 0; i
< map
->n
; ++i
) {
4929 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4933 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4934 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4941 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4942 __isl_take isl_space
*dim
)
4945 struct isl_map
*map
= NULL
;
4947 set
= isl_set_cow(set
);
4950 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4951 map
= (struct isl_map
*)set
;
4952 for (i
= 0; i
< set
->n
; ++i
) {
4953 map
->p
[i
] = isl_basic_map_from_basic_set(
4954 set
->p
[i
], isl_space_copy(dim
));
4958 isl_space_free(map
->dim
);
4962 isl_space_free(dim
);
4967 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4968 __isl_take isl_basic_set
*bset
)
4970 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4973 __isl_give isl_basic_map
*isl_basic_map_from_range(
4974 __isl_take isl_basic_set
*bset
)
4977 space
= isl_basic_set_get_space(bset
);
4978 space
= isl_space_from_range(space
);
4979 bset
= isl_basic_set_reset_space(bset
, space
);
4980 return (isl_basic_map
*)bset
;
4983 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4986 space
= isl_set_get_space(set
);
4987 space
= isl_space_from_range(space
);
4988 set
= isl_set_reset_space(set
, space
);
4989 return (struct isl_map
*)set
;
4992 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4994 return isl_map_reverse(isl_map_from_range(set
));
4997 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4998 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5000 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5003 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5004 __isl_take isl_set
*range
)
5006 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5009 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
5012 struct isl_set
*set
= NULL
;
5016 map
= isl_map_cow(map
);
5019 map
->dim
= isl_space_as_set_space(map
->dim
);
5022 set
= (struct isl_set
*)map
;
5023 for (i
= 0; i
< map
->n
; ++i
) {
5024 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
5034 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
5037 struct isl_map
*map
;
5042 isl_die(dim
->ctx
, isl_error_internal
,
5043 "negative number of basic maps", goto error
);
5044 map
= isl_alloc(dim
->ctx
, struct isl_map
,
5045 sizeof(struct isl_map
) +
5046 (n
- 1) * sizeof(struct isl_basic_map
*));
5050 map
->ctx
= dim
->ctx
;
5051 isl_ctx_ref(map
->ctx
);
5059 isl_space_free(dim
);
5063 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5064 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5067 struct isl_map
*map
;
5070 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5074 map
= isl_map_alloc_space(dims
, n
, flags
);
5078 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5080 struct isl_basic_map
*bmap
;
5081 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5082 bmap
= isl_basic_map_set_to_empty(bmap
);
5086 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5088 struct isl_basic_set
*bset
;
5089 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5090 bset
= isl_basic_set_set_to_empty(bset
);
5094 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5096 struct isl_basic_map
*bmap
;
5099 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5100 bmap
= isl_basic_map_set_to_empty(bmap
);
5104 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5106 struct isl_basic_map
*bmap
;
5109 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5110 bmap
= isl_basic_map_set_to_empty(bmap
);
5114 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5116 struct isl_basic_set
*bset
;
5119 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5120 bset
= isl_basic_set_set_to_empty(bset
);
5124 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5126 struct isl_basic_map
*bmap
;
5127 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5128 bmap
= isl_basic_map_finalize(bmap
);
5132 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5134 struct isl_basic_set
*bset
;
5135 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5136 bset
= isl_basic_set_finalize(bset
);
5140 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5143 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5144 isl_basic_map
*bmap
;
5146 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5147 for (i
= 0; i
< total
; ++i
) {
5148 int k
= isl_basic_map_alloc_inequality(bmap
);
5151 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5152 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5156 isl_basic_map_free(bmap
);
5160 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5162 return isl_basic_map_nat_universe(dim
);
5165 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5167 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5170 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5172 return isl_map_nat_universe(dim
);
5175 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5176 __isl_keep isl_basic_map
*model
)
5180 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5183 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5187 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5190 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5191 __isl_keep isl_set
*model
)
5195 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5198 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5200 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5203 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5207 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5210 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5214 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5217 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5219 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5222 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5226 return isl_set_empty(isl_space_copy(model
->dim
));
5229 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5231 struct isl_map
*map
;
5234 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5235 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5239 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5241 struct isl_set
*set
;
5244 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5245 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5249 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5253 return isl_set_universe(isl_space_copy(model
->dim
));
5256 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5259 struct isl_map
*dup
;
5263 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5264 for (i
= 0; i
< map
->n
; ++i
)
5265 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5269 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5270 __isl_take isl_basic_map
*bmap
)
5274 if (isl_basic_map_plain_is_empty(bmap
)) {
5275 isl_basic_map_free(bmap
);
5278 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5279 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5280 map
->p
[map
->n
] = bmap
;
5282 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5288 isl_basic_map_free(bmap
);
5292 void *isl_map_free(struct isl_map
*map
)
5302 isl_ctx_deref(map
->ctx
);
5303 for (i
= 0; i
< map
->n
; ++i
)
5304 isl_basic_map_free(map
->p
[i
]);
5305 isl_space_free(map
->dim
);
5311 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5312 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5316 base
= isl_map_cow(base
);
5320 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5323 for (i
= 0; i
< base
->n
; ++i
) {
5324 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5325 isl_space_copy(base
->dim
), 0, 0, 0);
5335 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5336 unsigned nparam
, unsigned dim
)
5338 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5342 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5343 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5347 bmap
= isl_basic_map_cow(bmap
);
5348 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5349 j
= isl_basic_map_alloc_equality(bmap
);
5352 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5353 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5354 isl_int_set_si(bmap
->eq
[j
][0], value
);
5355 bmap
= isl_basic_map_simplify(bmap
);
5356 return isl_basic_map_finalize(bmap
);
5358 isl_basic_map_free(bmap
);
5362 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5363 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5367 bmap
= isl_basic_map_cow(bmap
);
5368 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5369 j
= isl_basic_map_alloc_equality(bmap
);
5372 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5373 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5374 isl_int_set(bmap
->eq
[j
][0], value
);
5375 bmap
= isl_basic_map_simplify(bmap
);
5376 return isl_basic_map_finalize(bmap
);
5378 isl_basic_map_free(bmap
);
5382 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5383 enum isl_dim_type type
, unsigned pos
, int value
)
5387 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5388 return isl_basic_map_fix_pos_si(bmap
,
5389 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5391 isl_basic_map_free(bmap
);
5395 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5396 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5400 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5401 return isl_basic_map_fix_pos(bmap
,
5402 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5404 isl_basic_map_free(bmap
);
5408 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5409 * to be equal to "v".
5411 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5412 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5416 if (!isl_val_is_int(v
))
5417 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5418 "expecting integer value", goto error
);
5419 if (pos
>= isl_basic_map_dim(bmap
, type
))
5420 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5421 "index out of bounds", goto error
);
5422 pos
+= isl_basic_map_offset(bmap
, type
);
5423 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5427 isl_basic_map_free(bmap
);
5432 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5433 * to be equal to "v".
5435 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5436 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5438 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5441 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5442 enum isl_dim_type type
, unsigned pos
, int value
)
5444 return (struct isl_basic_set
*)
5445 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5449 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5450 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5452 return (struct isl_basic_set
*)
5453 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5457 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5458 unsigned input
, int value
)
5460 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5463 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5464 unsigned dim
, int value
)
5466 return (struct isl_basic_set
*)
5467 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5468 isl_dim_set
, dim
, value
);
5471 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5473 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5480 isl_basic_map_free(map
->p
[i
]);
5481 if (i
!= map
->n
- 1) {
5482 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5483 map
->p
[i
] = map
->p
[map
->n
- 1];
5490 /* Perform "fn" on each basic map of "map", where we may not be holding
5491 * the only reference to "map".
5492 * In particular, "fn" should be a semantics preserving operation
5493 * that we want to apply to all copies of "map". We therefore need
5494 * to be careful not to modify "map" in a way that breaks "map"
5495 * in case anything goes wrong.
5497 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5498 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5500 struct isl_basic_map
*bmap
;
5506 for (i
= map
->n
- 1; i
>= 0; --i
) {
5507 bmap
= isl_basic_map_copy(map
->p
[i
]);
5511 isl_basic_map_free(map
->p
[i
]);
5513 if (remove_if_empty(map
, i
) < 0)
5523 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5524 enum isl_dim_type type
, unsigned pos
, int value
)
5528 map
= isl_map_cow(map
);
5532 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5533 for (i
= map
->n
- 1; i
>= 0; --i
) {
5534 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5535 if (remove_if_empty(map
, i
) < 0)
5538 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5545 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5546 enum isl_dim_type type
, unsigned pos
, int value
)
5548 return (struct isl_set
*)
5549 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5552 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5553 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5557 map
= isl_map_cow(map
);
5561 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5562 for (i
= 0; i
< map
->n
; ++i
) {
5563 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5567 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5574 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5575 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5577 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5580 /* Fix the value of the variable at position "pos" of type "type" of "map"
5581 * to be equal to "v".
5583 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5584 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5588 map
= isl_map_cow(map
);
5592 if (!isl_val_is_int(v
))
5593 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5594 "expecting integer value", goto error
);
5595 if (pos
>= isl_map_dim(map
, type
))
5596 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5597 "index out of bounds", goto error
);
5598 for (i
= map
->n
- 1; i
>= 0; --i
) {
5599 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5601 if (remove_if_empty(map
, i
) < 0)
5604 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5613 /* Fix the value of the variable at position "pos" of type "type" of "set"
5614 * to be equal to "v".
5616 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5617 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5619 return isl_map_fix_val(set
, type
, pos
, v
);
5622 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5623 unsigned input
, int value
)
5625 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5628 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5630 return (struct isl_set
*)
5631 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5634 static __isl_give isl_basic_map
*basic_map_bound_si(
5635 __isl_take isl_basic_map
*bmap
,
5636 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5642 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5643 pos
+= isl_basic_map_offset(bmap
, type
);
5644 bmap
= isl_basic_map_cow(bmap
);
5645 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5646 j
= isl_basic_map_alloc_inequality(bmap
);
5649 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5651 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5652 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5654 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5655 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5657 bmap
= isl_basic_map_simplify(bmap
);
5658 return isl_basic_map_finalize(bmap
);
5660 isl_basic_map_free(bmap
);
5664 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5665 __isl_take isl_basic_map
*bmap
,
5666 enum isl_dim_type type
, unsigned pos
, int value
)
5668 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5671 /* Constrain the values of the given dimension to be no greater than "value".
5673 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5674 __isl_take isl_basic_map
*bmap
,
5675 enum isl_dim_type type
, unsigned pos
, int value
)
5677 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5680 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5681 unsigned dim
, isl_int value
)
5685 bset
= isl_basic_set_cow(bset
);
5686 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5687 j
= isl_basic_set_alloc_inequality(bset
);
5690 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5691 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5692 isl_int_neg(bset
->ineq
[j
][0], value
);
5693 bset
= isl_basic_set_simplify(bset
);
5694 return isl_basic_set_finalize(bset
);
5696 isl_basic_set_free(bset
);
5700 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5701 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5705 map
= isl_map_cow(map
);
5709 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5710 for (i
= 0; i
< map
->n
; ++i
) {
5711 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5712 type
, pos
, value
, upper
);
5716 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5723 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5724 enum isl_dim_type type
, unsigned pos
, int value
)
5726 return map_bound_si(map
, type
, pos
, value
, 0);
5729 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5730 enum isl_dim_type type
, unsigned pos
, int value
)
5732 return map_bound_si(map
, type
, pos
, value
, 1);
5735 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5736 enum isl_dim_type type
, unsigned pos
, int value
)
5738 return (struct isl_set
*)
5739 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5742 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5743 enum isl_dim_type type
, unsigned pos
, int value
)
5745 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5748 /* Bound the given variable of "bmap" from below (or above is "upper"
5749 * is set) to "value".
5751 static __isl_give isl_basic_map
*basic_map_bound(
5752 __isl_take isl_basic_map
*bmap
,
5753 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5759 if (pos
>= isl_basic_map_dim(bmap
, type
))
5760 isl_die(bmap
->ctx
, isl_error_invalid
,
5761 "index out of bounds", goto error
);
5762 pos
+= isl_basic_map_offset(bmap
, type
);
5763 bmap
= isl_basic_map_cow(bmap
);
5764 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5765 j
= isl_basic_map_alloc_inequality(bmap
);
5768 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5770 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5771 isl_int_set(bmap
->ineq
[j
][0], value
);
5773 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5774 isl_int_neg(bmap
->ineq
[j
][0], value
);
5776 bmap
= isl_basic_map_simplify(bmap
);
5777 return isl_basic_map_finalize(bmap
);
5779 isl_basic_map_free(bmap
);
5783 /* Bound the given variable of "map" from below (or above is "upper"
5784 * is set) to "value".
5786 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5787 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5791 map
= isl_map_cow(map
);
5795 if (pos
>= isl_map_dim(map
, type
))
5796 isl_die(map
->ctx
, isl_error_invalid
,
5797 "index out of bounds", goto error
);
5798 for (i
= map
->n
- 1; i
>= 0; --i
) {
5799 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5800 if (remove_if_empty(map
, i
) < 0)
5803 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5810 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5811 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5813 return map_bound(map
, type
, pos
, value
, 0);
5816 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5817 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5819 return map_bound(map
, type
, pos
, value
, 1);
5822 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5823 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5825 return isl_map_lower_bound(set
, type
, pos
, value
);
5828 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5829 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5831 return isl_map_upper_bound(set
, type
, pos
, value
);
5834 /* Force the values of the variable at position "pos" of type "type" of "set"
5835 * to be no smaller than "value".
5837 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
5838 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5842 if (!isl_val_is_int(value
))
5843 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5844 "expecting integer value", goto error
);
5845 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
5846 isl_val_free(value
);
5849 isl_val_free(value
);
5854 /* Force the values of the variable at position "pos" of type "type" of "set"
5855 * to be no greater than "value".
5857 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
5858 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5862 if (!isl_val_is_int(value
))
5863 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5864 "expecting integer value", goto error
);
5865 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
5866 isl_val_free(value
);
5869 isl_val_free(value
);
5874 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5879 set
= isl_set_cow(set
);
5883 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5884 for (i
= 0; i
< set
->n
; ++i
) {
5885 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5895 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5899 map
= isl_map_cow(map
);
5903 map
->dim
= isl_space_reverse(map
->dim
);
5906 for (i
= 0; i
< map
->n
; ++i
) {
5907 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5911 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5918 static struct isl_map
*isl_basic_map_partial_lexopt(
5919 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5920 struct isl_set
**empty
, int max
)
5922 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5925 struct isl_map
*isl_basic_map_partial_lexmax(
5926 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5927 struct isl_set
**empty
)
5929 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5932 struct isl_map
*isl_basic_map_partial_lexmin(
5933 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5934 struct isl_set
**empty
)
5936 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5939 struct isl_set
*isl_basic_set_partial_lexmin(
5940 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5941 struct isl_set
**empty
)
5943 return (struct isl_set
*)
5944 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5948 struct isl_set
*isl_basic_set_partial_lexmax(
5949 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5950 struct isl_set
**empty
)
5952 return (struct isl_set
*)
5953 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5957 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5958 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5959 __isl_give isl_set
**empty
)
5961 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5964 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5965 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5966 __isl_give isl_set
**empty
)
5968 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5971 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5972 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5973 __isl_give isl_set
**empty
)
5975 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5978 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5979 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5980 __isl_give isl_set
**empty
)
5982 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5985 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5986 __isl_take isl_basic_map
*bmap
, int max
)
5988 isl_basic_set
*dom
= NULL
;
5989 isl_space
*dom_space
;
5993 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5994 dom
= isl_basic_set_universe(dom_space
);
5995 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5997 isl_basic_map_free(bmap
);
6001 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
6002 __isl_take isl_basic_map
*bmap
)
6004 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
6008 #define TYPE isl_pw_multi_aff
6010 #define SUFFIX _pw_multi_aff
6012 #define EMPTY isl_pw_multi_aff_empty
6014 #define ADD isl_pw_multi_aff_union_add
6015 #include "isl_map_lexopt_templ.c"
6017 /* Given a map "map", compute the lexicographically minimal
6018 * (or maximal) image element for each domain element in dom,
6019 * in the form of an isl_pw_multi_aff.
6020 * Set *empty to those elements in dom that do not have an image element.
6022 * We first compute the lexicographically minimal or maximal element
6023 * in the first basic map. This results in a partial solution "res"
6024 * and a subset "todo" of dom that still need to be handled.
6025 * We then consider each of the remaining maps in "map" and successively
6026 * update both "res" and "todo".
6028 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6029 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6030 __isl_give isl_set
**empty
, int max
)
6033 isl_pw_multi_aff
*res
;
6039 if (isl_map_plain_is_empty(map
)) {
6044 return isl_pw_multi_aff_from_map(map
);
6047 res
= basic_map_partial_lexopt_pw_multi_aff(
6048 isl_basic_map_copy(map
->p
[0]),
6049 isl_set_copy(dom
), &todo
, max
);
6051 for (i
= 1; i
< map
->n
; ++i
) {
6052 isl_pw_multi_aff
*res_i
;
6055 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6056 isl_basic_map_copy(map
->p
[i
]),
6057 isl_set_copy(dom
), &todo_i
, max
);
6060 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6062 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6064 todo
= isl_set_intersect(todo
, todo_i
);
6085 #define TYPE isl_map
6089 #define EMPTY isl_map_empty
6091 #define ADD isl_map_union_disjoint
6092 #include "isl_map_lexopt_templ.c"
6094 /* Given a map "map", compute the lexicographically minimal
6095 * (or maximal) image element for each domain element in dom.
6096 * Set *empty to those elements in dom that do not have an image element.
6098 * We first compute the lexicographically minimal or maximal element
6099 * in the first basic map. This results in a partial solution "res"
6100 * and a subset "todo" of dom that still need to be handled.
6101 * We then consider each of the remaining maps in "map" and successively
6102 * update both "res" and "todo".
6104 * Let res^k and todo^k be the results after k steps and let i = k + 1.
6105 * Assume we are computing the lexicographical maximum.
6106 * We first compute the lexicographically maximal element in basic map i.
6107 * This results in a partial solution res_i and a subset todo_i.
6108 * Then we combine these results with those obtain for the first k basic maps
6109 * to obtain a result that is valid for the first k+1 basic maps.
6110 * In particular, the set where there is no solution is the set where
6111 * there is no solution for the first k basic maps and also no solution
6112 * for the ith basic map, i.e.,
6114 * todo^i = todo^k * todo_i
6116 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
6117 * solutions, arbitrarily breaking ties in favor of res^k.
6118 * That is, when res^k(a) >= res_i(a), we pick res^k and
6119 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
6120 * the lexicographic order.)
6121 * In practice, we compute
6123 * res^k * (res_i . "<=")
6127 * res_i * (res^k . "<")
6129 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
6130 * where only one of res^k and res_i provides a solution and we simply pick
6137 * Note that we only compute these intersections when dom(res^k) intersects
6138 * dom(res_i). Otherwise, the only effect of these intersections is to
6139 * potentially break up res^k and res_i into smaller pieces.
6140 * We want to avoid such splintering as much as possible.
6141 * In fact, an earlier implementation of this function would look for
6142 * better results in the domain of res^k and for extra results in todo^k,
6143 * but this would always result in a splintering according to todo^k,
6144 * even when the domain of basic map i is disjoint from the domains of
6145 * the previous basic maps.
6147 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6148 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6149 __isl_give isl_set
**empty
, int max
)
6152 struct isl_map
*res
;
6153 struct isl_set
*todo
;
6158 if (isl_map_plain_is_empty(map
)) {
6166 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6167 isl_set_copy(dom
), &todo
, max
);
6169 for (i
= 1; i
< map
->n
; ++i
) {
6173 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
6175 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
6176 isl_set_copy(dom
), &todo_i
, max
);
6179 lt
= isl_map_lex_lt(isl_space_copy(dim
));
6180 le
= isl_map_lex_le(dim
);
6182 lt
= isl_map_lex_gt(isl_space_copy(dim
));
6183 le
= isl_map_lex_ge(dim
);
6185 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
6186 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
6187 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6188 le
= isl_map_intersect(le
, isl_map_copy(res
));
6190 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6191 res
= isl_map_intersect_domain(res
,
6192 isl_set_copy(todo_i
));
6193 res_i
= isl_map_intersect_domain(res_i
,
6194 isl_set_copy(todo
));
6197 res
= isl_map_union_disjoint(res
, res_i
);
6198 res
= isl_map_union_disjoint(res
, lt
);
6199 res
= isl_map_union_disjoint(res
, le
);
6201 todo
= isl_set_intersect(todo
, todo_i
);
6221 __isl_give isl_map
*isl_map_partial_lexmax(
6222 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6223 __isl_give isl_set
**empty
)
6225 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6228 __isl_give isl_map
*isl_map_partial_lexmin(
6229 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6230 __isl_give isl_set
**empty
)
6232 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6235 __isl_give isl_set
*isl_set_partial_lexmin(
6236 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6237 __isl_give isl_set
**empty
)
6239 return (struct isl_set
*)
6240 isl_map_partial_lexmin((struct isl_map
*)set
,
6244 __isl_give isl_set
*isl_set_partial_lexmax(
6245 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6246 __isl_give isl_set
**empty
)
6248 return (struct isl_set
*)
6249 isl_map_partial_lexmax((struct isl_map
*)set
,
6253 /* Compute the lexicographic minimum (or maximum if "max" is set)
6254 * of "bmap" over its domain.
6256 * Since we are not interested in the part of the domain space where
6257 * there is no solution, we initialize the domain to those constraints
6258 * of "bmap" that only involve the parameters and the input dimensions.
6259 * This relieves the parametric programming engine from detecting those
6260 * inequalities and transferring them to the context. More importantly,
6261 * it ensures that those inequalities are transferred first and not
6262 * intermixed with inequalities that actually split the domain.
6264 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6268 isl_basic_map
*copy
;
6271 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6272 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6273 copy
= isl_basic_map_copy(bmap
);
6274 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6275 isl_dim_div
, 0, n_div
);
6276 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6277 isl_dim_out
, 0, n_out
);
6278 dom
= isl_basic_map_domain(copy
);
6279 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6282 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6284 return isl_basic_map_lexopt(bmap
, 0);
6287 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6289 return isl_basic_map_lexopt(bmap
, 1);
6292 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6294 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6297 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6299 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6302 /* Extract the first and only affine expression from list
6303 * and then add it to *pwaff with the given dom.
6304 * This domain is known to be disjoint from other domains
6305 * because of the way isl_basic_map_foreach_lexmax works.
6307 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6308 __isl_take isl_aff_list
*list
, void *user
)
6310 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6312 isl_pw_aff
**pwaff
= user
;
6313 isl_pw_aff
*pwaff_i
;
6317 if (isl_aff_list_n_aff(list
) != 1)
6318 isl_die(ctx
, isl_error_internal
,
6319 "expecting single element list", goto error
);
6321 aff
= isl_aff_list_get_aff(list
, 0);
6322 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6324 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6326 isl_aff_list_free(list
);
6330 isl_basic_set_free(dom
);
6331 isl_aff_list_free(list
);
6335 /* Given a basic map with one output dimension, compute the minimum or
6336 * maximum of that dimension as an isl_pw_aff.
6338 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6339 * call update_dim_opt on each leaf of the result.
6341 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6344 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6348 dim
= isl_space_from_domain(isl_space_domain(dim
));
6349 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6350 pwaff
= isl_pw_aff_empty(dim
);
6352 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6354 return isl_pw_aff_free(pwaff
);
6359 /* Compute the minimum or maximum of the given output dimension
6360 * as a function of the parameters and the input dimensions,
6361 * but independently of the other output dimensions.
6363 * We first project out the other output dimension and then compute
6364 * the "lexicographic" maximum in each basic map, combining the results
6365 * using isl_pw_aff_union_max.
6367 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6374 n_out
= isl_map_dim(map
, isl_dim_out
);
6375 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6376 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6381 isl_space
*dim
= isl_map_get_space(map
);
6382 dim
= isl_space_domain(isl_space_from_range(dim
));
6384 return isl_pw_aff_empty(dim
);
6387 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6388 for (i
= 1; i
< map
->n
; ++i
) {
6389 isl_pw_aff
*pwaff_i
;
6391 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6392 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6400 /* Compute the maximum of the given output dimension as a function of the
6401 * parameters and input dimensions, but independently of
6402 * the other output dimensions.
6404 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6406 return map_dim_opt(map
, pos
, 1);
6409 /* Compute the minimum or maximum of the given set dimension
6410 * as a function of the parameters,
6411 * but independently of the other set dimensions.
6413 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6416 return map_dim_opt(set
, pos
, max
);
6419 /* Compute the maximum of the given set dimension as a function of the
6420 * parameters, but independently of the other set dimensions.
6422 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6424 return set_dim_opt(set
, pos
, 1);
6427 /* Compute the minimum of the given set dimension as a function of the
6428 * parameters, but independently of the other set dimensions.
6430 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6432 return set_dim_opt(set
, pos
, 0);
6435 /* Apply a preimage specified by "mat" on the parameters of "bset".
6436 * bset is assumed to have only parameters and divs.
6438 static struct isl_basic_set
*basic_set_parameter_preimage(
6439 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6446 bset
->dim
= isl_space_cow(bset
->dim
);
6450 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6452 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6454 bset
->dim
->nparam
= 0;
6455 bset
->dim
->n_out
= nparam
;
6456 bset
= isl_basic_set_preimage(bset
, mat
);
6458 bset
->dim
->nparam
= bset
->dim
->n_out
;
6459 bset
->dim
->n_out
= 0;
6464 isl_basic_set_free(bset
);
6468 /* Apply a preimage specified by "mat" on the parameters of "set".
6469 * set is assumed to have only parameters and divs.
6471 static struct isl_set
*set_parameter_preimage(
6472 struct isl_set
*set
, struct isl_mat
*mat
)
6474 isl_space
*dim
= NULL
;
6480 dim
= isl_space_copy(set
->dim
);
6481 dim
= isl_space_cow(dim
);
6485 nparam
= isl_set_dim(set
, isl_dim_param
);
6487 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6490 dim
->n_out
= nparam
;
6491 isl_set_reset_space(set
, dim
);
6492 set
= isl_set_preimage(set
, mat
);
6495 dim
= isl_space_copy(set
->dim
);
6496 dim
= isl_space_cow(dim
);
6499 dim
->nparam
= dim
->n_out
;
6501 isl_set_reset_space(set
, dim
);
6504 isl_space_free(dim
);
6511 /* Intersect the basic set "bset" with the affine space specified by the
6512 * equalities in "eq".
6514 static struct isl_basic_set
*basic_set_append_equalities(
6515 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6523 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6528 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6529 for (i
= 0; i
< eq
->n_row
; ++i
) {
6530 k
= isl_basic_set_alloc_equality(bset
);
6533 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6534 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6538 bset
= isl_basic_set_gauss(bset
, NULL
);
6539 bset
= isl_basic_set_finalize(bset
);
6544 isl_basic_set_free(bset
);
6548 /* Intersect the set "set" with the affine space specified by the
6549 * equalities in "eq".
6551 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6559 for (i
= 0; i
< set
->n
; ++i
) {
6560 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6573 /* Given a basic set "bset" that only involves parameters and existentially
6574 * quantified variables, return the index of the first equality
6575 * that only involves parameters. If there is no such equality then
6576 * return bset->n_eq.
6578 * This function assumes that isl_basic_set_gauss has been called on "bset".
6580 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6583 unsigned nparam
, n_div
;
6588 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6589 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6591 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6592 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6599 /* Compute an explicit representation for the existentially quantified
6600 * variables in "bset" by computing the "minimal value" of the set
6601 * variables. Since there are no set variables, the computation of
6602 * the minimal value essentially computes an explicit representation
6603 * of the non-empty part(s) of "bset".
6605 * The input only involves parameters and existentially quantified variables.
6606 * All equalities among parameters have been removed.
6608 * Since the existentially quantified variables in the result are in general
6609 * going to be different from those in the input, we first replace
6610 * them by the minimal number of variables based on their equalities.
6611 * This should simplify the parametric integer programming.
6613 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6615 isl_morph
*morph1
, *morph2
;
6621 if (bset
->n_eq
== 0)
6622 return isl_basic_set_lexmin(bset
);
6624 morph1
= isl_basic_set_parameter_compression(bset
);
6625 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6626 bset
= isl_basic_set_lift(bset
);
6627 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6628 bset
= isl_morph_basic_set(morph2
, bset
);
6629 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6630 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6632 set
= isl_basic_set_lexmin(bset
);
6634 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6639 /* Project the given basic set onto its parameter domain, possibly introducing
6640 * new, explicit, existential variables in the constraints.
6641 * The input has parameters and (possibly implicit) existential variables.
6642 * The output has the same parameters, but only
6643 * explicit existentially quantified variables.
6645 * The actual projection is performed by pip, but pip doesn't seem
6646 * to like equalities very much, so we first remove the equalities
6647 * among the parameters by performing a variable compression on
6648 * the parameters. Afterward, an inverse transformation is performed
6649 * and the equalities among the parameters are inserted back in.
6651 * The variable compression on the parameters may uncover additional
6652 * equalities that were only implicit before. We therefore check
6653 * if there are any new parameter equalities in the result and
6654 * if so recurse. The removal of parameter equalities is required
6655 * for the parameter compression performed by base_compute_divs.
6657 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6661 struct isl_mat
*T
, *T2
;
6662 struct isl_set
*set
;
6665 bset
= isl_basic_set_cow(bset
);
6669 if (bset
->n_eq
== 0)
6670 return base_compute_divs(bset
);
6672 bset
= isl_basic_set_gauss(bset
, NULL
);
6675 if (isl_basic_set_plain_is_empty(bset
))
6676 return isl_set_from_basic_set(bset
);
6678 i
= first_parameter_equality(bset
);
6679 if (i
== bset
->n_eq
)
6680 return base_compute_divs(bset
);
6682 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6683 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6685 eq
= isl_mat_cow(eq
);
6686 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6687 if (T
&& T
->n_col
== 0) {
6691 bset
= isl_basic_set_set_to_empty(bset
);
6692 return isl_set_from_basic_set(bset
);
6694 bset
= basic_set_parameter_preimage(bset
, T
);
6696 i
= first_parameter_equality(bset
);
6699 else if (i
== bset
->n_eq
)
6700 set
= base_compute_divs(bset
);
6702 set
= parameter_compute_divs(bset
);
6703 set
= set_parameter_preimage(set
, T2
);
6704 set
= set_append_equalities(set
, eq
);
6708 /* Insert the divs from "ls" before those of "bmap".
6710 * The number of columns is not changed, which means that the last
6711 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6712 * The caller is responsible for removing the same number of dimensions
6713 * from the space of "bmap".
6715 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6716 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6722 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6726 old_n_div
= bmap
->n_div
;
6727 bmap
= insert_div_rows(bmap
, n_div
);
6731 for (i
= 0; i
< n_div
; ++i
) {
6732 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6733 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6739 /* Replace the space of "bmap" by the space and divs of "ls".
6741 * If "ls" has any divs, then we simplify the result since we may
6742 * have discovered some additional equalities that could simplify
6743 * the div expressions.
6745 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6746 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6750 bmap
= isl_basic_map_cow(bmap
);
6754 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6755 bmap
= insert_divs_from_local_space(bmap
, ls
);
6759 isl_space_free(bmap
->dim
);
6760 bmap
->dim
= isl_local_space_get_space(ls
);
6764 isl_local_space_free(ls
);
6766 bmap
= isl_basic_map_simplify(bmap
);
6767 bmap
= isl_basic_map_finalize(bmap
);
6770 isl_basic_map_free(bmap
);
6771 isl_local_space_free(ls
);
6775 /* Replace the space of "map" by the space and divs of "ls".
6777 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6778 __isl_take isl_local_space
*ls
)
6782 map
= isl_map_cow(map
);
6786 for (i
= 0; i
< map
->n
; ++i
) {
6787 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6788 isl_local_space_copy(ls
));
6792 isl_space_free(map
->dim
);
6793 map
->dim
= isl_local_space_get_space(ls
);
6797 isl_local_space_free(ls
);
6800 isl_local_space_free(ls
);
6805 /* Compute an explicit representation for the existentially
6806 * quantified variables for which do not know any explicit representation yet.
6808 * We first sort the existentially quantified variables so that the
6809 * existentially quantified variables for which we already have an explicit
6810 * representation are placed before those for which we do not.
6811 * The input dimensions, the output dimensions and the existentially
6812 * quantified variables for which we already have an explicit
6813 * representation are then turned into parameters.
6814 * compute_divs returns a map with the same parameters and
6815 * no input or output dimensions and the dimension specification
6816 * is reset to that of the input, including the existentially quantified
6817 * variables for which we already had an explicit representation.
6819 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6821 struct isl_basic_set
*bset
;
6822 struct isl_set
*set
;
6823 struct isl_map
*map
;
6825 isl_local_space
*ls
;
6832 bmap
= isl_basic_map_sort_divs(bmap
);
6833 bmap
= isl_basic_map_cow(bmap
);
6837 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
6838 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
6841 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6842 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6843 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6844 dim
= isl_space_set_alloc(bmap
->ctx
,
6845 nparam
+ n_in
+ n_out
+ n_known
, 0);
6849 ls
= isl_basic_map_get_local_space(bmap
);
6850 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6851 n_known
, bmap
->n_div
- n_known
);
6853 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6854 swap_div(bmap
, i
- n_known
, i
);
6855 bmap
->n_div
-= n_known
;
6856 bmap
->extra
-= n_known
;
6858 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6859 bset
= (struct isl_basic_set
*)bmap
;
6861 set
= parameter_compute_divs(bset
);
6862 map
= (struct isl_map
*)set
;
6863 map
= replace_space_by_local_space(map
, ls
);
6867 isl_basic_map_free(bmap
);
6871 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6879 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6880 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6881 if (isl_int_is_zero(bmap
->div
[i
][0]))
6883 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6889 static int map_divs_known(__isl_keep isl_map
*map
)
6896 for (i
= 0; i
< map
->n
; ++i
) {
6897 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6905 /* If bmap contains any unknown divs, then compute explicit
6906 * expressions for them. However, this computation may be
6907 * quite expensive, so first try to remove divs that aren't
6910 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6913 struct isl_map
*map
;
6915 known
= isl_basic_map_divs_known(bmap
);
6919 return isl_map_from_basic_map(bmap
);
6921 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6923 known
= isl_basic_map_divs_known(bmap
);
6927 return isl_map_from_basic_map(bmap
);
6929 map
= compute_divs(bmap
);
6932 isl_basic_map_free(bmap
);
6936 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6940 struct isl_map
*res
;
6947 known
= map_divs_known(map
);
6955 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6956 for (i
= 1 ; i
< map
->n
; ++i
) {
6958 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6959 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6960 res
= isl_map_union_disjoint(res
, r2
);
6962 res
= isl_map_union(res
, r2
);
6969 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6971 return (struct isl_set
*)
6972 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6975 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6977 return (struct isl_set
*)
6978 isl_map_compute_divs((struct isl_map
*)set
);
6981 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6984 struct isl_set
*set
;
6989 map
= isl_map_cow(map
);
6993 set
= (struct isl_set
*)map
;
6994 set
->dim
= isl_space_domain(set
->dim
);
6997 for (i
= 0; i
< map
->n
; ++i
) {
6998 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7002 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7003 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7010 /* Return the union of "map1" and "map2", where we assume for now that
7011 * "map1" and "map2" are disjoint. Note that the basic maps inside
7012 * "map1" or "map2" may not be disjoint from each other.
7013 * Also note that this function is also called from isl_map_union,
7014 * which takes care of handling the situation where "map1" and "map2"
7015 * may not be disjoint.
7017 * If one of the inputs is empty, we can simply return the other input.
7018 * Similarly, if one of the inputs is universal, then it is equal to the union.
7020 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7021 __isl_take isl_map
*map2
)
7025 struct isl_map
*map
= NULL
;
7040 is_universe
= isl_map_plain_is_universe(map1
);
7041 if (is_universe
< 0)
7048 is_universe
= isl_map_plain_is_universe(map2
);
7049 if (is_universe
< 0)
7056 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
7058 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7059 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7060 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7062 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7063 map1
->n
+ map2
->n
, flags
);
7066 for (i
= 0; i
< map1
->n
; ++i
) {
7067 map
= isl_map_add_basic_map(map
,
7068 isl_basic_map_copy(map1
->p
[i
]));
7072 for (i
= 0; i
< map2
->n
; ++i
) {
7073 map
= isl_map_add_basic_map(map
,
7074 isl_basic_map_copy(map2
->p
[i
]));
7088 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7089 __isl_take isl_map
*map2
)
7091 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7094 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
7096 map1
= isl_map_union_disjoint(map1
, map2
);
7100 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7104 struct isl_set
*isl_set_union_disjoint(
7105 struct isl_set
*set1
, struct isl_set
*set2
)
7107 return (struct isl_set
*)
7108 isl_map_union_disjoint(
7109 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
7112 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7114 return (struct isl_set
*)
7115 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7118 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7121 * "map" and "set" are assumed to be compatible and non-NULL.
7123 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7124 __isl_take isl_set
*set
,
7125 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7126 __isl_take isl_basic_set
*bset
))
7129 struct isl_map
*result
;
7132 if (isl_set_plain_is_universe(set
)) {
7137 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7138 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7139 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7141 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7142 map
->n
* set
->n
, flags
);
7143 for (i
= 0; result
&& i
< map
->n
; ++i
)
7144 for (j
= 0; j
< set
->n
; ++j
) {
7145 result
= isl_map_add_basic_map(result
,
7146 fn(isl_basic_map_copy(map
->p
[i
]),
7147 isl_basic_set_copy(set
->p
[j
])));
7157 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7158 __isl_take isl_set
*set
)
7163 if (!isl_map_compatible_range(map
, set
))
7164 isl_die(set
->ctx
, isl_error_invalid
,
7165 "incompatible spaces", goto error
);
7167 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7174 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7175 __isl_take isl_set
*set
)
7177 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7180 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7181 __isl_take isl_set
*set
)
7186 if (!isl_map_compatible_domain(map
, set
))
7187 isl_die(set
->ctx
, isl_error_invalid
,
7188 "incompatible spaces", goto error
);
7190 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7197 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7198 __isl_take isl_set
*set
)
7200 return isl_map_align_params_map_map_and(map
, set
,
7201 &map_intersect_domain
);
7204 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7205 __isl_take isl_map
*map2
)
7209 map1
= isl_map_reverse(map1
);
7210 map1
= isl_map_apply_range(map1
, map2
);
7211 return isl_map_reverse(map1
);
7218 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7219 __isl_take isl_map
*map2
)
7221 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7224 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7225 __isl_take isl_map
*map2
)
7227 isl_space
*dim_result
;
7228 struct isl_map
*result
;
7234 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7235 isl_space_copy(map2
->dim
));
7237 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7240 for (i
= 0; i
< map1
->n
; ++i
)
7241 for (j
= 0; j
< map2
->n
; ++j
) {
7242 result
= isl_map_add_basic_map(result
,
7243 isl_basic_map_apply_range(
7244 isl_basic_map_copy(map1
->p
[i
]),
7245 isl_basic_map_copy(map2
->p
[j
])));
7251 if (result
&& result
->n
<= 1)
7252 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7260 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7261 __isl_take isl_map
*map2
)
7263 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7267 * returns range - domain
7269 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7271 isl_space
*dims
, *target_dim
;
7272 struct isl_basic_set
*bset
;
7279 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
7280 bmap
->dim
, isl_dim_out
),
7282 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7283 dim
= isl_basic_map_n_in(bmap
);
7284 nparam
= isl_basic_map_n_param(bmap
);
7285 bset
= isl_basic_set_from_basic_map(bmap
);
7286 bset
= isl_basic_set_cow(bset
);
7287 dims
= isl_basic_set_get_space(bset
);
7288 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7289 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7290 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7291 for (i
= 0; i
< dim
; ++i
) {
7292 int j
= isl_basic_map_alloc_equality(
7293 (struct isl_basic_map
*)bset
);
7295 bset
= isl_basic_set_free(bset
);
7298 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7299 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7300 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7301 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7303 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7304 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7307 isl_basic_map_free(bmap
);
7312 * returns range - domain
7314 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7318 struct isl_set
*result
;
7323 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
7324 map
->dim
, isl_dim_out
),
7326 dim
= isl_map_get_space(map
);
7327 dim
= isl_space_domain(dim
);
7328 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7331 for (i
= 0; i
< map
->n
; ++i
)
7332 result
= isl_set_add_basic_set(result
,
7333 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7342 * returns [domain -> range] -> range - domain
7344 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7345 __isl_take isl_basic_map
*bmap
)
7349 isl_basic_map
*domain
;
7353 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
7354 isl_die(bmap
->ctx
, isl_error_invalid
,
7355 "domain and range don't match", goto error
);
7357 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7358 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7360 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7361 domain
= isl_basic_map_universe(dim
);
7363 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7364 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7365 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7367 total
= isl_basic_map_total_dim(bmap
);
7369 for (i
= 0; i
< n
; ++i
) {
7370 k
= isl_basic_map_alloc_equality(bmap
);
7373 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7374 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7375 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7376 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7379 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7380 return isl_basic_map_finalize(bmap
);
7382 isl_basic_map_free(bmap
);
7387 * returns [domain -> range] -> range - domain
7389 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7392 isl_space
*domain_dim
;
7397 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
7398 isl_die(map
->ctx
, isl_error_invalid
,
7399 "domain and range don't match", goto error
);
7401 map
= isl_map_cow(map
);
7405 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7406 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7407 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7410 for (i
= 0; i
< map
->n
; ++i
) {
7411 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7415 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7422 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7424 struct isl_basic_map
*bmap
;
7432 nparam
= dims
->nparam
;
7434 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7438 for (i
= 0; i
< dim
; ++i
) {
7439 int j
= isl_basic_map_alloc_equality(bmap
);
7442 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7443 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7444 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7446 return isl_basic_map_finalize(bmap
);
7448 isl_basic_map_free(bmap
);
7452 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7456 if (dim
->n_in
!= dim
->n_out
)
7457 isl_die(dim
->ctx
, isl_error_invalid
,
7458 "number of input and output dimensions needs to be "
7459 "the same", goto error
);
7460 return basic_map_identity(dim
);
7462 isl_space_free(dim
);
7466 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7468 if (!model
|| !model
->dim
)
7470 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7473 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7475 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7478 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7480 if (!model
|| !model
->dim
)
7482 return isl_map_identity(isl_space_copy(model
->dim
));
7485 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7487 if (!model
|| !model
->dim
)
7489 return isl_map_identity(isl_space_copy(model
->dim
));
7492 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7494 isl_space
*dim
= isl_set_get_space(set
);
7496 id
= isl_map_identity(isl_space_map_from_set(dim
));
7497 return isl_map_intersect_range(id
, set
);
7500 /* Construct a basic set with all set dimensions having only non-negative
7503 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7504 __isl_take isl_space
*space
)
7509 struct isl_basic_set
*bset
;
7513 nparam
= space
->nparam
;
7515 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7518 for (i
= 0; i
< dim
; ++i
) {
7519 int k
= isl_basic_set_alloc_inequality(bset
);
7522 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7523 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7527 isl_basic_set_free(bset
);
7531 /* Construct the half-space x_pos >= 0.
7533 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7537 isl_basic_set
*nonneg
;
7539 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7540 k
= isl_basic_set_alloc_inequality(nonneg
);
7543 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7544 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7546 return isl_basic_set_finalize(nonneg
);
7548 isl_basic_set_free(nonneg
);
7552 /* Construct the half-space x_pos <= -1.
7554 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7559 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7560 k
= isl_basic_set_alloc_inequality(neg
);
7563 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7564 isl_int_set_si(neg
->ineq
[k
][0], -1);
7565 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7567 return isl_basic_set_finalize(neg
);
7569 isl_basic_set_free(neg
);
7573 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7574 enum isl_dim_type type
, unsigned first
, unsigned n
)
7577 isl_basic_set
*nonneg
;
7585 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7587 for (i
= 0; i
< n
; ++i
) {
7588 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7589 pos(set
->dim
, type
) + first
+ i
);
7590 neg
= neg_halfspace(isl_set_get_space(set
),
7591 pos(set
->dim
, type
) + first
+ i
);
7593 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7602 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7603 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7610 if (isl_set_plain_is_empty(set
)) {
7615 return fn(set
, signs
, user
);
7618 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7620 half
= isl_set_intersect(half
, isl_set_copy(set
));
7621 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7625 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7627 half
= isl_set_intersect(half
, set
);
7628 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7634 /* Call "fn" on the intersections of "set" with each of the orthants
7635 * (except for obviously empty intersections). The orthant is identified
7636 * by the signs array, with each entry having value 1 or -1 according
7637 * to the sign of the corresponding variable.
7639 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7640 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7650 if (isl_set_plain_is_empty(set
))
7653 nparam
= isl_set_dim(set
, isl_dim_param
);
7654 nvar
= isl_set_dim(set
, isl_dim_set
);
7656 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7658 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7666 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7668 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7671 int isl_basic_map_is_subset(
7672 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7675 struct isl_map
*map1
;
7676 struct isl_map
*map2
;
7678 if (!bmap1
|| !bmap2
)
7681 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7682 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7684 is_subset
= isl_map_is_subset(map1
, map2
);
7692 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7693 __isl_keep isl_basic_set
*bset2
)
7695 return isl_basic_map_is_subset(bset1
, bset2
);
7698 int isl_basic_map_is_equal(
7699 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7703 if (!bmap1
|| !bmap2
)
7705 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7708 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7712 int isl_basic_set_is_equal(
7713 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7715 return isl_basic_map_is_equal(
7716 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7719 int isl_map_is_empty(struct isl_map
*map
)
7726 for (i
= 0; i
< map
->n
; ++i
) {
7727 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7736 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7738 return map
? map
->n
== 0 : -1;
7741 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7743 return isl_map_plain_is_empty(map
);
7746 int isl_set_plain_is_empty(struct isl_set
*set
)
7748 return set
? set
->n
== 0 : -1;
7751 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7753 return isl_set_plain_is_empty(set
);
7756 int isl_set_is_empty(struct isl_set
*set
)
7758 return isl_map_is_empty((struct isl_map
*)set
);
7761 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7766 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7769 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7774 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7777 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7783 is_subset
= isl_map_is_subset(map1
, map2
);
7786 is_subset
= isl_map_is_subset(map2
, map1
);
7790 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7792 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7795 int isl_basic_map_is_strict_subset(
7796 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7800 if (!bmap1
|| !bmap2
)
7802 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7805 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7806 if (is_subset
== -1)
7811 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7817 is_subset
= isl_map_is_subset(map1
, map2
);
7820 is_subset
= isl_map_is_subset(map2
, map1
);
7821 if (is_subset
== -1)
7826 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7828 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7831 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7835 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7838 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7842 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7845 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7852 for (i
= 0; i
< map
->n
; ++i
) {
7853 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7861 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7863 return isl_map_plain_is_universe((isl_map
*) set
);
7866 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7868 return isl_set_plain_is_universe(set
);
7871 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7873 struct isl_basic_set
*bset
= NULL
;
7874 struct isl_vec
*sample
= NULL
;
7881 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7884 if (isl_basic_map_is_universe(bmap
))
7887 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7888 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7889 copy
= isl_basic_map_remove_redundancies(copy
);
7890 empty
= isl_basic_map_plain_is_empty(copy
);
7891 isl_basic_map_free(copy
);
7895 total
= 1 + isl_basic_map_total_dim(bmap
);
7896 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7897 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7903 isl_vec_free(bmap
->sample
);
7904 bmap
->sample
= NULL
;
7905 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7908 sample
= isl_basic_set_sample_vec(bset
);
7911 empty
= sample
->size
== 0;
7912 isl_vec_free(bmap
->sample
);
7913 bmap
->sample
= sample
;
7915 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7920 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7924 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7927 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7929 return isl_basic_map_plain_is_empty(bmap
);
7932 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7936 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7939 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7941 return isl_basic_set_plain_is_empty(bset
);
7944 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7946 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7949 struct isl_map
*isl_basic_map_union(
7950 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7952 struct isl_map
*map
;
7953 if (!bmap1
|| !bmap2
)
7956 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7958 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7961 map
= isl_map_add_basic_map(map
, bmap1
);
7962 map
= isl_map_add_basic_map(map
, bmap2
);
7965 isl_basic_map_free(bmap1
);
7966 isl_basic_map_free(bmap2
);
7970 struct isl_set
*isl_basic_set_union(
7971 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7973 return (struct isl_set
*)isl_basic_map_union(
7974 (struct isl_basic_map
*)bset1
,
7975 (struct isl_basic_map
*)bset2
);
7978 /* Order divs such that any div only depends on previous divs */
7979 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7987 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7989 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7991 if (isl_int_is_zero(bmap
->div
[i
][0]))
7993 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7997 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8003 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8005 return (struct isl_basic_set
*)
8006 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
8009 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8016 for (i
= 0; i
< map
->n
; ++i
) {
8017 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8028 /* Apply the expansion computed by isl_merge_divs.
8029 * The expansion itself is given by "exp" while the resulting
8030 * list of divs is given by "div".
8032 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8033 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8038 bset
= isl_basic_set_cow(bset
);
8042 if (div
->n_row
< bset
->n_div
)
8043 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8044 "not an expansion", goto error
);
8046 n_div
= bset
->n_div
;
8047 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
8048 div
->n_row
- n_div
, 0,
8049 2 * (div
->n_row
- n_div
));
8051 for (i
= n_div
; i
< div
->n_row
; ++i
)
8052 if (isl_basic_set_alloc_div(bset
) < 0)
8056 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
8057 if (j
>= 0 && exp
[j
] == i
) {
8059 isl_basic_map_swap_div(bset
, i
, j
);
8062 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
8063 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
8071 isl_basic_set_free(bset
);
8076 /* Look for a div in dst that corresponds to the div "div" in src.
8077 * The divs before "div" in src and dst are assumed to be the same.
8079 * Returns -1 if no corresponding div was found and the position
8080 * of the corresponding div in dst otherwise.
8082 static int find_div(struct isl_basic_map
*dst
,
8083 struct isl_basic_map
*src
, unsigned div
)
8087 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8089 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8090 for (i
= div
; i
< dst
->n_div
; ++i
)
8091 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8092 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8093 dst
->n_div
- div
) == -1)
8098 struct isl_basic_map
*isl_basic_map_align_divs(
8099 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
8107 if (src
->n_div
== 0)
8110 for (i
= 0; i
< src
->n_div
; ++i
)
8111 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
8113 src
= isl_basic_map_order_divs(src
);
8114 dst
= isl_basic_map_cow(dst
);
8117 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
8118 src
->n_div
, 0, 2 * src
->n_div
);
8121 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8122 for (i
= 0; i
< src
->n_div
; ++i
) {
8123 int j
= find_div(dst
, src
, i
);
8125 j
= isl_basic_map_alloc_div(dst
);
8128 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8129 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8130 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8134 isl_basic_map_swap_div(dst
, i
, j
);
8138 isl_basic_map_free(dst
);
8142 struct isl_basic_set
*isl_basic_set_align_divs(
8143 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8145 return (struct isl_basic_set
*)isl_basic_map_align_divs(
8146 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
8149 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8157 map
= isl_map_compute_divs(map
);
8158 map
= isl_map_cow(map
);
8162 for (i
= 1; i
< map
->n
; ++i
)
8163 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8164 for (i
= 1; i
< map
->n
; ++i
) {
8165 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8167 return isl_map_free(map
);
8170 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8174 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8176 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
8179 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8180 __isl_take isl_map
*map
)
8184 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8185 map
= isl_map_intersect_domain(map
, set
);
8186 set
= isl_map_range(map
);
8194 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8195 __isl_take isl_map
*map
)
8197 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8200 /* There is no need to cow as removing empty parts doesn't change
8201 * the meaning of the set.
8203 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8210 for (i
= map
->n
- 1; i
>= 0; --i
)
8211 remove_if_empty(map
, i
);
8216 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8218 return (struct isl_set
*)
8219 isl_map_remove_empty_parts((struct isl_map
*)set
);
8222 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8224 struct isl_basic_map
*bmap
;
8225 if (!map
|| map
->n
== 0)
8227 bmap
= map
->p
[map
->n
-1];
8228 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8229 return isl_basic_map_copy(bmap
);
8232 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8234 return (struct isl_basic_set
*)
8235 isl_map_copy_basic_map((struct isl_map
*)set
);
8238 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8239 __isl_keep isl_basic_map
*bmap
)
8245 for (i
= map
->n
-1; i
>= 0; --i
) {
8246 if (map
->p
[i
] != bmap
)
8248 map
= isl_map_cow(map
);
8251 isl_basic_map_free(map
->p
[i
]);
8252 if (i
!= map
->n
-1) {
8253 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8254 map
->p
[i
] = map
->p
[map
->n
-1];
8265 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8266 struct isl_basic_set
*bset
)
8268 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8269 (struct isl_basic_map
*)bset
);
8272 /* Given two basic sets bset1 and bset2, compute the maximal difference
8273 * between the values of dimension pos in bset1 and those in bset2
8274 * for any common value of the parameters and dimensions preceding pos.
8276 static enum isl_lp_result
basic_set_maximal_difference_at(
8277 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8278 int pos
, isl_int
*opt
)
8281 struct isl_basic_map
*bmap1
= NULL
;
8282 struct isl_basic_map
*bmap2
= NULL
;
8283 struct isl_ctx
*ctx
;
8284 struct isl_vec
*obj
;
8287 unsigned dim1
, dim2
;
8288 enum isl_lp_result res
;
8290 if (!bset1
|| !bset2
)
8291 return isl_lp_error
;
8293 nparam
= isl_basic_set_n_param(bset1
);
8294 dim1
= isl_basic_set_n_dim(bset1
);
8295 dim2
= isl_basic_set_n_dim(bset2
);
8296 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8297 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8298 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8299 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8300 if (!bmap1
|| !bmap2
)
8302 bmap1
= isl_basic_map_cow(bmap1
);
8303 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8304 pos
, (dim1
- pos
) + (dim2
- pos
),
8305 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8306 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8309 total
= isl_basic_map_total_dim(bmap1
);
8311 obj
= isl_vec_alloc(ctx
, 1 + total
);
8314 isl_seq_clr(obj
->block
.data
, 1 + total
);
8315 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8316 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8317 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8319 isl_basic_map_free(bmap1
);
8323 isl_basic_map_free(bmap2
);
8325 isl_basic_map_free(bmap1
);
8326 return isl_lp_error
;
8329 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8330 * for any common value of the parameters and dimensions preceding pos
8331 * in both basic sets, the values of dimension pos in bset1 are
8332 * smaller or larger than those in bset2.
8335 * 1 if bset1 follows bset2
8336 * -1 if bset1 precedes bset2
8337 * 0 if bset1 and bset2 are incomparable
8338 * -2 if some error occurred.
8340 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8341 struct isl_basic_set
*bset2
, int pos
)
8344 enum isl_lp_result res
;
8349 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8351 if (res
== isl_lp_empty
)
8353 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8354 res
== isl_lp_unbounded
)
8356 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8365 /* Given two basic sets bset1 and bset2, check whether
8366 * for any common value of the parameters and dimensions preceding pos
8367 * there is a value of dimension pos in bset1 that is larger
8368 * than a value of the same dimension in bset2.
8371 * 1 if there exists such a pair
8372 * 0 if there is no such pair, but there is a pair of equal values
8374 * -2 if some error occurred.
8376 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8377 __isl_keep isl_basic_set
*bset2
, int pos
)
8380 enum isl_lp_result res
;
8385 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8387 if (res
== isl_lp_empty
)
8389 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8390 res
== isl_lp_unbounded
)
8392 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8394 else if (res
== isl_lp_ok
)
8403 /* Given two sets set1 and set2, check whether
8404 * for any common value of the parameters and dimensions preceding pos
8405 * there is a value of dimension pos in set1 that is larger
8406 * than a value of the same dimension in set2.
8409 * 1 if there exists such a pair
8410 * 0 if there is no such pair, but there is a pair of equal values
8412 * -2 if some error occurred.
8414 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8415 __isl_keep isl_set
*set2
, int pos
)
8423 for (i
= 0; i
< set1
->n
; ++i
)
8424 for (j
= 0; j
< set2
->n
; ++j
) {
8426 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8427 if (f
== 1 || f
== -2)
8436 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8437 unsigned pos
, isl_int
*val
)
8445 total
= isl_basic_map_total_dim(bmap
);
8446 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8447 for (; d
+1 > pos
; --d
)
8448 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8452 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8454 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8456 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8459 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8465 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8466 unsigned pos
, isl_int
*val
)
8478 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8481 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8482 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8483 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8484 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8488 isl_int_set(*val
, v
);
8494 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8495 unsigned pos
, isl_int
*val
)
8497 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8501 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8504 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8507 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8508 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8510 if (pos
>= isl_basic_map_dim(bmap
, type
))
8512 return isl_basic_map_plain_has_fixed_var(bmap
,
8513 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8516 /* If "bmap" obviously lies on a hyperplane where the given dimension
8517 * has a fixed value, then return that value.
8518 * Otherwise return NaN.
8520 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8521 __isl_keep isl_basic_map
*bmap
,
8522 enum isl_dim_type type
, unsigned pos
)
8530 ctx
= isl_basic_map_get_ctx(bmap
);
8531 v
= isl_val_alloc(ctx
);
8534 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8536 return isl_val_free(v
);
8538 isl_int_set_si(v
->d
, 1);
8542 return isl_val_nan(ctx
);
8545 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8546 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8548 if (pos
>= isl_map_dim(map
, type
))
8550 return isl_map_plain_has_fixed_var(map
,
8551 map_offset(map
, type
) - 1 + pos
, val
);
8554 /* If "map" obviously lies on a hyperplane where the given dimension
8555 * has a fixed value, then return that value.
8556 * Otherwise return NaN.
8558 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8559 enum isl_dim_type type
, unsigned pos
)
8567 ctx
= isl_map_get_ctx(map
);
8568 v
= isl_val_alloc(ctx
);
8571 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8573 return isl_val_free(v
);
8575 isl_int_set_si(v
->d
, 1);
8579 return isl_val_nan(ctx
);
8582 /* If "set" obviously lies on a hyperplane where the given dimension
8583 * has a fixed value, then return that value.
8584 * Otherwise return NaN.
8586 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8587 enum isl_dim_type type
, unsigned pos
)
8589 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8592 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8593 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8595 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8598 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8599 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8601 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8604 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8605 * then return this fixed value in *val.
8607 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8608 unsigned dim
, isl_int
*val
)
8610 return isl_basic_set_plain_has_fixed_var(bset
,
8611 isl_basic_set_n_param(bset
) + dim
, val
);
8614 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8615 * then return this fixed value in *val.
8617 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8618 unsigned dim
, isl_int
*val
)
8620 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8623 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8624 unsigned dim
, isl_int
*val
)
8626 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8629 /* Check if input variable in has fixed value and if so and if val is not NULL,
8630 * then return this fixed value in *val.
8632 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8633 unsigned in
, isl_int
*val
)
8635 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8638 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8639 * and if val is not NULL, then return this lower bound in *val.
8641 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8642 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8644 int i
, i_eq
= -1, i_ineq
= -1;
8651 total
= isl_basic_set_total_dim(bset
);
8652 nparam
= isl_basic_set_n_param(bset
);
8653 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8654 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8660 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8661 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8663 if (i_eq
!= -1 || i_ineq
!= -1)
8667 if (i_eq
== -1 && i_ineq
== -1)
8669 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8670 /* The coefficient should always be one due to normalization. */
8671 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8673 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8675 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8676 total
- nparam
- dim
- 1) != -1)
8679 isl_int_neg(*val
, c
[0]);
8683 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8684 unsigned dim
, isl_int
*val
)
8696 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8700 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8702 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8703 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8705 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8709 isl_int_set(*val
, v
);
8720 /* uset_gist depends on constraints without existentially quantified
8721 * variables sorting first.
8723 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8725 const struct constraint
*c1
= (const struct constraint
*)p1
;
8726 const struct constraint
*c2
= (const struct constraint
*)p2
;
8728 unsigned size
= isl_min(c1
->size
, c2
->size
);
8730 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8731 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8736 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8739 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8740 struct isl_basic_map
*bmap
)
8743 struct constraint
*c
;
8748 if (bmap
->n_ineq
== 0)
8750 total
= isl_basic_map_total_dim(bmap
);
8751 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8754 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8756 c
[i
].c
= bmap
->ineq
[i
];
8758 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8759 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8760 bmap
->ineq
[i
] = c
[i
].c
;
8764 isl_basic_map_free(bmap
);
8768 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8769 __isl_take isl_basic_set
*bset
)
8771 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8772 (struct isl_basic_map
*)bset
);
8775 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8779 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8781 bmap
= isl_basic_map_remove_redundancies(bmap
);
8782 bmap
= isl_basic_map_sort_constraints(bmap
);
8784 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8788 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8790 return (struct isl_basic_set
*)isl_basic_map_normalize(
8791 (struct isl_basic_map
*)bset
);
8794 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8795 const __isl_keep isl_basic_map
*bmap2
)
8802 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8803 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8804 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8805 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8806 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8807 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8808 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8809 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8810 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8811 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8812 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8814 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8816 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8818 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8819 return bmap1
->n_eq
- bmap2
->n_eq
;
8820 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8821 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8822 if (bmap1
->n_div
!= bmap2
->n_div
)
8823 return bmap1
->n_div
- bmap2
->n_div
;
8824 total
= isl_basic_map_total_dim(bmap1
);
8825 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8826 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8830 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8831 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8835 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8836 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8843 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8844 const __isl_keep isl_basic_set
*bset2
)
8846 return isl_basic_map_plain_cmp(bset1
, bset2
);
8849 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8855 if (set1
->n
!= set2
->n
)
8856 return set1
->n
- set2
->n
;
8858 for (i
= 0; i
< set1
->n
; ++i
) {
8859 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8867 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8868 __isl_keep isl_basic_map
*bmap2
)
8870 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8873 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8874 __isl_keep isl_basic_set
*bset2
)
8876 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8877 (isl_basic_map
*)bset2
);
8880 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8882 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8883 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8885 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8888 /* We normalize in place, but if anything goes wrong we need
8889 * to return NULL, so we need to make sure we don't change the
8890 * meaning of any possible other copies of map.
8892 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8895 struct isl_basic_map
*bmap
;
8899 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8901 for (i
= 0; i
< map
->n
; ++i
) {
8902 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8905 isl_basic_map_free(map
->p
[i
]);
8908 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8909 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8910 map
= isl_map_remove_empty_parts(map
);
8913 for (i
= map
->n
- 1; i
>= 1; --i
) {
8914 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8916 isl_basic_map_free(map
->p
[i
-1]);
8917 for (j
= i
; j
< map
->n
; ++j
)
8918 map
->p
[j
-1] = map
->p
[j
];
8928 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8930 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8933 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8943 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8946 map1
= isl_map_copy(map1
);
8947 map2
= isl_map_copy(map2
);
8948 map1
= isl_map_normalize(map1
);
8949 map2
= isl_map_normalize(map2
);
8952 equal
= map1
->n
== map2
->n
;
8953 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8954 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8967 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8969 return isl_map_plain_is_equal(map1
, map2
);
8972 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8974 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8975 (struct isl_map
*)set2
);
8978 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8980 return isl_set_plain_is_equal(set1
, set2
);
8983 /* Return an interval that ranges from min to max (inclusive)
8985 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8986 isl_int min
, isl_int max
)
8989 struct isl_basic_set
*bset
= NULL
;
8991 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8995 k
= isl_basic_set_alloc_inequality(bset
);
8998 isl_int_set_si(bset
->ineq
[k
][1], 1);
8999 isl_int_neg(bset
->ineq
[k
][0], min
);
9001 k
= isl_basic_set_alloc_inequality(bset
);
9004 isl_int_set_si(bset
->ineq
[k
][1], -1);
9005 isl_int_set(bset
->ineq
[k
][0], max
);
9009 isl_basic_set_free(bset
);
9013 /* Return the Cartesian product of the basic sets in list (in the given order).
9015 __isl_give isl_basic_set
*isl_basic_set_list_product(
9016 __isl_take
struct isl_basic_set_list
*list
)
9024 struct isl_basic_set
*product
= NULL
;
9028 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
9029 isl_assert(list
->ctx
, list
->p
[0], goto error
);
9030 nparam
= isl_basic_set_n_param(list
->p
[0]);
9031 dim
= isl_basic_set_n_dim(list
->p
[0]);
9032 extra
= list
->p
[0]->n_div
;
9033 n_eq
= list
->p
[0]->n_eq
;
9034 n_ineq
= list
->p
[0]->n_ineq
;
9035 for (i
= 1; i
< list
->n
; ++i
) {
9036 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9037 isl_assert(list
->ctx
,
9038 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9039 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9040 extra
+= list
->p
[i
]->n_div
;
9041 n_eq
+= list
->p
[i
]->n_eq
;
9042 n_ineq
+= list
->p
[i
]->n_ineq
;
9044 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9049 for (i
= 0; i
< list
->n
; ++i
) {
9050 isl_basic_set_add_constraints(product
,
9051 isl_basic_set_copy(list
->p
[i
]), dim
);
9052 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9054 isl_basic_set_list_free(list
);
9057 isl_basic_set_free(product
);
9058 isl_basic_set_list_free(list
);
9062 struct isl_basic_map
*isl_basic_map_product(
9063 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9065 isl_space
*dim_result
= NULL
;
9066 struct isl_basic_map
*bmap
;
9067 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9068 struct isl_dim_map
*dim_map1
, *dim_map2
;
9070 if (!bmap1
|| !bmap2
)
9073 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9074 bmap2
->dim
, isl_dim_param
), goto error
);
9075 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9076 isl_space_copy(bmap2
->dim
));
9078 in1
= isl_basic_map_n_in(bmap1
);
9079 in2
= isl_basic_map_n_in(bmap2
);
9080 out1
= isl_basic_map_n_out(bmap1
);
9081 out2
= isl_basic_map_n_out(bmap2
);
9082 nparam
= isl_basic_map_n_param(bmap1
);
9084 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9085 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9086 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9087 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9088 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9089 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9090 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9091 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9092 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9093 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9094 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9096 bmap
= isl_basic_map_alloc_space(dim_result
,
9097 bmap1
->n_div
+ bmap2
->n_div
,
9098 bmap1
->n_eq
+ bmap2
->n_eq
,
9099 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9100 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9101 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9102 bmap
= isl_basic_map_simplify(bmap
);
9103 return isl_basic_map_finalize(bmap
);
9105 isl_basic_map_free(bmap1
);
9106 isl_basic_map_free(bmap2
);
9110 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9111 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9113 isl_basic_map
*prod
;
9115 prod
= isl_basic_map_product(bmap1
, bmap2
);
9116 prod
= isl_basic_map_flatten(prod
);
9120 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9121 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9123 return isl_basic_map_flat_range_product(bset1
, bset2
);
9126 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9127 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9129 isl_space
*space_result
= NULL
;
9130 isl_basic_map
*bmap
;
9131 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9132 struct isl_dim_map
*dim_map1
, *dim_map2
;
9134 if (!bmap1
|| !bmap2
)
9137 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9138 isl_space_copy(bmap2
->dim
));
9140 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9141 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9142 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9143 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9145 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9146 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9147 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9148 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9149 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9150 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9151 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9152 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9153 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9154 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9155 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9157 bmap
= isl_basic_map_alloc_space(space_result
,
9158 bmap1
->n_div
+ bmap2
->n_div
,
9159 bmap1
->n_eq
+ bmap2
->n_eq
,
9160 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9161 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9162 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9163 bmap
= isl_basic_map_simplify(bmap
);
9164 return isl_basic_map_finalize(bmap
);
9166 isl_basic_map_free(bmap1
);
9167 isl_basic_map_free(bmap2
);
9171 __isl_give isl_basic_map
*isl_basic_map_range_product(
9172 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9174 isl_space
*dim_result
= NULL
;
9175 isl_basic_map
*bmap
;
9176 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9177 struct isl_dim_map
*dim_map1
, *dim_map2
;
9179 if (!bmap1
|| !bmap2
)
9182 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9183 bmap2
->dim
, isl_dim_param
))
9184 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9185 "parameters don't match", goto error
);
9187 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9188 isl_space_copy(bmap2
->dim
));
9190 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9191 out1
= isl_basic_map_n_out(bmap1
);
9192 out2
= isl_basic_map_n_out(bmap2
);
9193 nparam
= isl_basic_map_n_param(bmap1
);
9195 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9196 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9197 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9198 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9199 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9200 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9201 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9202 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9203 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9204 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9205 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9207 bmap
= isl_basic_map_alloc_space(dim_result
,
9208 bmap1
->n_div
+ bmap2
->n_div
,
9209 bmap1
->n_eq
+ bmap2
->n_eq
,
9210 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9211 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9212 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9213 bmap
= isl_basic_map_simplify(bmap
);
9214 return isl_basic_map_finalize(bmap
);
9216 isl_basic_map_free(bmap1
);
9217 isl_basic_map_free(bmap2
);
9221 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9222 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9224 isl_basic_map
*prod
;
9226 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9227 prod
= isl_basic_map_flatten_range(prod
);
9231 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9232 __isl_take isl_map
*map2
,
9233 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
9234 __isl_take isl_space
*right
),
9235 __isl_give isl_basic_map
*(*basic_map_product
)(
9236 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
9239 struct isl_map
*result
;
9245 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9246 map2
->dim
, isl_dim_param
), goto error
);
9248 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9249 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9250 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9252 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
9253 isl_space_copy(map2
->dim
)),
9254 map1
->n
* map2
->n
, flags
);
9257 for (i
= 0; i
< map1
->n
; ++i
)
9258 for (j
= 0; j
< map2
->n
; ++j
) {
9259 struct isl_basic_map
*part
;
9260 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9261 isl_basic_map_copy(map2
->p
[j
]));
9262 if (isl_basic_map_is_empty(part
))
9263 isl_basic_map_free(part
);
9265 result
= isl_map_add_basic_map(result
, part
);
9278 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9280 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9281 __isl_take isl_map
*map2
)
9283 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
9286 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9287 __isl_take isl_map
*map2
)
9289 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9292 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9294 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9295 __isl_take isl_map
*map2
)
9299 prod
= isl_map_product(map1
, map2
);
9300 prod
= isl_map_flatten(prod
);
9304 /* Given two set A and B, construct its Cartesian product A x B.
9306 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9308 return isl_map_range_product(set1
, set2
);
9311 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9312 __isl_take isl_set
*set2
)
9314 return isl_map_flat_range_product(set1
, set2
);
9317 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9319 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9320 __isl_take isl_map
*map2
)
9322 return map_product(map1
, map2
, &isl_space_domain_product
,
9323 &isl_basic_map_domain_product
);
9326 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9328 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9329 __isl_take isl_map
*map2
)
9331 return map_product(map1
, map2
, &isl_space_range_product
,
9332 &isl_basic_map_range_product
);
9335 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9336 __isl_take isl_map
*map2
)
9338 return isl_map_align_params_map_map_and(map1
, map2
,
9339 &map_domain_product_aligned
);
9342 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9343 __isl_take isl_map
*map2
)
9345 return isl_map_align_params_map_map_and(map1
, map2
,
9346 &map_range_product_aligned
);
9349 /* Given a map A -> [B -> C], extract the map A -> B.
9351 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
9358 if (!isl_space_range_is_wrapping(map
->dim
))
9359 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9360 "range is not a product", return isl_map_free(map
));
9362 space
= isl_map_get_space(map
);
9363 total
= isl_space_dim(space
, isl_dim_out
);
9364 space
= isl_space_range_factor_domain(space
);
9365 keep
= isl_space_dim(space
, isl_dim_out
);
9366 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
9367 map
= isl_map_reset_space(map
, space
);
9372 /* Given a map A -> [B -> C], extract the map A -> C.
9374 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
9381 if (!isl_space_range_is_wrapping(map
->dim
))
9382 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9383 "range is not a product", return isl_map_free(map
));
9385 space
= isl_map_get_space(map
);
9386 total
= isl_space_dim(space
, isl_dim_out
);
9387 space
= isl_space_range_factor_range(space
);
9388 keep
= isl_space_dim(space
, isl_dim_out
);
9389 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
9390 map
= isl_map_reset_space(map
, space
);
9395 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9397 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9398 __isl_take isl_map
*map2
)
9402 prod
= isl_map_domain_product(map1
, map2
);
9403 prod
= isl_map_flatten_domain(prod
);
9407 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9409 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9410 __isl_take isl_map
*map2
)
9414 prod
= isl_map_range_product(map1
, map2
);
9415 prod
= isl_map_flatten_range(prod
);
9419 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9422 uint32_t hash
= isl_hash_init();
9427 bmap
= isl_basic_map_copy(bmap
);
9428 bmap
= isl_basic_map_normalize(bmap
);
9431 total
= isl_basic_map_total_dim(bmap
);
9432 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9433 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9435 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9436 isl_hash_hash(hash
, c_hash
);
9438 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9439 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9441 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9442 isl_hash_hash(hash
, c_hash
);
9444 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9445 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9447 if (isl_int_is_zero(bmap
->div
[i
][0]))
9449 isl_hash_byte(hash
, i
& 0xFF);
9450 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9451 isl_hash_hash(hash
, c_hash
);
9453 isl_basic_map_free(bmap
);
9457 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9459 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9462 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9469 map
= isl_map_copy(map
);
9470 map
= isl_map_normalize(map
);
9474 hash
= isl_hash_init();
9475 for (i
= 0; i
< map
->n
; ++i
) {
9477 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9478 isl_hash_hash(hash
, bmap_hash
);
9486 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9488 return isl_map_get_hash((isl_map
*)set
);
9491 /* Check if the value for dimension dim is completely determined
9492 * by the values of the other parameters and variables.
9493 * That is, check if dimension dim is involved in an equality.
9495 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9502 nparam
= isl_basic_set_n_param(bset
);
9503 for (i
= 0; i
< bset
->n_eq
; ++i
)
9504 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9509 /* Check if the value for dimension dim is completely determined
9510 * by the values of the other parameters and variables.
9511 * That is, check if dimension dim is involved in an equality
9512 * for each of the subsets.
9514 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
9520 for (i
= 0; i
< set
->n
; ++i
) {
9522 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
9529 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9531 return set
? set
->n
: 0;
9534 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9535 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9542 for (i
= 0; i
< map
->n
; ++i
)
9543 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9549 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9550 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9557 for (i
= 0; i
< set
->n
; ++i
)
9558 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9564 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9571 bset
= isl_basic_set_cow(bset
);
9575 dim
= isl_basic_set_get_space(bset
);
9576 dim
= isl_space_lift(dim
, bset
->n_div
);
9579 isl_space_free(bset
->dim
);
9581 bset
->extra
-= bset
->n_div
;
9584 bset
= isl_basic_set_finalize(bset
);
9588 isl_basic_set_free(bset
);
9592 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9598 set
= isl_set_align_divs(set
);
9603 set
= isl_set_cow(set
);
9607 n_div
= set
->p
[0]->n_div
;
9608 dim
= isl_set_get_space(set
);
9609 dim
= isl_space_lift(dim
, n_div
);
9612 isl_space_free(set
->dim
);
9615 for (i
= 0; i
< set
->n
; ++i
) {
9616 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9627 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9630 struct isl_basic_map
*bmap
;
9637 set
= isl_set_align_divs(set
);
9642 dim
= isl_set_get_space(set
);
9643 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9645 return isl_map_identity(isl_space_map_from_set(dim
));
9648 n_div
= set
->p
[0]->n_div
;
9649 dim
= isl_space_map_from_set(dim
);
9650 n_param
= isl_space_dim(dim
, isl_dim_param
);
9651 n_set
= isl_space_dim(dim
, isl_dim_in
);
9652 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9653 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9654 for (i
= 0; i
< n_set
; ++i
)
9655 bmap
= var_equal(bmap
, i
);
9657 total
= n_param
+ n_set
+ n_set
+ n_div
;
9658 for (i
= 0; i
< n_div
; ++i
) {
9659 k
= isl_basic_map_alloc_inequality(bmap
);
9662 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9663 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9664 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9665 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9666 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9667 set
->p
[0]->div
[i
][0]);
9669 l
= isl_basic_map_alloc_inequality(bmap
);
9672 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9673 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9674 set
->p
[0]->div
[i
][0]);
9675 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9679 bmap
= isl_basic_map_simplify(bmap
);
9680 bmap
= isl_basic_map_finalize(bmap
);
9681 return isl_map_from_basic_map(bmap
);
9684 isl_basic_map_free(bmap
);
9688 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9696 dim
= isl_basic_set_total_dim(bset
);
9697 size
+= bset
->n_eq
* (1 + dim
);
9698 size
+= bset
->n_ineq
* (1 + dim
);
9699 size
+= bset
->n_div
* (2 + dim
);
9704 int isl_set_size(__isl_keep isl_set
*set
)
9712 for (i
= 0; i
< set
->n
; ++i
)
9713 size
+= isl_basic_set_size(set
->p
[i
]);
9718 /* Check if there is any lower bound (if lower == 0) and/or upper
9719 * bound (if upper == 0) on the specified dim.
9721 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9722 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9729 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9731 pos
+= isl_basic_map_offset(bmap
, type
);
9733 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9734 if (isl_int_is_zero(bmap
->div
[i
][0]))
9736 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9740 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9741 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9744 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9745 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9752 return lower
&& upper
;
9755 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9756 enum isl_dim_type type
, unsigned pos
)
9758 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9761 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9762 enum isl_dim_type type
, unsigned pos
)
9764 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9767 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9768 enum isl_dim_type type
, unsigned pos
)
9770 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9773 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9774 enum isl_dim_type type
, unsigned pos
)
9781 for (i
= 0; i
< map
->n
; ++i
) {
9783 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9784 if (bounded
< 0 || !bounded
)
9791 /* Return 1 if the specified dim is involved in both an upper bound
9792 * and a lower bound.
9794 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9795 enum isl_dim_type type
, unsigned pos
)
9797 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9800 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9802 static int has_any_bound(__isl_keep isl_map
*map
,
9803 enum isl_dim_type type
, unsigned pos
,
9804 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9805 enum isl_dim_type type
, unsigned pos
))
9812 for (i
= 0; i
< map
->n
; ++i
) {
9814 bounded
= fn(map
->p
[i
], type
, pos
);
9815 if (bounded
< 0 || bounded
)
9822 /* Return 1 if the specified dim is involved in any lower bound.
9824 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9825 enum isl_dim_type type
, unsigned pos
)
9827 return has_any_bound(set
, type
, pos
,
9828 &isl_basic_map_dim_has_lower_bound
);
9831 /* Return 1 if the specified dim is involved in any upper bound.
9833 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9834 enum isl_dim_type type
, unsigned pos
)
9836 return has_any_bound(set
, type
, pos
,
9837 &isl_basic_map_dim_has_upper_bound
);
9840 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9842 static int has_bound(__isl_keep isl_map
*map
,
9843 enum isl_dim_type type
, unsigned pos
,
9844 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9845 enum isl_dim_type type
, unsigned pos
))
9852 for (i
= 0; i
< map
->n
; ++i
) {
9854 bounded
= fn(map
->p
[i
], type
, pos
);
9855 if (bounded
< 0 || !bounded
)
9862 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9864 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9865 enum isl_dim_type type
, unsigned pos
)
9867 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9870 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9872 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9873 enum isl_dim_type type
, unsigned pos
)
9875 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9878 /* For each of the "n" variables starting at "first", determine
9879 * the sign of the variable and put the results in the first "n"
9880 * elements of the array "signs".
9882 * 1 means that the variable is non-negative
9883 * -1 means that the variable is non-positive
9884 * 0 means the variable attains both positive and negative values.
9886 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9887 unsigned first
, unsigned n
, int *signs
)
9889 isl_vec
*bound
= NULL
;
9890 struct isl_tab
*tab
= NULL
;
9891 struct isl_tab_undo
*snap
;
9894 if (!bset
|| !signs
)
9897 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9898 tab
= isl_tab_from_basic_set(bset
, 0);
9902 isl_seq_clr(bound
->el
, bound
->size
);
9903 isl_int_set_si(bound
->el
[0], -1);
9905 snap
= isl_tab_snap(tab
);
9906 for (i
= 0; i
< n
; ++i
) {
9909 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9910 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9913 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9914 if (isl_tab_rollback(tab
, snap
) < 0)
9922 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9923 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9926 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9927 if (isl_tab_rollback(tab
, snap
) < 0)
9930 signs
[i
] = empty
? -1 : 0;
9934 isl_vec_free(bound
);
9938 isl_vec_free(bound
);
9942 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9943 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9945 if (!bset
|| !signs
)
9947 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9950 first
+= pos(bset
->dim
, type
) - 1;
9951 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9954 /* Check if the given basic map is obviously single-valued.
9955 * In particular, for each output dimension, check that there is
9956 * an equality that defines the output dimension in terms of
9957 * earlier dimensions.
9959 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9969 total
= 1 + isl_basic_map_total_dim(bmap
);
9970 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9971 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9973 for (i
= 0; i
< n_out
; ++i
) {
9974 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9975 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9977 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9978 total
- (o_out
+ i
+ 1)) == -1)
9981 if (j
>= bmap
->n_eq
)
9988 /* Check if the given basic map is single-valued.
9993 * and check if the result is a subset of the identity mapping.
9995 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9998 isl_basic_map
*test
;
10002 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10006 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10007 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10009 space
= isl_basic_map_get_space(bmap
);
10010 space
= isl_space_map_from_set(isl_space_range(space
));
10011 id
= isl_basic_map_identity(space
);
10013 sv
= isl_basic_map_is_subset(test
, id
);
10015 isl_basic_map_free(test
);
10016 isl_basic_map_free(id
);
10021 /* Check if the given map is obviously single-valued.
10023 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10032 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10035 /* Check if the given map is single-valued.
10036 * We simply compute
10040 * and check if the result is a subset of the identity mapping.
10042 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
10049 sv
= isl_map_plain_is_single_valued(map
);
10053 test
= isl_map_reverse(isl_map_copy(map
));
10054 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10056 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10057 id
= isl_map_identity(dim
);
10059 sv
= isl_map_is_subset(test
, id
);
10061 isl_map_free(test
);
10067 int isl_map_is_injective(__isl_keep isl_map
*map
)
10071 map
= isl_map_copy(map
);
10072 map
= isl_map_reverse(map
);
10073 in
= isl_map_is_single_valued(map
);
10079 /* Check if the given map is obviously injective.
10081 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10085 map
= isl_map_copy(map
);
10086 map
= isl_map_reverse(map
);
10087 in
= isl_map_plain_is_single_valued(map
);
10093 int isl_map_is_bijective(__isl_keep isl_map
*map
)
10097 sv
= isl_map_is_single_valued(map
);
10101 return isl_map_is_injective(map
);
10104 int isl_set_is_singleton(__isl_keep isl_set
*set
)
10106 return isl_map_is_single_valued((isl_map
*)set
);
10109 int isl_map_is_translation(__isl_keep isl_map
*map
)
10114 delta
= isl_map_deltas(isl_map_copy(map
));
10115 ok
= isl_set_is_singleton(delta
);
10116 isl_set_free(delta
);
10121 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10123 if (isl_seq_first_non_zero(p
, pos
) != -1)
10125 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10130 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10139 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10142 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10143 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10144 for (j
= 0; j
< nvar
; ++j
) {
10145 int lower
= 0, upper
= 0;
10146 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10147 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10149 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10153 if (i
< bset
->n_eq
)
10155 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10156 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10158 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10160 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10165 if (!lower
|| !upper
)
10172 int isl_set_is_box(__isl_keep isl_set
*set
)
10179 return isl_basic_set_is_box(set
->p
[0]);
10182 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10187 return isl_space_is_wrapping(bset
->dim
);
10190 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
10195 return isl_space_is_wrapping(set
->dim
);
10198 /* Is the range of "map" a wrapped relation?
10200 int isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
10205 return isl_space_range_is_wrapping(map
->dim
);
10208 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
10210 bmap
= isl_basic_map_cow(bmap
);
10214 bmap
->dim
= isl_space_wrap(bmap
->dim
);
10218 bmap
= isl_basic_map_finalize(bmap
);
10220 return (isl_basic_set
*)bmap
;
10222 isl_basic_map_free(bmap
);
10226 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
10230 map
= isl_map_cow(map
);
10234 for (i
= 0; i
< map
->n
; ++i
) {
10235 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
10239 map
->dim
= isl_space_wrap(map
->dim
);
10243 return (isl_set
*)map
;
10249 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
10251 bset
= isl_basic_set_cow(bset
);
10255 bset
->dim
= isl_space_unwrap(bset
->dim
);
10259 bset
= isl_basic_set_finalize(bset
);
10261 return (isl_basic_map
*)bset
;
10263 isl_basic_set_free(bset
);
10267 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
10274 if (!isl_set_is_wrapping(set
))
10275 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
10278 set
= isl_set_cow(set
);
10282 for (i
= 0; i
< set
->n
; ++i
) {
10283 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
10288 set
->dim
= isl_space_unwrap(set
->dim
);
10292 return (isl_map
*)set
;
10298 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
10299 enum isl_dim_type type
)
10304 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
10307 bmap
= isl_basic_map_cow(bmap
);
10311 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
10315 bmap
= isl_basic_map_finalize(bmap
);
10319 isl_basic_map_free(bmap
);
10323 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10324 enum isl_dim_type type
)
10331 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10334 map
= isl_map_cow(map
);
10338 for (i
= 0; i
< map
->n
; ++i
) {
10339 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10343 map
->dim
= isl_space_reset(map
->dim
, type
);
10353 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10358 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10361 bmap
= isl_basic_map_cow(bmap
);
10365 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10369 bmap
= isl_basic_map_finalize(bmap
);
10373 isl_basic_map_free(bmap
);
10377 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10379 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
10382 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10383 __isl_take isl_basic_map
*bmap
)
10388 if (!bmap
->dim
->nested
[0])
10391 bmap
= isl_basic_map_cow(bmap
);
10395 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10399 bmap
= isl_basic_map_finalize(bmap
);
10403 isl_basic_map_free(bmap
);
10407 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10408 __isl_take isl_basic_map
*bmap
)
10413 if (!bmap
->dim
->nested
[1])
10416 bmap
= isl_basic_map_cow(bmap
);
10420 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
10424 bmap
= isl_basic_map_finalize(bmap
);
10428 isl_basic_map_free(bmap
);
10432 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
10439 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
10442 map
= isl_map_cow(map
);
10446 for (i
= 0; i
< map
->n
; ++i
) {
10447 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
10451 map
->dim
= isl_space_flatten(map
->dim
);
10461 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
10463 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
10466 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
10468 isl_space
*dim
, *flat_dim
;
10471 dim
= isl_set_get_space(set
);
10472 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
10473 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
10474 map
= isl_map_intersect_domain(map
, set
);
10479 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
10486 if (!map
->dim
->nested
[0])
10489 map
= isl_map_cow(map
);
10493 for (i
= 0; i
< map
->n
; ++i
) {
10494 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
10498 map
->dim
= isl_space_flatten_domain(map
->dim
);
10508 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
10515 if (!map
->dim
->nested
[1])
10518 map
= isl_map_cow(map
);
10522 for (i
= 0; i
< map
->n
; ++i
) {
10523 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
10527 map
->dim
= isl_space_flatten_range(map
->dim
);
10537 /* Reorder the dimensions of "bmap" according to the given dim_map
10538 * and set the dimension specification to "dim".
10540 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
10541 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
10543 isl_basic_map
*res
;
10546 bmap
= isl_basic_map_cow(bmap
);
10547 if (!bmap
|| !dim
|| !dim_map
)
10550 flags
= bmap
->flags
;
10551 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
10552 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
10553 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
10554 res
= isl_basic_map_alloc_space(dim
,
10555 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
10556 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
10558 res
->flags
= flags
;
10559 res
= isl_basic_map_finalize(res
);
10563 isl_basic_map_free(bmap
);
10564 isl_space_free(dim
);
10568 /* Reorder the dimensions of "map" according to given reordering.
10570 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
10571 __isl_take isl_reordering
*r
)
10574 struct isl_dim_map
*dim_map
;
10576 map
= isl_map_cow(map
);
10577 dim_map
= isl_dim_map_from_reordering(r
);
10578 if (!map
|| !r
|| !dim_map
)
10581 for (i
= 0; i
< map
->n
; ++i
) {
10582 struct isl_dim_map
*dim_map_i
;
10584 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10586 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10587 isl_space_copy(r
->dim
), dim_map_i
);
10593 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10595 isl_reordering_free(r
);
10601 isl_reordering_free(r
);
10605 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10606 __isl_take isl_reordering
*r
)
10608 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10611 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10612 __isl_take isl_space
*model
)
10616 if (!map
|| !model
)
10619 ctx
= isl_space_get_ctx(model
);
10620 if (!isl_space_has_named_params(model
))
10621 isl_die(ctx
, isl_error_invalid
,
10622 "model has unnamed parameters", goto error
);
10623 if (!isl_space_has_named_params(map
->dim
))
10624 isl_die(ctx
, isl_error_invalid
,
10625 "relation has unnamed parameters", goto error
);
10626 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10627 isl_reordering
*exp
;
10629 model
= isl_space_drop_dims(model
, isl_dim_in
,
10630 0, isl_space_dim(model
, isl_dim_in
));
10631 model
= isl_space_drop_dims(model
, isl_dim_out
,
10632 0, isl_space_dim(model
, isl_dim_out
));
10633 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10634 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10635 map
= isl_map_realign(map
, exp
);
10638 isl_space_free(model
);
10641 isl_space_free(model
);
10646 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10647 __isl_take isl_space
*model
)
10649 return isl_map_align_params(set
, model
);
10652 /* Align the parameters of "bmap" to those of "model", introducing
10653 * additional parameters if needed.
10655 __isl_give isl_basic_map
*isl_basic_map_align_params(
10656 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10660 if (!bmap
|| !model
)
10663 ctx
= isl_space_get_ctx(model
);
10664 if (!isl_space_has_named_params(model
))
10665 isl_die(ctx
, isl_error_invalid
,
10666 "model has unnamed parameters", goto error
);
10667 if (!isl_space_has_named_params(bmap
->dim
))
10668 isl_die(ctx
, isl_error_invalid
,
10669 "relation has unnamed parameters", goto error
);
10670 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10671 isl_reordering
*exp
;
10672 struct isl_dim_map
*dim_map
;
10674 model
= isl_space_drop_dims(model
, isl_dim_in
,
10675 0, isl_space_dim(model
, isl_dim_in
));
10676 model
= isl_space_drop_dims(model
, isl_dim_out
,
10677 0, isl_space_dim(model
, isl_dim_out
));
10678 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10679 exp
= isl_reordering_extend_space(exp
,
10680 isl_basic_map_get_space(bmap
));
10681 dim_map
= isl_dim_map_from_reordering(exp
);
10682 bmap
= isl_basic_map_realign(bmap
,
10683 exp
? isl_space_copy(exp
->dim
) : NULL
,
10684 isl_dim_map_extend(dim_map
, bmap
));
10685 isl_reordering_free(exp
);
10689 isl_space_free(model
);
10692 isl_space_free(model
);
10693 isl_basic_map_free(bmap
);
10697 /* Align the parameters of "bset" to those of "model", introducing
10698 * additional parameters if needed.
10700 __isl_give isl_basic_set
*isl_basic_set_align_params(
10701 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10703 return isl_basic_map_align_params(bset
, model
);
10706 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10707 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10708 enum isl_dim_type c2
, enum isl_dim_type c3
,
10709 enum isl_dim_type c4
, enum isl_dim_type c5
)
10711 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10712 struct isl_mat
*mat
;
10718 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10719 isl_basic_map_total_dim(bmap
) + 1);
10722 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10723 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10724 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10725 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10726 isl_int_set(mat
->row
[i
][pos
],
10727 bmap
->eq
[i
][off
+ k
]);
10735 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10736 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10737 enum isl_dim_type c2
, enum isl_dim_type c3
,
10738 enum isl_dim_type c4
, enum isl_dim_type c5
)
10740 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10741 struct isl_mat
*mat
;
10747 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10748 isl_basic_map_total_dim(bmap
) + 1);
10751 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10752 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10753 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10754 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10755 isl_int_set(mat
->row
[i
][pos
],
10756 bmap
->ineq
[i
][off
+ k
]);
10764 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10765 __isl_take isl_space
*dim
,
10766 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10767 enum isl_dim_type c2
, enum isl_dim_type c3
,
10768 enum isl_dim_type c4
, enum isl_dim_type c5
)
10770 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10771 isl_basic_map
*bmap
;
10777 if (!dim
|| !eq
|| !ineq
)
10780 if (eq
->n_col
!= ineq
->n_col
)
10781 isl_die(dim
->ctx
, isl_error_invalid
,
10782 "equalities and inequalities matrices should have "
10783 "same number of columns", goto error
);
10785 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10787 if (eq
->n_col
< total
)
10788 isl_die(dim
->ctx
, isl_error_invalid
,
10789 "number of columns too small", goto error
);
10791 extra
= eq
->n_col
- total
;
10793 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10794 eq
->n_row
, ineq
->n_row
);
10797 for (i
= 0; i
< extra
; ++i
) {
10798 k
= isl_basic_map_alloc_div(bmap
);
10801 isl_int_set_si(bmap
->div
[k
][0], 0);
10803 for (i
= 0; i
< eq
->n_row
; ++i
) {
10804 l
= isl_basic_map_alloc_equality(bmap
);
10807 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10808 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10809 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10810 isl_int_set(bmap
->eq
[l
][off
+ k
],
10816 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10817 l
= isl_basic_map_alloc_inequality(bmap
);
10820 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10821 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10822 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10823 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10824 ineq
->row
[i
][pos
]);
10830 isl_space_free(dim
);
10832 isl_mat_free(ineq
);
10834 bmap
= isl_basic_map_simplify(bmap
);
10835 return isl_basic_map_finalize(bmap
);
10837 isl_space_free(dim
);
10839 isl_mat_free(ineq
);
10843 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10844 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10845 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10847 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10848 c1
, c2
, c3
, c4
, isl_dim_in
);
10851 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10852 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10853 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10855 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10856 c1
, c2
, c3
, c4
, isl_dim_in
);
10859 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10860 __isl_take isl_space
*dim
,
10861 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10862 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10864 return (isl_basic_set
*)
10865 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10866 c1
, c2
, c3
, c4
, isl_dim_in
);
10869 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10874 return isl_space_can_zip(bmap
->dim
);
10877 int isl_map_can_zip(__isl_keep isl_map
*map
)
10882 return isl_space_can_zip(map
->dim
);
10885 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10886 * (A -> C) -> (B -> D).
10888 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10897 if (!isl_basic_map_can_zip(bmap
))
10898 isl_die(bmap
->ctx
, isl_error_invalid
,
10899 "basic map cannot be zipped", goto error
);
10900 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10901 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10902 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10903 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10904 bmap
= isl_basic_map_cow(bmap
);
10905 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10908 bmap
->dim
= isl_space_zip(bmap
->dim
);
10913 isl_basic_map_free(bmap
);
10917 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10918 * (A -> C) -> (B -> D).
10920 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10927 if (!isl_map_can_zip(map
))
10928 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10931 map
= isl_map_cow(map
);
10935 for (i
= 0; i
< map
->n
; ++i
) {
10936 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10941 map
->dim
= isl_space_zip(map
->dim
);
10951 /* Can we apply isl_basic_map_curry to "bmap"?
10952 * That is, does it have a nested relation in its domain?
10954 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10959 return isl_space_can_curry(bmap
->dim
);
10962 /* Can we apply isl_map_curry to "map"?
10963 * That is, does it have a nested relation in its domain?
10965 int isl_map_can_curry(__isl_keep isl_map
*map
)
10970 return isl_space_can_curry(map
->dim
);
10973 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10976 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10982 if (!isl_basic_map_can_curry(bmap
))
10983 isl_die(bmap
->ctx
, isl_error_invalid
,
10984 "basic map cannot be curried", goto error
);
10985 bmap
= isl_basic_map_cow(bmap
);
10988 bmap
->dim
= isl_space_curry(bmap
->dim
);
10993 isl_basic_map_free(bmap
);
10997 /* Given a map (A -> B) -> C, return the corresponding map
11000 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11007 if (!isl_map_can_curry(map
))
11008 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
11011 map
= isl_map_cow(map
);
11015 for (i
= 0; i
< map
->n
; ++i
) {
11016 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
11021 map
->dim
= isl_space_curry(map
->dim
);
11031 /* Can we apply isl_basic_map_uncurry to "bmap"?
11032 * That is, does it have a nested relation in its domain?
11034 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11039 return isl_space_can_uncurry(bmap
->dim
);
11042 /* Can we apply isl_map_uncurry to "map"?
11043 * That is, does it have a nested relation in its domain?
11045 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
11050 return isl_space_can_uncurry(map
->dim
);
11053 /* Given a basic map A -> (B -> C), return the corresponding basic map
11056 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11062 if (!isl_basic_map_can_uncurry(bmap
))
11063 isl_die(bmap
->ctx
, isl_error_invalid
,
11064 "basic map cannot be uncurried",
11065 return isl_basic_map_free(bmap
));
11066 bmap
= isl_basic_map_cow(bmap
);
11069 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11071 return isl_basic_map_free(bmap
);
11075 /* Given a map A -> (B -> C), return the corresponding map
11078 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11085 if (!isl_map_can_uncurry(map
))
11086 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
11087 return isl_map_free(map
));
11089 map
= isl_map_cow(map
);
11093 for (i
= 0; i
< map
->n
; ++i
) {
11094 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
11096 return isl_map_free(map
);
11099 map
->dim
= isl_space_uncurry(map
->dim
);
11101 return isl_map_free(map
);
11106 /* Construct a basic map mapping the domain of the affine expression
11107 * to a one-dimensional range prescribed by the affine expression.
11109 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11113 isl_local_space
*ls
;
11114 isl_basic_map
*bmap
;
11119 ls
= isl_aff_get_local_space(aff
);
11120 bmap
= isl_basic_map_from_local_space(ls
);
11121 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11122 k
= isl_basic_map_alloc_equality(bmap
);
11126 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11127 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11128 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11129 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11130 aff
->v
->size
- (pos
+ 1));
11133 bmap
= isl_basic_map_finalize(bmap
);
11137 isl_basic_map_free(bmap
);
11141 /* Construct a map mapping the domain of the affine expression
11142 * to a one-dimensional range prescribed by the affine expression.
11144 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11146 isl_basic_map
*bmap
;
11148 bmap
= isl_basic_map_from_aff(aff
);
11149 return isl_map_from_basic_map(bmap
);
11152 /* Construct a basic map mapping the domain the multi-affine expression
11153 * to its range, with each dimension in the range equated to the
11154 * corresponding affine expression.
11156 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11157 __isl_take isl_multi_aff
*maff
)
11161 isl_basic_map
*bmap
;
11166 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11167 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11168 "invalid space", return isl_multi_aff_free(maff
));
11170 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11171 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11173 for (i
= 0; i
< maff
->n
; ++i
) {
11175 isl_basic_map
*bmap_i
;
11177 aff
= isl_aff_copy(maff
->p
[i
]);
11178 bmap_i
= isl_basic_map_from_aff(aff
);
11180 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11183 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11185 isl_multi_aff_free(maff
);
11189 /* Construct a map mapping the domain the multi-affine expression
11190 * to its range, with each dimension in the range equated to the
11191 * corresponding affine expression.
11193 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11195 isl_basic_map
*bmap
;
11197 bmap
= isl_basic_map_from_multi_aff(maff
);
11198 return isl_map_from_basic_map(bmap
);
11201 /* Construct a basic map mapping a domain in the given space to
11202 * to an n-dimensional range, with n the number of elements in the list,
11203 * where each coordinate in the range is prescribed by the
11204 * corresponding affine expression.
11205 * The domains of all affine expressions in the list are assumed to match
11208 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11209 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11213 isl_basic_map
*bmap
;
11218 dim
= isl_space_from_domain(domain_dim
);
11219 bmap
= isl_basic_map_universe(dim
);
11221 for (i
= 0; i
< list
->n
; ++i
) {
11223 isl_basic_map
*bmap_i
;
11225 aff
= isl_aff_copy(list
->p
[i
]);
11226 bmap_i
= isl_basic_map_from_aff(aff
);
11228 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11231 isl_aff_list_free(list
);
11235 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11236 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11238 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11241 /* Construct a basic map where the given dimensions are equal to each other.
11243 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11244 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11246 isl_basic_map
*bmap
= NULL
;
11252 if (pos1
>= isl_space_dim(space
, type1
))
11253 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11254 "index out of bounds", goto error
);
11255 if (pos2
>= isl_space_dim(space
, type2
))
11256 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11257 "index out of bounds", goto error
);
11259 if (type1
== type2
&& pos1
== pos2
)
11260 return isl_basic_map_universe(space
);
11262 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11263 i
= isl_basic_map_alloc_equality(bmap
);
11266 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11267 pos1
+= isl_basic_map_offset(bmap
, type1
);
11268 pos2
+= isl_basic_map_offset(bmap
, type2
);
11269 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11270 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11271 bmap
= isl_basic_map_finalize(bmap
);
11272 isl_space_free(space
);
11275 isl_space_free(space
);
11276 isl_basic_map_free(bmap
);
11280 /* Add a constraint imposing that the given two dimensions are equal.
11282 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
11283 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11287 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11289 bmap
= isl_basic_map_intersect(bmap
, eq
);
11294 /* Add a constraint imposing that the given two dimensions are equal.
11296 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
11297 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11299 isl_basic_map
*bmap
;
11301 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11303 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11308 /* Add a constraint imposing that the given two dimensions have opposite values.
11310 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
11311 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11313 isl_basic_map
*bmap
= NULL
;
11319 if (pos1
>= isl_map_dim(map
, type1
))
11320 isl_die(map
->ctx
, isl_error_invalid
,
11321 "index out of bounds", goto error
);
11322 if (pos2
>= isl_map_dim(map
, type2
))
11323 isl_die(map
->ctx
, isl_error_invalid
,
11324 "index out of bounds", goto error
);
11326 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11327 i
= isl_basic_map_alloc_equality(bmap
);
11330 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11331 pos1
+= isl_basic_map_offset(bmap
, type1
);
11332 pos2
+= isl_basic_map_offset(bmap
, type2
);
11333 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11334 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11335 bmap
= isl_basic_map_finalize(bmap
);
11337 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11341 isl_basic_map_free(bmap
);
11346 /* Add a constraint imposing that the value of the first dimension is
11347 * greater than or equal to that of the second.
11349 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
11350 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11353 isl_local_space
*ls
;
11358 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
11359 isl_die(bmap
->ctx
, isl_error_invalid
,
11360 "index out of bounds", return isl_basic_map_free(bmap
));
11361 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
11362 isl_die(bmap
->ctx
, isl_error_invalid
,
11363 "index out of bounds", return isl_basic_map_free(bmap
));
11365 if (type1
== type2
&& pos1
== pos2
)
11368 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
11369 c
= isl_inequality_alloc(ls
);
11370 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11371 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11372 bmap
= isl_basic_map_add_constraint(bmap
, c
);
11377 /* Construct a basic map where the value of the first dimension is
11378 * greater than that of the second.
11380 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
11381 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11383 isl_basic_map
*bmap
= NULL
;
11389 if (pos1
>= isl_space_dim(space
, type1
))
11390 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11391 "index out of bounds", goto error
);
11392 if (pos2
>= isl_space_dim(space
, type2
))
11393 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11394 "index out of bounds", goto error
);
11396 if (type1
== type2
&& pos1
== pos2
)
11397 return isl_basic_map_empty(space
);
11399 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
11400 i
= isl_basic_map_alloc_inequality(bmap
);
11403 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11404 pos1
+= isl_basic_map_offset(bmap
, type1
);
11405 pos2
+= isl_basic_map_offset(bmap
, type2
);
11406 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
11407 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
11408 isl_int_set_si(bmap
->ineq
[i
][0], -1);
11409 bmap
= isl_basic_map_finalize(bmap
);
11413 isl_space_free(space
);
11414 isl_basic_map_free(bmap
);
11418 /* Add a constraint imposing that the value of the first dimension is
11419 * greater than that of the second.
11421 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
11422 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11426 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11428 bmap
= isl_basic_map_intersect(bmap
, gt
);
11433 /* Add a constraint imposing that the value of the first dimension is
11434 * greater than that of the second.
11436 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
11437 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11439 isl_basic_map
*bmap
;
11441 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11443 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11448 /* Add a constraint imposing that the value of the first dimension is
11449 * smaller than that of the second.
11451 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
11452 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11454 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
11457 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
11461 isl_local_space
*ls
;
11466 if (!isl_basic_map_divs_known(bmap
))
11467 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11468 "some divs are unknown", return NULL
);
11470 ls
= isl_basic_map_get_local_space(bmap
);
11471 div
= isl_local_space_get_div(ls
, pos
);
11472 isl_local_space_free(ls
);
11477 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
11480 return isl_basic_map_get_div(bset
, pos
);
11483 /* Plug in "subs" for dimension "type", "pos" of "bset".
11485 * Let i be the dimension to replace and let "subs" be of the form
11489 * Any integer division with a non-zero coefficient for i,
11491 * floor((a i + g)/m)
11495 * floor((a f + d g)/(m d))
11497 * Constraints of the form
11505 * We currently require that "subs" is an integral expression.
11506 * Handling rational expressions may require us to add stride constraints
11507 * as we do in isl_basic_set_preimage_multi_aff.
11509 __isl_give isl_basic_set
*isl_basic_set_substitute(
11510 __isl_take isl_basic_set
*bset
,
11511 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11517 if (bset
&& isl_basic_set_plain_is_empty(bset
))
11520 bset
= isl_basic_set_cow(bset
);
11521 if (!bset
|| !subs
)
11524 ctx
= isl_basic_set_get_ctx(bset
);
11525 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
11526 isl_die(ctx
, isl_error_invalid
,
11527 "spaces don't match", goto error
);
11528 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
11529 isl_die(ctx
, isl_error_unsupported
,
11530 "cannot handle divs yet", goto error
);
11531 if (!isl_int_is_one(subs
->v
->el
[0]))
11532 isl_die(ctx
, isl_error_invalid
,
11533 "can only substitute integer expressions", goto error
);
11535 pos
+= isl_basic_set_offset(bset
, type
);
11539 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11540 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
11542 isl_int_set(v
, bset
->eq
[i
][pos
]);
11543 isl_int_set_si(bset
->eq
[i
][pos
], 0);
11544 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
11545 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11548 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11549 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
11551 isl_int_set(v
, bset
->ineq
[i
][pos
]);
11552 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
11553 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
11554 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11557 for (i
= 0; i
< bset
->n_div
; ++i
) {
11558 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
11560 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
11561 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
11562 isl_seq_combine(bset
->div
[i
] + 1,
11563 subs
->v
->el
[0], bset
->div
[i
] + 1,
11564 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11565 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
11570 bset
= isl_basic_set_simplify(bset
);
11571 return isl_basic_set_finalize(bset
);
11573 isl_basic_set_free(bset
);
11577 /* Plug in "subs" for dimension "type", "pos" of "set".
11579 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
11580 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11584 if (set
&& isl_set_plain_is_empty(set
))
11587 set
= isl_set_cow(set
);
11591 for (i
= set
->n
- 1; i
>= 0; --i
) {
11592 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
11593 if (remove_if_empty(set
, i
) < 0)
11603 /* Check if the range of "ma" is compatible with the domain or range
11604 * (depending on "type") of "bmap".
11605 * Return -1 if anything is wrong.
11607 static int check_basic_map_compatible_range_multi_aff(
11608 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
11609 __isl_keep isl_multi_aff
*ma
)
11612 isl_space
*ma_space
;
11614 ma_space
= isl_multi_aff_get_space(ma
);
11615 m
= isl_space_tuple_match(bmap
->dim
, type
, ma_space
, isl_dim_out
);
11616 isl_space_free(ma_space
);
11618 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11619 "spaces don't match", return -1);
11623 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
11624 * coefficients before the transformed range of dimensions,
11625 * the "n_after" coefficients after the transformed range of dimensions
11626 * and the coefficients of the other divs in "bmap".
11628 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
11629 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
11634 isl_local_space
*ls
;
11639 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11643 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
11644 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
11645 for (i
= 0; i
< n_div
; ++i
) {
11646 int o_bmap
= 0, o_ls
= 0;
11648 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
11649 o_bmap
+= 1 + 1 + n_param
;
11650 o_ls
+= 1 + 1 + n_param
;
11651 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
11652 o_bmap
+= n_before
;
11653 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11654 ls
->div
->row
[i
] + o_ls
, n_set
);
11657 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
11659 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11660 ls
->div
->row
[i
] + o_ls
, n_div
);
11663 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
11664 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
11668 isl_local_space_free(ls
);
11671 isl_local_space_free(ls
);
11675 /* How many stride constraints does "ma" enforce?
11676 * That is, how many of the affine expressions have a denominator
11677 * different from one?
11679 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11684 for (i
= 0; i
< ma
->n
; ++i
)
11685 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11691 /* For each affine expression in ma of the form
11693 * x_i = (f_i y + h_i)/m_i
11695 * with m_i different from one, add a constraint to "bmap"
11698 * f_i y + h_i = m_i alpha_i
11700 * with alpha_i an additional existentially quantified variable.
11702 static __isl_give isl_basic_map
*add_ma_strides(
11703 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
11704 int n_before
, int n_after
)
11713 total
= isl_basic_map_total_dim(bmap
);
11714 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
11715 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
11716 n_div
= isl_multi_aff_dim(ma
, isl_dim_div
);
11717 for (i
= 0; i
< ma
->n
; ++i
) {
11718 int o_bmap
= 0, o_ma
= 1;
11720 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11722 div
= isl_basic_map_alloc_div(bmap
);
11723 k
= isl_basic_map_alloc_equality(bmap
);
11724 if (div
< 0 || k
< 0)
11726 isl_int_set_si(bmap
->div
[div
][0], 0);
11727 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11728 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
11729 o_bmap
+= 1 + n_param
;
11730 o_ma
+= 1 + n_param
;
11731 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
11732 o_bmap
+= n_before
;
11733 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11734 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
11737 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
11739 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11740 ma
->p
[i
]->v
->el
+ o_ma
, n_div
);
11743 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
11744 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11750 isl_basic_map_free(bmap
);
11754 /* Replace the domain or range space (depending on "type) of "space" by "set".
11756 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
11757 enum isl_dim_type type
, __isl_take isl_space
*set
)
11759 if (type
== isl_dim_in
) {
11760 space
= isl_space_range(space
);
11761 space
= isl_space_map_from_domain_and_range(set
, space
);
11763 space
= isl_space_domain(space
);
11764 space
= isl_space_map_from_domain_and_range(space
, set
);
11770 /* Compute the preimage of the domain or range (depending on "type")
11771 * of "bmap" under the function represented by "ma".
11772 * In other words, plug in "ma" in the domain or range of "bmap".
11773 * The result is a basic map that lives in the same space as "bmap"
11774 * except that the domain or range has been replaced by
11775 * the domain space of "ma".
11777 * If bmap is represented by
11779 * A(p) + S u + B x + T v + C(divs) >= 0,
11781 * where u and x are input and output dimensions if type == isl_dim_out
11782 * while x and v are input and output dimensions if type == isl_dim_in,
11783 * and ma is represented by
11785 * x = D(p) + F(y) + G(divs')
11787 * then the result is
11789 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
11791 * The divs in the input set are similarly adjusted.
11794 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
11798 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
11799 * B_i G(divs') + c_i(divs))/n_i)
11801 * If bmap is not a rational map and if F(y) involves any denominators
11803 * x_i = (f_i y + h_i)/m_i
11805 * then additional constraints are added to ensure that we only
11806 * map back integer points. That is we enforce
11808 * f_i y + h_i = m_i alpha_i
11810 * with alpha_i an additional existentially quantified variable.
11812 * We first copy over the divs from "ma".
11813 * Then we add the modified constraints and divs from "bmap".
11814 * Finally, we add the stride constraints, if needed.
11816 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
11817 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
11818 __isl_take isl_multi_aff
*ma
)
11822 isl_basic_map
*res
= NULL
;
11823 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
11824 isl_int f
, c1
, c2
, g
;
11825 int rational
, strides
;
11832 ma
= isl_multi_aff_align_divs(ma
);
11835 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
11838 if (type
== isl_dim_in
) {
11840 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
11842 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
11845 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
11846 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11848 space
= isl_multi_aff_get_domain_space(ma
);
11849 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
11850 rational
= isl_basic_map_is_rational(bmap
);
11851 strides
= rational
? 0 : multi_aff_strides(ma
);
11852 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
11853 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
11855 res
= isl_basic_map_set_rational(res
);
11857 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
11858 if (isl_basic_map_alloc_div(res
) < 0)
11861 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
11864 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
11865 k
= isl_basic_map_alloc_equality(res
);
11868 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
11869 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11872 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11873 k
= isl_basic_map_alloc_inequality(res
);
11876 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
11877 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11880 for (i
= 0; i
< bmap
->n_div
; ++i
) {
11881 if (isl_int_is_zero(bmap
->div
[i
][0])) {
11882 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11885 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
11886 n_before
, n_after
, n_div_ma
, n_div_bmap
,
11891 res
= add_ma_strides(res
, ma
, n_before
, n_after
);
11897 isl_basic_map_free(bmap
);
11898 isl_multi_aff_free(ma
);
11899 res
= isl_basic_set_simplify(res
);
11900 return isl_basic_map_finalize(res
);
11906 isl_basic_map_free(bmap
);
11907 isl_multi_aff_free(ma
);
11908 isl_basic_map_free(res
);
11912 /* Compute the preimage of "bset" under the function represented by "ma".
11913 * In other words, plug in "ma" in "bset". The result is a basic set
11914 * that lives in the domain space of "ma".
11916 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11917 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11919 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
11922 /* Compute the preimage of the domain of "bmap" under the function
11923 * represented by "ma".
11924 * In other words, plug in "ma" in the domain of "bmap".
11925 * The result is a basic map that lives in the same space as "bmap"
11926 * except that the domain has been replaced by the domain space of "ma".
11928 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
11929 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
11931 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
11934 /* Compute the preimage of the range of "bmap" under the function
11935 * represented by "ma".
11936 * In other words, plug in "ma" in the range of "bmap".
11937 * The result is a basic map that lives in the same space as "bmap"
11938 * except that the range has been replaced by the domain space of "ma".
11940 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
11941 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
11943 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
11946 /* Check if the range of "ma" is compatible with the domain or range
11947 * (depending on "type") of "map".
11948 * Return -1 if anything is wrong.
11950 static int check_map_compatible_range_multi_aff(
11951 __isl_keep isl_map
*map
, enum isl_dim_type type
,
11952 __isl_keep isl_multi_aff
*ma
)
11955 isl_space
*ma_space
;
11957 ma_space
= isl_multi_aff_get_space(ma
);
11958 m
= isl_space_tuple_match(map
->dim
, type
, ma_space
, isl_dim_out
);
11959 isl_space_free(ma_space
);
11961 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11962 "spaces don't match", return -1);
11966 /* Compute the preimage of the domain or range (depending on "type")
11967 * of "map" under the function represented by "ma".
11968 * In other words, plug in "ma" in the domain or range of "map".
11969 * The result is a map that lives in the same space as "map"
11970 * except that the domain or range has been replaced by
11971 * the domain space of "ma".
11973 * The parameters are assumed to have been aligned.
11975 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
11976 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11981 map
= isl_map_cow(map
);
11982 ma
= isl_multi_aff_align_divs(ma
);
11985 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
11988 for (i
= 0; i
< map
->n
; ++i
) {
11989 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
11990 isl_multi_aff_copy(ma
));
11995 space
= isl_multi_aff_get_domain_space(ma
);
11996 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
11998 isl_space_free(map
->dim
);
12003 isl_multi_aff_free(ma
);
12005 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
12006 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
12009 isl_multi_aff_free(ma
);
12014 /* Compute the preimage of the domain or range (depending on "type")
12015 * of "map" under the function represented by "ma".
12016 * In other words, plug in "ma" in the domain or range of "map".
12017 * The result is a map that lives in the same space as "map"
12018 * except that the domain or range has been replaced by
12019 * the domain space of "ma".
12021 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
12022 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12027 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
12028 return map_preimage_multi_aff(map
, type
, ma
);
12030 if (!isl_space_has_named_params(map
->dim
) ||
12031 !isl_space_has_named_params(ma
->space
))
12032 isl_die(map
->ctx
, isl_error_invalid
,
12033 "unaligned unnamed parameters", goto error
);
12034 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
12035 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
12037 return map_preimage_multi_aff(map
, type
, ma
);
12039 isl_multi_aff_free(ma
);
12040 return isl_map_free(map
);
12043 /* Compute the preimage of "set" under the function represented by "ma".
12044 * In other words, plug in "ma" "set". The result is a set
12045 * that lives in the domain space of "ma".
12047 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
12048 __isl_take isl_multi_aff
*ma
)
12050 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
12053 /* Compute the preimage of the domain of "map" under the function
12054 * represented by "ma".
12055 * In other words, plug in "ma" in the domain of "map".
12056 * The result is a map that lives in the same space as "map"
12057 * except that the domain has been replaced by the domain space of "ma".
12059 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12060 __isl_take isl_multi_aff
*ma
)
12062 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12065 /* Compute the preimage of "map" under the function represented by "pma".
12066 * In other words, plug in "pma" in the domain or range of "map".
12067 * The result is a map that lives in the same space as "map",
12068 * except that the space of type "type" has been replaced by
12069 * the domain space of "pma".
12071 * The parameters of "map" and "pma" are assumed to have been aligned.
12073 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
12074 __isl_take isl_map
*map
, enum isl_dim_type type
,
12075 __isl_take isl_pw_multi_aff
*pma
)
12084 isl_pw_multi_aff_free(pma
);
12085 res
= isl_map_empty(isl_map_get_space(map
));
12090 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12091 isl_multi_aff_copy(pma
->p
[0].maff
));
12092 if (type
== isl_dim_in
)
12093 res
= isl_map_intersect_domain(res
,
12094 isl_map_copy(pma
->p
[0].set
));
12096 res
= isl_map_intersect_range(res
,
12097 isl_map_copy(pma
->p
[0].set
));
12099 for (i
= 1; i
< pma
->n
; ++i
) {
12102 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12103 isl_multi_aff_copy(pma
->p
[i
].maff
));
12104 if (type
== isl_dim_in
)
12105 res_i
= isl_map_intersect_domain(res_i
,
12106 isl_map_copy(pma
->p
[i
].set
));
12108 res_i
= isl_map_intersect_range(res_i
,
12109 isl_map_copy(pma
->p
[i
].set
));
12110 res
= isl_map_union(res
, res_i
);
12113 isl_pw_multi_aff_free(pma
);
12117 isl_pw_multi_aff_free(pma
);
12122 /* Compute the preimage of "map" under the function represented by "pma".
12123 * In other words, plug in "pma" in the domain or range of "map".
12124 * The result is a map that lives in the same space as "map",
12125 * except that the space of type "type" has been replaced by
12126 * the domain space of "pma".
12128 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
12129 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
12134 if (isl_space_match(map
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
12135 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12137 if (!isl_space_has_named_params(map
->dim
) ||
12138 !isl_space_has_named_params(pma
->dim
))
12139 isl_die(map
->ctx
, isl_error_invalid
,
12140 "unaligned unnamed parameters", goto error
);
12141 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
12142 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
12144 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12146 isl_pw_multi_aff_free(pma
);
12147 return isl_map_free(map
);
12150 /* Compute the preimage of "set" under the function represented by "pma".
12151 * In other words, plug in "pma" in "set". The result is a set
12152 * that lives in the domain space of "pma".
12154 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
12155 __isl_take isl_pw_multi_aff
*pma
)
12157 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
12160 /* Compute the preimage of "map" under the function represented by "pma".
12161 * In other words, plug in "pma" in the domain "map".
12162 * The result is a map that lives in the same space as "map",
12163 * except that domain space has been replaced by the domain space of "pma".
12165 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
12166 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12168 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
12171 /* Compute the preimage of "map" under the function represented by "mpa".
12172 * In other words, plug in "mpa" in the domain or range of "map".
12173 * The result is a map that lives in the same space as "map",
12174 * except that the space of type "type" has been replaced by
12175 * the domain space of "mpa".
12177 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
12178 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
12180 isl_pw_multi_aff
*pma
;
12182 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
12183 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
12186 /* Compute the preimage of "map" under the function represented by "mpa".
12187 * In other words, plug in "mpa" in the domain "map".
12188 * The result is a map that lives in the same space as "map",
12189 * except that domain space has been replaced by the domain space of "mpa".
12191 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
12192 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
12194 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
12197 /* Compute the preimage of "set" by the function represented by "mpa".
12198 * In other words, plug in "mpa" in "set".
12200 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
12201 __isl_take isl_multi_pw_aff
*mpa
)
12203 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);