2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 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
);
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
);
440 /* Replace the identifier of the tuple by "id".
442 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
443 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
445 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
448 /* Does the input or output tuple have a name?
450 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
452 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
455 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
456 enum isl_dim_type type
)
458 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
461 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
464 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
467 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
468 enum isl_dim_type type
, __isl_take isl_id
*id
)
470 map
= isl_map_cow(map
);
474 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
476 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
482 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
483 __isl_take isl_id
*id
)
485 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
488 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
489 enum isl_dim_type type
)
491 map
= isl_map_cow(map
);
495 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
497 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
500 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
502 return isl_map_reset_tuple_id(set
, isl_dim_set
);
505 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
507 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
510 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
511 enum isl_dim_type type
)
513 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
516 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
518 return isl_map_has_tuple_id(set
, isl_dim_set
);
521 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
523 return isl_map_get_tuple_id(set
, isl_dim_set
);
526 /* Does the set tuple have a name?
528 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
530 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
534 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
536 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
539 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
541 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
544 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
545 enum isl_dim_type type
, unsigned pos
)
547 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
550 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
551 enum isl_dim_type type
, unsigned pos
)
553 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
556 /* Does the given dimension have a name?
558 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
559 enum isl_dim_type type
, unsigned pos
)
561 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
564 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
565 enum isl_dim_type type
, unsigned pos
)
567 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
570 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
571 enum isl_dim_type type
, unsigned pos
)
573 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
576 /* Does the given dimension have a name?
578 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
579 enum isl_dim_type type
, unsigned pos
)
581 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
584 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
585 __isl_take isl_basic_map
*bmap
,
586 enum isl_dim_type type
, unsigned pos
, const char *s
)
588 bmap
= isl_basic_map_cow(bmap
);
591 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
594 return isl_basic_map_finalize(bmap
);
596 isl_basic_map_free(bmap
);
600 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
601 enum isl_dim_type type
, unsigned pos
, const char *s
)
605 map
= isl_map_cow(map
);
609 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
613 for (i
= 0; i
< map
->n
; ++i
) {
614 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
625 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
626 __isl_take isl_basic_set
*bset
,
627 enum isl_dim_type type
, unsigned pos
, const char *s
)
629 return (isl_basic_set
*)isl_basic_map_set_dim_name(
630 (isl_basic_map
*)bset
, type
, pos
, s
);
633 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
634 enum isl_dim_type type
, unsigned pos
, const char *s
)
636 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
639 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
640 enum isl_dim_type type
, unsigned pos
)
642 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
645 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
646 enum isl_dim_type type
, unsigned pos
)
648 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
651 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
652 enum isl_dim_type type
, unsigned pos
)
654 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
657 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
658 enum isl_dim_type type
, unsigned pos
)
660 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
663 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
664 enum isl_dim_type type
, unsigned pos
)
666 return isl_map_has_dim_id(set
, type
, pos
);
669 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
670 enum isl_dim_type type
, unsigned pos
)
672 return isl_map_get_dim_id(set
, type
, pos
);
675 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
676 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
678 map
= isl_map_cow(map
);
682 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
684 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
690 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
691 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
693 return isl_map_set_dim_id(set
, type
, pos
, id
);
696 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
697 __isl_keep isl_id
*id
)
701 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
704 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
705 __isl_keep isl_id
*id
)
707 return isl_map_find_dim_by_id(set
, type
, id
);
710 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
715 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
718 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
721 return isl_map_find_dim_by_name(set
, type
, name
);
724 /* Reset the user pointer on all identifiers of parameters and tuples
725 * of the space of "map".
727 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
731 space
= isl_map_get_space(map
);
732 space
= isl_space_reset_user(space
);
733 map
= isl_map_reset_space(map
, space
);
738 /* Reset the user pointer on all identifiers of parameters and tuples
739 * of the space of "set".
741 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
743 return isl_map_reset_user(set
);
746 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
750 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
753 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
755 return isl_basic_map_is_rational(bset
);
758 /* Does "bmap" contain any rational points?
760 * If "bmap" has an equality for each dimension, equating the dimension
761 * to an integer constant, then it has no rational points, even if it
762 * is marked as rational.
764 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
766 int has_rational
= 1;
771 if (isl_basic_map_plain_is_empty(bmap
))
773 if (!isl_basic_map_is_rational(bmap
))
775 bmap
= isl_basic_map_copy(bmap
);
776 bmap
= isl_basic_map_implicit_equalities(bmap
);
779 total
= isl_basic_map_total_dim(bmap
);
780 if (bmap
->n_eq
== total
) {
782 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
783 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
786 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
787 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
789 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
797 isl_basic_map_free(bmap
);
802 /* Does "map" contain any rational points?
804 int isl_map_has_rational(__isl_keep isl_map
*map
)
811 for (i
= 0; i
< map
->n
; ++i
) {
812 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
813 if (has_rational
< 0)
821 /* Does "set" contain any rational points?
823 int isl_set_has_rational(__isl_keep isl_set
*set
)
825 return isl_map_has_rational(set
);
828 /* Is this basic set a parameter domain?
830 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
834 return isl_space_is_params(bset
->dim
);
837 /* Is this set a parameter domain?
839 int isl_set_is_params(__isl_keep isl_set
*set
)
843 return isl_space_is_params(set
->dim
);
846 /* Is this map actually a parameter domain?
847 * Users should never call this function. Outside of isl,
848 * a map can never be a parameter domain.
850 int isl_map_is_params(__isl_keep isl_map
*map
)
854 return isl_space_is_params(map
->dim
);
857 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
858 struct isl_basic_map
*bmap
, unsigned extra
,
859 unsigned n_eq
, unsigned n_ineq
)
862 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
867 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
868 if (isl_blk_is_error(bmap
->block
))
871 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
872 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
876 bmap
->block2
= isl_blk_empty();
879 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
880 if (isl_blk_is_error(bmap
->block2
))
883 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
888 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
889 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
891 for (i
= 0; i
< extra
; ++i
)
892 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
896 bmap
->c_size
= n_eq
+ n_ineq
;
897 bmap
->eq
= bmap
->ineq
+ n_ineq
;
906 isl_basic_map_free(bmap
);
910 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
911 unsigned nparam
, unsigned dim
, unsigned extra
,
912 unsigned n_eq
, unsigned n_ineq
)
914 struct isl_basic_map
*bmap
;
917 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
921 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
922 return (struct isl_basic_set
*)bmap
;
925 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
926 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
928 struct isl_basic_map
*bmap
;
931 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
932 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
933 return (struct isl_basic_set
*)bmap
;
939 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
940 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
942 struct isl_basic_map
*bmap
;
946 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
951 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
957 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
958 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
959 unsigned n_eq
, unsigned n_ineq
)
961 struct isl_basic_map
*bmap
;
964 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
968 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
972 static void dup_constraints(
973 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
976 unsigned total
= isl_basic_map_total_dim(src
);
978 for (i
= 0; i
< src
->n_eq
; ++i
) {
979 int j
= isl_basic_map_alloc_equality(dst
);
980 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
983 for (i
= 0; i
< src
->n_ineq
; ++i
) {
984 int j
= isl_basic_map_alloc_inequality(dst
);
985 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
988 for (i
= 0; i
< src
->n_div
; ++i
) {
989 int j
= isl_basic_map_alloc_div(dst
);
990 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
992 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
995 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
997 struct isl_basic_map
*dup
;
1001 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1002 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1005 dup_constraints(dup
, bmap
);
1006 dup
->flags
= bmap
->flags
;
1007 dup
->sample
= isl_vec_copy(bmap
->sample
);
1011 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1013 struct isl_basic_map
*dup
;
1015 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
1016 return (struct isl_basic_set
*)dup
;
1019 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
1024 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1028 return isl_basic_set_dup(bset
);
1031 struct isl_set
*isl_set_copy(struct isl_set
*set
)
1040 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
1045 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1049 bmap
= isl_basic_map_dup(bmap
);
1051 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1055 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1064 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1069 if (--bmap
->ref
> 0)
1072 isl_ctx_deref(bmap
->ctx
);
1074 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1076 isl_blk_free(bmap
->ctx
, bmap
->block
);
1077 isl_vec_free(bmap
->sample
);
1078 isl_space_free(bmap
->dim
);
1084 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1086 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1089 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1091 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1094 __isl_give isl_map
*isl_map_align_params_map_map_and(
1095 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1096 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1097 __isl_take isl_map
*map2
))
1101 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1102 return fn(map1
, map2
);
1103 if (!isl_space_has_named_params(map1
->dim
) ||
1104 !isl_space_has_named_params(map2
->dim
))
1105 isl_die(map1
->ctx
, isl_error_invalid
,
1106 "unaligned unnamed parameters", goto error
);
1107 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1108 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1109 return fn(map1
, map2
);
1116 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1117 __isl_keep isl_map
*map2
,
1118 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1124 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1125 return fn(map1
, map2
);
1126 if (!isl_space_has_named_params(map1
->dim
) ||
1127 !isl_space_has_named_params(map2
->dim
))
1128 isl_die(map1
->ctx
, isl_error_invalid
,
1129 "unaligned unnamed parameters", return -1);
1130 map1
= isl_map_copy(map1
);
1131 map2
= isl_map_copy(map2
);
1132 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1133 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1140 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1142 struct isl_ctx
*ctx
;
1146 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1147 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1149 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1150 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1151 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1152 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1153 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1154 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1156 int j
= isl_basic_map_alloc_inequality(bmap
);
1160 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1161 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1168 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1169 bmap
->extra
- bmap
->n_div
);
1170 return bmap
->n_eq
++;
1173 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1175 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1178 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1182 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1187 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1189 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1192 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1197 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1199 if (pos
!= bmap
->n_eq
- 1) {
1201 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1202 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1208 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1210 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1213 /* Turn inequality "pos" of "bmap" into an equality.
1215 * In particular, we move the inequality in front of the equalities
1216 * and move the last inequality in the position of the moved inequality.
1217 * Note that isl_tab_make_equalities_explicit depends on this particular
1218 * change in the ordering of the constraints.
1220 void isl_basic_map_inequality_to_equality(
1221 struct isl_basic_map
*bmap
, unsigned pos
)
1225 t
= bmap
->ineq
[pos
];
1226 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1227 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1232 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1233 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1234 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1235 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1238 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1240 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1243 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1245 struct isl_ctx
*ctx
;
1249 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1250 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1251 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1252 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1253 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1254 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1255 1 + isl_basic_map_total_dim(bmap
),
1256 bmap
->extra
- bmap
->n_div
);
1257 return bmap
->n_ineq
++;
1260 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1262 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1265 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1269 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1274 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1276 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1279 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1284 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1286 if (pos
!= bmap
->n_ineq
- 1) {
1287 t
= bmap
->ineq
[pos
];
1288 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1289 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1290 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1296 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1298 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1301 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1306 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1309 k
= isl_basic_map_alloc_equality(bmap
);
1312 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1315 isl_basic_map_free(bmap
);
1319 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1322 return (isl_basic_set
*)
1323 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1326 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1331 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1334 k
= isl_basic_map_alloc_inequality(bmap
);
1337 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1340 isl_basic_map_free(bmap
);
1344 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1347 return (isl_basic_set
*)
1348 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1351 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1355 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1356 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1357 1 + 1 + isl_basic_map_total_dim(bmap
),
1358 bmap
->extra
- bmap
->n_div
);
1359 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1360 return bmap
->n_div
++;
1363 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1365 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1368 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1372 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1377 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1379 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1382 /* Copy constraint from src to dst, putting the vars of src at offset
1383 * dim_off in dst and the divs of src at offset div_off in dst.
1384 * If both sets are actually map, then dim_off applies to the input
1387 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1388 struct isl_basic_map
*src_map
, isl_int
*src
,
1389 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1391 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1392 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1393 unsigned src_in
= isl_basic_map_n_in(src_map
);
1394 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1395 unsigned src_out
= isl_basic_map_n_out(src_map
);
1396 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1397 isl_int_set(dst
[0], src
[0]);
1398 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1399 if (dst_nparam
> src_nparam
)
1400 isl_seq_clr(dst
+1+src_nparam
,
1401 dst_nparam
- src_nparam
);
1402 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1403 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1405 isl_min(dst_in
-in_off
, src_in
));
1406 if (dst_in
-in_off
> src_in
)
1407 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1408 dst_in
- in_off
- src_in
);
1409 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1410 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1411 src
+1+src_nparam
+src_in
,
1412 isl_min(dst_out
-out_off
, src_out
));
1413 if (dst_out
-out_off
> src_out
)
1414 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1415 dst_out
- out_off
- src_out
);
1416 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1417 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1418 src
+1+src_nparam
+src_in
+src_out
,
1419 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1420 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1421 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1422 div_off
+src_map
->n_div
,
1423 dst_map
->n_div
- div_off
- src_map
->n_div
);
1426 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1427 struct isl_basic_map
*src_map
, isl_int
*src
,
1428 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1430 isl_int_set(dst
[0], src
[0]);
1431 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1434 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1435 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1440 if (!bmap1
|| !bmap2
)
1443 div_off
= bmap1
->n_div
;
1445 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1446 int i1
= isl_basic_map_alloc_equality(bmap1
);
1449 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1450 i_pos
, o_pos
, div_off
);
1453 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1454 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1457 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1458 i_pos
, o_pos
, div_off
);
1461 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1462 int i1
= isl_basic_map_alloc_div(bmap1
);
1465 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1466 i_pos
, o_pos
, div_off
);
1469 isl_basic_map_free(bmap2
);
1474 isl_basic_map_free(bmap1
);
1475 isl_basic_map_free(bmap2
);
1479 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1480 struct isl_basic_set
*bset2
, unsigned pos
)
1482 return (struct isl_basic_set
*)
1483 add_constraints((struct isl_basic_map
*)bset1
,
1484 (struct isl_basic_map
*)bset2
, 0, pos
);
1487 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1488 __isl_take isl_space
*dim
, unsigned extra
,
1489 unsigned n_eq
, unsigned n_ineq
)
1491 struct isl_basic_map
*ext
;
1501 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1502 base
->extra
>= base
->n_div
+ extra
;
1504 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1505 room_for_ineq(base
, n_ineq
)) {
1506 isl_space_free(dim
);
1510 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1511 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1512 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1513 extra
+= base
->extra
;
1515 n_ineq
+= base
->n_ineq
;
1517 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1523 ext
->sample
= isl_vec_copy(base
->sample
);
1524 flags
= base
->flags
;
1525 ext
= add_constraints(ext
, base
, 0, 0);
1528 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1534 isl_space_free(dim
);
1535 isl_basic_map_free(base
);
1539 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1540 __isl_take isl_space
*dim
, unsigned extra
,
1541 unsigned n_eq
, unsigned n_ineq
)
1543 return (struct isl_basic_set
*)
1544 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1545 extra
, n_eq
, n_ineq
);
1548 struct isl_basic_map
*isl_basic_map_extend_constraints(
1549 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1553 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1557 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1558 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1559 unsigned n_eq
, unsigned n_ineq
)
1561 struct isl_basic_map
*bmap
;
1566 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1570 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1573 isl_basic_map_free(base
);
1577 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1578 unsigned nparam
, unsigned dim
, unsigned extra
,
1579 unsigned n_eq
, unsigned n_ineq
)
1581 return (struct isl_basic_set
*)
1582 isl_basic_map_extend((struct isl_basic_map
*)base
,
1583 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1586 struct isl_basic_set
*isl_basic_set_extend_constraints(
1587 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1589 return (struct isl_basic_set
*)
1590 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1594 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1596 return (struct isl_basic_set
*)
1597 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1600 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1605 if (bmap
->ref
> 1) {
1607 bmap
= isl_basic_map_dup(bmap
);
1610 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1614 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1622 return isl_set_dup(set
);
1625 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1633 return isl_map_dup(map
);
1636 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1637 unsigned a_len
, unsigned b_len
)
1639 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1640 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1641 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1644 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1645 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1653 isl_assert(bmap
->ctx
,
1654 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1656 if (n1
== 0 || n2
== 0)
1659 bmap
= isl_basic_map_cow(bmap
);
1663 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1664 if (isl_blk_is_error(blk
))
1667 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1669 bmap
->eq
[i
] + pos
, n1
, n2
);
1671 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1673 bmap
->ineq
[i
] + pos
, n1
, n2
);
1675 for (i
= 0; i
< bmap
->n_div
; ++i
)
1677 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1679 isl_blk_free(bmap
->ctx
, blk
);
1681 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1682 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1683 return isl_basic_map_finalize(bmap
);
1685 isl_basic_map_free(bmap
);
1689 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1690 __isl_take isl_basic_set
*bset
, unsigned n
)
1698 nparam
= isl_basic_set_n_param(bset
);
1699 dim
= isl_basic_set_n_dim(bset
);
1700 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1702 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1704 isl_basic_set_free(bset
);
1708 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1714 total
= isl_basic_map_total_dim(bmap
);
1715 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1716 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1718 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1720 i
= isl_basic_map_alloc_equality(bmap
);
1724 isl_int_set_si(bmap
->eq
[i
][0], 1);
1725 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1726 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1727 isl_vec_free(bmap
->sample
);
1728 bmap
->sample
= NULL
;
1729 return isl_basic_map_finalize(bmap
);
1731 isl_basic_map_free(bmap
);
1735 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1737 return (struct isl_basic_set
*)
1738 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1741 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1744 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1746 isl_int
*t
= bmap
->div
[a
];
1747 bmap
->div
[a
] = bmap
->div
[b
];
1751 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1752 * div definitions accordingly.
1754 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1757 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1759 swap_div(bmap
, a
, b
);
1761 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1762 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1764 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1765 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1767 for (i
= 0; i
< bmap
->n_div
; ++i
)
1768 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1769 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1772 /* Eliminate the specified n dimensions starting at first from the
1773 * constraints, without removing the dimensions from the space.
1774 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1776 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1777 enum isl_dim_type type
, unsigned first
, unsigned n
)
1786 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1787 isl_die(map
->ctx
, isl_error_invalid
,
1788 "index out of bounds", goto error
);
1790 map
= isl_map_cow(map
);
1794 for (i
= 0; i
< map
->n
; ++i
) {
1795 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1805 /* Eliminate the specified n dimensions starting at first from the
1806 * constraints, without removing the dimensions from the space.
1807 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1809 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1810 enum isl_dim_type type
, unsigned first
, unsigned n
)
1812 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1815 /* Eliminate the specified n dimensions starting at first from the
1816 * constraints, without removing the dimensions from the space.
1817 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1819 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1820 unsigned first
, unsigned n
)
1822 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1825 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1826 __isl_take isl_basic_map
*bmap
)
1830 bmap
= isl_basic_map_eliminate_vars(bmap
,
1831 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1835 return isl_basic_map_finalize(bmap
);
1838 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1839 __isl_take isl_basic_set
*bset
)
1841 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1842 (struct isl_basic_map
*)bset
);
1845 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1854 map
= isl_map_cow(map
);
1858 for (i
= 0; i
< map
->n
; ++i
) {
1859 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1869 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1871 return isl_map_remove_divs(set
);
1874 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1875 enum isl_dim_type type
, unsigned first
, unsigned n
)
1879 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1881 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1883 bmap
= isl_basic_map_eliminate_vars(bmap
,
1884 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1887 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1889 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1892 isl_basic_map_free(bmap
);
1896 /* Return true if the definition of the given div (recursively) involves
1897 * any of the given variables.
1899 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1900 unsigned first
, unsigned n
)
1903 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1905 if (isl_int_is_zero(bmap
->div
[div
][0]))
1907 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1910 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1911 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1913 if (div_involves_vars(bmap
, i
, first
, n
))
1920 /* Try and add a lower and/or upper bound on "div" to "bmap"
1921 * based on inequality "i".
1922 * "total" is the total number of variables (excluding the divs).
1923 * "v" is a temporary object that can be used during the calculations.
1924 * If "lb" is set, then a lower bound should be constructed.
1925 * If "ub" is set, then an upper bound should be constructed.
1927 * The calling function has already checked that the inequality does not
1928 * reference "div", but we still need to check that the inequality is
1929 * of the right form. We'll consider the case where we want to construct
1930 * a lower bound. The construction of upper bounds is similar.
1932 * Let "div" be of the form
1934 * q = floor((a + f(x))/d)
1936 * We essentially check if constraint "i" is of the form
1940 * so that we can use it to derive a lower bound on "div".
1941 * However, we allow a slightly more general form
1945 * with the condition that the coefficients of g(x) - f(x) are all
1947 * Rewriting this constraint as
1951 * adding a + f(x) to both sides and dividing by d, we obtain
1953 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1955 * Taking the floor on both sides, we obtain
1957 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1961 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1963 * In the case of an upper bound, we construct the constraint
1965 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1968 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1969 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1970 unsigned total
, isl_int v
, int lb
, int ub
)
1974 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1976 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1977 bmap
->div
[div
][1 + 1 + j
]);
1978 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1981 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1982 bmap
->div
[div
][1 + 1 + j
]);
1983 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1989 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1991 int k
= isl_basic_map_alloc_inequality(bmap
);
1994 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1995 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1996 bmap
->div
[div
][1 + j
]);
1997 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1998 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2000 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2003 int k
= isl_basic_map_alloc_inequality(bmap
);
2006 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2007 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2008 bmap
->div
[div
][1 + j
]);
2009 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2010 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2012 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2017 isl_basic_map_free(bmap
);
2021 /* This function is called right before "div" is eliminated from "bmap"
2022 * using Fourier-Motzkin.
2023 * Look through the constraints of "bmap" for constraints on the argument
2024 * of the integer division and use them to construct constraints on the
2025 * integer division itself. These constraints can then be combined
2026 * during the Fourier-Motzkin elimination.
2027 * Note that it is only useful to introduce lower bounds on "div"
2028 * if "bmap" already contains upper bounds on "div" as the newly
2029 * introduce lower bounds can then be combined with the pre-existing
2030 * upper bounds. Similarly for upper bounds.
2031 * We therefore first check if "bmap" contains any lower and/or upper bounds
2034 * It is interesting to note that the introduction of these constraints
2035 * can indeed lead to more accurate results, even when compared to
2036 * deriving constraints on the argument of "div" from constraints on "div".
2037 * Consider, for example, the set
2039 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2041 * The second constraint can be rewritten as
2043 * 2 * [(-i-2j+3)/4] + k >= 0
2045 * from which we can derive
2047 * -i - 2j + 3 >= -2k
2053 * Combined with the first constraint, we obtain
2055 * -3 <= 3 + 2k or k >= -3
2057 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2058 * the first constraint, we obtain
2060 * [(i + 2j)/4] >= [-3/4] = -1
2062 * Combining this constraint with the second constraint, we obtain
2066 static __isl_give isl_basic_map
*insert_bounds_on_div(
2067 __isl_take isl_basic_map
*bmap
, int div
)
2070 int check_lb
, check_ub
;
2077 if (isl_int_is_zero(bmap
->div
[div
][0]))
2080 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2084 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2085 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2092 if (!check_lb
&& !check_ub
)
2097 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2098 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2101 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2102 check_lb
, check_ub
);
2110 /* Remove all divs (recursively) involving any of the given dimensions
2111 * in their definitions.
2113 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2114 __isl_take isl_basic_map
*bmap
,
2115 enum isl_dim_type type
, unsigned first
, unsigned n
)
2121 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2123 first
+= isl_basic_map_offset(bmap
, type
);
2125 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2126 if (!div_involves_vars(bmap
, i
, first
, n
))
2128 bmap
= insert_bounds_on_div(bmap
, i
);
2129 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2137 isl_basic_map_free(bmap
);
2141 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2142 __isl_take isl_basic_set
*bset
,
2143 enum isl_dim_type type
, unsigned first
, unsigned n
)
2145 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2148 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2149 enum isl_dim_type type
, unsigned first
, unsigned n
)
2158 map
= isl_map_cow(map
);
2162 for (i
= 0; i
< map
->n
; ++i
) {
2163 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2174 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2175 enum isl_dim_type type
, unsigned first
, unsigned n
)
2177 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2181 /* Does the desciption of "bmap" depend on the specified dimensions?
2182 * We also check whether the dimensions appear in any of the div definitions.
2183 * In principle there is no need for this check. If the dimensions appear
2184 * in a div definition, they also appear in the defining constraints of that
2187 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2188 enum isl_dim_type type
, unsigned first
, unsigned n
)
2195 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2196 isl_die(bmap
->ctx
, isl_error_invalid
,
2197 "index out of bounds", return -1);
2199 first
+= isl_basic_map_offset(bmap
, type
);
2200 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2201 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2203 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2204 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2206 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2207 if (isl_int_is_zero(bmap
->div
[i
][0]))
2209 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2216 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2217 enum isl_dim_type type
, unsigned first
, unsigned n
)
2224 if (first
+ n
> isl_map_dim(map
, type
))
2225 isl_die(map
->ctx
, isl_error_invalid
,
2226 "index out of bounds", return -1);
2228 for (i
= 0; i
< map
->n
; ++i
) {
2229 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2231 if (involves
< 0 || involves
)
2238 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2239 enum isl_dim_type type
, unsigned first
, unsigned n
)
2241 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2244 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2245 enum isl_dim_type type
, unsigned first
, unsigned n
)
2247 return isl_map_involves_dims(set
, type
, first
, n
);
2250 /* Return true if the definition of the given div is unknown or depends
2253 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2256 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2258 if (isl_int_is_zero(bmap
->div
[div
][0]))
2261 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2262 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2264 if (div_is_unknown(bmap
, i
))
2271 /* Remove all divs that are unknown or defined in terms of unknown divs.
2273 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2274 __isl_take isl_basic_map
*bmap
)
2281 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2282 if (!div_is_unknown(bmap
, i
))
2284 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2293 /* Remove all divs that are unknown or defined in terms of unknown divs.
2295 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2296 __isl_take isl_basic_set
*bset
)
2298 return isl_basic_map_remove_unknown_divs(bset
);
2301 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2310 map
= isl_map_cow(map
);
2314 for (i
= 0; i
< map
->n
; ++i
) {
2315 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2325 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2327 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2330 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2331 __isl_take isl_basic_set
*bset
,
2332 enum isl_dim_type type
, unsigned first
, unsigned n
)
2334 return (isl_basic_set
*)
2335 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2338 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2339 enum isl_dim_type type
, unsigned first
, unsigned n
)
2346 map
= isl_map_cow(map
);
2349 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2351 for (i
= 0; i
< map
->n
; ++i
) {
2352 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2353 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2357 map
= isl_map_drop(map
, type
, first
, n
);
2364 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2365 enum isl_dim_type type
, unsigned first
, unsigned n
)
2367 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2370 /* Project out n inputs starting at first using Fourier-Motzkin */
2371 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2372 unsigned first
, unsigned n
)
2374 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2377 static void dump_term(struct isl_basic_map
*bmap
,
2378 isl_int c
, int pos
, FILE *out
)
2381 unsigned in
= isl_basic_map_n_in(bmap
);
2382 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2383 unsigned nparam
= isl_basic_map_n_param(bmap
);
2385 isl_int_print(out
, c
, 0);
2387 if (!isl_int_is_one(c
))
2388 isl_int_print(out
, c
, 0);
2389 if (pos
< 1 + nparam
) {
2390 name
= isl_space_get_dim_name(bmap
->dim
,
2391 isl_dim_param
, pos
- 1);
2393 fprintf(out
, "%s", name
);
2395 fprintf(out
, "p%d", pos
- 1);
2396 } else if (pos
< 1 + nparam
+ in
)
2397 fprintf(out
, "i%d", pos
- 1 - nparam
);
2398 else if (pos
< 1 + nparam
+ dim
)
2399 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2401 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2405 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2406 int sign
, FILE *out
)
2410 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2414 for (i
= 0, first
= 1; i
< len
; ++i
) {
2415 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2418 fprintf(out
, " + ");
2420 isl_int_abs(v
, c
[i
]);
2421 dump_term(bmap
, v
, i
, out
);
2428 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2429 const char *op
, FILE *out
, int indent
)
2433 fprintf(out
, "%*s", indent
, "");
2435 dump_constraint_sign(bmap
, c
, 1, out
);
2436 fprintf(out
, " %s ", op
);
2437 dump_constraint_sign(bmap
, c
, -1, out
);
2441 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2442 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2444 fprintf(out
, "%*s", indent
, "");
2445 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2450 static void dump_constraints(struct isl_basic_map
*bmap
,
2451 isl_int
**c
, unsigned n
,
2452 const char *op
, FILE *out
, int indent
)
2456 for (i
= 0; i
< n
; ++i
)
2457 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2460 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2464 unsigned total
= isl_basic_map_total_dim(bmap
);
2466 for (j
= 0; j
< 1 + total
; ++j
) {
2467 if (isl_int_is_zero(exp
[j
]))
2469 if (!first
&& isl_int_is_pos(exp
[j
]))
2471 dump_term(bmap
, exp
[j
], j
, out
);
2476 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2480 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2481 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2483 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2484 fprintf(out
, "%*s", indent
, "");
2485 fprintf(out
, "e%d = [(", i
);
2486 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2488 isl_int_print(out
, bmap
->div
[i
][0], 0);
2489 fprintf(out
, "]\n");
2493 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2494 FILE *out
, int indent
)
2497 fprintf(out
, "null basic set\n");
2501 fprintf(out
, "%*s", indent
, "");
2502 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2503 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2504 bset
->extra
, bset
->flags
);
2505 dump((struct isl_basic_map
*)bset
, out
, indent
);
2508 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2509 FILE *out
, int indent
)
2512 fprintf(out
, "null basic map\n");
2516 fprintf(out
, "%*s", indent
, "");
2517 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2518 "flags: %x, n_name: %d\n",
2520 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2521 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2522 dump(bmap
, out
, indent
);
2525 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2530 total
= isl_basic_map_total_dim(bmap
);
2531 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2532 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2533 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2534 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2538 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2541 struct isl_set
*set
;
2545 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2546 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2547 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2548 sizeof(struct isl_set
) +
2549 (n
- 1) * sizeof(struct isl_basic_set
*));
2553 set
->ctx
= dim
->ctx
;
2554 isl_ctx_ref(set
->ctx
);
2562 isl_space_free(dim
);
2566 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2567 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2569 struct isl_set
*set
;
2572 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2576 set
= isl_set_alloc_space(dims
, n
, flags
);
2580 /* Make sure "map" has room for at least "n" more basic maps.
2582 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2585 struct isl_map
*grown
= NULL
;
2589 isl_assert(map
->ctx
, n
>= 0, goto error
);
2590 if (map
->n
+ n
<= map
->size
)
2592 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2595 for (i
= 0; i
< map
->n
; ++i
) {
2596 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2604 isl_map_free(grown
);
2609 /* Make sure "set" has room for at least "n" more basic sets.
2611 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2613 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2616 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2619 struct isl_set
*dup
;
2624 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2627 for (i
= 0; i
< set
->n
; ++i
)
2628 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2632 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2634 return isl_map_from_basic_map(bset
);
2637 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2639 struct isl_map
*map
;
2644 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2645 return isl_map_add_basic_map(map
, bmap
);
2648 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2649 __isl_take isl_basic_set
*bset
)
2651 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2652 (struct isl_basic_map
*)bset
);
2655 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
2665 isl_ctx_deref(set
->ctx
);
2666 for (i
= 0; i
< set
->n
; ++i
)
2667 isl_basic_set_free(set
->p
[i
]);
2668 isl_space_free(set
->dim
);
2674 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2679 fprintf(out
, "null set\n");
2683 fprintf(out
, "%*s", indent
, "");
2684 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2685 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2687 for (i
= 0; i
< set
->n
; ++i
) {
2688 fprintf(out
, "%*s", indent
, "");
2689 fprintf(out
, "basic set %d:\n", i
);
2690 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2694 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2699 fprintf(out
, "null map\n");
2703 fprintf(out
, "%*s", indent
, "");
2704 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2705 "flags: %x, n_name: %d\n",
2706 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2707 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2708 for (i
= 0; i
< map
->n
; ++i
) {
2709 fprintf(out
, "%*s", indent
, "");
2710 fprintf(out
, "basic map %d:\n", i
);
2711 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2715 struct isl_basic_map
*isl_basic_map_intersect_domain(
2716 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2718 struct isl_basic_map
*bmap_domain
;
2723 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2724 bset
->dim
, isl_dim_param
), goto error
);
2726 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2727 isl_assert(bset
->ctx
,
2728 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2730 bmap
= isl_basic_map_cow(bmap
);
2733 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2734 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2735 bmap_domain
= isl_basic_map_from_domain(bset
);
2736 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2738 bmap
= isl_basic_map_simplify(bmap
);
2739 return isl_basic_map_finalize(bmap
);
2741 isl_basic_map_free(bmap
);
2742 isl_basic_set_free(bset
);
2746 struct isl_basic_map
*isl_basic_map_intersect_range(
2747 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2749 struct isl_basic_map
*bmap_range
;
2754 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2755 bset
->dim
, isl_dim_param
), goto error
);
2757 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2758 isl_assert(bset
->ctx
,
2759 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2761 if (isl_basic_set_is_universe(bset
)) {
2762 isl_basic_set_free(bset
);
2766 bmap
= isl_basic_map_cow(bmap
);
2769 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2770 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2771 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2772 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2774 bmap
= isl_basic_map_simplify(bmap
);
2775 return isl_basic_map_finalize(bmap
);
2777 isl_basic_map_free(bmap
);
2778 isl_basic_set_free(bset
);
2782 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2791 total
= 1 + isl_basic_map_total_dim(bmap
);
2792 if (total
!= vec
->size
)
2797 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2798 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2799 if (!isl_int_is_zero(s
)) {
2805 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2806 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2807 if (isl_int_is_neg(s
)) {
2818 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2820 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2823 struct isl_basic_map
*isl_basic_map_intersect(
2824 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2826 struct isl_vec
*sample
= NULL
;
2828 if (!bmap1
|| !bmap2
)
2831 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2832 bmap2
->dim
, isl_dim_param
), goto error
);
2833 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2834 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2835 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2836 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2837 return isl_basic_map_intersect(bmap2
, bmap1
);
2839 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2840 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2841 isl_assert(bmap1
->ctx
,
2842 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2844 if (bmap1
->sample
&&
2845 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2846 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2847 sample
= isl_vec_copy(bmap1
->sample
);
2848 else if (bmap2
->sample
&&
2849 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2850 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2851 sample
= isl_vec_copy(bmap2
->sample
);
2853 bmap1
= isl_basic_map_cow(bmap1
);
2856 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2857 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2858 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2861 isl_vec_free(sample
);
2863 isl_vec_free(bmap1
->sample
);
2864 bmap1
->sample
= sample
;
2867 bmap1
= isl_basic_map_simplify(bmap1
);
2868 return isl_basic_map_finalize(bmap1
);
2871 isl_vec_free(sample
);
2872 isl_basic_map_free(bmap1
);
2873 isl_basic_map_free(bmap2
);
2877 struct isl_basic_set
*isl_basic_set_intersect(
2878 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2880 return (struct isl_basic_set
*)
2881 isl_basic_map_intersect(
2882 (struct isl_basic_map
*)bset1
,
2883 (struct isl_basic_map
*)bset2
);
2886 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2887 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2889 return isl_basic_set_intersect(bset1
, bset2
);
2892 /* Special case of isl_map_intersect, where both map1 and map2
2893 * are convex, without any divs and such that either map1 or map2
2894 * contains a single constraint. This constraint is then simply
2895 * added to the other map.
2897 static __isl_give isl_map
*map_intersect_add_constraint(
2898 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2900 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2901 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2902 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2903 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2905 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2906 return isl_map_intersect(map2
, map1
);
2908 isl_assert(map2
->ctx
,
2909 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2911 map1
= isl_map_cow(map1
);
2914 if (isl_map_plain_is_empty(map1
)) {
2918 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2919 if (map2
->p
[0]->n_eq
== 1)
2920 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2922 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2923 map2
->p
[0]->ineq
[0]);
2925 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2926 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2930 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2931 isl_basic_map_free(map1
->p
[0]);
2944 /* map2 may be either a parameter domain or a map living in the same
2947 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2948 __isl_take isl_map
*map2
)
2957 if ((isl_map_plain_is_empty(map1
) ||
2958 isl_map_plain_is_universe(map2
)) &&
2959 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2963 if ((isl_map_plain_is_empty(map2
) ||
2964 isl_map_plain_is_universe(map1
)) &&
2965 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2970 if (map1
->n
== 1 && map2
->n
== 1 &&
2971 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2972 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2973 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2974 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2975 return map_intersect_add_constraint(map1
, map2
);
2977 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2978 isl_space_dim(map2
->dim
, isl_dim_param
))
2979 isl_assert(map1
->ctx
,
2980 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2982 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2983 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2984 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2986 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2987 map1
->n
* map2
->n
, flags
);
2990 for (i
= 0; i
< map1
->n
; ++i
)
2991 for (j
= 0; j
< map2
->n
; ++j
) {
2992 struct isl_basic_map
*part
;
2993 part
= isl_basic_map_intersect(
2994 isl_basic_map_copy(map1
->p
[i
]),
2995 isl_basic_map_copy(map2
->p
[j
]));
2996 if (isl_basic_map_is_empty(part
) < 0)
2997 part
= isl_basic_map_free(part
);
2998 result
= isl_map_add_basic_map(result
, part
);
3011 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3012 __isl_take isl_map
*map2
)
3016 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3017 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3018 "spaces don't match", goto error
);
3019 return map_intersect_internal(map1
, map2
);
3026 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3027 __isl_take isl_map
*map2
)
3029 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3032 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3034 return (struct isl_set
*)
3035 isl_map_intersect((struct isl_map
*)set1
,
3036 (struct isl_map
*)set2
);
3039 /* map_intersect_internal accepts intersections
3040 * with parameter domains, so we can just call that function.
3042 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3043 __isl_take isl_set
*params
)
3045 return map_intersect_internal(map
, params
);
3048 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3049 __isl_take isl_map
*map2
)
3051 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3054 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3055 __isl_take isl_set
*params
)
3057 return isl_map_intersect_params(set
, params
);
3060 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3063 struct isl_basic_set
*bset
;
3068 bmap
= isl_basic_map_cow(bmap
);
3071 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3072 in
= isl_basic_map_n_in(bmap
);
3073 bset
= isl_basic_set_from_basic_map(bmap
);
3074 bset
= isl_basic_set_swap_vars(bset
, in
);
3075 return isl_basic_map_from_basic_set(bset
, dim
);
3078 static __isl_give isl_basic_map
*basic_map_space_reset(
3079 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3085 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3088 space
= isl_basic_map_get_space(bmap
);
3089 space
= isl_space_reset(space
, type
);
3090 bmap
= isl_basic_map_reset_space(bmap
, space
);
3094 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3095 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3096 unsigned pos
, unsigned n
)
3099 struct isl_basic_map
*res
;
3100 struct isl_dim_map
*dim_map
;
3101 unsigned total
, off
;
3102 enum isl_dim_type t
;
3105 return basic_map_space_reset(bmap
, type
);
3110 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3112 total
= isl_basic_map_total_dim(bmap
) + n
;
3113 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3115 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3117 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3119 unsigned size
= isl_basic_map_dim(bmap
, t
);
3120 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3122 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3123 pos
, size
- pos
, off
+ pos
+ n
);
3125 off
+= isl_space_dim(res_dim
, t
);
3127 isl_dim_map_div(dim_map
, bmap
, off
);
3129 res
= isl_basic_map_alloc_space(res_dim
,
3130 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3131 if (isl_basic_map_is_rational(bmap
))
3132 res
= isl_basic_map_set_rational(res
);
3133 if (isl_basic_map_plain_is_empty(bmap
)) {
3134 isl_basic_map_free(bmap
);
3136 return isl_basic_map_set_to_empty(res
);
3138 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3139 return isl_basic_map_finalize(res
);
3142 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3143 __isl_take isl_basic_set
*bset
,
3144 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3146 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3149 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3150 enum isl_dim_type type
, unsigned n
)
3154 return isl_basic_map_insert_dims(bmap
, type
,
3155 isl_basic_map_dim(bmap
, type
), n
);
3158 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3159 enum isl_dim_type type
, unsigned n
)
3163 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3164 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3166 isl_basic_set_free(bset
);
3170 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3171 enum isl_dim_type type
)
3175 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3178 space
= isl_map_get_space(map
);
3179 space
= isl_space_reset(space
, type
);
3180 map
= isl_map_reset_space(map
, space
);
3184 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3185 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3190 return map_space_reset(map
, type
);
3192 map
= isl_map_cow(map
);
3196 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3200 for (i
= 0; i
< map
->n
; ++i
) {
3201 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3212 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3213 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3215 return isl_map_insert_dims(set
, type
, pos
, n
);
3218 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3219 enum isl_dim_type type
, unsigned n
)
3223 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3226 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3227 enum isl_dim_type type
, unsigned n
)
3231 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3232 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3238 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3239 __isl_take isl_basic_map
*bmap
,
3240 enum isl_dim_type dst_type
, unsigned dst_pos
,
3241 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3243 struct isl_dim_map
*dim_map
;
3244 struct isl_basic_map
*res
;
3245 enum isl_dim_type t
;
3246 unsigned total
, off
;
3253 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3256 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3259 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3261 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3262 pos(bmap
->dim
, src_type
) + src_pos
+
3263 ((src_type
< dst_type
) ? n
: 0)) {
3264 bmap
= isl_basic_map_cow(bmap
);
3268 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3269 src_type
, src_pos
, n
);
3273 bmap
= isl_basic_map_finalize(bmap
);
3278 total
= isl_basic_map_total_dim(bmap
);
3279 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3282 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3283 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3284 if (t
== dst_type
) {
3285 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3288 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3291 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3292 dst_pos
, size
- dst_pos
, off
);
3293 off
+= size
- dst_pos
;
3294 } else if (t
== src_type
) {
3295 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3298 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3299 src_pos
+ n
, size
- src_pos
- n
, off
);
3300 off
+= size
- src_pos
- n
;
3302 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3306 isl_dim_map_div(dim_map
, bmap
, off
);
3308 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3309 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3310 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3314 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3315 src_type
, src_pos
, n
);
3319 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3320 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3321 bmap
= isl_basic_map_finalize(bmap
);
3325 isl_basic_map_free(bmap
);
3329 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3330 enum isl_dim_type dst_type
, unsigned dst_pos
,
3331 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3333 return (isl_basic_set
*)isl_basic_map_move_dims(
3334 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3337 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3338 enum isl_dim_type dst_type
, unsigned dst_pos
,
3339 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3343 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3344 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3345 src_type
, src_pos
, n
);
3351 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3352 enum isl_dim_type dst_type
, unsigned dst_pos
,
3353 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3362 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3365 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3368 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3370 map
= isl_map_cow(map
);
3374 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3378 for (i
= 0; i
< map
->n
; ++i
) {
3379 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3381 src_type
, src_pos
, n
);
3392 /* Move the specified dimensions to the last columns right before
3393 * the divs. Don't change the dimension specification of bmap.
3394 * That's the responsibility of the caller.
3396 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3397 enum isl_dim_type type
, unsigned first
, unsigned n
)
3399 struct isl_dim_map
*dim_map
;
3400 struct isl_basic_map
*res
;
3401 enum isl_dim_type t
;
3402 unsigned total
, off
;
3406 if (pos(bmap
->dim
, type
) + first
+ n
==
3407 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3410 total
= isl_basic_map_total_dim(bmap
);
3411 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3414 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3415 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3417 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3420 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3421 first
, n
, total
- bmap
->n_div
- n
);
3422 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3423 first
+ n
, size
- (first
+ n
), off
);
3424 off
+= size
- (first
+ n
);
3426 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3430 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3432 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3433 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3434 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3438 /* Insert "n" rows in the divs of "bmap".
3440 * The number of columns is not changed, which means that the last
3441 * dimensions of "bmap" are being reintepreted as the new divs.
3442 * The space of "bmap" is not adjusted, however, which means
3443 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3444 * from the space of "bmap" is the responsibility of the caller.
3446 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3454 bmap
= isl_basic_map_cow(bmap
);
3458 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3459 old
= bmap
->block2
.data
;
3460 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3461 (bmap
->extra
+ n
) * (1 + row_size
));
3462 if (!bmap
->block2
.data
)
3463 return isl_basic_map_free(bmap
);
3464 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3466 return isl_basic_map_free(bmap
);
3467 for (i
= 0; i
< n
; ++i
) {
3468 new_div
[i
] = bmap
->block2
.data
+
3469 (bmap
->extra
+ i
) * (1 + row_size
);
3470 isl_seq_clr(new_div
[i
], 1 + row_size
);
3472 for (i
= 0; i
< bmap
->extra
; ++i
)
3473 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3475 bmap
->div
= new_div
;
3482 /* Turn the n dimensions of type type, starting at first
3483 * into existentially quantified variables.
3485 __isl_give isl_basic_map
*isl_basic_map_project_out(
3486 __isl_take isl_basic_map
*bmap
,
3487 enum isl_dim_type type
, unsigned first
, unsigned n
)
3490 return basic_map_space_reset(bmap
, type
);
3495 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3496 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3498 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3501 bmap
= move_last(bmap
, type
, first
, n
);
3502 bmap
= isl_basic_map_cow(bmap
);
3503 bmap
= insert_div_rows(bmap
, n
);
3507 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3510 bmap
= isl_basic_map_simplify(bmap
);
3511 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3512 return isl_basic_map_finalize(bmap
);
3514 isl_basic_map_free(bmap
);
3518 /* Turn the n dimensions of type type, starting at first
3519 * into existentially quantified variables.
3521 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3522 enum isl_dim_type type
, unsigned first
, unsigned n
)
3524 return (isl_basic_set
*)isl_basic_map_project_out(
3525 (isl_basic_map
*)bset
, type
, first
, n
);
3528 /* Turn the n dimensions of type type, starting at first
3529 * into existentially quantified variables.
3531 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3532 enum isl_dim_type type
, unsigned first
, unsigned n
)
3540 return map_space_reset(map
, type
);
3542 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3544 map
= isl_map_cow(map
);
3548 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3552 for (i
= 0; i
< map
->n
; ++i
) {
3553 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3564 /* Turn the n dimensions of type type, starting at first
3565 * into existentially quantified variables.
3567 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3568 enum isl_dim_type type
, unsigned first
, unsigned n
)
3570 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3573 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3577 for (i
= 0; i
< n
; ++i
) {
3578 j
= isl_basic_map_alloc_div(bmap
);
3581 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3585 isl_basic_map_free(bmap
);
3589 struct isl_basic_map
*isl_basic_map_apply_range(
3590 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3592 isl_space
*dim_result
= NULL
;
3593 struct isl_basic_map
*bmap
;
3594 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3595 struct isl_dim_map
*dim_map1
, *dim_map2
;
3597 if (!bmap1
|| !bmap2
)
3599 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3600 bmap2
->dim
, isl_dim_param
))
3601 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3602 "parameters don't match", goto error
);
3603 if (!isl_space_tuple_match(bmap1
->dim
, isl_dim_out
,
3604 bmap2
->dim
, isl_dim_in
))
3605 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3606 "spaces don't match", goto error
);
3608 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3609 isl_space_copy(bmap2
->dim
));
3611 n_in
= isl_basic_map_n_in(bmap1
);
3612 n_out
= isl_basic_map_n_out(bmap2
);
3613 n
= isl_basic_map_n_out(bmap1
);
3614 nparam
= isl_basic_map_n_param(bmap1
);
3616 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3617 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3618 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3619 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3620 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3621 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3622 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3623 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3624 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3625 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3626 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3628 bmap
= isl_basic_map_alloc_space(dim_result
,
3629 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3630 bmap1
->n_eq
+ bmap2
->n_eq
,
3631 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3632 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3633 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3634 bmap
= add_divs(bmap
, n
);
3635 bmap
= isl_basic_map_simplify(bmap
);
3636 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3637 return isl_basic_map_finalize(bmap
);
3639 isl_basic_map_free(bmap1
);
3640 isl_basic_map_free(bmap2
);
3644 struct isl_basic_set
*isl_basic_set_apply(
3645 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3650 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3653 return (struct isl_basic_set
*)
3654 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3656 isl_basic_set_free(bset
);
3657 isl_basic_map_free(bmap
);
3661 struct isl_basic_map
*isl_basic_map_apply_domain(
3662 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3664 if (!bmap1
|| !bmap2
)
3667 isl_assert(bmap1
->ctx
,
3668 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3669 isl_assert(bmap1
->ctx
,
3670 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3673 bmap1
= isl_basic_map_reverse(bmap1
);
3674 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3675 return isl_basic_map_reverse(bmap1
);
3677 isl_basic_map_free(bmap1
);
3678 isl_basic_map_free(bmap2
);
3682 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3683 * A \cap B -> f(A) + f(B)
3685 struct isl_basic_map
*isl_basic_map_sum(
3686 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3688 unsigned n_in
, n_out
, nparam
, total
, pos
;
3689 struct isl_basic_map
*bmap
= NULL
;
3690 struct isl_dim_map
*dim_map1
, *dim_map2
;
3693 if (!bmap1
|| !bmap2
)
3696 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3699 nparam
= isl_basic_map_n_param(bmap1
);
3700 n_in
= isl_basic_map_n_in(bmap1
);
3701 n_out
= isl_basic_map_n_out(bmap1
);
3703 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3704 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3705 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3706 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3707 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3708 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3709 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3710 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3711 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3712 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3713 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3715 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3716 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3717 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3718 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3719 for (i
= 0; i
< n_out
; ++i
) {
3720 int j
= isl_basic_map_alloc_equality(bmap
);
3723 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3724 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3725 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3726 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3728 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3729 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3730 bmap
= add_divs(bmap
, 2 * n_out
);
3732 bmap
= isl_basic_map_simplify(bmap
);
3733 return isl_basic_map_finalize(bmap
);
3735 isl_basic_map_free(bmap
);
3736 isl_basic_map_free(bmap1
);
3737 isl_basic_map_free(bmap2
);
3741 /* Given two maps A -> f(A) and B -> g(B), construct a map
3742 * A \cap B -> f(A) + f(B)
3744 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3746 struct isl_map
*result
;
3752 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3754 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3755 map1
->n
* map2
->n
, 0);
3758 for (i
= 0; i
< map1
->n
; ++i
)
3759 for (j
= 0; j
< map2
->n
; ++j
) {
3760 struct isl_basic_map
*part
;
3761 part
= isl_basic_map_sum(
3762 isl_basic_map_copy(map1
->p
[i
]),
3763 isl_basic_map_copy(map2
->p
[j
]));
3764 if (isl_basic_map_is_empty(part
))
3765 isl_basic_map_free(part
);
3767 result
= isl_map_add_basic_map(result
, part
);
3780 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3781 __isl_take isl_set
*set2
)
3783 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3786 /* Given a basic map A -> f(A), construct A -> -f(A).
3788 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3793 bmap
= isl_basic_map_cow(bmap
);
3797 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3798 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3799 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3800 for (j
= 0; j
< n
; ++j
)
3801 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3802 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3803 for (j
= 0; j
< n
; ++j
)
3804 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3805 for (i
= 0; i
< bmap
->n_div
; ++i
)
3806 for (j
= 0; j
< n
; ++j
)
3807 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3808 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3809 return isl_basic_map_finalize(bmap
);
3812 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3814 return isl_basic_map_neg(bset
);
3817 /* Given a map A -> f(A), construct A -> -f(A).
3819 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3823 map
= isl_map_cow(map
);
3827 for (i
= 0; i
< map
->n
; ++i
) {
3828 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3839 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3841 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3844 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3845 * A -> floor(f(A)/d).
3847 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3850 unsigned n_in
, n_out
, nparam
, total
, pos
;
3851 struct isl_basic_map
*result
= NULL
;
3852 struct isl_dim_map
*dim_map
;
3858 nparam
= isl_basic_map_n_param(bmap
);
3859 n_in
= isl_basic_map_n_in(bmap
);
3860 n_out
= isl_basic_map_n_out(bmap
);
3862 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3863 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3864 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3865 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3866 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3867 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3869 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3870 bmap
->n_div
+ n_out
,
3871 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3872 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3873 result
= add_divs(result
, n_out
);
3874 for (i
= 0; i
< n_out
; ++i
) {
3876 j
= isl_basic_map_alloc_inequality(result
);
3879 isl_seq_clr(result
->ineq
[j
], 1+total
);
3880 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3881 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3882 j
= isl_basic_map_alloc_inequality(result
);
3885 isl_seq_clr(result
->ineq
[j
], 1+total
);
3886 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3887 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3888 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3891 result
= isl_basic_map_simplify(result
);
3892 return isl_basic_map_finalize(result
);
3894 isl_basic_map_free(result
);
3898 /* Given a map A -> f(A) and an integer d, construct a map
3899 * A -> floor(f(A)/d).
3901 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3905 map
= isl_map_cow(map
);
3909 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3910 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3911 for (i
= 0; i
< map
->n
; ++i
) {
3912 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3923 /* Given a map A -> f(A) and an integer d, construct a map
3924 * A -> floor(f(A)/d).
3926 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
3927 __isl_take isl_val
*d
)
3931 if (!isl_val_is_int(d
))
3932 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
3933 "expecting integer denominator", goto error
);
3934 map
= isl_map_floordiv(map
, d
->n
);
3943 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3949 i
= isl_basic_map_alloc_equality(bmap
);
3952 nparam
= isl_basic_map_n_param(bmap
);
3953 n_in
= isl_basic_map_n_in(bmap
);
3954 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3955 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3956 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3957 return isl_basic_map_finalize(bmap
);
3959 isl_basic_map_free(bmap
);
3963 /* Add a constraints to "bmap" expressing i_pos < o_pos
3965 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3971 i
= isl_basic_map_alloc_inequality(bmap
);
3974 nparam
= isl_basic_map_n_param(bmap
);
3975 n_in
= isl_basic_map_n_in(bmap
);
3976 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3977 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3978 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3979 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3980 return isl_basic_map_finalize(bmap
);
3982 isl_basic_map_free(bmap
);
3986 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3988 static __isl_give isl_basic_map
*var_less_or_equal(
3989 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3995 i
= isl_basic_map_alloc_inequality(bmap
);
3998 nparam
= isl_basic_map_n_param(bmap
);
3999 n_in
= isl_basic_map_n_in(bmap
);
4000 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4001 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4002 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4003 return isl_basic_map_finalize(bmap
);
4005 isl_basic_map_free(bmap
);
4009 /* Add a constraints to "bmap" expressing i_pos > o_pos
4011 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
4017 i
= isl_basic_map_alloc_inequality(bmap
);
4020 nparam
= isl_basic_map_n_param(bmap
);
4021 n_in
= isl_basic_map_n_in(bmap
);
4022 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4023 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4024 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4025 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4026 return isl_basic_map_finalize(bmap
);
4028 isl_basic_map_free(bmap
);
4032 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4034 static __isl_give isl_basic_map
*var_more_or_equal(
4035 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4041 i
= isl_basic_map_alloc_inequality(bmap
);
4044 nparam
= isl_basic_map_n_param(bmap
);
4045 n_in
= isl_basic_map_n_in(bmap
);
4046 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4047 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4048 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4049 return isl_basic_map_finalize(bmap
);
4051 isl_basic_map_free(bmap
);
4055 __isl_give isl_basic_map
*isl_basic_map_equal(
4056 __isl_take isl_space
*dim
, unsigned n_equal
)
4059 struct isl_basic_map
*bmap
;
4060 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4063 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4064 bmap
= var_equal(bmap
, i
);
4065 return isl_basic_map_finalize(bmap
);
4068 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4070 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4074 struct isl_basic_map
*bmap
;
4075 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4078 for (i
= 0; i
< pos
&& bmap
; ++i
)
4079 bmap
= var_equal(bmap
, i
);
4081 bmap
= var_less(bmap
, pos
);
4082 return isl_basic_map_finalize(bmap
);
4085 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4087 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4088 __isl_take isl_space
*dim
, unsigned pos
)
4091 isl_basic_map
*bmap
;
4093 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4094 for (i
= 0; i
< pos
; ++i
)
4095 bmap
= var_equal(bmap
, i
);
4096 bmap
= var_less_or_equal(bmap
, pos
);
4097 return isl_basic_map_finalize(bmap
);
4100 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4102 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4106 struct isl_basic_map
*bmap
;
4107 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4110 for (i
= 0; i
< pos
&& bmap
; ++i
)
4111 bmap
= var_equal(bmap
, i
);
4113 bmap
= var_more(bmap
, pos
);
4114 return isl_basic_map_finalize(bmap
);
4117 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4119 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4120 __isl_take isl_space
*dim
, unsigned pos
)
4123 isl_basic_map
*bmap
;
4125 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4126 for (i
= 0; i
< pos
; ++i
)
4127 bmap
= var_equal(bmap
, i
);
4128 bmap
= var_more_or_equal(bmap
, pos
);
4129 return isl_basic_map_finalize(bmap
);
4132 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4133 unsigned n
, int equal
)
4135 struct isl_map
*map
;
4138 if (n
== 0 && equal
)
4139 return isl_map_universe(dims
);
4141 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4143 for (i
= 0; i
+ 1 < n
; ++i
)
4144 map
= isl_map_add_basic_map(map
,
4145 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4148 map
= isl_map_add_basic_map(map
,
4149 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4151 map
= isl_map_add_basic_map(map
,
4152 isl_basic_map_less_at(dims
, n
- 1));
4154 isl_space_free(dims
);
4159 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4163 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4166 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4168 return map_lex_lte_first(dim
, n
, 0);
4171 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4173 return map_lex_lte_first(dim
, n
, 1);
4176 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4178 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4181 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4183 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4186 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4187 unsigned n
, int equal
)
4189 struct isl_map
*map
;
4192 if (n
== 0 && equal
)
4193 return isl_map_universe(dims
);
4195 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4197 for (i
= 0; i
+ 1 < n
; ++i
)
4198 map
= isl_map_add_basic_map(map
,
4199 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4202 map
= isl_map_add_basic_map(map
,
4203 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4205 map
= isl_map_add_basic_map(map
,
4206 isl_basic_map_more_at(dims
, n
- 1));
4208 isl_space_free(dims
);
4213 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4217 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4220 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4222 return map_lex_gte_first(dim
, n
, 0);
4225 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4227 return map_lex_gte_first(dim
, n
, 1);
4230 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4232 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4235 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4237 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4240 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4241 __isl_take isl_set
*set2
)
4244 map
= isl_map_lex_le(isl_set_get_space(set1
));
4245 map
= isl_map_intersect_domain(map
, set1
);
4246 map
= isl_map_intersect_range(map
, set2
);
4250 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4251 __isl_take isl_set
*set2
)
4254 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4255 map
= isl_map_intersect_domain(map
, set1
);
4256 map
= isl_map_intersect_range(map
, set2
);
4260 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4261 __isl_take isl_set
*set2
)
4264 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4265 map
= isl_map_intersect_domain(map
, set1
);
4266 map
= isl_map_intersect_range(map
, set2
);
4270 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4271 __isl_take isl_set
*set2
)
4274 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4275 map
= isl_map_intersect_domain(map
, set1
);
4276 map
= isl_map_intersect_range(map
, set2
);
4280 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4281 __isl_take isl_map
*map2
)
4284 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4285 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4286 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4290 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4291 __isl_take isl_map
*map2
)
4294 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4295 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4296 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4300 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4301 __isl_take isl_map
*map2
)
4304 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4305 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4306 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4310 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4311 __isl_take isl_map
*map2
)
4314 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4315 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4316 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4320 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4321 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4323 struct isl_basic_map
*bmap
;
4325 bset
= isl_basic_set_cow(bset
);
4329 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4330 isl_space_free(bset
->dim
);
4331 bmap
= (struct isl_basic_map
*) bset
;
4333 return isl_basic_map_finalize(bmap
);
4335 isl_basic_set_free(bset
);
4336 isl_space_free(dim
);
4340 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4344 if (bmap
->dim
->n_in
== 0)
4345 return (struct isl_basic_set
*)bmap
;
4346 bmap
= isl_basic_map_cow(bmap
);
4349 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4352 bmap
= isl_basic_map_finalize(bmap
);
4353 return (struct isl_basic_set
*)bmap
;
4355 isl_basic_map_free(bmap
);
4359 /* For a div d = floor(f/m), add the constraint
4363 static int add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
4364 unsigned pos
, isl_int
*div
)
4367 unsigned total
= isl_basic_map_total_dim(bmap
);
4369 i
= isl_basic_map_alloc_inequality(bmap
);
4372 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4373 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4378 /* For a div d = floor(f/m), add the constraint
4380 * -(f-(n-1)) + m d >= 0
4382 static int add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
4383 unsigned pos
, isl_int
*div
)
4386 unsigned total
= isl_basic_map_total_dim(bmap
);
4388 i
= isl_basic_map_alloc_inequality(bmap
);
4391 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4392 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
4393 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
4394 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
4399 /* For a div d = floor(f/m), add the constraints
4402 * -(f-(n-1)) + m d >= 0
4404 * Note that the second constraint is the negation of
4408 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4409 unsigned pos
, isl_int
*div
)
4411 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
4413 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
4418 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4419 unsigned pos
, isl_int
*div
)
4421 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4425 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4427 unsigned total
= isl_basic_map_total_dim(bmap
);
4428 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4430 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4434 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4436 * In particular, if this div is of the form d = floor(f/m),
4437 * then add the constraint
4441 * if sign < 0 or the constraint
4443 * -(f-(n-1)) + m d >= 0
4447 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
4448 unsigned div
, int sign
)
4456 total
= isl_basic_map_total_dim(bmap
);
4457 div_pos
= total
- bmap
->n_div
+ div
;
4460 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4462 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4465 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4467 return isl_basic_map_add_div_constraints(bset
, div
);
4470 struct isl_basic_set
*isl_basic_map_underlying_set(
4471 struct isl_basic_map
*bmap
)
4475 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4477 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4478 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4479 return (struct isl_basic_set
*)bmap
;
4480 bmap
= isl_basic_map_cow(bmap
);
4483 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4486 bmap
->extra
-= bmap
->n_div
;
4488 bmap
= isl_basic_map_finalize(bmap
);
4489 return (struct isl_basic_set
*)bmap
;
4491 isl_basic_map_free(bmap
);
4495 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4496 __isl_take isl_basic_set
*bset
)
4498 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4501 struct isl_basic_map
*isl_basic_map_overlying_set(
4502 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4504 struct isl_basic_map
*bmap
;
4505 struct isl_ctx
*ctx
;
4512 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4513 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4514 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4516 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4517 isl_basic_map_free(like
);
4518 return (struct isl_basic_map
*)bset
;
4520 bset
= isl_basic_set_cow(bset
);
4523 total
= bset
->dim
->n_out
+ bset
->extra
;
4524 bmap
= (struct isl_basic_map
*)bset
;
4525 isl_space_free(bmap
->dim
);
4526 bmap
->dim
= isl_space_copy(like
->dim
);
4529 bmap
->n_div
= like
->n_div
;
4530 bmap
->extra
+= like
->n_div
;
4534 ltotal
= total
- bmap
->extra
+ like
->extra
;
4537 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4538 bmap
->extra
* (1 + 1 + total
));
4539 if (isl_blk_is_error(bmap
->block2
))
4541 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4545 for (i
= 0; i
< bmap
->extra
; ++i
)
4546 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4547 for (i
= 0; i
< like
->n_div
; ++i
) {
4548 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4549 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4551 bmap
= isl_basic_map_extend_constraints(bmap
,
4552 0, 2 * like
->n_div
);
4553 for (i
= 0; i
< like
->n_div
; ++i
) {
4556 if (isl_int_is_zero(bmap
->div
[i
][0]))
4558 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4559 bmap
= isl_basic_map_free(bmap
);
4562 isl_basic_map_free(like
);
4563 bmap
= isl_basic_map_simplify(bmap
);
4564 bmap
= isl_basic_map_finalize(bmap
);
4567 isl_basic_map_free(like
);
4568 isl_basic_set_free(bset
);
4572 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4573 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4575 return (struct isl_basic_set
*)
4576 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4579 struct isl_set
*isl_set_from_underlying_set(
4580 struct isl_set
*set
, struct isl_basic_set
*like
)
4586 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4588 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4589 isl_basic_set_free(like
);
4592 set
= isl_set_cow(set
);
4595 for (i
= 0; i
< set
->n
; ++i
) {
4596 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4597 isl_basic_set_copy(like
));
4601 isl_space_free(set
->dim
);
4602 set
->dim
= isl_space_copy(like
->dim
);
4605 isl_basic_set_free(like
);
4608 isl_basic_set_free(like
);
4613 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4617 map
= isl_map_cow(map
);
4620 map
->dim
= isl_space_cow(map
->dim
);
4624 for (i
= 1; i
< map
->n
; ++i
)
4625 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4627 for (i
= 0; i
< map
->n
; ++i
) {
4628 map
->p
[i
] = (struct isl_basic_map
*)
4629 isl_basic_map_underlying_set(map
->p
[i
]);
4634 map
->dim
= isl_space_underlying(map
->dim
, 0);
4636 isl_space_free(map
->dim
);
4637 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4641 return (struct isl_set
*)map
;
4647 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4649 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4652 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4653 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4655 bmap
= isl_basic_map_cow(bmap
);
4659 isl_space_free(bmap
->dim
);
4662 bmap
= isl_basic_map_finalize(bmap
);
4666 isl_basic_map_free(bmap
);
4667 isl_space_free(dim
);
4671 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4672 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4674 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4678 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4679 __isl_take isl_space
*dim
)
4683 map
= isl_map_cow(map
);
4687 for (i
= 0; i
< map
->n
; ++i
) {
4688 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4689 isl_space_copy(dim
));
4693 isl_space_free(map
->dim
);
4699 isl_space_free(dim
);
4703 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4704 __isl_take isl_space
*dim
)
4706 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4709 /* Compute the parameter domain of the given basic set.
4711 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4716 if (isl_basic_set_is_params(bset
))
4719 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4720 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4721 space
= isl_basic_set_get_space(bset
);
4722 space
= isl_space_params(space
);
4723 bset
= isl_basic_set_reset_space(bset
, space
);
4727 /* Construct a zero-dimensional basic set with the given parameter domain.
4729 __isl_give isl_basic_set
*isl_basic_set_from_params(
4730 __isl_take isl_basic_set
*bset
)
4733 space
= isl_basic_set_get_space(bset
);
4734 space
= isl_space_set_from_params(space
);
4735 bset
= isl_basic_set_reset_space(bset
, space
);
4739 /* Compute the parameter domain of the given set.
4741 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4746 if (isl_set_is_params(set
))
4749 n
= isl_set_dim(set
, isl_dim_set
);
4750 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4751 space
= isl_set_get_space(set
);
4752 space
= isl_space_params(space
);
4753 set
= isl_set_reset_space(set
, space
);
4757 /* Construct a zero-dimensional set with the given parameter domain.
4759 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4762 space
= isl_set_get_space(set
);
4763 space
= isl_space_set_from_params(space
);
4764 set
= isl_set_reset_space(set
, space
);
4768 /* Compute the parameter domain of the given map.
4770 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4775 n
= isl_map_dim(map
, isl_dim_in
);
4776 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4777 n
= isl_map_dim(map
, isl_dim_out
);
4778 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4779 space
= isl_map_get_space(map
);
4780 space
= isl_space_params(space
);
4781 map
= isl_map_reset_space(map
, space
);
4785 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4788 struct isl_basic_set
*domain
;
4794 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4796 n_in
= isl_basic_map_n_in(bmap
);
4797 n_out
= isl_basic_map_n_out(bmap
);
4798 domain
= isl_basic_set_from_basic_map(bmap
);
4799 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4801 domain
= isl_basic_set_reset_space(domain
, dim
);
4806 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4810 return isl_space_may_be_set(bmap
->dim
);
4813 /* Is this basic map actually a set?
4814 * Users should never call this function. Outside of isl,
4815 * the type should indicate whether something is a set or a map.
4817 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4821 return isl_space_is_set(bmap
->dim
);
4824 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4828 if (isl_basic_map_is_set(bmap
))
4830 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4833 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4834 __isl_take isl_basic_map
*bmap
)
4838 isl_basic_map
*domain
;
4839 int nparam
, n_in
, n_out
;
4842 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4843 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4844 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4846 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4847 domain
= isl_basic_map_universe(dim
);
4849 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4850 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4851 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4853 total
= isl_basic_map_total_dim(bmap
);
4855 for (i
= 0; i
< n_in
; ++i
) {
4856 k
= isl_basic_map_alloc_equality(bmap
);
4859 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4860 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4861 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4864 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4865 return isl_basic_map_finalize(bmap
);
4867 isl_basic_map_free(bmap
);
4871 __isl_give isl_basic_map
*isl_basic_map_range_map(
4872 __isl_take isl_basic_map
*bmap
)
4876 isl_basic_map
*range
;
4877 int nparam
, n_in
, n_out
;
4880 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4881 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4882 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4884 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4885 range
= isl_basic_map_universe(dim
);
4887 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4888 bmap
= isl_basic_map_apply_range(bmap
, range
);
4889 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4891 total
= isl_basic_map_total_dim(bmap
);
4893 for (i
= 0; i
< n_out
; ++i
) {
4894 k
= isl_basic_map_alloc_equality(bmap
);
4897 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4898 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4899 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4902 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4903 return isl_basic_map_finalize(bmap
);
4905 isl_basic_map_free(bmap
);
4909 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4913 return isl_space_may_be_set(map
->dim
);
4916 /* Is this map actually a set?
4917 * Users should never call this function. Outside of isl,
4918 * the type should indicate whether something is a set or a map.
4920 int isl_map_is_set(__isl_keep isl_map
*map
)
4924 return isl_space_is_set(map
->dim
);
4927 struct isl_set
*isl_map_range(struct isl_map
*map
)
4930 struct isl_set
*set
;
4934 if (isl_map_is_set(map
))
4935 return (isl_set
*)map
;
4937 map
= isl_map_cow(map
);
4941 set
= (struct isl_set
*) map
;
4942 set
->dim
= isl_space_range(set
->dim
);
4945 for (i
= 0; i
< map
->n
; ++i
) {
4946 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4950 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4951 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4958 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4962 map
= isl_map_cow(map
);
4966 map
->dim
= isl_space_domain_map(map
->dim
);
4969 for (i
= 0; i
< map
->n
; ++i
) {
4970 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4974 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4975 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4982 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4985 isl_space
*range_dim
;
4987 map
= isl_map_cow(map
);
4991 range_dim
= isl_space_range(isl_map_get_space(map
));
4992 range_dim
= isl_space_from_range(range_dim
);
4993 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4994 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4997 for (i
= 0; i
< map
->n
; ++i
) {
4998 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5002 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5003 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5010 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
5011 __isl_take isl_space
*dim
)
5014 struct isl_map
*map
= NULL
;
5016 set
= isl_set_cow(set
);
5019 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
5020 map
= (struct isl_map
*)set
;
5021 for (i
= 0; i
< set
->n
; ++i
) {
5022 map
->p
[i
] = isl_basic_map_from_basic_set(
5023 set
->p
[i
], isl_space_copy(dim
));
5027 isl_space_free(map
->dim
);
5031 isl_space_free(dim
);
5036 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5037 __isl_take isl_basic_set
*bset
)
5039 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5042 __isl_give isl_basic_map
*isl_basic_map_from_range(
5043 __isl_take isl_basic_set
*bset
)
5046 space
= isl_basic_set_get_space(bset
);
5047 space
= isl_space_from_range(space
);
5048 bset
= isl_basic_set_reset_space(bset
, space
);
5049 return (isl_basic_map
*)bset
;
5052 /* Create a relation with the given set as range.
5053 * The domain of the created relation is a zero-dimensional
5054 * flat anonymous space.
5056 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5059 space
= isl_set_get_space(set
);
5060 space
= isl_space_from_range(space
);
5061 set
= isl_set_reset_space(set
, space
);
5062 return (struct isl_map
*)set
;
5065 /* Create a relation with the given set as domain.
5066 * The range of the created relation is a zero-dimensional
5067 * flat anonymous space.
5069 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5071 return isl_map_reverse(isl_map_from_range(set
));
5074 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5075 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5077 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5080 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5081 __isl_take isl_set
*range
)
5083 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5086 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
5089 struct isl_set
*set
= NULL
;
5093 map
= isl_map_cow(map
);
5096 map
->dim
= isl_space_as_set_space(map
->dim
);
5099 set
= (struct isl_set
*)map
;
5100 for (i
= 0; i
< map
->n
; ++i
) {
5101 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
5111 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
5114 struct isl_map
*map
;
5119 isl_die(dim
->ctx
, isl_error_internal
,
5120 "negative number of basic maps", goto error
);
5121 map
= isl_alloc(dim
->ctx
, struct isl_map
,
5122 sizeof(struct isl_map
) +
5123 (n
- 1) * sizeof(struct isl_basic_map
*));
5127 map
->ctx
= dim
->ctx
;
5128 isl_ctx_ref(map
->ctx
);
5136 isl_space_free(dim
);
5140 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5141 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5144 struct isl_map
*map
;
5147 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5151 map
= isl_map_alloc_space(dims
, n
, flags
);
5155 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5157 struct isl_basic_map
*bmap
;
5158 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5159 bmap
= isl_basic_map_set_to_empty(bmap
);
5163 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5165 struct isl_basic_set
*bset
;
5166 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5167 bset
= isl_basic_set_set_to_empty(bset
);
5171 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5173 struct isl_basic_map
*bmap
;
5176 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5177 bmap
= isl_basic_map_set_to_empty(bmap
);
5181 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5183 struct isl_basic_map
*bmap
;
5186 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5187 bmap
= isl_basic_map_set_to_empty(bmap
);
5191 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5193 struct isl_basic_set
*bset
;
5196 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5197 bset
= isl_basic_set_set_to_empty(bset
);
5201 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5203 struct isl_basic_map
*bmap
;
5204 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5205 bmap
= isl_basic_map_finalize(bmap
);
5209 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5211 struct isl_basic_set
*bset
;
5212 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5213 bset
= isl_basic_set_finalize(bset
);
5217 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5220 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5221 isl_basic_map
*bmap
;
5223 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5224 for (i
= 0; i
< total
; ++i
) {
5225 int k
= isl_basic_map_alloc_inequality(bmap
);
5228 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5229 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5233 isl_basic_map_free(bmap
);
5237 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5239 return isl_basic_map_nat_universe(dim
);
5242 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5244 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5247 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5249 return isl_map_nat_universe(dim
);
5252 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5253 __isl_keep isl_basic_map
*model
)
5257 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5260 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5264 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5267 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5268 __isl_keep isl_set
*model
)
5272 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5275 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5277 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5280 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5284 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5287 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5291 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5294 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5296 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5299 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5303 return isl_set_empty(isl_space_copy(model
->dim
));
5306 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5308 struct isl_map
*map
;
5311 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5312 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5316 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5318 struct isl_set
*set
;
5321 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5322 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5326 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5330 return isl_set_universe(isl_space_copy(model
->dim
));
5333 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5336 struct isl_map
*dup
;
5340 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5341 for (i
= 0; i
< map
->n
; ++i
)
5342 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5346 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5347 __isl_take isl_basic_map
*bmap
)
5351 if (isl_basic_map_plain_is_empty(bmap
)) {
5352 isl_basic_map_free(bmap
);
5355 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5356 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5357 map
->p
[map
->n
] = bmap
;
5359 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5365 isl_basic_map_free(bmap
);
5369 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
5379 isl_ctx_deref(map
->ctx
);
5380 for (i
= 0; i
< map
->n
; ++i
)
5381 isl_basic_map_free(map
->p
[i
]);
5382 isl_space_free(map
->dim
);
5388 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5389 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5393 base
= isl_map_cow(base
);
5397 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5400 for (i
= 0; i
< base
->n
; ++i
) {
5401 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5402 isl_space_copy(base
->dim
), 0, 0, 0);
5412 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5413 unsigned nparam
, unsigned dim
)
5415 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5419 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5420 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5424 bmap
= isl_basic_map_cow(bmap
);
5425 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5426 j
= isl_basic_map_alloc_equality(bmap
);
5429 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5430 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5431 isl_int_set_si(bmap
->eq
[j
][0], value
);
5432 bmap
= isl_basic_map_simplify(bmap
);
5433 return isl_basic_map_finalize(bmap
);
5435 isl_basic_map_free(bmap
);
5439 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5440 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5444 bmap
= isl_basic_map_cow(bmap
);
5445 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5446 j
= isl_basic_map_alloc_equality(bmap
);
5449 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5450 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5451 isl_int_set(bmap
->eq
[j
][0], value
);
5452 bmap
= isl_basic_map_simplify(bmap
);
5453 return isl_basic_map_finalize(bmap
);
5455 isl_basic_map_free(bmap
);
5459 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5460 enum isl_dim_type type
, unsigned pos
, int value
)
5464 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5465 return isl_basic_map_fix_pos_si(bmap
,
5466 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5468 isl_basic_map_free(bmap
);
5472 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5473 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5477 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5478 return isl_basic_map_fix_pos(bmap
,
5479 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5481 isl_basic_map_free(bmap
);
5485 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5486 * to be equal to "v".
5488 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5489 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5493 if (!isl_val_is_int(v
))
5494 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5495 "expecting integer value", goto error
);
5496 if (pos
>= isl_basic_map_dim(bmap
, type
))
5497 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5498 "index out of bounds", goto error
);
5499 pos
+= isl_basic_map_offset(bmap
, type
);
5500 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5504 isl_basic_map_free(bmap
);
5509 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5510 * to be equal to "v".
5512 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5513 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5515 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5518 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5519 enum isl_dim_type type
, unsigned pos
, int value
)
5521 return (struct isl_basic_set
*)
5522 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5526 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5527 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5529 return (struct isl_basic_set
*)
5530 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5534 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5535 unsigned input
, int value
)
5537 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5540 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5541 unsigned dim
, int value
)
5543 return (struct isl_basic_set
*)
5544 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5545 isl_dim_set
, dim
, value
);
5548 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5550 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5557 isl_basic_map_free(map
->p
[i
]);
5558 if (i
!= map
->n
- 1) {
5559 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5560 map
->p
[i
] = map
->p
[map
->n
- 1];
5567 /* Perform "fn" on each basic map of "map", where we may not be holding
5568 * the only reference to "map".
5569 * In particular, "fn" should be a semantics preserving operation
5570 * that we want to apply to all copies of "map". We therefore need
5571 * to be careful not to modify "map" in a way that breaks "map"
5572 * in case anything goes wrong.
5574 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5575 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5577 struct isl_basic_map
*bmap
;
5583 for (i
= map
->n
- 1; i
>= 0; --i
) {
5584 bmap
= isl_basic_map_copy(map
->p
[i
]);
5588 isl_basic_map_free(map
->p
[i
]);
5590 if (remove_if_empty(map
, i
) < 0)
5600 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5601 enum isl_dim_type type
, unsigned pos
, int value
)
5605 map
= isl_map_cow(map
);
5609 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5610 for (i
= map
->n
- 1; i
>= 0; --i
) {
5611 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5612 if (remove_if_empty(map
, i
) < 0)
5615 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5622 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5623 enum isl_dim_type type
, unsigned pos
, int value
)
5625 return (struct isl_set
*)
5626 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5629 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5630 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5634 map
= isl_map_cow(map
);
5638 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5639 for (i
= 0; i
< map
->n
; ++i
) {
5640 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5644 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5651 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5652 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5654 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5657 /* Fix the value of the variable at position "pos" of type "type" of "map"
5658 * to be equal to "v".
5660 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5661 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5665 map
= isl_map_cow(map
);
5669 if (!isl_val_is_int(v
))
5670 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5671 "expecting integer value", goto error
);
5672 if (pos
>= isl_map_dim(map
, type
))
5673 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5674 "index out of bounds", goto error
);
5675 for (i
= map
->n
- 1; i
>= 0; --i
) {
5676 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5678 if (remove_if_empty(map
, i
) < 0)
5681 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5690 /* Fix the value of the variable at position "pos" of type "type" of "set"
5691 * to be equal to "v".
5693 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5694 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5696 return isl_map_fix_val(set
, type
, pos
, v
);
5699 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5700 unsigned input
, int value
)
5702 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5705 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5707 return (struct isl_set
*)
5708 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5711 static __isl_give isl_basic_map
*basic_map_bound_si(
5712 __isl_take isl_basic_map
*bmap
,
5713 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5719 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5720 pos
+= isl_basic_map_offset(bmap
, type
);
5721 bmap
= isl_basic_map_cow(bmap
);
5722 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5723 j
= isl_basic_map_alloc_inequality(bmap
);
5726 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5728 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5729 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5731 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5732 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5734 bmap
= isl_basic_map_simplify(bmap
);
5735 return isl_basic_map_finalize(bmap
);
5737 isl_basic_map_free(bmap
);
5741 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5742 __isl_take isl_basic_map
*bmap
,
5743 enum isl_dim_type type
, unsigned pos
, int value
)
5745 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5748 /* Constrain the values of the given dimension to be no greater than "value".
5750 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5751 __isl_take isl_basic_map
*bmap
,
5752 enum isl_dim_type type
, unsigned pos
, int value
)
5754 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5757 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5758 unsigned dim
, isl_int value
)
5762 bset
= isl_basic_set_cow(bset
);
5763 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5764 j
= isl_basic_set_alloc_inequality(bset
);
5767 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5768 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5769 isl_int_neg(bset
->ineq
[j
][0], value
);
5770 bset
= isl_basic_set_simplify(bset
);
5771 return isl_basic_set_finalize(bset
);
5773 isl_basic_set_free(bset
);
5777 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5778 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5782 map
= isl_map_cow(map
);
5786 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5787 for (i
= 0; i
< map
->n
; ++i
) {
5788 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5789 type
, pos
, value
, upper
);
5793 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5800 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5801 enum isl_dim_type type
, unsigned pos
, int value
)
5803 return map_bound_si(map
, type
, pos
, value
, 0);
5806 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5807 enum isl_dim_type type
, unsigned pos
, int value
)
5809 return map_bound_si(map
, type
, pos
, value
, 1);
5812 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5813 enum isl_dim_type type
, unsigned pos
, int value
)
5815 return (struct isl_set
*)
5816 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5819 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5820 enum isl_dim_type type
, unsigned pos
, int value
)
5822 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5825 /* Bound the given variable of "bmap" from below (or above is "upper"
5826 * is set) to "value".
5828 static __isl_give isl_basic_map
*basic_map_bound(
5829 __isl_take isl_basic_map
*bmap
,
5830 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5836 if (pos
>= isl_basic_map_dim(bmap
, type
))
5837 isl_die(bmap
->ctx
, isl_error_invalid
,
5838 "index out of bounds", goto error
);
5839 pos
+= isl_basic_map_offset(bmap
, type
);
5840 bmap
= isl_basic_map_cow(bmap
);
5841 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5842 j
= isl_basic_map_alloc_inequality(bmap
);
5845 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5847 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5848 isl_int_set(bmap
->ineq
[j
][0], value
);
5850 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5851 isl_int_neg(bmap
->ineq
[j
][0], value
);
5853 bmap
= isl_basic_map_simplify(bmap
);
5854 return isl_basic_map_finalize(bmap
);
5856 isl_basic_map_free(bmap
);
5860 /* Bound the given variable of "map" from below (or above is "upper"
5861 * is set) to "value".
5863 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5864 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5868 map
= isl_map_cow(map
);
5872 if (pos
>= isl_map_dim(map
, type
))
5873 isl_die(map
->ctx
, isl_error_invalid
,
5874 "index out of bounds", goto error
);
5875 for (i
= map
->n
- 1; i
>= 0; --i
) {
5876 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5877 if (remove_if_empty(map
, i
) < 0)
5880 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5887 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5888 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5890 return map_bound(map
, type
, pos
, value
, 0);
5893 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5894 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5896 return map_bound(map
, type
, pos
, value
, 1);
5899 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5900 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5902 return isl_map_lower_bound(set
, type
, pos
, value
);
5905 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5906 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5908 return isl_map_upper_bound(set
, type
, pos
, value
);
5911 /* Force the values of the variable at position "pos" of type "type" of "set"
5912 * to be no smaller than "value".
5914 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
5915 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5919 if (!isl_val_is_int(value
))
5920 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5921 "expecting integer value", goto error
);
5922 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
5923 isl_val_free(value
);
5926 isl_val_free(value
);
5931 /* Force the values of the variable at position "pos" of type "type" of "set"
5932 * to be no greater than "value".
5934 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
5935 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5939 if (!isl_val_is_int(value
))
5940 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5941 "expecting integer value", goto error
);
5942 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
5943 isl_val_free(value
);
5946 isl_val_free(value
);
5951 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5956 set
= isl_set_cow(set
);
5960 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5961 for (i
= 0; i
< set
->n
; ++i
) {
5962 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5972 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5976 map
= isl_map_cow(map
);
5980 map
->dim
= isl_space_reverse(map
->dim
);
5983 for (i
= 0; i
< map
->n
; ++i
) {
5984 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5988 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5995 static struct isl_map
*isl_basic_map_partial_lexopt(
5996 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5997 struct isl_set
**empty
, int max
)
5999 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
6002 struct isl_map
*isl_basic_map_partial_lexmax(
6003 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
6004 struct isl_set
**empty
)
6006 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
6009 struct isl_map
*isl_basic_map_partial_lexmin(
6010 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
6011 struct isl_set
**empty
)
6013 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
6016 struct isl_set
*isl_basic_set_partial_lexmin(
6017 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
6018 struct isl_set
**empty
)
6020 return (struct isl_set
*)
6021 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
6025 struct isl_set
*isl_basic_set_partial_lexmax(
6026 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
6027 struct isl_set
**empty
)
6029 return (struct isl_set
*)
6030 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
6034 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
6035 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
6036 __isl_give isl_set
**empty
)
6038 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
6041 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
6042 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
6043 __isl_give isl_set
**empty
)
6045 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
6048 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
6049 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
6050 __isl_give isl_set
**empty
)
6052 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
6055 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
6056 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
6057 __isl_give isl_set
**empty
)
6059 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
6062 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
6063 __isl_take isl_basic_map
*bmap
, int max
)
6065 isl_basic_set
*dom
= NULL
;
6066 isl_space
*dom_space
;
6070 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
6071 dom
= isl_basic_set_universe(dom_space
);
6072 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
6074 isl_basic_map_free(bmap
);
6078 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
6079 __isl_take isl_basic_map
*bmap
)
6081 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
6085 #define TYPE isl_pw_multi_aff
6087 #define SUFFIX _pw_multi_aff
6089 #define EMPTY isl_pw_multi_aff_empty
6091 #define ADD isl_pw_multi_aff_union_add
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 * in the form of an isl_pw_multi_aff.
6097 * Set *empty to those elements in dom that do not have an image element.
6099 * We first compute the lexicographically minimal or maximal element
6100 * in the first basic map. This results in a partial solution "res"
6101 * and a subset "todo" of dom that still need to be handled.
6102 * We then consider each of the remaining maps in "map" and successively
6103 * update both "res" and "todo".
6105 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6106 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6107 __isl_give isl_set
**empty
, int max
)
6110 isl_pw_multi_aff
*res
;
6116 if (isl_map_plain_is_empty(map
)) {
6121 return isl_pw_multi_aff_from_map(map
);
6124 res
= basic_map_partial_lexopt_pw_multi_aff(
6125 isl_basic_map_copy(map
->p
[0]),
6126 isl_set_copy(dom
), &todo
, max
);
6128 for (i
= 1; i
< map
->n
; ++i
) {
6129 isl_pw_multi_aff
*res_i
;
6132 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6133 isl_basic_map_copy(map
->p
[i
]),
6134 isl_set_copy(dom
), &todo_i
, max
);
6137 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6139 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6141 todo
= isl_set_intersect(todo
, todo_i
);
6162 #define TYPE isl_map
6166 #define EMPTY isl_map_empty
6168 #define ADD isl_map_union_disjoint
6169 #include "isl_map_lexopt_templ.c"
6171 /* Given a map "map", compute the lexicographically minimal
6172 * (or maximal) image element for each domain element in dom.
6173 * Set *empty to those elements in dom that do not have an image element.
6175 * We first compute the lexicographically minimal or maximal element
6176 * in the first basic map. This results in a partial solution "res"
6177 * and a subset "todo" of dom that still need to be handled.
6178 * We then consider each of the remaining maps in "map" and successively
6179 * update both "res" and "todo".
6181 * Let res^k and todo^k be the results after k steps and let i = k + 1.
6182 * Assume we are computing the lexicographical maximum.
6183 * We first compute the lexicographically maximal element in basic map i.
6184 * This results in a partial solution res_i and a subset todo_i.
6185 * Then we combine these results with those obtain for the first k basic maps
6186 * to obtain a result that is valid for the first k+1 basic maps.
6187 * In particular, the set where there is no solution is the set where
6188 * there is no solution for the first k basic maps and also no solution
6189 * for the ith basic map, i.e.,
6191 * todo^i = todo^k * todo_i
6193 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
6194 * solutions, arbitrarily breaking ties in favor of res^k.
6195 * That is, when res^k(a) >= res_i(a), we pick res^k and
6196 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
6197 * the lexicographic order.)
6198 * In practice, we compute
6200 * res^k * (res_i . "<=")
6204 * res_i * (res^k . "<")
6206 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
6207 * where only one of res^k and res_i provides a solution and we simply pick
6214 * Note that we only compute these intersections when dom(res^k) intersects
6215 * dom(res_i). Otherwise, the only effect of these intersections is to
6216 * potentially break up res^k and res_i into smaller pieces.
6217 * We want to avoid such splintering as much as possible.
6218 * In fact, an earlier implementation of this function would look for
6219 * better results in the domain of res^k and for extra results in todo^k,
6220 * but this would always result in a splintering according to todo^k,
6221 * even when the domain of basic map i is disjoint from the domains of
6222 * the previous basic maps.
6224 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6225 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6226 __isl_give isl_set
**empty
, int max
)
6229 struct isl_map
*res
;
6230 struct isl_set
*todo
;
6235 if (isl_map_plain_is_empty(map
)) {
6243 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6244 isl_set_copy(dom
), &todo
, max
);
6246 for (i
= 1; i
< map
->n
; ++i
) {
6250 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
6252 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
6253 isl_set_copy(dom
), &todo_i
, max
);
6256 lt
= isl_map_lex_lt(isl_space_copy(dim
));
6257 le
= isl_map_lex_le(dim
);
6259 lt
= isl_map_lex_gt(isl_space_copy(dim
));
6260 le
= isl_map_lex_ge(dim
);
6262 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
6263 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
6264 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6265 le
= isl_map_intersect(le
, isl_map_copy(res
));
6267 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6268 res
= isl_map_intersect_domain(res
,
6269 isl_set_copy(todo_i
));
6270 res_i
= isl_map_intersect_domain(res_i
,
6271 isl_set_copy(todo
));
6274 res
= isl_map_union_disjoint(res
, res_i
);
6275 res
= isl_map_union_disjoint(res
, lt
);
6276 res
= isl_map_union_disjoint(res
, le
);
6278 todo
= isl_set_intersect(todo
, todo_i
);
6298 __isl_give isl_map
*isl_map_partial_lexmax(
6299 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6300 __isl_give isl_set
**empty
)
6302 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6305 __isl_give isl_map
*isl_map_partial_lexmin(
6306 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6307 __isl_give isl_set
**empty
)
6309 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6312 __isl_give isl_set
*isl_set_partial_lexmin(
6313 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6314 __isl_give isl_set
**empty
)
6316 return (struct isl_set
*)
6317 isl_map_partial_lexmin((struct isl_map
*)set
,
6321 __isl_give isl_set
*isl_set_partial_lexmax(
6322 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6323 __isl_give isl_set
**empty
)
6325 return (struct isl_set
*)
6326 isl_map_partial_lexmax((struct isl_map
*)set
,
6330 /* Compute the lexicographic minimum (or maximum if "max" is set)
6331 * of "bmap" over its domain.
6333 * Since we are not interested in the part of the domain space where
6334 * there is no solution, we initialize the domain to those constraints
6335 * of "bmap" that only involve the parameters and the input dimensions.
6336 * This relieves the parametric programming engine from detecting those
6337 * inequalities and transferring them to the context. More importantly,
6338 * it ensures that those inequalities are transferred first and not
6339 * intermixed with inequalities that actually split the domain.
6341 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6345 isl_basic_map
*copy
;
6348 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6349 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6350 copy
= isl_basic_map_copy(bmap
);
6351 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6352 isl_dim_div
, 0, n_div
);
6353 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6354 isl_dim_out
, 0, n_out
);
6355 dom
= isl_basic_map_domain(copy
);
6356 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6359 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6361 return isl_basic_map_lexopt(bmap
, 0);
6364 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6366 return isl_basic_map_lexopt(bmap
, 1);
6369 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6371 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6374 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6376 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6379 /* Extract the first and only affine expression from list
6380 * and then add it to *pwaff with the given dom.
6381 * This domain is known to be disjoint from other domains
6382 * because of the way isl_basic_map_foreach_lexmax works.
6384 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6385 __isl_take isl_aff_list
*list
, void *user
)
6387 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6389 isl_pw_aff
**pwaff
= user
;
6390 isl_pw_aff
*pwaff_i
;
6394 if (isl_aff_list_n_aff(list
) != 1)
6395 isl_die(ctx
, isl_error_internal
,
6396 "expecting single element list", goto error
);
6398 aff
= isl_aff_list_get_aff(list
, 0);
6399 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6401 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6403 isl_aff_list_free(list
);
6407 isl_basic_set_free(dom
);
6408 isl_aff_list_free(list
);
6412 /* Given a basic map with one output dimension, compute the minimum or
6413 * maximum of that dimension as an isl_pw_aff.
6415 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6416 * call update_dim_opt on each leaf of the result.
6418 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6421 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6425 dim
= isl_space_from_domain(isl_space_domain(dim
));
6426 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6427 pwaff
= isl_pw_aff_empty(dim
);
6429 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6431 return isl_pw_aff_free(pwaff
);
6436 /* Compute the minimum or maximum of the given output dimension
6437 * as a function of the parameters and the input dimensions,
6438 * but independently of the other output dimensions.
6440 * We first project out the other output dimension and then compute
6441 * the "lexicographic" maximum in each basic map, combining the results
6442 * using isl_pw_aff_union_max.
6444 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6451 n_out
= isl_map_dim(map
, isl_dim_out
);
6452 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6453 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6458 isl_space
*dim
= isl_map_get_space(map
);
6460 return isl_pw_aff_empty(dim
);
6463 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6464 for (i
= 1; i
< map
->n
; ++i
) {
6465 isl_pw_aff
*pwaff_i
;
6467 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6468 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6476 /* Compute the maximum of the given output dimension as a function of the
6477 * parameters and input dimensions, but independently of
6478 * the other output dimensions.
6480 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6482 return map_dim_opt(map
, pos
, 1);
6485 /* Compute the minimum or maximum of the given set dimension
6486 * as a function of the parameters,
6487 * but independently of the other set dimensions.
6489 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6492 return map_dim_opt(set
, pos
, max
);
6495 /* Compute the maximum of the given set dimension as a function of the
6496 * parameters, but independently of the other set dimensions.
6498 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6500 return set_dim_opt(set
, pos
, 1);
6503 /* Compute the minimum of the given set dimension as a function of the
6504 * parameters, but independently of the other set dimensions.
6506 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6508 return set_dim_opt(set
, pos
, 0);
6511 /* Apply a preimage specified by "mat" on the parameters of "bset".
6512 * bset is assumed to have only parameters and divs.
6514 static struct isl_basic_set
*basic_set_parameter_preimage(
6515 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6522 bset
->dim
= isl_space_cow(bset
->dim
);
6526 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6528 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6530 bset
->dim
->nparam
= 0;
6531 bset
->dim
->n_out
= nparam
;
6532 bset
= isl_basic_set_preimage(bset
, mat
);
6534 bset
->dim
->nparam
= bset
->dim
->n_out
;
6535 bset
->dim
->n_out
= 0;
6540 isl_basic_set_free(bset
);
6544 /* Apply a preimage specified by "mat" on the parameters of "set".
6545 * set is assumed to have only parameters and divs.
6547 static struct isl_set
*set_parameter_preimage(
6548 struct isl_set
*set
, struct isl_mat
*mat
)
6550 isl_space
*dim
= NULL
;
6556 dim
= isl_space_copy(set
->dim
);
6557 dim
= isl_space_cow(dim
);
6561 nparam
= isl_set_dim(set
, isl_dim_param
);
6563 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6566 dim
->n_out
= nparam
;
6567 isl_set_reset_space(set
, dim
);
6568 set
= isl_set_preimage(set
, mat
);
6571 dim
= isl_space_copy(set
->dim
);
6572 dim
= isl_space_cow(dim
);
6575 dim
->nparam
= dim
->n_out
;
6577 isl_set_reset_space(set
, dim
);
6580 isl_space_free(dim
);
6587 /* Intersect the basic set "bset" with the affine space specified by the
6588 * equalities in "eq".
6590 static struct isl_basic_set
*basic_set_append_equalities(
6591 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6599 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6604 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6605 for (i
= 0; i
< eq
->n_row
; ++i
) {
6606 k
= isl_basic_set_alloc_equality(bset
);
6609 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6610 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6614 bset
= isl_basic_set_gauss(bset
, NULL
);
6615 bset
= isl_basic_set_finalize(bset
);
6620 isl_basic_set_free(bset
);
6624 /* Intersect the set "set" with the affine space specified by the
6625 * equalities in "eq".
6627 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6635 for (i
= 0; i
< set
->n
; ++i
) {
6636 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6649 /* Given a basic set "bset" that only involves parameters and existentially
6650 * quantified variables, return the index of the first equality
6651 * that only involves parameters. If there is no such equality then
6652 * return bset->n_eq.
6654 * This function assumes that isl_basic_set_gauss has been called on "bset".
6656 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6659 unsigned nparam
, n_div
;
6664 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6665 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6667 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6668 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6675 /* Compute an explicit representation for the existentially quantified
6676 * variables in "bset" by computing the "minimal value" of the set
6677 * variables. Since there are no set variables, the computation of
6678 * the minimal value essentially computes an explicit representation
6679 * of the non-empty part(s) of "bset".
6681 * The input only involves parameters and existentially quantified variables.
6682 * All equalities among parameters have been removed.
6684 * Since the existentially quantified variables in the result are in general
6685 * going to be different from those in the input, we first replace
6686 * them by the minimal number of variables based on their equalities.
6687 * This should simplify the parametric integer programming.
6689 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6691 isl_morph
*morph1
, *morph2
;
6697 if (bset
->n_eq
== 0)
6698 return isl_basic_set_lexmin(bset
);
6700 morph1
= isl_basic_set_parameter_compression(bset
);
6701 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6702 bset
= isl_basic_set_lift(bset
);
6703 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6704 bset
= isl_morph_basic_set(morph2
, bset
);
6705 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6706 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6708 set
= isl_basic_set_lexmin(bset
);
6710 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6715 /* Project the given basic set onto its parameter domain, possibly introducing
6716 * new, explicit, existential variables in the constraints.
6717 * The input has parameters and (possibly implicit) existential variables.
6718 * The output has the same parameters, but only
6719 * explicit existentially quantified variables.
6721 * The actual projection is performed by pip, but pip doesn't seem
6722 * to like equalities very much, so we first remove the equalities
6723 * among the parameters by performing a variable compression on
6724 * the parameters. Afterward, an inverse transformation is performed
6725 * and the equalities among the parameters are inserted back in.
6727 * The variable compression on the parameters may uncover additional
6728 * equalities that were only implicit before. We therefore check
6729 * if there are any new parameter equalities in the result and
6730 * if so recurse. The removal of parameter equalities is required
6731 * for the parameter compression performed by base_compute_divs.
6733 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6737 struct isl_mat
*T
, *T2
;
6738 struct isl_set
*set
;
6741 bset
= isl_basic_set_cow(bset
);
6745 if (bset
->n_eq
== 0)
6746 return base_compute_divs(bset
);
6748 bset
= isl_basic_set_gauss(bset
, NULL
);
6751 if (isl_basic_set_plain_is_empty(bset
))
6752 return isl_set_from_basic_set(bset
);
6754 i
= first_parameter_equality(bset
);
6755 if (i
== bset
->n_eq
)
6756 return base_compute_divs(bset
);
6758 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6759 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6761 eq
= isl_mat_cow(eq
);
6762 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6763 if (T
&& T
->n_col
== 0) {
6767 bset
= isl_basic_set_set_to_empty(bset
);
6768 return isl_set_from_basic_set(bset
);
6770 bset
= basic_set_parameter_preimage(bset
, T
);
6772 i
= first_parameter_equality(bset
);
6775 else if (i
== bset
->n_eq
)
6776 set
= base_compute_divs(bset
);
6778 set
= parameter_compute_divs(bset
);
6779 set
= set_parameter_preimage(set
, T2
);
6780 set
= set_append_equalities(set
, eq
);
6784 /* Insert the divs from "ls" before those of "bmap".
6786 * The number of columns is not changed, which means that the last
6787 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6788 * The caller is responsible for removing the same number of dimensions
6789 * from the space of "bmap".
6791 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6792 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6798 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6802 old_n_div
= bmap
->n_div
;
6803 bmap
= insert_div_rows(bmap
, n_div
);
6807 for (i
= 0; i
< n_div
; ++i
) {
6808 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6809 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6815 /* Replace the space of "bmap" by the space and divs of "ls".
6817 * If "ls" has any divs, then we simplify the result since we may
6818 * have discovered some additional equalities that could simplify
6819 * the div expressions.
6821 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6822 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6826 bmap
= isl_basic_map_cow(bmap
);
6830 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6831 bmap
= insert_divs_from_local_space(bmap
, ls
);
6835 isl_space_free(bmap
->dim
);
6836 bmap
->dim
= isl_local_space_get_space(ls
);
6840 isl_local_space_free(ls
);
6842 bmap
= isl_basic_map_simplify(bmap
);
6843 bmap
= isl_basic_map_finalize(bmap
);
6846 isl_basic_map_free(bmap
);
6847 isl_local_space_free(ls
);
6851 /* Replace the space of "map" by the space and divs of "ls".
6853 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6854 __isl_take isl_local_space
*ls
)
6858 map
= isl_map_cow(map
);
6862 for (i
= 0; i
< map
->n
; ++i
) {
6863 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6864 isl_local_space_copy(ls
));
6868 isl_space_free(map
->dim
);
6869 map
->dim
= isl_local_space_get_space(ls
);
6873 isl_local_space_free(ls
);
6876 isl_local_space_free(ls
);
6881 /* Compute an explicit representation for the existentially
6882 * quantified variables for which do not know any explicit representation yet.
6884 * We first sort the existentially quantified variables so that the
6885 * existentially quantified variables for which we already have an explicit
6886 * representation are placed before those for which we do not.
6887 * The input dimensions, the output dimensions and the existentially
6888 * quantified variables for which we already have an explicit
6889 * representation are then turned into parameters.
6890 * compute_divs returns a map with the same parameters and
6891 * no input or output dimensions and the dimension specification
6892 * is reset to that of the input, including the existentially quantified
6893 * variables for which we already had an explicit representation.
6895 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6897 struct isl_basic_set
*bset
;
6898 struct isl_set
*set
;
6899 struct isl_map
*map
;
6901 isl_local_space
*ls
;
6908 bmap
= isl_basic_map_sort_divs(bmap
);
6909 bmap
= isl_basic_map_cow(bmap
);
6913 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
6914 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
6917 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6918 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6919 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6920 dim
= isl_space_set_alloc(bmap
->ctx
,
6921 nparam
+ n_in
+ n_out
+ n_known
, 0);
6925 ls
= isl_basic_map_get_local_space(bmap
);
6926 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6927 n_known
, bmap
->n_div
- n_known
);
6929 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6930 swap_div(bmap
, i
- n_known
, i
);
6931 bmap
->n_div
-= n_known
;
6932 bmap
->extra
-= n_known
;
6934 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6935 bset
= (struct isl_basic_set
*)bmap
;
6937 set
= parameter_compute_divs(bset
);
6938 map
= (struct isl_map
*)set
;
6939 map
= replace_space_by_local_space(map
, ls
);
6943 isl_basic_map_free(bmap
);
6947 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6955 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6956 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6957 if (isl_int_is_zero(bmap
->div
[i
][0]))
6959 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6965 static int map_divs_known(__isl_keep isl_map
*map
)
6972 for (i
= 0; i
< map
->n
; ++i
) {
6973 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6981 /* If bmap contains any unknown divs, then compute explicit
6982 * expressions for them. However, this computation may be
6983 * quite expensive, so first try to remove divs that aren't
6986 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6989 struct isl_map
*map
;
6991 known
= isl_basic_map_divs_known(bmap
);
6995 return isl_map_from_basic_map(bmap
);
6997 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6999 known
= isl_basic_map_divs_known(bmap
);
7003 return isl_map_from_basic_map(bmap
);
7005 map
= compute_divs(bmap
);
7008 isl_basic_map_free(bmap
);
7012 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
7016 struct isl_map
*res
;
7023 known
= map_divs_known(map
);
7031 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7032 for (i
= 1 ; i
< map
->n
; ++i
) {
7034 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7035 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7036 res
= isl_map_union_disjoint(res
, r2
);
7038 res
= isl_map_union(res
, r2
);
7045 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7047 return (struct isl_set
*)
7048 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
7051 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7053 return (struct isl_set
*)
7054 isl_map_compute_divs((struct isl_map
*)set
);
7057 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7060 struct isl_set
*set
;
7065 map
= isl_map_cow(map
);
7069 set
= (struct isl_set
*)map
;
7070 set
->dim
= isl_space_domain(set
->dim
);
7073 for (i
= 0; i
< map
->n
; ++i
) {
7074 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7078 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7079 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7086 /* Return the union of "map1" and "map2", where we assume for now that
7087 * "map1" and "map2" are disjoint. Note that the basic maps inside
7088 * "map1" or "map2" may not be disjoint from each other.
7089 * Also note that this function is also called from isl_map_union,
7090 * which takes care of handling the situation where "map1" and "map2"
7091 * may not be disjoint.
7093 * If one of the inputs is empty, we can simply return the other input.
7094 * Similarly, if one of the inputs is universal, then it is equal to the union.
7096 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7097 __isl_take isl_map
*map2
)
7101 struct isl_map
*map
= NULL
;
7116 is_universe
= isl_map_plain_is_universe(map1
);
7117 if (is_universe
< 0)
7124 is_universe
= isl_map_plain_is_universe(map2
);
7125 if (is_universe
< 0)
7132 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
7134 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7135 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7136 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7138 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7139 map1
->n
+ map2
->n
, flags
);
7142 for (i
= 0; i
< map1
->n
; ++i
) {
7143 map
= isl_map_add_basic_map(map
,
7144 isl_basic_map_copy(map1
->p
[i
]));
7148 for (i
= 0; i
< map2
->n
; ++i
) {
7149 map
= isl_map_add_basic_map(map
,
7150 isl_basic_map_copy(map2
->p
[i
]));
7164 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7165 * guaranteed to be disjoint by the caller.
7167 * Note that this functions is called from within isl_map_make_disjoint,
7168 * so we have to be careful not to touch the constraints of the inputs
7171 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7172 __isl_take isl_map
*map2
)
7174 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7177 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7178 * not be disjoint. The parameters are assumed to have been aligned.
7180 * We currently simply call map_union_disjoint, the internal operation
7181 * of which does not really depend on the inputs being disjoint.
7182 * If the result contains more than one basic map, then we clear
7183 * the disjoint flag since the result may contain basic maps from
7184 * both inputs and these are not guaranteed to be disjoint.
7186 * As a special case, if "map1" and "map2" are obviously equal,
7187 * then we simply return "map1".
7189 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7190 __isl_take isl_map
*map2
)
7197 equal
= isl_map_plain_is_equal(map1
, map2
);
7205 map1
= map_union_disjoint(map1
, map2
);
7209 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7217 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7220 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7221 __isl_take isl_map
*map2
)
7223 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7226 struct isl_set
*isl_set_union_disjoint(
7227 struct isl_set
*set1
, struct isl_set
*set2
)
7229 return (struct isl_set
*)
7230 isl_map_union_disjoint(
7231 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
7234 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7236 return (struct isl_set
*)
7237 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7240 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7243 * "map" and "set" are assumed to be compatible and non-NULL.
7245 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7246 __isl_take isl_set
*set
,
7247 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7248 __isl_take isl_basic_set
*bset
))
7251 struct isl_map
*result
;
7254 if (isl_set_plain_is_universe(set
)) {
7259 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7260 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7261 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7263 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7264 map
->n
* set
->n
, flags
);
7265 for (i
= 0; result
&& i
< map
->n
; ++i
)
7266 for (j
= 0; j
< set
->n
; ++j
) {
7267 result
= isl_map_add_basic_map(result
,
7268 fn(isl_basic_map_copy(map
->p
[i
]),
7269 isl_basic_set_copy(set
->p
[j
])));
7279 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7280 __isl_take isl_set
*set
)
7285 if (!isl_map_compatible_range(map
, set
))
7286 isl_die(set
->ctx
, isl_error_invalid
,
7287 "incompatible spaces", goto error
);
7289 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7296 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7297 __isl_take isl_set
*set
)
7299 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7302 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7303 __isl_take isl_set
*set
)
7308 if (!isl_map_compatible_domain(map
, set
))
7309 isl_die(set
->ctx
, isl_error_invalid
,
7310 "incompatible spaces", goto error
);
7312 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7319 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7320 __isl_take isl_set
*set
)
7322 return isl_map_align_params_map_map_and(map
, set
,
7323 &map_intersect_domain
);
7326 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7327 __isl_take isl_map
*map2
)
7331 map1
= isl_map_reverse(map1
);
7332 map1
= isl_map_apply_range(map1
, map2
);
7333 return isl_map_reverse(map1
);
7340 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7341 __isl_take isl_map
*map2
)
7343 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7346 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7347 __isl_take isl_map
*map2
)
7349 isl_space
*dim_result
;
7350 struct isl_map
*result
;
7356 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7357 isl_space_copy(map2
->dim
));
7359 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7362 for (i
= 0; i
< map1
->n
; ++i
)
7363 for (j
= 0; j
< map2
->n
; ++j
) {
7364 result
= isl_map_add_basic_map(result
,
7365 isl_basic_map_apply_range(
7366 isl_basic_map_copy(map1
->p
[i
]),
7367 isl_basic_map_copy(map2
->p
[j
])));
7373 if (result
&& result
->n
<= 1)
7374 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7382 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7383 __isl_take isl_map
*map2
)
7385 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7389 * returns range - domain
7391 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7393 isl_space
*dims
, *target_dim
;
7394 struct isl_basic_set
*bset
;
7401 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
7402 bmap
->dim
, isl_dim_out
),
7404 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7405 dim
= isl_basic_map_n_in(bmap
);
7406 nparam
= isl_basic_map_n_param(bmap
);
7407 bset
= isl_basic_set_from_basic_map(bmap
);
7408 bset
= isl_basic_set_cow(bset
);
7409 dims
= isl_basic_set_get_space(bset
);
7410 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7411 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7412 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7413 for (i
= 0; i
< dim
; ++i
) {
7414 int j
= isl_basic_map_alloc_equality(
7415 (struct isl_basic_map
*)bset
);
7417 bset
= isl_basic_set_free(bset
);
7420 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7421 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7422 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7423 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7425 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7426 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7429 isl_basic_map_free(bmap
);
7434 * returns range - domain
7436 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7440 struct isl_set
*result
;
7445 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
7446 map
->dim
, isl_dim_out
),
7448 dim
= isl_map_get_space(map
);
7449 dim
= isl_space_domain(dim
);
7450 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7453 for (i
= 0; i
< map
->n
; ++i
)
7454 result
= isl_set_add_basic_set(result
,
7455 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7464 * returns [domain -> range] -> range - domain
7466 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7467 __isl_take isl_basic_map
*bmap
)
7471 isl_basic_map
*domain
;
7475 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
7476 isl_die(bmap
->ctx
, isl_error_invalid
,
7477 "domain and range don't match", goto error
);
7479 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7480 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7482 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7483 domain
= isl_basic_map_universe(dim
);
7485 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7486 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7487 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7489 total
= isl_basic_map_total_dim(bmap
);
7491 for (i
= 0; i
< n
; ++i
) {
7492 k
= isl_basic_map_alloc_equality(bmap
);
7495 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7496 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7497 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7498 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7501 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7502 return isl_basic_map_finalize(bmap
);
7504 isl_basic_map_free(bmap
);
7509 * returns [domain -> range] -> range - domain
7511 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7514 isl_space
*domain_dim
;
7519 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
7520 isl_die(map
->ctx
, isl_error_invalid
,
7521 "domain and range don't match", goto error
);
7523 map
= isl_map_cow(map
);
7527 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7528 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7529 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7532 for (i
= 0; i
< map
->n
; ++i
) {
7533 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7537 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7544 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7546 struct isl_basic_map
*bmap
;
7554 nparam
= dims
->nparam
;
7556 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7560 for (i
= 0; i
< dim
; ++i
) {
7561 int j
= isl_basic_map_alloc_equality(bmap
);
7564 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7565 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7566 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7568 return isl_basic_map_finalize(bmap
);
7570 isl_basic_map_free(bmap
);
7574 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7578 if (dim
->n_in
!= dim
->n_out
)
7579 isl_die(dim
->ctx
, isl_error_invalid
,
7580 "number of input and output dimensions needs to be "
7581 "the same", goto error
);
7582 return basic_map_identity(dim
);
7584 isl_space_free(dim
);
7588 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7590 if (!model
|| !model
->dim
)
7592 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7595 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7597 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7600 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7602 if (!model
|| !model
->dim
)
7604 return isl_map_identity(isl_space_copy(model
->dim
));
7607 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7609 if (!model
|| !model
->dim
)
7611 return isl_map_identity(isl_space_copy(model
->dim
));
7614 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7616 isl_space
*dim
= isl_set_get_space(set
);
7618 id
= isl_map_identity(isl_space_map_from_set(dim
));
7619 return isl_map_intersect_range(id
, set
);
7622 /* Construct a basic set with all set dimensions having only non-negative
7625 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7626 __isl_take isl_space
*space
)
7631 struct isl_basic_set
*bset
;
7635 nparam
= space
->nparam
;
7637 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7640 for (i
= 0; i
< dim
; ++i
) {
7641 int k
= isl_basic_set_alloc_inequality(bset
);
7644 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7645 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7649 isl_basic_set_free(bset
);
7653 /* Construct the half-space x_pos >= 0.
7655 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7659 isl_basic_set
*nonneg
;
7661 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7662 k
= isl_basic_set_alloc_inequality(nonneg
);
7665 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7666 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7668 return isl_basic_set_finalize(nonneg
);
7670 isl_basic_set_free(nonneg
);
7674 /* Construct the half-space x_pos <= -1.
7676 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7681 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7682 k
= isl_basic_set_alloc_inequality(neg
);
7685 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7686 isl_int_set_si(neg
->ineq
[k
][0], -1);
7687 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7689 return isl_basic_set_finalize(neg
);
7691 isl_basic_set_free(neg
);
7695 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7696 enum isl_dim_type type
, unsigned first
, unsigned n
)
7699 isl_basic_set
*nonneg
;
7707 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7709 for (i
= 0; i
< n
; ++i
) {
7710 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7711 pos(set
->dim
, type
) + first
+ i
);
7712 neg
= neg_halfspace(isl_set_get_space(set
),
7713 pos(set
->dim
, type
) + first
+ i
);
7715 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7724 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7725 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7732 if (isl_set_plain_is_empty(set
)) {
7737 return fn(set
, signs
, user
);
7740 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7742 half
= isl_set_intersect(half
, isl_set_copy(set
));
7743 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7747 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7749 half
= isl_set_intersect(half
, set
);
7750 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7756 /* Call "fn" on the intersections of "set" with each of the orthants
7757 * (except for obviously empty intersections). The orthant is identified
7758 * by the signs array, with each entry having value 1 or -1 according
7759 * to the sign of the corresponding variable.
7761 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7762 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7772 if (isl_set_plain_is_empty(set
))
7775 nparam
= isl_set_dim(set
, isl_dim_param
);
7776 nvar
= isl_set_dim(set
, isl_dim_set
);
7778 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7780 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7788 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7790 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7793 int isl_basic_map_is_subset(
7794 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7797 struct isl_map
*map1
;
7798 struct isl_map
*map2
;
7800 if (!bmap1
|| !bmap2
)
7803 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7804 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7806 is_subset
= isl_map_is_subset(map1
, map2
);
7814 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7815 __isl_keep isl_basic_set
*bset2
)
7817 return isl_basic_map_is_subset(bset1
, bset2
);
7820 int isl_basic_map_is_equal(
7821 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7825 if (!bmap1
|| !bmap2
)
7827 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7830 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7834 int isl_basic_set_is_equal(
7835 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7837 return isl_basic_map_is_equal(
7838 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7841 int isl_map_is_empty(struct isl_map
*map
)
7848 for (i
= 0; i
< map
->n
; ++i
) {
7849 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7858 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7860 return map
? map
->n
== 0 : -1;
7863 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7865 return isl_map_plain_is_empty(map
);
7868 int isl_set_plain_is_empty(struct isl_set
*set
)
7870 return set
? set
->n
== 0 : -1;
7873 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7875 return isl_set_plain_is_empty(set
);
7878 int isl_set_is_empty(struct isl_set
*set
)
7880 return isl_map_is_empty((struct isl_map
*)set
);
7883 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7888 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7891 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7896 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7899 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7905 is_subset
= isl_map_is_subset(map1
, map2
);
7908 is_subset
= isl_map_is_subset(map2
, map1
);
7912 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7914 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7917 int isl_basic_map_is_strict_subset(
7918 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7922 if (!bmap1
|| !bmap2
)
7924 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7927 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7928 if (is_subset
== -1)
7933 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7939 is_subset
= isl_map_is_subset(map1
, map2
);
7942 is_subset
= isl_map_is_subset(map2
, map1
);
7943 if (is_subset
== -1)
7948 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7950 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7953 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7957 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7960 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7964 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7967 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7974 for (i
= 0; i
< map
->n
; ++i
) {
7975 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7983 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7985 return isl_map_plain_is_universe((isl_map
*) set
);
7988 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7990 return isl_set_plain_is_universe(set
);
7993 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7995 struct isl_basic_set
*bset
= NULL
;
7996 struct isl_vec
*sample
= NULL
;
8003 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8006 if (isl_basic_map_is_universe(bmap
))
8009 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8010 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8011 copy
= isl_basic_map_remove_redundancies(copy
);
8012 empty
= isl_basic_map_plain_is_empty(copy
);
8013 isl_basic_map_free(copy
);
8017 total
= 1 + isl_basic_map_total_dim(bmap
);
8018 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
8019 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
8025 isl_vec_free(bmap
->sample
);
8026 bmap
->sample
= NULL
;
8027 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8030 sample
= isl_basic_set_sample_vec(bset
);
8033 empty
= sample
->size
== 0;
8034 isl_vec_free(bmap
->sample
);
8035 bmap
->sample
= sample
;
8037 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8042 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8046 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8049 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
8051 return isl_basic_map_plain_is_empty(bmap
);
8054 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8058 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8061 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
8063 return isl_basic_set_plain_is_empty(bset
);
8066 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
8068 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
8071 struct isl_map
*isl_basic_map_union(
8072 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8074 struct isl_map
*map
;
8075 if (!bmap1
|| !bmap2
)
8078 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8080 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8083 map
= isl_map_add_basic_map(map
, bmap1
);
8084 map
= isl_map_add_basic_map(map
, bmap2
);
8087 isl_basic_map_free(bmap1
);
8088 isl_basic_map_free(bmap2
);
8092 struct isl_set
*isl_basic_set_union(
8093 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8095 return (struct isl_set
*)isl_basic_map_union(
8096 (struct isl_basic_map
*)bset1
,
8097 (struct isl_basic_map
*)bset2
);
8100 /* Order divs such that any div only depends on previous divs */
8101 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
8109 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8111 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8113 if (isl_int_is_zero(bmap
->div
[i
][0]))
8115 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8119 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8125 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8127 return (struct isl_basic_set
*)
8128 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
8131 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8138 for (i
= 0; i
< map
->n
; ++i
) {
8139 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8150 /* Apply the expansion computed by isl_merge_divs.
8151 * The expansion itself is given by "exp" while the resulting
8152 * list of divs is given by "div".
8154 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8155 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8160 bset
= isl_basic_set_cow(bset
);
8164 if (div
->n_row
< bset
->n_div
)
8165 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8166 "not an expansion", goto error
);
8168 n_div
= bset
->n_div
;
8169 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
8170 div
->n_row
- n_div
, 0,
8171 2 * (div
->n_row
- n_div
));
8173 for (i
= n_div
; i
< div
->n_row
; ++i
)
8174 if (isl_basic_set_alloc_div(bset
) < 0)
8178 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
8179 if (j
>= 0 && exp
[j
] == i
) {
8181 isl_basic_map_swap_div(bset
, i
, j
);
8184 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
8185 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
8193 isl_basic_set_free(bset
);
8198 /* Look for a div in dst that corresponds to the div "div" in src.
8199 * The divs before "div" in src and dst are assumed to be the same.
8201 * Returns -1 if no corresponding div was found and the position
8202 * of the corresponding div in dst otherwise.
8204 static int find_div(struct isl_basic_map
*dst
,
8205 struct isl_basic_map
*src
, unsigned div
)
8209 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8211 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8212 for (i
= div
; i
< dst
->n_div
; ++i
)
8213 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8214 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8215 dst
->n_div
- div
) == -1)
8220 struct isl_basic_map
*isl_basic_map_align_divs(
8221 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
8229 if (src
->n_div
== 0)
8232 for (i
= 0; i
< src
->n_div
; ++i
)
8233 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
8235 src
= isl_basic_map_order_divs(src
);
8236 dst
= isl_basic_map_cow(dst
);
8239 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
8240 src
->n_div
, 0, 2 * src
->n_div
);
8243 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8244 for (i
= 0; i
< src
->n_div
; ++i
) {
8245 int j
= find_div(dst
, src
, i
);
8247 j
= isl_basic_map_alloc_div(dst
);
8250 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8251 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8252 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8256 isl_basic_map_swap_div(dst
, i
, j
);
8260 isl_basic_map_free(dst
);
8264 struct isl_basic_set
*isl_basic_set_align_divs(
8265 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8267 return (struct isl_basic_set
*)isl_basic_map_align_divs(
8268 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
8271 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8279 map
= isl_map_compute_divs(map
);
8280 map
= isl_map_cow(map
);
8284 for (i
= 1; i
< map
->n
; ++i
)
8285 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8286 for (i
= 1; i
< map
->n
; ++i
) {
8287 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8289 return isl_map_free(map
);
8292 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8296 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8298 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
8301 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8302 __isl_take isl_map
*map
)
8306 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8307 map
= isl_map_intersect_domain(map
, set
);
8308 set
= isl_map_range(map
);
8316 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8317 __isl_take isl_map
*map
)
8319 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8322 /* There is no need to cow as removing empty parts doesn't change
8323 * the meaning of the set.
8325 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8332 for (i
= map
->n
- 1; i
>= 0; --i
)
8333 remove_if_empty(map
, i
);
8338 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8340 return (struct isl_set
*)
8341 isl_map_remove_empty_parts((struct isl_map
*)set
);
8344 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8346 struct isl_basic_map
*bmap
;
8347 if (!map
|| map
->n
== 0)
8349 bmap
= map
->p
[map
->n
-1];
8350 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8351 return isl_basic_map_copy(bmap
);
8354 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8356 return (struct isl_basic_set
*)
8357 isl_map_copy_basic_map((struct isl_map
*)set
);
8360 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8361 __isl_keep isl_basic_map
*bmap
)
8367 for (i
= map
->n
-1; i
>= 0; --i
) {
8368 if (map
->p
[i
] != bmap
)
8370 map
= isl_map_cow(map
);
8373 isl_basic_map_free(map
->p
[i
]);
8374 if (i
!= map
->n
-1) {
8375 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8376 map
->p
[i
] = map
->p
[map
->n
-1];
8387 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8388 struct isl_basic_set
*bset
)
8390 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8391 (struct isl_basic_map
*)bset
);
8394 /* Given two basic sets bset1 and bset2, compute the maximal difference
8395 * between the values of dimension pos in bset1 and those in bset2
8396 * for any common value of the parameters and dimensions preceding pos.
8398 static enum isl_lp_result
basic_set_maximal_difference_at(
8399 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8400 int pos
, isl_int
*opt
)
8403 struct isl_basic_map
*bmap1
= NULL
;
8404 struct isl_basic_map
*bmap2
= NULL
;
8405 struct isl_ctx
*ctx
;
8406 struct isl_vec
*obj
;
8409 unsigned dim1
, dim2
;
8410 enum isl_lp_result res
;
8412 if (!bset1
|| !bset2
)
8413 return isl_lp_error
;
8415 nparam
= isl_basic_set_n_param(bset1
);
8416 dim1
= isl_basic_set_n_dim(bset1
);
8417 dim2
= isl_basic_set_n_dim(bset2
);
8418 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8419 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8420 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8421 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8422 if (!bmap1
|| !bmap2
)
8424 bmap1
= isl_basic_map_cow(bmap1
);
8425 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8426 pos
, (dim1
- pos
) + (dim2
- pos
),
8427 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8428 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8431 total
= isl_basic_map_total_dim(bmap1
);
8433 obj
= isl_vec_alloc(ctx
, 1 + total
);
8436 isl_seq_clr(obj
->block
.data
, 1 + total
);
8437 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8438 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8439 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8441 isl_basic_map_free(bmap1
);
8445 isl_basic_map_free(bmap2
);
8447 isl_basic_map_free(bmap1
);
8448 return isl_lp_error
;
8451 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8452 * for any common value of the parameters and dimensions preceding pos
8453 * in both basic sets, the values of dimension pos in bset1 are
8454 * smaller or larger than those in bset2.
8457 * 1 if bset1 follows bset2
8458 * -1 if bset1 precedes bset2
8459 * 0 if bset1 and bset2 are incomparable
8460 * -2 if some error occurred.
8462 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8463 struct isl_basic_set
*bset2
, int pos
)
8466 enum isl_lp_result res
;
8471 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8473 if (res
== isl_lp_empty
)
8475 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8476 res
== isl_lp_unbounded
)
8478 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8487 /* Given two basic sets bset1 and bset2, check whether
8488 * for any common value of the parameters and dimensions preceding pos
8489 * there is a value of dimension pos in bset1 that is larger
8490 * than a value of the same dimension in bset2.
8493 * 1 if there exists such a pair
8494 * 0 if there is no such pair, but there is a pair of equal values
8496 * -2 if some error occurred.
8498 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8499 __isl_keep isl_basic_set
*bset2
, int pos
)
8502 enum isl_lp_result res
;
8507 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8509 if (res
== isl_lp_empty
)
8511 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8512 res
== isl_lp_unbounded
)
8514 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8516 else if (res
== isl_lp_ok
)
8525 /* Given two sets set1 and set2, check whether
8526 * for any common value of the parameters and dimensions preceding pos
8527 * there is a value of dimension pos in set1 that is larger
8528 * than a value of the same dimension in set2.
8531 * 1 if there exists such a pair
8532 * 0 if there is no such pair, but there is a pair of equal values
8534 * -2 if some error occurred.
8536 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8537 __isl_keep isl_set
*set2
, int pos
)
8545 for (i
= 0; i
< set1
->n
; ++i
)
8546 for (j
= 0; j
< set2
->n
; ++j
) {
8548 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8549 if (f
== 1 || f
== -2)
8558 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8559 unsigned pos
, isl_int
*val
)
8567 total
= isl_basic_map_total_dim(bmap
);
8568 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8569 for (; d
+1 > pos
; --d
)
8570 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8574 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8576 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8578 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8581 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8587 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8588 unsigned pos
, isl_int
*val
)
8600 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8603 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8604 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8605 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8606 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8610 isl_int_set(*val
, v
);
8616 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8617 unsigned pos
, isl_int
*val
)
8619 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8623 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8626 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8629 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8630 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8632 if (pos
>= isl_basic_map_dim(bmap
, type
))
8634 return isl_basic_map_plain_has_fixed_var(bmap
,
8635 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8638 /* If "bmap" obviously lies on a hyperplane where the given dimension
8639 * has a fixed value, then return that value.
8640 * Otherwise return NaN.
8642 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8643 __isl_keep isl_basic_map
*bmap
,
8644 enum isl_dim_type type
, unsigned pos
)
8652 ctx
= isl_basic_map_get_ctx(bmap
);
8653 v
= isl_val_alloc(ctx
);
8656 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8658 return isl_val_free(v
);
8660 isl_int_set_si(v
->d
, 1);
8664 return isl_val_nan(ctx
);
8667 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8668 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8670 if (pos
>= isl_map_dim(map
, type
))
8672 return isl_map_plain_has_fixed_var(map
,
8673 map_offset(map
, type
) - 1 + pos
, val
);
8676 /* If "map" obviously lies on a hyperplane where the given dimension
8677 * has a fixed value, then return that value.
8678 * Otherwise return NaN.
8680 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8681 enum isl_dim_type type
, unsigned pos
)
8689 ctx
= isl_map_get_ctx(map
);
8690 v
= isl_val_alloc(ctx
);
8693 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8695 return isl_val_free(v
);
8697 isl_int_set_si(v
->d
, 1);
8701 return isl_val_nan(ctx
);
8704 /* If "set" obviously lies on a hyperplane where the given dimension
8705 * has a fixed value, then return that value.
8706 * Otherwise return NaN.
8708 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8709 enum isl_dim_type type
, unsigned pos
)
8711 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8714 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8715 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8717 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8720 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8721 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8723 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8726 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8727 * then return this fixed value in *val.
8729 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8730 unsigned dim
, isl_int
*val
)
8732 return isl_basic_set_plain_has_fixed_var(bset
,
8733 isl_basic_set_n_param(bset
) + dim
, val
);
8736 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8737 * then return this fixed value in *val.
8739 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8740 unsigned dim
, isl_int
*val
)
8742 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8745 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8746 unsigned dim
, isl_int
*val
)
8748 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8751 /* Check if input variable in has fixed value and if so and if val is not NULL,
8752 * then return this fixed value in *val.
8754 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8755 unsigned in
, isl_int
*val
)
8757 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8760 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8761 * and if val is not NULL, then return this lower bound in *val.
8763 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8764 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8766 int i
, i_eq
= -1, i_ineq
= -1;
8773 total
= isl_basic_set_total_dim(bset
);
8774 nparam
= isl_basic_set_n_param(bset
);
8775 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8776 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8782 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8783 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8785 if (i_eq
!= -1 || i_ineq
!= -1)
8789 if (i_eq
== -1 && i_ineq
== -1)
8791 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8792 /* The coefficient should always be one due to normalization. */
8793 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8795 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8797 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8798 total
- nparam
- dim
- 1) != -1)
8801 isl_int_neg(*val
, c
[0]);
8805 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8806 unsigned dim
, isl_int
*val
)
8818 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8822 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8824 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8825 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8827 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8831 isl_int_set(*val
, v
);
8842 /* uset_gist depends on constraints without existentially quantified
8843 * variables sorting first.
8845 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8847 const struct constraint
*c1
= (const struct constraint
*)p1
;
8848 const struct constraint
*c2
= (const struct constraint
*)p2
;
8850 unsigned size
= isl_min(c1
->size
, c2
->size
);
8852 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8853 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8858 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8861 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8862 struct isl_basic_map
*bmap
)
8865 struct constraint
*c
;
8870 if (bmap
->n_ineq
== 0)
8872 total
= isl_basic_map_total_dim(bmap
);
8873 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8876 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8878 c
[i
].c
= bmap
->ineq
[i
];
8880 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8881 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8882 bmap
->ineq
[i
] = c
[i
].c
;
8886 isl_basic_map_free(bmap
);
8890 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8891 __isl_take isl_basic_set
*bset
)
8893 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8894 (struct isl_basic_map
*)bset
);
8897 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8901 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8903 bmap
= isl_basic_map_remove_redundancies(bmap
);
8904 bmap
= isl_basic_map_sort_constraints(bmap
);
8906 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8910 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8912 return (struct isl_basic_set
*)isl_basic_map_normalize(
8913 (struct isl_basic_map
*)bset
);
8916 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8917 const __isl_keep isl_basic_map
*bmap2
)
8924 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8925 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8926 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8927 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8928 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8929 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8930 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8931 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8932 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8933 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8934 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8936 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8938 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8940 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8941 return bmap1
->n_eq
- bmap2
->n_eq
;
8942 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8943 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8944 if (bmap1
->n_div
!= bmap2
->n_div
)
8945 return bmap1
->n_div
- bmap2
->n_div
;
8946 total
= isl_basic_map_total_dim(bmap1
);
8947 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8948 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8952 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8953 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8957 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8958 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8965 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8966 const __isl_keep isl_basic_set
*bset2
)
8968 return isl_basic_map_plain_cmp(bset1
, bset2
);
8971 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8977 if (set1
->n
!= set2
->n
)
8978 return set1
->n
- set2
->n
;
8980 for (i
= 0; i
< set1
->n
; ++i
) {
8981 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8989 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8990 __isl_keep isl_basic_map
*bmap2
)
8992 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8995 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8996 __isl_keep isl_basic_set
*bset2
)
8998 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8999 (isl_basic_map
*)bset2
);
9002 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9004 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
9005 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
9007 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9010 /* We normalize in place, but if anything goes wrong we need
9011 * to return NULL, so we need to make sure we don't change the
9012 * meaning of any possible other copies of map.
9014 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
9017 struct isl_basic_map
*bmap
;
9021 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9023 for (i
= 0; i
< map
->n
; ++i
) {
9024 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9027 isl_basic_map_free(map
->p
[i
]);
9030 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9031 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9032 map
= isl_map_remove_empty_parts(map
);
9035 for (i
= map
->n
- 1; i
>= 1; --i
) {
9036 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
9038 isl_basic_map_free(map
->p
[i
-1]);
9039 for (j
= i
; j
< map
->n
; ++j
)
9040 map
->p
[j
-1] = map
->p
[j
];
9050 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9052 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
9055 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
9065 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9068 map1
= isl_map_copy(map1
);
9069 map2
= isl_map_copy(map2
);
9070 map1
= isl_map_normalize(map1
);
9071 map2
= isl_map_normalize(map2
);
9074 equal
= map1
->n
== map2
->n
;
9075 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9076 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9089 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
9091 return isl_map_plain_is_equal(map1
, map2
);
9094 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9096 return isl_map_plain_is_equal((struct isl_map
*)set1
,
9097 (struct isl_map
*)set2
);
9100 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9102 return isl_set_plain_is_equal(set1
, set2
);
9105 /* Return an interval that ranges from min to max (inclusive)
9107 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
9108 isl_int min
, isl_int max
)
9111 struct isl_basic_set
*bset
= NULL
;
9113 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
9117 k
= isl_basic_set_alloc_inequality(bset
);
9120 isl_int_set_si(bset
->ineq
[k
][1], 1);
9121 isl_int_neg(bset
->ineq
[k
][0], min
);
9123 k
= isl_basic_set_alloc_inequality(bset
);
9126 isl_int_set_si(bset
->ineq
[k
][1], -1);
9127 isl_int_set(bset
->ineq
[k
][0], max
);
9131 isl_basic_set_free(bset
);
9135 /* Return the Cartesian product of the basic sets in list (in the given order).
9137 __isl_give isl_basic_set
*isl_basic_set_list_product(
9138 __isl_take
struct isl_basic_set_list
*list
)
9146 struct isl_basic_set
*product
= NULL
;
9150 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
9151 isl_assert(list
->ctx
, list
->p
[0], goto error
);
9152 nparam
= isl_basic_set_n_param(list
->p
[0]);
9153 dim
= isl_basic_set_n_dim(list
->p
[0]);
9154 extra
= list
->p
[0]->n_div
;
9155 n_eq
= list
->p
[0]->n_eq
;
9156 n_ineq
= list
->p
[0]->n_ineq
;
9157 for (i
= 1; i
< list
->n
; ++i
) {
9158 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9159 isl_assert(list
->ctx
,
9160 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9161 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9162 extra
+= list
->p
[i
]->n_div
;
9163 n_eq
+= list
->p
[i
]->n_eq
;
9164 n_ineq
+= list
->p
[i
]->n_ineq
;
9166 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9171 for (i
= 0; i
< list
->n
; ++i
) {
9172 isl_basic_set_add_constraints(product
,
9173 isl_basic_set_copy(list
->p
[i
]), dim
);
9174 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9176 isl_basic_set_list_free(list
);
9179 isl_basic_set_free(product
);
9180 isl_basic_set_list_free(list
);
9184 struct isl_basic_map
*isl_basic_map_product(
9185 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9187 isl_space
*dim_result
= NULL
;
9188 struct isl_basic_map
*bmap
;
9189 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9190 struct isl_dim_map
*dim_map1
, *dim_map2
;
9192 if (!bmap1
|| !bmap2
)
9195 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9196 bmap2
->dim
, isl_dim_param
), goto error
);
9197 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9198 isl_space_copy(bmap2
->dim
));
9200 in1
= isl_basic_map_n_in(bmap1
);
9201 in2
= isl_basic_map_n_in(bmap2
);
9202 out1
= isl_basic_map_n_out(bmap1
);
9203 out2
= isl_basic_map_n_out(bmap2
);
9204 nparam
= isl_basic_map_n_param(bmap1
);
9206 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9207 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9208 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9209 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9210 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9211 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9212 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9213 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9214 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9215 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9216 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9218 bmap
= isl_basic_map_alloc_space(dim_result
,
9219 bmap1
->n_div
+ bmap2
->n_div
,
9220 bmap1
->n_eq
+ bmap2
->n_eq
,
9221 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9222 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9223 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9224 bmap
= isl_basic_map_simplify(bmap
);
9225 return isl_basic_map_finalize(bmap
);
9227 isl_basic_map_free(bmap1
);
9228 isl_basic_map_free(bmap2
);
9232 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9233 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9235 isl_basic_map
*prod
;
9237 prod
= isl_basic_map_product(bmap1
, bmap2
);
9238 prod
= isl_basic_map_flatten(prod
);
9242 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9243 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9245 return isl_basic_map_flat_range_product(bset1
, bset2
);
9248 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9249 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9251 isl_space
*space_result
= NULL
;
9252 isl_basic_map
*bmap
;
9253 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9254 struct isl_dim_map
*dim_map1
, *dim_map2
;
9256 if (!bmap1
|| !bmap2
)
9259 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9260 isl_space_copy(bmap2
->dim
));
9262 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9263 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9264 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9265 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9267 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9268 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9269 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9270 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9271 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9272 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9273 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9274 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9275 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9276 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9277 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9279 bmap
= isl_basic_map_alloc_space(space_result
,
9280 bmap1
->n_div
+ bmap2
->n_div
,
9281 bmap1
->n_eq
+ bmap2
->n_eq
,
9282 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9283 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9284 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9285 bmap
= isl_basic_map_simplify(bmap
);
9286 return isl_basic_map_finalize(bmap
);
9288 isl_basic_map_free(bmap1
);
9289 isl_basic_map_free(bmap2
);
9293 __isl_give isl_basic_map
*isl_basic_map_range_product(
9294 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9296 isl_space
*dim_result
= NULL
;
9297 isl_basic_map
*bmap
;
9298 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9299 struct isl_dim_map
*dim_map1
, *dim_map2
;
9301 if (!bmap1
|| !bmap2
)
9304 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9305 bmap2
->dim
, isl_dim_param
))
9306 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9307 "parameters don't match", goto error
);
9309 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9310 isl_space_copy(bmap2
->dim
));
9312 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9313 out1
= isl_basic_map_n_out(bmap1
);
9314 out2
= isl_basic_map_n_out(bmap2
);
9315 nparam
= isl_basic_map_n_param(bmap1
);
9317 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9318 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9319 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9320 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9321 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9322 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9323 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9324 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9325 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9326 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9327 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9329 bmap
= isl_basic_map_alloc_space(dim_result
,
9330 bmap1
->n_div
+ bmap2
->n_div
,
9331 bmap1
->n_eq
+ bmap2
->n_eq
,
9332 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9333 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9334 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9335 bmap
= isl_basic_map_simplify(bmap
);
9336 return isl_basic_map_finalize(bmap
);
9338 isl_basic_map_free(bmap1
);
9339 isl_basic_map_free(bmap2
);
9343 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9344 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9346 isl_basic_map
*prod
;
9348 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9349 prod
= isl_basic_map_flatten_range(prod
);
9353 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9354 __isl_take isl_map
*map2
,
9355 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
9356 __isl_take isl_space
*right
),
9357 __isl_give isl_basic_map
*(*basic_map_product
)(
9358 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
9361 struct isl_map
*result
;
9367 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9368 map2
->dim
, isl_dim_param
), goto error
);
9370 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9371 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9372 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9374 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
9375 isl_space_copy(map2
->dim
)),
9376 map1
->n
* map2
->n
, flags
);
9379 for (i
= 0; i
< map1
->n
; ++i
)
9380 for (j
= 0; j
< map2
->n
; ++j
) {
9381 struct isl_basic_map
*part
;
9382 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9383 isl_basic_map_copy(map2
->p
[j
]));
9384 if (isl_basic_map_is_empty(part
))
9385 isl_basic_map_free(part
);
9387 result
= isl_map_add_basic_map(result
, part
);
9400 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9402 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9403 __isl_take isl_map
*map2
)
9405 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
9408 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9409 __isl_take isl_map
*map2
)
9411 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9414 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9416 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9417 __isl_take isl_map
*map2
)
9421 prod
= isl_map_product(map1
, map2
);
9422 prod
= isl_map_flatten(prod
);
9426 /* Given two set A and B, construct its Cartesian product A x B.
9428 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9430 return isl_map_range_product(set1
, set2
);
9433 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9434 __isl_take isl_set
*set2
)
9436 return isl_map_flat_range_product(set1
, set2
);
9439 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9441 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9442 __isl_take isl_map
*map2
)
9444 return map_product(map1
, map2
, &isl_space_domain_product
,
9445 &isl_basic_map_domain_product
);
9448 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9450 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9451 __isl_take isl_map
*map2
)
9453 return map_product(map1
, map2
, &isl_space_range_product
,
9454 &isl_basic_map_range_product
);
9457 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9458 __isl_take isl_map
*map2
)
9460 return isl_map_align_params_map_map_and(map1
, map2
,
9461 &map_domain_product_aligned
);
9464 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9465 __isl_take isl_map
*map2
)
9467 return isl_map_align_params_map_map_and(map1
, map2
,
9468 &map_range_product_aligned
);
9471 /* Given a map A -> [B -> C], extract the map A -> B.
9473 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
9480 if (!isl_space_range_is_wrapping(map
->dim
))
9481 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9482 "range is not a product", return isl_map_free(map
));
9484 space
= isl_map_get_space(map
);
9485 total
= isl_space_dim(space
, isl_dim_out
);
9486 space
= isl_space_range_factor_domain(space
);
9487 keep
= isl_space_dim(space
, isl_dim_out
);
9488 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
9489 map
= isl_map_reset_space(map
, space
);
9494 /* Given a map A -> [B -> C], extract the map A -> C.
9496 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
9503 if (!isl_space_range_is_wrapping(map
->dim
))
9504 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9505 "range is not a product", return isl_map_free(map
));
9507 space
= isl_map_get_space(map
);
9508 total
= isl_space_dim(space
, isl_dim_out
);
9509 space
= isl_space_range_factor_range(space
);
9510 keep
= isl_space_dim(space
, isl_dim_out
);
9511 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
9512 map
= isl_map_reset_space(map
, space
);
9517 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9519 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9520 __isl_take isl_map
*map2
)
9524 prod
= isl_map_domain_product(map1
, map2
);
9525 prod
= isl_map_flatten_domain(prod
);
9529 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9531 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9532 __isl_take isl_map
*map2
)
9536 prod
= isl_map_range_product(map1
, map2
);
9537 prod
= isl_map_flatten_range(prod
);
9541 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9544 uint32_t hash
= isl_hash_init();
9549 bmap
= isl_basic_map_copy(bmap
);
9550 bmap
= isl_basic_map_normalize(bmap
);
9553 total
= isl_basic_map_total_dim(bmap
);
9554 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9555 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9557 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9558 isl_hash_hash(hash
, c_hash
);
9560 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9561 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9563 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9564 isl_hash_hash(hash
, c_hash
);
9566 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9567 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9569 if (isl_int_is_zero(bmap
->div
[i
][0]))
9571 isl_hash_byte(hash
, i
& 0xFF);
9572 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9573 isl_hash_hash(hash
, c_hash
);
9575 isl_basic_map_free(bmap
);
9579 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9581 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9584 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9591 map
= isl_map_copy(map
);
9592 map
= isl_map_normalize(map
);
9596 hash
= isl_hash_init();
9597 for (i
= 0; i
< map
->n
; ++i
) {
9599 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9600 isl_hash_hash(hash
, bmap_hash
);
9608 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9610 return isl_map_get_hash((isl_map
*)set
);
9613 /* Check if the value for dimension dim is completely determined
9614 * by the values of the other parameters and variables.
9615 * That is, check if dimension dim is involved in an equality.
9617 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9624 nparam
= isl_basic_set_n_param(bset
);
9625 for (i
= 0; i
< bset
->n_eq
; ++i
)
9626 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9631 /* Check if the value for dimension dim is completely determined
9632 * by the values of the other parameters and variables.
9633 * That is, check if dimension dim is involved in an equality
9634 * for each of the subsets.
9636 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
9642 for (i
= 0; i
< set
->n
; ++i
) {
9644 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
9651 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9653 return set
? set
->n
: 0;
9656 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9657 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9664 for (i
= 0; i
< map
->n
; ++i
)
9665 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9671 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9672 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9679 for (i
= 0; i
< set
->n
; ++i
)
9680 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9686 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9693 bset
= isl_basic_set_cow(bset
);
9697 dim
= isl_basic_set_get_space(bset
);
9698 dim
= isl_space_lift(dim
, bset
->n_div
);
9701 isl_space_free(bset
->dim
);
9703 bset
->extra
-= bset
->n_div
;
9706 bset
= isl_basic_set_finalize(bset
);
9710 isl_basic_set_free(bset
);
9714 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9720 set
= isl_set_align_divs(set
);
9725 set
= isl_set_cow(set
);
9729 n_div
= set
->p
[0]->n_div
;
9730 dim
= isl_set_get_space(set
);
9731 dim
= isl_space_lift(dim
, n_div
);
9734 isl_space_free(set
->dim
);
9737 for (i
= 0; i
< set
->n
; ++i
) {
9738 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9749 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9752 struct isl_basic_map
*bmap
;
9759 set
= isl_set_align_divs(set
);
9764 dim
= isl_set_get_space(set
);
9765 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9767 return isl_map_identity(isl_space_map_from_set(dim
));
9770 n_div
= set
->p
[0]->n_div
;
9771 dim
= isl_space_map_from_set(dim
);
9772 n_param
= isl_space_dim(dim
, isl_dim_param
);
9773 n_set
= isl_space_dim(dim
, isl_dim_in
);
9774 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9775 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9776 for (i
= 0; i
< n_set
; ++i
)
9777 bmap
= var_equal(bmap
, i
);
9779 total
= n_param
+ n_set
+ n_set
+ n_div
;
9780 for (i
= 0; i
< n_div
; ++i
) {
9781 k
= isl_basic_map_alloc_inequality(bmap
);
9784 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9785 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9786 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9787 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9788 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9789 set
->p
[0]->div
[i
][0]);
9791 l
= isl_basic_map_alloc_inequality(bmap
);
9794 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9795 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9796 set
->p
[0]->div
[i
][0]);
9797 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9801 bmap
= isl_basic_map_simplify(bmap
);
9802 bmap
= isl_basic_map_finalize(bmap
);
9803 return isl_map_from_basic_map(bmap
);
9806 isl_basic_map_free(bmap
);
9810 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9818 dim
= isl_basic_set_total_dim(bset
);
9819 size
+= bset
->n_eq
* (1 + dim
);
9820 size
+= bset
->n_ineq
* (1 + dim
);
9821 size
+= bset
->n_div
* (2 + dim
);
9826 int isl_set_size(__isl_keep isl_set
*set
)
9834 for (i
= 0; i
< set
->n
; ++i
)
9835 size
+= isl_basic_set_size(set
->p
[i
]);
9840 /* Check if there is any lower bound (if lower == 0) and/or upper
9841 * bound (if upper == 0) on the specified dim.
9843 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9844 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9851 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9853 pos
+= isl_basic_map_offset(bmap
, type
);
9855 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9856 if (isl_int_is_zero(bmap
->div
[i
][0]))
9858 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9862 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9863 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9866 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9867 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9874 return lower
&& upper
;
9877 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9878 enum isl_dim_type type
, unsigned pos
)
9880 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9883 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9884 enum isl_dim_type type
, unsigned pos
)
9886 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9889 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9890 enum isl_dim_type type
, unsigned pos
)
9892 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9895 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9896 enum isl_dim_type type
, unsigned pos
)
9903 for (i
= 0; i
< map
->n
; ++i
) {
9905 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9906 if (bounded
< 0 || !bounded
)
9913 /* Return 1 if the specified dim is involved in both an upper bound
9914 * and a lower bound.
9916 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9917 enum isl_dim_type type
, unsigned pos
)
9919 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9922 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9924 static int has_any_bound(__isl_keep isl_map
*map
,
9925 enum isl_dim_type type
, unsigned pos
,
9926 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9927 enum isl_dim_type type
, unsigned pos
))
9934 for (i
= 0; i
< map
->n
; ++i
) {
9936 bounded
= fn(map
->p
[i
], type
, pos
);
9937 if (bounded
< 0 || bounded
)
9944 /* Return 1 if the specified dim is involved in any lower bound.
9946 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9947 enum isl_dim_type type
, unsigned pos
)
9949 return has_any_bound(set
, type
, pos
,
9950 &isl_basic_map_dim_has_lower_bound
);
9953 /* Return 1 if the specified dim is involved in any upper bound.
9955 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9956 enum isl_dim_type type
, unsigned pos
)
9958 return has_any_bound(set
, type
, pos
,
9959 &isl_basic_map_dim_has_upper_bound
);
9962 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9964 static int has_bound(__isl_keep isl_map
*map
,
9965 enum isl_dim_type type
, unsigned pos
,
9966 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9967 enum isl_dim_type type
, unsigned pos
))
9974 for (i
= 0; i
< map
->n
; ++i
) {
9976 bounded
= fn(map
->p
[i
], type
, pos
);
9977 if (bounded
< 0 || !bounded
)
9984 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9986 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9987 enum isl_dim_type type
, unsigned pos
)
9989 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9992 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9994 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9995 enum isl_dim_type type
, unsigned pos
)
9997 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10000 /* For each of the "n" variables starting at "first", determine
10001 * the sign of the variable and put the results in the first "n"
10002 * elements of the array "signs".
10004 * 1 means that the variable is non-negative
10005 * -1 means that the variable is non-positive
10006 * 0 means the variable attains both positive and negative values.
10008 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10009 unsigned first
, unsigned n
, int *signs
)
10011 isl_vec
*bound
= NULL
;
10012 struct isl_tab
*tab
= NULL
;
10013 struct isl_tab_undo
*snap
;
10016 if (!bset
|| !signs
)
10019 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10020 tab
= isl_tab_from_basic_set(bset
, 0);
10021 if (!bound
|| !tab
)
10024 isl_seq_clr(bound
->el
, bound
->size
);
10025 isl_int_set_si(bound
->el
[0], -1);
10027 snap
= isl_tab_snap(tab
);
10028 for (i
= 0; i
< n
; ++i
) {
10031 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10032 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10034 empty
= tab
->empty
;
10035 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10036 if (isl_tab_rollback(tab
, snap
) < 0)
10044 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10045 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10047 empty
= tab
->empty
;
10048 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10049 if (isl_tab_rollback(tab
, snap
) < 0)
10052 signs
[i
] = empty
? -1 : 0;
10056 isl_vec_free(bound
);
10060 isl_vec_free(bound
);
10064 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10065 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10067 if (!bset
|| !signs
)
10069 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10072 first
+= pos(bset
->dim
, type
) - 1;
10073 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10076 /* Check if the given basic map is obviously single-valued.
10077 * In particular, for each output dimension, check that there is
10078 * an equality that defines the output dimension in terms of
10079 * earlier dimensions.
10081 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10091 total
= 1 + isl_basic_map_total_dim(bmap
);
10092 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10093 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10095 for (i
= 0; i
< n_out
; ++i
) {
10096 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10097 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
10099 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
10100 total
- (o_out
+ i
+ 1)) == -1)
10103 if (j
>= bmap
->n_eq
)
10110 /* Check if the given basic map is single-valued.
10111 * We simply compute
10115 * and check if the result is a subset of the identity mapping.
10117 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10120 isl_basic_map
*test
;
10124 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10128 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10129 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10131 space
= isl_basic_map_get_space(bmap
);
10132 space
= isl_space_map_from_set(isl_space_range(space
));
10133 id
= isl_basic_map_identity(space
);
10135 sv
= isl_basic_map_is_subset(test
, id
);
10137 isl_basic_map_free(test
);
10138 isl_basic_map_free(id
);
10143 /* Check if the given map is obviously single-valued.
10145 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10154 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10157 /* Check if the given map is single-valued.
10158 * We simply compute
10162 * and check if the result is a subset of the identity mapping.
10164 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
10171 sv
= isl_map_plain_is_single_valued(map
);
10175 test
= isl_map_reverse(isl_map_copy(map
));
10176 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10178 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10179 id
= isl_map_identity(dim
);
10181 sv
= isl_map_is_subset(test
, id
);
10183 isl_map_free(test
);
10189 int isl_map_is_injective(__isl_keep isl_map
*map
)
10193 map
= isl_map_copy(map
);
10194 map
= isl_map_reverse(map
);
10195 in
= isl_map_is_single_valued(map
);
10201 /* Check if the given map is obviously injective.
10203 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10207 map
= isl_map_copy(map
);
10208 map
= isl_map_reverse(map
);
10209 in
= isl_map_plain_is_single_valued(map
);
10215 int isl_map_is_bijective(__isl_keep isl_map
*map
)
10219 sv
= isl_map_is_single_valued(map
);
10223 return isl_map_is_injective(map
);
10226 int isl_set_is_singleton(__isl_keep isl_set
*set
)
10228 return isl_map_is_single_valued((isl_map
*)set
);
10231 int isl_map_is_translation(__isl_keep isl_map
*map
)
10236 delta
= isl_map_deltas(isl_map_copy(map
));
10237 ok
= isl_set_is_singleton(delta
);
10238 isl_set_free(delta
);
10243 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10245 if (isl_seq_first_non_zero(p
, pos
) != -1)
10247 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10252 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10261 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10264 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10265 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10266 for (j
= 0; j
< nvar
; ++j
) {
10267 int lower
= 0, upper
= 0;
10268 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10269 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10271 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10275 if (i
< bset
->n_eq
)
10277 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10278 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10280 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10282 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10287 if (!lower
|| !upper
)
10294 int isl_set_is_box(__isl_keep isl_set
*set
)
10301 return isl_basic_set_is_box(set
->p
[0]);
10304 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10309 return isl_space_is_wrapping(bset
->dim
);
10312 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
10317 return isl_space_is_wrapping(set
->dim
);
10320 /* Is the domain of "map" a wrapped relation?
10322 int isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
10327 return isl_space_domain_is_wrapping(map
->dim
);
10330 /* Is the range of "map" a wrapped relation?
10332 int isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
10337 return isl_space_range_is_wrapping(map
->dim
);
10340 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
10342 bmap
= isl_basic_map_cow(bmap
);
10346 bmap
->dim
= isl_space_wrap(bmap
->dim
);
10350 bmap
= isl_basic_map_finalize(bmap
);
10352 return (isl_basic_set
*)bmap
;
10354 isl_basic_map_free(bmap
);
10358 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
10362 map
= isl_map_cow(map
);
10366 for (i
= 0; i
< map
->n
; ++i
) {
10367 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
10371 map
->dim
= isl_space_wrap(map
->dim
);
10375 return (isl_set
*)map
;
10381 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
10383 bset
= isl_basic_set_cow(bset
);
10387 bset
->dim
= isl_space_unwrap(bset
->dim
);
10391 bset
= isl_basic_set_finalize(bset
);
10393 return (isl_basic_map
*)bset
;
10395 isl_basic_set_free(bset
);
10399 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
10406 if (!isl_set_is_wrapping(set
))
10407 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
10410 set
= isl_set_cow(set
);
10414 for (i
= 0; i
< set
->n
; ++i
) {
10415 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
10420 set
->dim
= isl_space_unwrap(set
->dim
);
10424 return (isl_map
*)set
;
10430 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
10431 enum isl_dim_type type
)
10436 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
10439 bmap
= isl_basic_map_cow(bmap
);
10443 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
10447 bmap
= isl_basic_map_finalize(bmap
);
10451 isl_basic_map_free(bmap
);
10455 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10456 enum isl_dim_type type
)
10463 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10466 map
= isl_map_cow(map
);
10470 for (i
= 0; i
< map
->n
; ++i
) {
10471 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10475 map
->dim
= isl_space_reset(map
->dim
, type
);
10485 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10490 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10493 bmap
= isl_basic_map_cow(bmap
);
10497 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10501 bmap
= isl_basic_map_finalize(bmap
);
10505 isl_basic_map_free(bmap
);
10509 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10511 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
10514 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10515 __isl_take isl_basic_map
*bmap
)
10520 if (!bmap
->dim
->nested
[0])
10523 bmap
= isl_basic_map_cow(bmap
);
10527 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10531 bmap
= isl_basic_map_finalize(bmap
);
10535 isl_basic_map_free(bmap
);
10539 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10540 __isl_take isl_basic_map
*bmap
)
10545 if (!bmap
->dim
->nested
[1])
10548 bmap
= isl_basic_map_cow(bmap
);
10552 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
10556 bmap
= isl_basic_map_finalize(bmap
);
10560 isl_basic_map_free(bmap
);
10564 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
10571 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
10574 map
= isl_map_cow(map
);
10578 for (i
= 0; i
< map
->n
; ++i
) {
10579 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
10583 map
->dim
= isl_space_flatten(map
->dim
);
10593 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
10595 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
10598 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
10600 isl_space
*dim
, *flat_dim
;
10603 dim
= isl_set_get_space(set
);
10604 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
10605 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
10606 map
= isl_map_intersect_domain(map
, set
);
10611 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
10618 if (!map
->dim
->nested
[0])
10621 map
= isl_map_cow(map
);
10625 for (i
= 0; i
< map
->n
; ++i
) {
10626 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
10630 map
->dim
= isl_space_flatten_domain(map
->dim
);
10640 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
10647 if (!map
->dim
->nested
[1])
10650 map
= isl_map_cow(map
);
10654 for (i
= 0; i
< map
->n
; ++i
) {
10655 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
10659 map
->dim
= isl_space_flatten_range(map
->dim
);
10669 /* Reorder the dimensions of "bmap" according to the given dim_map
10670 * and set the dimension specification to "dim".
10672 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
10673 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
10675 isl_basic_map
*res
;
10678 bmap
= isl_basic_map_cow(bmap
);
10679 if (!bmap
|| !dim
|| !dim_map
)
10682 flags
= bmap
->flags
;
10683 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
10684 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
10685 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
10686 res
= isl_basic_map_alloc_space(dim
,
10687 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
10688 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
10690 res
->flags
= flags
;
10691 res
= isl_basic_map_finalize(res
);
10695 isl_basic_map_free(bmap
);
10696 isl_space_free(dim
);
10700 /* Reorder the dimensions of "map" according to given reordering.
10702 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
10703 __isl_take isl_reordering
*r
)
10706 struct isl_dim_map
*dim_map
;
10708 map
= isl_map_cow(map
);
10709 dim_map
= isl_dim_map_from_reordering(r
);
10710 if (!map
|| !r
|| !dim_map
)
10713 for (i
= 0; i
< map
->n
; ++i
) {
10714 struct isl_dim_map
*dim_map_i
;
10716 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10718 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10719 isl_space_copy(r
->dim
), dim_map_i
);
10725 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10727 isl_reordering_free(r
);
10733 isl_reordering_free(r
);
10737 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10738 __isl_take isl_reordering
*r
)
10740 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10743 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10744 __isl_take isl_space
*model
)
10748 if (!map
|| !model
)
10751 ctx
= isl_space_get_ctx(model
);
10752 if (!isl_space_has_named_params(model
))
10753 isl_die(ctx
, isl_error_invalid
,
10754 "model has unnamed parameters", goto error
);
10755 if (!isl_space_has_named_params(map
->dim
))
10756 isl_die(ctx
, isl_error_invalid
,
10757 "relation has unnamed parameters", goto error
);
10758 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10759 isl_reordering
*exp
;
10761 model
= isl_space_drop_dims(model
, isl_dim_in
,
10762 0, isl_space_dim(model
, isl_dim_in
));
10763 model
= isl_space_drop_dims(model
, isl_dim_out
,
10764 0, isl_space_dim(model
, isl_dim_out
));
10765 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10766 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10767 map
= isl_map_realign(map
, exp
);
10770 isl_space_free(model
);
10773 isl_space_free(model
);
10778 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10779 __isl_take isl_space
*model
)
10781 return isl_map_align_params(set
, model
);
10784 /* Align the parameters of "bmap" to those of "model", introducing
10785 * additional parameters if needed.
10787 __isl_give isl_basic_map
*isl_basic_map_align_params(
10788 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10792 if (!bmap
|| !model
)
10795 ctx
= isl_space_get_ctx(model
);
10796 if (!isl_space_has_named_params(model
))
10797 isl_die(ctx
, isl_error_invalid
,
10798 "model has unnamed parameters", goto error
);
10799 if (!isl_space_has_named_params(bmap
->dim
))
10800 isl_die(ctx
, isl_error_invalid
,
10801 "relation has unnamed parameters", goto error
);
10802 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10803 isl_reordering
*exp
;
10804 struct isl_dim_map
*dim_map
;
10806 model
= isl_space_drop_dims(model
, isl_dim_in
,
10807 0, isl_space_dim(model
, isl_dim_in
));
10808 model
= isl_space_drop_dims(model
, isl_dim_out
,
10809 0, isl_space_dim(model
, isl_dim_out
));
10810 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10811 exp
= isl_reordering_extend_space(exp
,
10812 isl_basic_map_get_space(bmap
));
10813 dim_map
= isl_dim_map_from_reordering(exp
);
10814 bmap
= isl_basic_map_realign(bmap
,
10815 exp
? isl_space_copy(exp
->dim
) : NULL
,
10816 isl_dim_map_extend(dim_map
, bmap
));
10817 isl_reordering_free(exp
);
10821 isl_space_free(model
);
10824 isl_space_free(model
);
10825 isl_basic_map_free(bmap
);
10829 /* Align the parameters of "bset" to those of "model", introducing
10830 * additional parameters if needed.
10832 __isl_give isl_basic_set
*isl_basic_set_align_params(
10833 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10835 return isl_basic_map_align_params(bset
, model
);
10838 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10839 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10840 enum isl_dim_type c2
, enum isl_dim_type c3
,
10841 enum isl_dim_type c4
, enum isl_dim_type c5
)
10843 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10844 struct isl_mat
*mat
;
10850 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10851 isl_basic_map_total_dim(bmap
) + 1);
10854 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10855 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10856 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10857 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10858 isl_int_set(mat
->row
[i
][pos
],
10859 bmap
->eq
[i
][off
+ k
]);
10867 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10868 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10869 enum isl_dim_type c2
, enum isl_dim_type c3
,
10870 enum isl_dim_type c4
, enum isl_dim_type c5
)
10872 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10873 struct isl_mat
*mat
;
10879 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10880 isl_basic_map_total_dim(bmap
) + 1);
10883 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10884 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10885 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10886 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10887 isl_int_set(mat
->row
[i
][pos
],
10888 bmap
->ineq
[i
][off
+ k
]);
10896 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10897 __isl_take isl_space
*dim
,
10898 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10899 enum isl_dim_type c2
, enum isl_dim_type c3
,
10900 enum isl_dim_type c4
, enum isl_dim_type c5
)
10902 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10903 isl_basic_map
*bmap
;
10909 if (!dim
|| !eq
|| !ineq
)
10912 if (eq
->n_col
!= ineq
->n_col
)
10913 isl_die(dim
->ctx
, isl_error_invalid
,
10914 "equalities and inequalities matrices should have "
10915 "same number of columns", goto error
);
10917 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10919 if (eq
->n_col
< total
)
10920 isl_die(dim
->ctx
, isl_error_invalid
,
10921 "number of columns too small", goto error
);
10923 extra
= eq
->n_col
- total
;
10925 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10926 eq
->n_row
, ineq
->n_row
);
10929 for (i
= 0; i
< extra
; ++i
) {
10930 k
= isl_basic_map_alloc_div(bmap
);
10933 isl_int_set_si(bmap
->div
[k
][0], 0);
10935 for (i
= 0; i
< eq
->n_row
; ++i
) {
10936 l
= isl_basic_map_alloc_equality(bmap
);
10939 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10940 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10941 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10942 isl_int_set(bmap
->eq
[l
][off
+ k
],
10948 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10949 l
= isl_basic_map_alloc_inequality(bmap
);
10952 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10953 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10954 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10955 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10956 ineq
->row
[i
][pos
]);
10962 isl_space_free(dim
);
10964 isl_mat_free(ineq
);
10966 bmap
= isl_basic_map_simplify(bmap
);
10967 return isl_basic_map_finalize(bmap
);
10969 isl_space_free(dim
);
10971 isl_mat_free(ineq
);
10975 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10976 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10977 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10979 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10980 c1
, c2
, c3
, c4
, isl_dim_in
);
10983 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10984 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10985 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10987 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10988 c1
, c2
, c3
, c4
, isl_dim_in
);
10991 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10992 __isl_take isl_space
*dim
,
10993 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10994 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10996 return (isl_basic_set
*)
10997 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10998 c1
, c2
, c3
, c4
, isl_dim_in
);
11001 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11006 return isl_space_can_zip(bmap
->dim
);
11009 int isl_map_can_zip(__isl_keep isl_map
*map
)
11014 return isl_space_can_zip(map
->dim
);
11017 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11018 * (A -> C) -> (B -> D).
11020 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11029 if (!isl_basic_map_can_zip(bmap
))
11030 isl_die(bmap
->ctx
, isl_error_invalid
,
11031 "basic map cannot be zipped", goto error
);
11032 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11033 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11034 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11035 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11036 bmap
= isl_basic_map_cow(bmap
);
11037 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11040 bmap
->dim
= isl_space_zip(bmap
->dim
);
11045 isl_basic_map_free(bmap
);
11049 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11050 * (A -> C) -> (B -> D).
11052 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11059 if (!isl_map_can_zip(map
))
11060 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11063 map
= isl_map_cow(map
);
11067 for (i
= 0; i
< map
->n
; ++i
) {
11068 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11073 map
->dim
= isl_space_zip(map
->dim
);
11083 /* Can we apply isl_basic_map_curry to "bmap"?
11084 * That is, does it have a nested relation in its domain?
11086 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11091 return isl_space_can_curry(bmap
->dim
);
11094 /* Can we apply isl_map_curry to "map"?
11095 * That is, does it have a nested relation in its domain?
11097 int isl_map_can_curry(__isl_keep isl_map
*map
)
11102 return isl_space_can_curry(map
->dim
);
11105 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11108 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11114 if (!isl_basic_map_can_curry(bmap
))
11115 isl_die(bmap
->ctx
, isl_error_invalid
,
11116 "basic map cannot be curried", goto error
);
11117 bmap
= isl_basic_map_cow(bmap
);
11120 bmap
->dim
= isl_space_curry(bmap
->dim
);
11125 isl_basic_map_free(bmap
);
11129 /* Given a map (A -> B) -> C, return the corresponding map
11132 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11139 if (!isl_map_can_curry(map
))
11140 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
11143 map
= isl_map_cow(map
);
11147 for (i
= 0; i
< map
->n
; ++i
) {
11148 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
11153 map
->dim
= isl_space_curry(map
->dim
);
11163 /* Can we apply isl_basic_map_uncurry to "bmap"?
11164 * That is, does it have a nested relation in its domain?
11166 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11171 return isl_space_can_uncurry(bmap
->dim
);
11174 /* Can we apply isl_map_uncurry to "map"?
11175 * That is, does it have a nested relation in its domain?
11177 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
11182 return isl_space_can_uncurry(map
->dim
);
11185 /* Given a basic map A -> (B -> C), return the corresponding basic map
11188 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11194 if (!isl_basic_map_can_uncurry(bmap
))
11195 isl_die(bmap
->ctx
, isl_error_invalid
,
11196 "basic map cannot be uncurried",
11197 return isl_basic_map_free(bmap
));
11198 bmap
= isl_basic_map_cow(bmap
);
11201 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11203 return isl_basic_map_free(bmap
);
11207 /* Given a map A -> (B -> C), return the corresponding map
11210 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11217 if (!isl_map_can_uncurry(map
))
11218 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
11219 return isl_map_free(map
));
11221 map
= isl_map_cow(map
);
11225 for (i
= 0; i
< map
->n
; ++i
) {
11226 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
11228 return isl_map_free(map
);
11231 map
->dim
= isl_space_uncurry(map
->dim
);
11233 return isl_map_free(map
);
11238 /* Construct a basic map mapping the domain of the affine expression
11239 * to a one-dimensional range prescribed by the affine expression.
11241 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11245 isl_local_space
*ls
;
11246 isl_basic_map
*bmap
;
11251 ls
= isl_aff_get_local_space(aff
);
11252 bmap
= isl_basic_map_from_local_space(ls
);
11253 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11254 k
= isl_basic_map_alloc_equality(bmap
);
11258 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11259 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11260 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11261 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11262 aff
->v
->size
- (pos
+ 1));
11265 bmap
= isl_basic_map_finalize(bmap
);
11269 isl_basic_map_free(bmap
);
11273 /* Construct a map mapping the domain of the affine expression
11274 * to a one-dimensional range prescribed by the affine expression.
11276 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11278 isl_basic_map
*bmap
;
11280 bmap
= isl_basic_map_from_aff(aff
);
11281 return isl_map_from_basic_map(bmap
);
11284 /* Construct a basic map mapping the domain the multi-affine expression
11285 * to its range, with each dimension in the range equated to the
11286 * corresponding affine expression.
11288 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11289 __isl_take isl_multi_aff
*maff
)
11293 isl_basic_map
*bmap
;
11298 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11299 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11300 "invalid space", goto error
);
11302 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11303 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11305 for (i
= 0; i
< maff
->n
; ++i
) {
11307 isl_basic_map
*bmap_i
;
11309 aff
= isl_aff_copy(maff
->p
[i
]);
11310 bmap_i
= isl_basic_map_from_aff(aff
);
11312 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11315 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11317 isl_multi_aff_free(maff
);
11320 isl_multi_aff_free(maff
);
11324 /* Construct a map mapping the domain the multi-affine expression
11325 * to its range, with each dimension in the range equated to the
11326 * corresponding affine expression.
11328 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11330 isl_basic_map
*bmap
;
11332 bmap
= isl_basic_map_from_multi_aff(maff
);
11333 return isl_map_from_basic_map(bmap
);
11336 /* Construct a basic map mapping a domain in the given space to
11337 * to an n-dimensional range, with n the number of elements in the list,
11338 * where each coordinate in the range is prescribed by the
11339 * corresponding affine expression.
11340 * The domains of all affine expressions in the list are assumed to match
11343 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11344 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11348 isl_basic_map
*bmap
;
11353 dim
= isl_space_from_domain(domain_dim
);
11354 bmap
= isl_basic_map_universe(dim
);
11356 for (i
= 0; i
< list
->n
; ++i
) {
11358 isl_basic_map
*bmap_i
;
11360 aff
= isl_aff_copy(list
->p
[i
]);
11361 bmap_i
= isl_basic_map_from_aff(aff
);
11363 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11366 isl_aff_list_free(list
);
11370 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11371 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11373 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11376 /* Construct a basic map where the given dimensions are equal to each other.
11378 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11379 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11381 isl_basic_map
*bmap
= NULL
;
11387 if (pos1
>= isl_space_dim(space
, type1
))
11388 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11389 "index out of bounds", goto error
);
11390 if (pos2
>= isl_space_dim(space
, type2
))
11391 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11392 "index out of bounds", goto error
);
11394 if (type1
== type2
&& pos1
== pos2
)
11395 return isl_basic_map_universe(space
);
11397 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11398 i
= isl_basic_map_alloc_equality(bmap
);
11401 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11402 pos1
+= isl_basic_map_offset(bmap
, type1
);
11403 pos2
+= isl_basic_map_offset(bmap
, type2
);
11404 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11405 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11406 bmap
= isl_basic_map_finalize(bmap
);
11407 isl_space_free(space
);
11410 isl_space_free(space
);
11411 isl_basic_map_free(bmap
);
11415 /* Add a constraint imposing that the given two dimensions are equal.
11417 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
11418 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11422 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11424 bmap
= isl_basic_map_intersect(bmap
, eq
);
11429 /* Add a constraint imposing that the given two dimensions are equal.
11431 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
11432 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11434 isl_basic_map
*bmap
;
11436 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11438 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11443 /* Add a constraint imposing that the given two dimensions have opposite values.
11445 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
11446 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11448 isl_basic_map
*bmap
= NULL
;
11454 if (pos1
>= isl_map_dim(map
, type1
))
11455 isl_die(map
->ctx
, isl_error_invalid
,
11456 "index out of bounds", goto error
);
11457 if (pos2
>= isl_map_dim(map
, type2
))
11458 isl_die(map
->ctx
, isl_error_invalid
,
11459 "index out of bounds", goto error
);
11461 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11462 i
= isl_basic_map_alloc_equality(bmap
);
11465 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11466 pos1
+= isl_basic_map_offset(bmap
, type1
);
11467 pos2
+= isl_basic_map_offset(bmap
, type2
);
11468 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11469 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11470 bmap
= isl_basic_map_finalize(bmap
);
11472 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11476 isl_basic_map_free(bmap
);
11481 /* Construct a constraint imposing that the value of the first dimension is
11482 * greater than or equal to that of the second.
11484 static __isl_give isl_constraint
*constraint_order_ge(
11485 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
11486 enum isl_dim_type type2
, int pos2
)
11493 c
= isl_inequality_alloc(isl_local_space_from_space(space
));
11495 if (pos1
>= isl_constraint_dim(c
, type1
))
11496 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
11497 "index out of bounds", return isl_constraint_free(c
));
11498 if (pos2
>= isl_constraint_dim(c
, type2
))
11499 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
11500 "index out of bounds", return isl_constraint_free(c
));
11502 if (type1
== type2
&& pos1
== pos2
)
11505 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11506 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11511 /* Add a constraint imposing that the value of the first dimension is
11512 * greater than or equal to that of the second.
11514 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
11515 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11520 if (type1
== type2
&& pos1
== pos2
)
11522 space
= isl_basic_map_get_space(bmap
);
11523 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
11524 bmap
= isl_basic_map_add_constraint(bmap
, c
);
11529 /* Add a constraint imposing that the value of the first dimension is
11530 * greater than or equal to that of the second.
11532 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
11533 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11538 if (type1
== type2
&& pos1
== pos2
)
11540 space
= isl_map_get_space(map
);
11541 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
11542 map
= isl_map_add_constraint(map
, c
);
11547 /* Add a constraint imposing that the value of the first dimension is
11548 * less than or equal to that of the second.
11550 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
11551 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11553 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
11556 /* Construct a basic map where the value of the first dimension is
11557 * greater than that of the second.
11559 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
11560 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11562 isl_basic_map
*bmap
= NULL
;
11568 if (pos1
>= isl_space_dim(space
, type1
))
11569 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11570 "index out of bounds", goto error
);
11571 if (pos2
>= isl_space_dim(space
, type2
))
11572 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11573 "index out of bounds", goto error
);
11575 if (type1
== type2
&& pos1
== pos2
)
11576 return isl_basic_map_empty(space
);
11578 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
11579 i
= isl_basic_map_alloc_inequality(bmap
);
11582 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11583 pos1
+= isl_basic_map_offset(bmap
, type1
);
11584 pos2
+= isl_basic_map_offset(bmap
, type2
);
11585 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
11586 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
11587 isl_int_set_si(bmap
->ineq
[i
][0], -1);
11588 bmap
= isl_basic_map_finalize(bmap
);
11592 isl_space_free(space
);
11593 isl_basic_map_free(bmap
);
11597 /* Add a constraint imposing that the value of the first dimension is
11598 * greater than that of the second.
11600 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
11601 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11605 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11607 bmap
= isl_basic_map_intersect(bmap
, gt
);
11612 /* Add a constraint imposing that the value of the first dimension is
11613 * greater than that of the second.
11615 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
11616 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11618 isl_basic_map
*bmap
;
11620 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11622 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11627 /* Add a constraint imposing that the value of the first dimension is
11628 * smaller than that of the second.
11630 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
11631 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11633 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
11636 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
11640 isl_local_space
*ls
;
11645 if (!isl_basic_map_divs_known(bmap
))
11646 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11647 "some divs are unknown", return NULL
);
11649 ls
= isl_basic_map_get_local_space(bmap
);
11650 div
= isl_local_space_get_div(ls
, pos
);
11651 isl_local_space_free(ls
);
11656 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
11659 return isl_basic_map_get_div(bset
, pos
);
11662 /* Plug in "subs" for dimension "type", "pos" of "bset".
11664 * Let i be the dimension to replace and let "subs" be of the form
11668 * Any integer division with a non-zero coefficient for i,
11670 * floor((a i + g)/m)
11674 * floor((a f + d g)/(m d))
11676 * Constraints of the form
11684 * We currently require that "subs" is an integral expression.
11685 * Handling rational expressions may require us to add stride constraints
11686 * as we do in isl_basic_set_preimage_multi_aff.
11688 __isl_give isl_basic_set
*isl_basic_set_substitute(
11689 __isl_take isl_basic_set
*bset
,
11690 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11696 if (bset
&& isl_basic_set_plain_is_empty(bset
))
11699 bset
= isl_basic_set_cow(bset
);
11700 if (!bset
|| !subs
)
11703 ctx
= isl_basic_set_get_ctx(bset
);
11704 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
11705 isl_die(ctx
, isl_error_invalid
,
11706 "spaces don't match", goto error
);
11707 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
11708 isl_die(ctx
, isl_error_unsupported
,
11709 "cannot handle divs yet", goto error
);
11710 if (!isl_int_is_one(subs
->v
->el
[0]))
11711 isl_die(ctx
, isl_error_invalid
,
11712 "can only substitute integer expressions", goto error
);
11714 pos
+= isl_basic_set_offset(bset
, type
);
11718 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11719 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
11721 isl_int_set(v
, bset
->eq
[i
][pos
]);
11722 isl_int_set_si(bset
->eq
[i
][pos
], 0);
11723 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
11724 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11727 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11728 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
11730 isl_int_set(v
, bset
->ineq
[i
][pos
]);
11731 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
11732 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
11733 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11736 for (i
= 0; i
< bset
->n_div
; ++i
) {
11737 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
11739 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
11740 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
11741 isl_seq_combine(bset
->div
[i
] + 1,
11742 subs
->v
->el
[0], bset
->div
[i
] + 1,
11743 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11744 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
11749 bset
= isl_basic_set_simplify(bset
);
11750 return isl_basic_set_finalize(bset
);
11752 isl_basic_set_free(bset
);
11756 /* Plug in "subs" for dimension "type", "pos" of "set".
11758 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
11759 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11763 if (set
&& isl_set_plain_is_empty(set
))
11766 set
= isl_set_cow(set
);
11770 for (i
= set
->n
- 1; i
>= 0; --i
) {
11771 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
11772 if (remove_if_empty(set
, i
) < 0)
11782 /* Check if the range of "ma" is compatible with the domain or range
11783 * (depending on "type") of "bmap".
11784 * Return -1 if anything is wrong.
11786 static int check_basic_map_compatible_range_multi_aff(
11787 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
11788 __isl_keep isl_multi_aff
*ma
)
11791 isl_space
*ma_space
;
11793 ma_space
= isl_multi_aff_get_space(ma
);
11794 m
= isl_space_tuple_match(bmap
->dim
, type
, ma_space
, isl_dim_out
);
11795 isl_space_free(ma_space
);
11797 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11798 "spaces don't match", return -1);
11802 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
11803 * coefficients before the transformed range of dimensions,
11804 * the "n_after" coefficients after the transformed range of dimensions
11805 * and the coefficients of the other divs in "bmap".
11807 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
11808 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
11813 isl_local_space
*ls
;
11818 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11822 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
11823 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
11824 for (i
= 0; i
< n_div
; ++i
) {
11825 int o_bmap
= 0, o_ls
= 0;
11827 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
11828 o_bmap
+= 1 + 1 + n_param
;
11829 o_ls
+= 1 + 1 + n_param
;
11830 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
11831 o_bmap
+= n_before
;
11832 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11833 ls
->div
->row
[i
] + o_ls
, n_set
);
11836 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
11838 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11839 ls
->div
->row
[i
] + o_ls
, n_div
);
11842 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
11843 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
11847 isl_local_space_free(ls
);
11850 isl_local_space_free(ls
);
11854 /* How many stride constraints does "ma" enforce?
11855 * That is, how many of the affine expressions have a denominator
11856 * different from one?
11858 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11863 for (i
= 0; i
< ma
->n
; ++i
)
11864 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11870 /* For each affine expression in ma of the form
11872 * x_i = (f_i y + h_i)/m_i
11874 * with m_i different from one, add a constraint to "bmap"
11877 * f_i y + h_i = m_i alpha_i
11879 * with alpha_i an additional existentially quantified variable.
11881 static __isl_give isl_basic_map
*add_ma_strides(
11882 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
11883 int n_before
, int n_after
)
11892 total
= isl_basic_map_total_dim(bmap
);
11893 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
11894 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
11895 n_div
= isl_multi_aff_dim(ma
, isl_dim_div
);
11896 for (i
= 0; i
< ma
->n
; ++i
) {
11897 int o_bmap
= 0, o_ma
= 1;
11899 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11901 div
= isl_basic_map_alloc_div(bmap
);
11902 k
= isl_basic_map_alloc_equality(bmap
);
11903 if (div
< 0 || k
< 0)
11905 isl_int_set_si(bmap
->div
[div
][0], 0);
11906 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11907 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
11908 o_bmap
+= 1 + n_param
;
11909 o_ma
+= 1 + n_param
;
11910 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
11911 o_bmap
+= n_before
;
11912 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11913 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
11916 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
11918 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11919 ma
->p
[i
]->v
->el
+ o_ma
, n_div
);
11922 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
11923 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11929 isl_basic_map_free(bmap
);
11933 /* Replace the domain or range space (depending on "type) of "space" by "set".
11935 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
11936 enum isl_dim_type type
, __isl_take isl_space
*set
)
11938 if (type
== isl_dim_in
) {
11939 space
= isl_space_range(space
);
11940 space
= isl_space_map_from_domain_and_range(set
, space
);
11942 space
= isl_space_domain(space
);
11943 space
= isl_space_map_from_domain_and_range(space
, set
);
11949 /* Compute the preimage of the domain or range (depending on "type")
11950 * of "bmap" under the function represented by "ma".
11951 * In other words, plug in "ma" in the domain or range of "bmap".
11952 * The result is a basic map that lives in the same space as "bmap"
11953 * except that the domain or range has been replaced by
11954 * the domain space of "ma".
11956 * If bmap is represented by
11958 * A(p) + S u + B x + T v + C(divs) >= 0,
11960 * where u and x are input and output dimensions if type == isl_dim_out
11961 * while x and v are input and output dimensions if type == isl_dim_in,
11962 * and ma is represented by
11964 * x = D(p) + F(y) + G(divs')
11966 * then the result is
11968 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
11970 * The divs in the input set are similarly adjusted.
11973 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
11977 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
11978 * B_i G(divs') + c_i(divs))/n_i)
11980 * If bmap is not a rational map and if F(y) involves any denominators
11982 * x_i = (f_i y + h_i)/m_i
11984 * then additional constraints are added to ensure that we only
11985 * map back integer points. That is we enforce
11987 * f_i y + h_i = m_i alpha_i
11989 * with alpha_i an additional existentially quantified variable.
11991 * We first copy over the divs from "ma".
11992 * Then we add the modified constraints and divs from "bmap".
11993 * Finally, we add the stride constraints, if needed.
11995 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
11996 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
11997 __isl_take isl_multi_aff
*ma
)
12001 isl_basic_map
*res
= NULL
;
12002 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12003 isl_int f
, c1
, c2
, g
;
12004 int rational
, strides
;
12011 ma
= isl_multi_aff_align_divs(ma
);
12014 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12017 if (type
== isl_dim_in
) {
12019 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12021 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12024 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12025 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12027 space
= isl_multi_aff_get_domain_space(ma
);
12028 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12029 rational
= isl_basic_map_is_rational(bmap
);
12030 strides
= rational
? 0 : multi_aff_strides(ma
);
12031 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12032 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12034 res
= isl_basic_map_set_rational(res
);
12036 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12037 if (isl_basic_map_alloc_div(res
) < 0)
12040 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12043 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12044 k
= isl_basic_map_alloc_equality(res
);
12047 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12048 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12051 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12052 k
= isl_basic_map_alloc_inequality(res
);
12055 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12056 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12059 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12060 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12061 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12064 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12065 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12070 res
= add_ma_strides(res
, ma
, n_before
, n_after
);
12076 isl_basic_map_free(bmap
);
12077 isl_multi_aff_free(ma
);
12078 res
= isl_basic_set_simplify(res
);
12079 return isl_basic_map_finalize(res
);
12085 isl_basic_map_free(bmap
);
12086 isl_multi_aff_free(ma
);
12087 isl_basic_map_free(res
);
12091 /* Compute the preimage of "bset" under the function represented by "ma".
12092 * In other words, plug in "ma" in "bset". The result is a basic set
12093 * that lives in the domain space of "ma".
12095 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12096 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12098 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12101 /* Compute the preimage of the domain of "bmap" under the function
12102 * represented by "ma".
12103 * In other words, plug in "ma" in the domain of "bmap".
12104 * The result is a basic map that lives in the same space as "bmap"
12105 * except that the domain has been replaced by the domain space of "ma".
12107 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12108 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12110 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12113 /* Compute the preimage of the range of "bmap" under the function
12114 * represented by "ma".
12115 * In other words, plug in "ma" in the range of "bmap".
12116 * The result is a basic map that lives in the same space as "bmap"
12117 * except that the range has been replaced by the domain space of "ma".
12119 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12120 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12122 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12125 /* Check if the range of "ma" is compatible with the domain or range
12126 * (depending on "type") of "map".
12127 * Return -1 if anything is wrong.
12129 static int check_map_compatible_range_multi_aff(
12130 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12131 __isl_keep isl_multi_aff
*ma
)
12134 isl_space
*ma_space
;
12136 ma_space
= isl_multi_aff_get_space(ma
);
12137 m
= isl_space_tuple_match(map
->dim
, type
, ma_space
, isl_dim_out
);
12138 isl_space_free(ma_space
);
12140 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12141 "spaces don't match", return -1);
12145 /* Compute the preimage of the domain or range (depending on "type")
12146 * of "map" under the function represented by "ma".
12147 * In other words, plug in "ma" in the domain or range of "map".
12148 * The result is a map that lives in the same space as "map"
12149 * except that the domain or range has been replaced by
12150 * the domain space of "ma".
12152 * The parameters are assumed to have been aligned.
12154 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
12155 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12160 map
= isl_map_cow(map
);
12161 ma
= isl_multi_aff_align_divs(ma
);
12164 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
12167 for (i
= 0; i
< map
->n
; ++i
) {
12168 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
12169 isl_multi_aff_copy(ma
));
12174 space
= isl_multi_aff_get_domain_space(ma
);
12175 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
12177 isl_space_free(map
->dim
);
12182 isl_multi_aff_free(ma
);
12184 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
12185 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
12188 isl_multi_aff_free(ma
);
12193 /* Compute the preimage of the domain or range (depending on "type")
12194 * of "map" under the function represented by "ma".
12195 * In other words, plug in "ma" in the domain or range of "map".
12196 * The result is a map that lives in the same space as "map"
12197 * except that the domain or range has been replaced by
12198 * the domain space of "ma".
12200 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
12201 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12206 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
12207 return map_preimage_multi_aff(map
, type
, ma
);
12209 if (!isl_space_has_named_params(map
->dim
) ||
12210 !isl_space_has_named_params(ma
->space
))
12211 isl_die(map
->ctx
, isl_error_invalid
,
12212 "unaligned unnamed parameters", goto error
);
12213 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
12214 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
12216 return map_preimage_multi_aff(map
, type
, ma
);
12218 isl_multi_aff_free(ma
);
12219 return isl_map_free(map
);
12222 /* Compute the preimage of "set" under the function represented by "ma".
12223 * In other words, plug in "ma" in "set". The result is a set
12224 * that lives in the domain space of "ma".
12226 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
12227 __isl_take isl_multi_aff
*ma
)
12229 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
12232 /* Compute the preimage of the domain of "map" under the function
12233 * represented by "ma".
12234 * In other words, plug in "ma" in the domain of "map".
12235 * The result is a map that lives in the same space as "map"
12236 * except that the domain has been replaced by the domain space of "ma".
12238 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12239 __isl_take isl_multi_aff
*ma
)
12241 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12244 /* Compute the preimage of the range of "map" under the function
12245 * represented by "ma".
12246 * In other words, plug in "ma" in the range of "map".
12247 * The result is a map that lives in the same space as "map"
12248 * except that the range has been replaced by the domain space of "ma".
12250 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
12251 __isl_take isl_multi_aff
*ma
)
12253 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
12256 /* Compute the preimage of "map" under the function represented by "pma".
12257 * In other words, plug in "pma" in the domain or range of "map".
12258 * The result is a map that lives in the same space as "map",
12259 * except that the space of type "type" has been replaced by
12260 * the domain space of "pma".
12262 * The parameters of "map" and "pma" are assumed to have been aligned.
12264 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
12265 __isl_take isl_map
*map
, enum isl_dim_type type
,
12266 __isl_take isl_pw_multi_aff
*pma
)
12275 isl_pw_multi_aff_free(pma
);
12276 res
= isl_map_empty(isl_map_get_space(map
));
12281 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12282 isl_multi_aff_copy(pma
->p
[0].maff
));
12283 if (type
== isl_dim_in
)
12284 res
= isl_map_intersect_domain(res
,
12285 isl_map_copy(pma
->p
[0].set
));
12287 res
= isl_map_intersect_range(res
,
12288 isl_map_copy(pma
->p
[0].set
));
12290 for (i
= 1; i
< pma
->n
; ++i
) {
12293 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12294 isl_multi_aff_copy(pma
->p
[i
].maff
));
12295 if (type
== isl_dim_in
)
12296 res_i
= isl_map_intersect_domain(res_i
,
12297 isl_map_copy(pma
->p
[i
].set
));
12299 res_i
= isl_map_intersect_range(res_i
,
12300 isl_map_copy(pma
->p
[i
].set
));
12301 res
= isl_map_union(res
, res_i
);
12304 isl_pw_multi_aff_free(pma
);
12308 isl_pw_multi_aff_free(pma
);
12313 /* Compute the preimage of "map" under the function represented by "pma".
12314 * In other words, plug in "pma" in the domain or range of "map".
12315 * The result is a map that lives in the same space as "map",
12316 * except that the space of type "type" has been replaced by
12317 * the domain space of "pma".
12319 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
12320 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
12325 if (isl_space_match(map
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
12326 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12328 if (!isl_space_has_named_params(map
->dim
) ||
12329 !isl_space_has_named_params(pma
->dim
))
12330 isl_die(map
->ctx
, isl_error_invalid
,
12331 "unaligned unnamed parameters", goto error
);
12332 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
12333 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
12335 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12337 isl_pw_multi_aff_free(pma
);
12338 return isl_map_free(map
);
12341 /* Compute the preimage of "set" under the function represented by "pma".
12342 * In other words, plug in "pma" in "set". The result is a set
12343 * that lives in the domain space of "pma".
12345 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
12346 __isl_take isl_pw_multi_aff
*pma
)
12348 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
12351 /* Compute the preimage of the domain of "map" under the function
12352 * represented by "pma".
12353 * In other words, plug in "pma" in the domain of "map".
12354 * The result is a map that lives in the same space as "map",
12355 * except that domain space has been replaced by the domain space of "pma".
12357 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
12358 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12360 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
12363 /* Compute the preimage of the range of "map" under the function
12364 * represented by "pma".
12365 * In other words, plug in "pma" in the range of "map".
12366 * The result is a map that lives in the same space as "map",
12367 * except that range space has been replaced by the domain space of "pma".
12369 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
12370 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12372 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
12375 /* Compute the preimage of "map" under the function represented by "mpa".
12376 * In other words, plug in "mpa" in the domain or range of "map".
12377 * The result is a map that lives in the same space as "map",
12378 * except that the space of type "type" has been replaced by
12379 * the domain space of "mpa".
12381 * If the map does not involve any constraints that refer to the
12382 * dimensions of the substituted space, then the only possible
12383 * effect of "mpa" on the map is to map the space to a different space.
12384 * We create a separate isl_multi_aff to effectuate this change
12385 * in order to avoid spurious splitting of the map along the pieces
12388 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
12389 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
12392 isl_pw_multi_aff
*pma
;
12397 n
= isl_map_dim(map
, type
);
12398 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
12402 space
= isl_multi_pw_aff_get_space(mpa
);
12403 isl_multi_pw_aff_free(mpa
);
12404 ma
= isl_multi_aff_zero(space
);
12405 return isl_map_preimage_multi_aff(map
, type
, ma
);
12408 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
12409 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
12412 isl_multi_pw_aff_free(mpa
);
12416 /* Compute the preimage of "map" under the function represented by "mpa".
12417 * In other words, plug in "mpa" in the domain "map".
12418 * The result is a map that lives in the same space as "map",
12419 * except that domain space has been replaced by the domain space of "mpa".
12421 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
12422 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
12424 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
12427 /* Compute the preimage of "set" by the function represented by "mpa".
12428 * In other words, plug in "mpa" in "set".
12430 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
12431 __isl_take isl_multi_pw_aff
*mpa
)
12433 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);