2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
7 * Use of this software is governed by the MIT license
9 * Written by Sven Verdoolaege, K.U.Leuven, Departement
10 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
11 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
12 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
14 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
15 * B.P. 105 - 78153 Le Chesnay, France
19 #include <isl_ctx_private.h>
20 #include <isl_map_private.h>
22 #include <isl/constraint.h>
23 #include "isl_space_private.h"
24 #include "isl_equalities.h"
25 #include <isl_lp_private.h>
29 #include <isl_reordering.h>
30 #include "isl_sample.h"
34 #include <isl_mat_private.h>
35 #include <isl_vec_private.h>
36 #include <isl_dim_map.h>
37 #include <isl_local_space_private.h>
38 #include <isl_aff_private.h>
39 #include <isl_options_private.h>
40 #include <isl_morph.h>
41 #include <isl_val_private.h>
42 #include <isl/deprecated/map_int.h>
43 #include <isl/deprecated/set_int.h>
45 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
48 case isl_dim_param
: return dim
->nparam
;
49 case isl_dim_in
: return dim
->n_in
;
50 case isl_dim_out
: return dim
->n_out
;
51 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
56 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
59 case isl_dim_param
: return 1;
60 case isl_dim_in
: return 1 + dim
->nparam
;
61 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
66 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
67 enum isl_dim_type type
)
72 case isl_dim_cst
: return 1;
75 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
76 case isl_dim_div
: return bmap
->n_div
;
77 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
82 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
84 return map
? n(map
->dim
, type
) : 0;
87 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
89 return set
? n(set
->dim
, type
) : 0;
92 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
93 enum isl_dim_type type
)
95 isl_space
*dim
= bmap
->dim
;
97 case isl_dim_cst
: return 0;
98 case isl_dim_param
: return 1;
99 case isl_dim_in
: return 1 + dim
->nparam
;
100 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
101 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
106 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
107 enum isl_dim_type type
)
109 return isl_basic_map_offset(bset
, type
);
112 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
114 return pos(map
->dim
, type
);
117 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
118 enum isl_dim_type type
)
120 return isl_basic_map_dim(bset
, type
);
123 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
125 return isl_basic_set_dim(bset
, isl_dim_set
);
128 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
130 return isl_basic_set_dim(bset
, isl_dim_param
);
133 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
137 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
140 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
142 return isl_set_dim(set
, isl_dim_set
);
145 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
147 return isl_set_dim(set
, isl_dim_param
);
150 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
152 return bmap
? bmap
->dim
->n_in
: 0;
155 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
157 return bmap
? bmap
->dim
->n_out
: 0;
160 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
162 return bmap
? bmap
->dim
->nparam
: 0;
165 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
167 return bmap
? bmap
->n_div
: 0;
170 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
172 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
175 unsigned isl_map_n_in(const struct isl_map
*map
)
177 return map
? map
->dim
->n_in
: 0;
180 unsigned isl_map_n_out(const struct isl_map
*map
)
182 return map
? map
->dim
->n_out
: 0;
185 unsigned isl_map_n_param(const struct isl_map
*map
)
187 return map
? map
->dim
->nparam
: 0;
190 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
195 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
198 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
199 set
->dim
, isl_dim_set
);
202 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
203 struct isl_basic_set
*bset
)
208 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
211 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
212 bset
->dim
, isl_dim_set
);
215 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
220 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
223 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
224 set
->dim
, isl_dim_set
);
227 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
228 struct isl_basic_set
*bset
)
233 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
236 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
237 bset
->dim
, isl_dim_set
);
240 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
242 return bmap
? bmap
->ctx
: NULL
;
245 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
247 return bset
? bset
->ctx
: NULL
;
250 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
252 return map
? map
->ctx
: NULL
;
255 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
257 return set
? set
->ctx
: NULL
;
260 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
264 return isl_space_copy(bmap
->dim
);
267 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
271 return isl_space_copy(bset
->dim
);
274 /* Extract the divs in "bmap" as a matrix.
276 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
287 ctx
= isl_basic_map_get_ctx(bmap
);
288 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
289 cols
= 1 + 1 + total
+ bmap
->n_div
;
290 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
294 for (i
= 0; i
< bmap
->n_div
; ++i
)
295 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
300 /* Extract the divs in "bset" as a matrix.
302 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
304 return isl_basic_map_get_divs(bset
);
307 __isl_give isl_local_space
*isl_basic_map_get_local_space(
308 __isl_keep isl_basic_map
*bmap
)
315 div
= isl_basic_map_get_divs(bmap
);
316 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
319 __isl_give isl_local_space
*isl_basic_set_get_local_space(
320 __isl_keep isl_basic_set
*bset
)
322 return isl_basic_map_get_local_space(bset
);
325 /* For each known div d = floor(f/m), add the constraints
328 * -(f-(n-1)) + m d >= 0
330 * Do not finalize the result.
332 static __isl_give isl_basic_map
*add_known_div_constraints(
333 __isl_take isl_basic_map
*bmap
)
340 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
343 bmap
= isl_basic_map_cow(bmap
);
344 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
347 for (i
= 0; i
< n_div
; ++i
) {
348 if (isl_int_is_zero(bmap
->div
[i
][0]))
350 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
351 return isl_basic_map_free(bmap
);
357 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
358 __isl_take isl_local_space
*ls
)
367 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
368 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
369 n_div
, 0, 2 * n_div
);
371 for (i
= 0; i
< n_div
; ++i
)
372 if (isl_basic_map_alloc_div(bmap
) < 0)
375 for (i
= 0; i
< n_div
; ++i
)
376 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
377 bmap
= add_known_div_constraints(bmap
);
379 isl_local_space_free(ls
);
382 isl_local_space_free(ls
);
383 isl_basic_map_free(bmap
);
387 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
388 __isl_take isl_local_space
*ls
)
390 return isl_basic_map_from_local_space(ls
);
393 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
397 return isl_space_copy(map
->dim
);
400 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
404 return isl_space_copy(set
->dim
);
407 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
408 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
410 bmap
= isl_basic_map_cow(bmap
);
413 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
416 bmap
= isl_basic_map_finalize(bmap
);
419 isl_basic_map_free(bmap
);
423 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
424 __isl_take isl_basic_set
*bset
, const char *s
)
426 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
429 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
430 enum isl_dim_type type
)
432 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
435 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
436 enum isl_dim_type type
, const char *s
)
440 map
= isl_map_cow(map
);
444 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
448 for (i
= 0; i
< map
->n
; ++i
) {
449 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
460 /* Replace the identifier of the tuple of type "type" by "id".
462 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
463 __isl_take isl_basic_map
*bmap
,
464 enum isl_dim_type type
, __isl_take isl_id
*id
)
466 bmap
= isl_basic_map_cow(bmap
);
469 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
471 return isl_basic_map_free(bmap
);
472 bmap
= isl_basic_map_finalize(bmap
);
479 /* Replace the identifier of the tuple by "id".
481 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
482 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
484 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
487 /* Does the input or output tuple have a name?
489 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
491 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
494 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
495 enum isl_dim_type type
)
497 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
500 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
503 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
506 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
507 enum isl_dim_type type
, __isl_take isl_id
*id
)
509 map
= isl_map_cow(map
);
513 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
515 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
521 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
522 __isl_take isl_id
*id
)
524 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
527 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
528 enum isl_dim_type type
)
530 map
= isl_map_cow(map
);
534 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
536 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
539 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
541 return isl_map_reset_tuple_id(set
, isl_dim_set
);
544 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
546 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
549 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
550 enum isl_dim_type type
)
552 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
555 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
557 return isl_map_has_tuple_id(set
, isl_dim_set
);
560 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
562 return isl_map_get_tuple_id(set
, isl_dim_set
);
565 /* Does the set tuple have a name?
567 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
570 return isl_bool_error
;
571 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
575 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
577 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
580 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
582 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
585 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
586 enum isl_dim_type type
, unsigned pos
)
588 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
591 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
592 enum isl_dim_type type
, unsigned pos
)
594 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
597 /* Does the given dimension have a name?
599 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
600 enum isl_dim_type type
, unsigned pos
)
603 return isl_bool_error
;
604 return isl_space_has_dim_name(map
->dim
, type
, pos
);
607 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
608 enum isl_dim_type type
, unsigned pos
)
610 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
613 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
614 enum isl_dim_type type
, unsigned pos
)
616 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
619 /* Does the given dimension have a name?
621 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
622 enum isl_dim_type type
, unsigned pos
)
625 return isl_bool_error
;
626 return isl_space_has_dim_name(set
->dim
, type
, pos
);
629 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
630 __isl_take isl_basic_map
*bmap
,
631 enum isl_dim_type type
, unsigned pos
, const char *s
)
633 bmap
= isl_basic_map_cow(bmap
);
636 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
639 return isl_basic_map_finalize(bmap
);
641 isl_basic_map_free(bmap
);
645 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
646 enum isl_dim_type type
, unsigned pos
, const char *s
)
650 map
= isl_map_cow(map
);
654 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
658 for (i
= 0; i
< map
->n
; ++i
) {
659 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
670 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
671 __isl_take isl_basic_set
*bset
,
672 enum isl_dim_type type
, unsigned pos
, const char *s
)
674 return (isl_basic_set
*)isl_basic_map_set_dim_name(
675 (isl_basic_map
*)bset
, type
, pos
, s
);
678 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
679 enum isl_dim_type type
, unsigned pos
, const char *s
)
681 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
684 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
685 enum isl_dim_type type
, unsigned pos
)
688 return isl_bool_error
;
689 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
692 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
693 enum isl_dim_type type
, unsigned pos
)
695 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
698 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
699 enum isl_dim_type type
, unsigned pos
)
701 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
704 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
705 enum isl_dim_type type
, unsigned pos
)
707 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
710 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
711 enum isl_dim_type type
, unsigned pos
)
713 return isl_map_has_dim_id(set
, type
, pos
);
716 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
717 enum isl_dim_type type
, unsigned pos
)
719 return isl_map_get_dim_id(set
, type
, pos
);
722 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
723 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
725 map
= isl_map_cow(map
);
729 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
731 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
737 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
738 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
740 return isl_map_set_dim_id(set
, type
, pos
, id
);
743 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
744 __isl_keep isl_id
*id
)
748 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
751 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
752 __isl_keep isl_id
*id
)
754 return isl_map_find_dim_by_id(set
, type
, id
);
757 /* Return the position of the dimension of the given type and name
759 * Return -1 if no such dimension can be found.
761 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
762 enum isl_dim_type type
, const char *name
)
766 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
769 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
774 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
777 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
780 return isl_map_find_dim_by_name(set
, type
, name
);
783 /* Reset the user pointer on all identifiers of parameters and tuples
784 * of the space of "map".
786 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
790 space
= isl_map_get_space(map
);
791 space
= isl_space_reset_user(space
);
792 map
= isl_map_reset_space(map
, space
);
797 /* Reset the user pointer on all identifiers of parameters and tuples
798 * of the space of "set".
800 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
802 return isl_map_reset_user(set
);
805 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
809 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
812 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
814 return isl_basic_map_is_rational(bset
);
817 /* Does "bmap" contain any rational points?
819 * If "bmap" has an equality for each dimension, equating the dimension
820 * to an integer constant, then it has no rational points, even if it
821 * is marked as rational.
823 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
825 int has_rational
= 1;
830 if (isl_basic_map_plain_is_empty(bmap
))
832 if (!isl_basic_map_is_rational(bmap
))
834 bmap
= isl_basic_map_copy(bmap
);
835 bmap
= isl_basic_map_implicit_equalities(bmap
);
838 total
= isl_basic_map_total_dim(bmap
);
839 if (bmap
->n_eq
== total
) {
841 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
842 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
845 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
846 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
848 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
856 isl_basic_map_free(bmap
);
861 /* Does "map" contain any rational points?
863 int isl_map_has_rational(__isl_keep isl_map
*map
)
870 for (i
= 0; i
< map
->n
; ++i
) {
871 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
872 if (has_rational
< 0)
880 /* Does "set" contain any rational points?
882 int isl_set_has_rational(__isl_keep isl_set
*set
)
884 return isl_map_has_rational(set
);
887 /* Is this basic set a parameter domain?
889 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
893 return isl_space_is_params(bset
->dim
);
896 /* Is this set a parameter domain?
898 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
901 return isl_bool_error
;
902 return isl_space_is_params(set
->dim
);
905 /* Is this map actually a parameter domain?
906 * Users should never call this function. Outside of isl,
907 * a map can never be a parameter domain.
909 int isl_map_is_params(__isl_keep isl_map
*map
)
913 return isl_space_is_params(map
->dim
);
916 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
917 struct isl_basic_map
*bmap
, unsigned extra
,
918 unsigned n_eq
, unsigned n_ineq
)
921 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
926 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
927 if (isl_blk_is_error(bmap
->block
))
930 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
931 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
935 bmap
->block2
= isl_blk_empty();
938 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
939 if (isl_blk_is_error(bmap
->block2
))
942 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
947 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
948 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
950 for (i
= 0; i
< extra
; ++i
)
951 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
955 bmap
->c_size
= n_eq
+ n_ineq
;
956 bmap
->eq
= bmap
->ineq
+ n_ineq
;
965 isl_basic_map_free(bmap
);
969 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
970 unsigned nparam
, unsigned dim
, unsigned extra
,
971 unsigned n_eq
, unsigned n_ineq
)
973 struct isl_basic_map
*bmap
;
976 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
980 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
981 return (struct isl_basic_set
*)bmap
;
984 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
985 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
987 struct isl_basic_map
*bmap
;
990 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
991 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
992 return (struct isl_basic_set
*)bmap
;
998 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
999 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1001 struct isl_basic_map
*bmap
;
1005 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1010 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1012 isl_space_free(dim
);
1016 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1017 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1018 unsigned n_eq
, unsigned n_ineq
)
1020 struct isl_basic_map
*bmap
;
1023 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1027 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1031 static void dup_constraints(
1032 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1035 unsigned total
= isl_basic_map_total_dim(src
);
1037 for (i
= 0; i
< src
->n_eq
; ++i
) {
1038 int j
= isl_basic_map_alloc_equality(dst
);
1039 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1042 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1043 int j
= isl_basic_map_alloc_inequality(dst
);
1044 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1047 for (i
= 0; i
< src
->n_div
; ++i
) {
1048 int j
= isl_basic_map_alloc_div(dst
);
1049 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1051 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1054 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
1056 struct isl_basic_map
*dup
;
1060 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1061 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1064 dup_constraints(dup
, bmap
);
1065 dup
->flags
= bmap
->flags
;
1066 dup
->sample
= isl_vec_copy(bmap
->sample
);
1070 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1072 struct isl_basic_map
*dup
;
1074 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
1075 return (struct isl_basic_set
*)dup
;
1078 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
1083 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1087 return isl_basic_set_dup(bset
);
1090 struct isl_set
*isl_set_copy(struct isl_set
*set
)
1099 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
1104 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1108 bmap
= isl_basic_map_dup(bmap
);
1110 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1114 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1123 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1128 if (--bmap
->ref
> 0)
1131 isl_ctx_deref(bmap
->ctx
);
1133 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1135 isl_blk_free(bmap
->ctx
, bmap
->block
);
1136 isl_vec_free(bmap
->sample
);
1137 isl_space_free(bmap
->dim
);
1143 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1145 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1148 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1150 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1153 __isl_give isl_map
*isl_map_align_params_map_map_and(
1154 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1155 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1156 __isl_take isl_map
*map2
))
1160 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1161 return fn(map1
, map2
);
1162 if (!isl_space_has_named_params(map1
->dim
) ||
1163 !isl_space_has_named_params(map2
->dim
))
1164 isl_die(map1
->ctx
, isl_error_invalid
,
1165 "unaligned unnamed parameters", goto error
);
1166 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1167 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1168 return fn(map1
, map2
);
1175 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1176 __isl_keep isl_map
*map2
,
1177 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1182 return isl_bool_error
;
1183 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1184 return fn(map1
, map2
);
1185 if (!isl_space_has_named_params(map1
->dim
) ||
1186 !isl_space_has_named_params(map2
->dim
))
1187 isl_die(map1
->ctx
, isl_error_invalid
,
1188 "unaligned unnamed parameters", return isl_bool_error
);
1189 map1
= isl_map_copy(map1
);
1190 map2
= isl_map_copy(map2
);
1191 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1192 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1199 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1201 struct isl_ctx
*ctx
;
1205 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1206 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1208 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1209 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1210 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1211 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1212 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1213 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1215 int j
= isl_basic_map_alloc_inequality(bmap
);
1219 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1220 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1227 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1228 bmap
->extra
- bmap
->n_div
);
1229 return bmap
->n_eq
++;
1232 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1234 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1237 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1241 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1246 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1248 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1251 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1256 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1258 if (pos
!= bmap
->n_eq
- 1) {
1260 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1261 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1267 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1269 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1272 /* Turn inequality "pos" of "bmap" into an equality.
1274 * In particular, we move the inequality in front of the equalities
1275 * and move the last inequality in the position of the moved inequality.
1276 * Note that isl_tab_make_equalities_explicit depends on this particular
1277 * change in the ordering of the constraints.
1279 void isl_basic_map_inequality_to_equality(
1280 struct isl_basic_map
*bmap
, unsigned pos
)
1284 t
= bmap
->ineq
[pos
];
1285 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1286 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1291 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1292 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1293 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1294 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1297 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1299 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1302 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1304 struct isl_ctx
*ctx
;
1308 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1309 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1310 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1311 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1312 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1313 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1314 1 + isl_basic_map_total_dim(bmap
),
1315 bmap
->extra
- bmap
->n_div
);
1316 return bmap
->n_ineq
++;
1319 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1321 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1324 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1328 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1333 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1335 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1338 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1343 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1345 if (pos
!= bmap
->n_ineq
- 1) {
1346 t
= bmap
->ineq
[pos
];
1347 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1348 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1349 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1355 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1357 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1360 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1365 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1368 k
= isl_basic_map_alloc_equality(bmap
);
1371 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1374 isl_basic_map_free(bmap
);
1378 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1381 return (isl_basic_set
*)
1382 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1385 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1390 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1393 k
= isl_basic_map_alloc_inequality(bmap
);
1396 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1399 isl_basic_map_free(bmap
);
1403 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1406 return (isl_basic_set
*)
1407 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1410 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1414 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1415 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1416 1 + 1 + isl_basic_map_total_dim(bmap
),
1417 bmap
->extra
- bmap
->n_div
);
1418 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1419 return bmap
->n_div
++;
1422 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1424 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1427 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1431 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1436 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1438 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1441 /* Copy constraint from src to dst, putting the vars of src at offset
1442 * dim_off in dst and the divs of src at offset div_off in dst.
1443 * If both sets are actually map, then dim_off applies to the input
1446 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1447 struct isl_basic_map
*src_map
, isl_int
*src
,
1448 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1450 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1451 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1452 unsigned src_in
= isl_basic_map_n_in(src_map
);
1453 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1454 unsigned src_out
= isl_basic_map_n_out(src_map
);
1455 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1456 isl_int_set(dst
[0], src
[0]);
1457 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1458 if (dst_nparam
> src_nparam
)
1459 isl_seq_clr(dst
+1+src_nparam
,
1460 dst_nparam
- src_nparam
);
1461 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1462 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1464 isl_min(dst_in
-in_off
, src_in
));
1465 if (dst_in
-in_off
> src_in
)
1466 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1467 dst_in
- in_off
- src_in
);
1468 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1469 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1470 src
+1+src_nparam
+src_in
,
1471 isl_min(dst_out
-out_off
, src_out
));
1472 if (dst_out
-out_off
> src_out
)
1473 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1474 dst_out
- out_off
- src_out
);
1475 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1476 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1477 src
+1+src_nparam
+src_in
+src_out
,
1478 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1479 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1480 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1481 div_off
+src_map
->n_div
,
1482 dst_map
->n_div
- div_off
- src_map
->n_div
);
1485 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1486 struct isl_basic_map
*src_map
, isl_int
*src
,
1487 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1489 isl_int_set(dst
[0], src
[0]);
1490 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1493 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1494 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1499 if (!bmap1
|| !bmap2
)
1502 div_off
= bmap1
->n_div
;
1504 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1505 int i1
= isl_basic_map_alloc_equality(bmap1
);
1508 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1509 i_pos
, o_pos
, div_off
);
1512 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1513 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1516 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1517 i_pos
, o_pos
, div_off
);
1520 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1521 int i1
= isl_basic_map_alloc_div(bmap1
);
1524 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1525 i_pos
, o_pos
, div_off
);
1528 isl_basic_map_free(bmap2
);
1533 isl_basic_map_free(bmap1
);
1534 isl_basic_map_free(bmap2
);
1538 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1539 struct isl_basic_set
*bset2
, unsigned pos
)
1541 return (struct isl_basic_set
*)
1542 add_constraints((struct isl_basic_map
*)bset1
,
1543 (struct isl_basic_map
*)bset2
, 0, pos
);
1546 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1547 __isl_take isl_space
*dim
, unsigned extra
,
1548 unsigned n_eq
, unsigned n_ineq
)
1550 struct isl_basic_map
*ext
;
1560 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1561 base
->extra
>= base
->n_div
+ extra
;
1563 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1564 room_for_ineq(base
, n_ineq
)) {
1565 isl_space_free(dim
);
1569 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1570 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1571 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1572 extra
+= base
->extra
;
1574 n_ineq
+= base
->n_ineq
;
1576 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1582 ext
->sample
= isl_vec_copy(base
->sample
);
1583 flags
= base
->flags
;
1584 ext
= add_constraints(ext
, base
, 0, 0);
1587 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1593 isl_space_free(dim
);
1594 isl_basic_map_free(base
);
1598 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1599 __isl_take isl_space
*dim
, unsigned extra
,
1600 unsigned n_eq
, unsigned n_ineq
)
1602 return (struct isl_basic_set
*)
1603 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1604 extra
, n_eq
, n_ineq
);
1607 struct isl_basic_map
*isl_basic_map_extend_constraints(
1608 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1612 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1616 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1617 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1618 unsigned n_eq
, unsigned n_ineq
)
1620 struct isl_basic_map
*bmap
;
1625 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1629 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1632 isl_basic_map_free(base
);
1636 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1637 unsigned nparam
, unsigned dim
, unsigned extra
,
1638 unsigned n_eq
, unsigned n_ineq
)
1640 return (struct isl_basic_set
*)
1641 isl_basic_map_extend((struct isl_basic_map
*)base
,
1642 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1645 struct isl_basic_set
*isl_basic_set_extend_constraints(
1646 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1648 return (struct isl_basic_set
*)
1649 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1653 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1655 return (struct isl_basic_set
*)
1656 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1659 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1664 if (bmap
->ref
> 1) {
1666 bmap
= isl_basic_map_dup(bmap
);
1669 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1670 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1675 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1683 return isl_set_dup(set
);
1686 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1694 return isl_map_dup(map
);
1697 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1698 unsigned a_len
, unsigned b_len
)
1700 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1701 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1702 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1705 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1706 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1714 isl_assert(bmap
->ctx
,
1715 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1717 if (n1
== 0 || n2
== 0)
1720 bmap
= isl_basic_map_cow(bmap
);
1724 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1725 if (isl_blk_is_error(blk
))
1728 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1730 bmap
->eq
[i
] + pos
, n1
, n2
);
1732 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1734 bmap
->ineq
[i
] + pos
, n1
, n2
);
1736 for (i
= 0; i
< bmap
->n_div
; ++i
)
1738 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1740 isl_blk_free(bmap
->ctx
, blk
);
1742 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1743 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1744 return isl_basic_map_finalize(bmap
);
1746 isl_basic_map_free(bmap
);
1750 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1756 total
= isl_basic_map_total_dim(bmap
);
1757 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1758 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1760 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1762 i
= isl_basic_map_alloc_equality(bmap
);
1766 isl_int_set_si(bmap
->eq
[i
][0], 1);
1767 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1768 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1769 isl_vec_free(bmap
->sample
);
1770 bmap
->sample
= NULL
;
1771 return isl_basic_map_finalize(bmap
);
1773 isl_basic_map_free(bmap
);
1777 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1779 return (struct isl_basic_set
*)
1780 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1783 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1786 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1788 isl_int
*t
= bmap
->div
[a
];
1789 bmap
->div
[a
] = bmap
->div
[b
];
1793 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1794 * div definitions accordingly.
1796 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1799 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1801 swap_div(bmap
, a
, b
);
1803 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1804 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1806 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1807 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1809 for (i
= 0; i
< bmap
->n_div
; ++i
)
1810 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1811 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1814 /* Eliminate the specified n dimensions starting at first from the
1815 * constraints, without removing the dimensions from the space.
1816 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1818 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1819 enum isl_dim_type type
, unsigned first
, unsigned n
)
1828 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1829 isl_die(map
->ctx
, isl_error_invalid
,
1830 "index out of bounds", goto error
);
1832 map
= isl_map_cow(map
);
1836 for (i
= 0; i
< map
->n
; ++i
) {
1837 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1847 /* Eliminate the specified n dimensions starting at first from the
1848 * constraints, without removing the dimensions from the space.
1849 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1851 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1852 enum isl_dim_type type
, unsigned first
, unsigned n
)
1854 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1857 /* Eliminate the specified n dimensions starting at first from the
1858 * constraints, without removing the dimensions from the space.
1859 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1861 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1862 unsigned first
, unsigned n
)
1864 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1867 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1868 __isl_take isl_basic_map
*bmap
)
1872 bmap
= isl_basic_map_eliminate_vars(bmap
,
1873 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1877 return isl_basic_map_finalize(bmap
);
1880 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1881 __isl_take isl_basic_set
*bset
)
1883 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1884 (struct isl_basic_map
*)bset
);
1887 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1896 map
= isl_map_cow(map
);
1900 for (i
= 0; i
< map
->n
; ++i
) {
1901 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1911 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1913 return isl_map_remove_divs(set
);
1916 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1917 enum isl_dim_type type
, unsigned first
, unsigned n
)
1921 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1923 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1925 bmap
= isl_basic_map_eliminate_vars(bmap
,
1926 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1929 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1931 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1934 isl_basic_map_free(bmap
);
1938 /* Return true if the definition of the given div (recursively) involves
1939 * any of the given variables.
1941 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1942 unsigned first
, unsigned n
)
1945 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1947 if (isl_int_is_zero(bmap
->div
[div
][0]))
1949 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1952 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1953 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1955 if (div_involves_vars(bmap
, i
, first
, n
))
1962 /* Try and add a lower and/or upper bound on "div" to "bmap"
1963 * based on inequality "i".
1964 * "total" is the total number of variables (excluding the divs).
1965 * "v" is a temporary object that can be used during the calculations.
1966 * If "lb" is set, then a lower bound should be constructed.
1967 * If "ub" is set, then an upper bound should be constructed.
1969 * The calling function has already checked that the inequality does not
1970 * reference "div", but we still need to check that the inequality is
1971 * of the right form. We'll consider the case where we want to construct
1972 * a lower bound. The construction of upper bounds is similar.
1974 * Let "div" be of the form
1976 * q = floor((a + f(x))/d)
1978 * We essentially check if constraint "i" is of the form
1982 * so that we can use it to derive a lower bound on "div".
1983 * However, we allow a slightly more general form
1987 * with the condition that the coefficients of g(x) - f(x) are all
1989 * Rewriting this constraint as
1993 * adding a + f(x) to both sides and dividing by d, we obtain
1995 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1997 * Taking the floor on both sides, we obtain
1999 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2003 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2005 * In the case of an upper bound, we construct the constraint
2007 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2010 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2011 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2012 unsigned total
, isl_int v
, int lb
, int ub
)
2016 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2018 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2019 bmap
->div
[div
][1 + 1 + j
]);
2020 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2023 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2024 bmap
->div
[div
][1 + 1 + j
]);
2025 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2031 bmap
= isl_basic_map_cow(bmap
);
2032 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2034 int k
= isl_basic_map_alloc_inequality(bmap
);
2037 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2038 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2039 bmap
->div
[div
][1 + j
]);
2040 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2041 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2043 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2046 int k
= isl_basic_map_alloc_inequality(bmap
);
2049 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2050 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2051 bmap
->div
[div
][1 + j
]);
2052 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2053 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2055 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2058 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2061 isl_basic_map_free(bmap
);
2065 /* This function is called right before "div" is eliminated from "bmap"
2066 * using Fourier-Motzkin.
2067 * Look through the constraints of "bmap" for constraints on the argument
2068 * of the integer division and use them to construct constraints on the
2069 * integer division itself. These constraints can then be combined
2070 * during the Fourier-Motzkin elimination.
2071 * Note that it is only useful to introduce lower bounds on "div"
2072 * if "bmap" already contains upper bounds on "div" as the newly
2073 * introduce lower bounds can then be combined with the pre-existing
2074 * upper bounds. Similarly for upper bounds.
2075 * We therefore first check if "bmap" contains any lower and/or upper bounds
2078 * It is interesting to note that the introduction of these constraints
2079 * can indeed lead to more accurate results, even when compared to
2080 * deriving constraints on the argument of "div" from constraints on "div".
2081 * Consider, for example, the set
2083 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2085 * The second constraint can be rewritten as
2087 * 2 * [(-i-2j+3)/4] + k >= 0
2089 * from which we can derive
2091 * -i - 2j + 3 >= -2k
2097 * Combined with the first constraint, we obtain
2099 * -3 <= 3 + 2k or k >= -3
2101 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2102 * the first constraint, we obtain
2104 * [(i + 2j)/4] >= [-3/4] = -1
2106 * Combining this constraint with the second constraint, we obtain
2110 static __isl_give isl_basic_map
*insert_bounds_on_div(
2111 __isl_take isl_basic_map
*bmap
, int div
)
2114 int check_lb
, check_ub
;
2121 if (isl_int_is_zero(bmap
->div
[div
][0]))
2124 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2128 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2129 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2136 if (!check_lb
&& !check_ub
)
2141 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2142 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2145 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2146 check_lb
, check_ub
);
2154 /* Remove all divs (recursively) involving any of the given dimensions
2155 * in their definitions.
2157 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2158 __isl_take isl_basic_map
*bmap
,
2159 enum isl_dim_type type
, unsigned first
, unsigned n
)
2165 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2167 first
+= isl_basic_map_offset(bmap
, type
);
2169 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2170 if (!div_involves_vars(bmap
, i
, first
, n
))
2172 bmap
= insert_bounds_on_div(bmap
, i
);
2173 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2181 isl_basic_map_free(bmap
);
2185 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2186 __isl_take isl_basic_set
*bset
,
2187 enum isl_dim_type type
, unsigned first
, unsigned n
)
2189 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2192 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2193 enum isl_dim_type type
, unsigned first
, unsigned n
)
2202 map
= isl_map_cow(map
);
2206 for (i
= 0; i
< map
->n
; ++i
) {
2207 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2218 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2219 enum isl_dim_type type
, unsigned first
, unsigned n
)
2221 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2225 /* Does the desciption of "bmap" depend on the specified dimensions?
2226 * We also check whether the dimensions appear in any of the div definitions.
2227 * In principle there is no need for this check. If the dimensions appear
2228 * in a div definition, they also appear in the defining constraints of that
2231 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2232 enum isl_dim_type type
, unsigned first
, unsigned n
)
2237 return isl_bool_error
;
2239 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2240 isl_die(bmap
->ctx
, isl_error_invalid
,
2241 "index out of bounds", return isl_bool_error
);
2243 first
+= isl_basic_map_offset(bmap
, type
);
2244 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2245 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2246 return isl_bool_true
;
2247 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2248 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2249 return isl_bool_true
;
2250 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2251 if (isl_int_is_zero(bmap
->div
[i
][0]))
2253 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2254 return isl_bool_true
;
2257 return isl_bool_false
;
2260 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2261 enum isl_dim_type type
, unsigned first
, unsigned n
)
2266 return isl_bool_error
;
2268 if (first
+ n
> isl_map_dim(map
, type
))
2269 isl_die(map
->ctx
, isl_error_invalid
,
2270 "index out of bounds", return isl_bool_error
);
2272 for (i
= 0; i
< map
->n
; ++i
) {
2273 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2275 if (involves
< 0 || involves
)
2279 return isl_bool_false
;
2282 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2283 enum isl_dim_type type
, unsigned first
, unsigned n
)
2285 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2288 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2289 enum isl_dim_type type
, unsigned first
, unsigned n
)
2291 return isl_map_involves_dims(set
, type
, first
, n
);
2294 /* Return true if the definition of the given div is unknown or depends
2297 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2300 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2302 if (isl_int_is_zero(bmap
->div
[div
][0]))
2305 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2306 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2308 if (div_is_unknown(bmap
, i
))
2315 /* Remove all divs that are unknown or defined in terms of unknown divs.
2317 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2318 __isl_take isl_basic_map
*bmap
)
2325 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2326 if (!div_is_unknown(bmap
, i
))
2328 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2337 /* Remove all divs that are unknown or defined in terms of unknown divs.
2339 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2340 __isl_take isl_basic_set
*bset
)
2342 return isl_basic_map_remove_unknown_divs(bset
);
2345 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2354 map
= isl_map_cow(map
);
2358 for (i
= 0; i
< map
->n
; ++i
) {
2359 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2369 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2371 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2374 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2375 __isl_take isl_basic_set
*bset
,
2376 enum isl_dim_type type
, unsigned first
, unsigned n
)
2378 return (isl_basic_set
*)
2379 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2382 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2383 enum isl_dim_type type
, unsigned first
, unsigned n
)
2390 map
= isl_map_cow(map
);
2393 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2395 for (i
= 0; i
< map
->n
; ++i
) {
2396 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2397 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2401 map
= isl_map_drop(map
, type
, first
, n
);
2408 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2409 enum isl_dim_type type
, unsigned first
, unsigned n
)
2411 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2414 /* Project out n inputs starting at first using Fourier-Motzkin */
2415 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2416 unsigned first
, unsigned n
)
2418 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2421 static void dump_term(struct isl_basic_map
*bmap
,
2422 isl_int c
, int pos
, FILE *out
)
2425 unsigned in
= isl_basic_map_n_in(bmap
);
2426 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2427 unsigned nparam
= isl_basic_map_n_param(bmap
);
2429 isl_int_print(out
, c
, 0);
2431 if (!isl_int_is_one(c
))
2432 isl_int_print(out
, c
, 0);
2433 if (pos
< 1 + nparam
) {
2434 name
= isl_space_get_dim_name(bmap
->dim
,
2435 isl_dim_param
, pos
- 1);
2437 fprintf(out
, "%s", name
);
2439 fprintf(out
, "p%d", pos
- 1);
2440 } else if (pos
< 1 + nparam
+ in
)
2441 fprintf(out
, "i%d", pos
- 1 - nparam
);
2442 else if (pos
< 1 + nparam
+ dim
)
2443 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2445 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2449 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2450 int sign
, FILE *out
)
2454 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2458 for (i
= 0, first
= 1; i
< len
; ++i
) {
2459 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2462 fprintf(out
, " + ");
2464 isl_int_abs(v
, c
[i
]);
2465 dump_term(bmap
, v
, i
, out
);
2472 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2473 const char *op
, FILE *out
, int indent
)
2477 fprintf(out
, "%*s", indent
, "");
2479 dump_constraint_sign(bmap
, c
, 1, out
);
2480 fprintf(out
, " %s ", op
);
2481 dump_constraint_sign(bmap
, c
, -1, out
);
2485 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2486 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2488 fprintf(out
, "%*s", indent
, "");
2489 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2494 static void dump_constraints(struct isl_basic_map
*bmap
,
2495 isl_int
**c
, unsigned n
,
2496 const char *op
, FILE *out
, int indent
)
2500 for (i
= 0; i
< n
; ++i
)
2501 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2504 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2508 unsigned total
= isl_basic_map_total_dim(bmap
);
2510 for (j
= 0; j
< 1 + total
; ++j
) {
2511 if (isl_int_is_zero(exp
[j
]))
2513 if (!first
&& isl_int_is_pos(exp
[j
]))
2515 dump_term(bmap
, exp
[j
], j
, out
);
2520 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2524 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2525 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2527 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2528 fprintf(out
, "%*s", indent
, "");
2529 fprintf(out
, "e%d = [(", i
);
2530 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2532 isl_int_print(out
, bmap
->div
[i
][0], 0);
2533 fprintf(out
, "]\n");
2537 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2538 FILE *out
, int indent
)
2541 fprintf(out
, "null basic set\n");
2545 fprintf(out
, "%*s", indent
, "");
2546 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2547 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2548 bset
->extra
, bset
->flags
);
2549 dump((struct isl_basic_map
*)bset
, out
, indent
);
2552 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2553 FILE *out
, int indent
)
2556 fprintf(out
, "null basic map\n");
2560 fprintf(out
, "%*s", indent
, "");
2561 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2562 "flags: %x, n_name: %d\n",
2564 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2565 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2566 dump(bmap
, out
, indent
);
2569 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2574 total
= isl_basic_map_total_dim(bmap
);
2575 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2576 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2577 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2578 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2582 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2585 struct isl_set
*set
;
2589 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2590 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2591 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2592 sizeof(struct isl_set
) +
2593 (n
- 1) * sizeof(struct isl_basic_set
*));
2597 set
->ctx
= dim
->ctx
;
2598 isl_ctx_ref(set
->ctx
);
2606 isl_space_free(dim
);
2610 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2611 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2613 struct isl_set
*set
;
2616 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2620 set
= isl_set_alloc_space(dims
, n
, flags
);
2624 /* Make sure "map" has room for at least "n" more basic maps.
2626 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2629 struct isl_map
*grown
= NULL
;
2633 isl_assert(map
->ctx
, n
>= 0, goto error
);
2634 if (map
->n
+ n
<= map
->size
)
2636 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2639 for (i
= 0; i
< map
->n
; ++i
) {
2640 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2648 isl_map_free(grown
);
2653 /* Make sure "set" has room for at least "n" more basic sets.
2655 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2657 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2660 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2663 struct isl_set
*dup
;
2668 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2671 for (i
= 0; i
< set
->n
; ++i
)
2672 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2676 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2678 return isl_map_from_basic_map(bset
);
2681 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2683 struct isl_map
*map
;
2688 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2689 return isl_map_add_basic_map(map
, bmap
);
2692 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2693 __isl_take isl_basic_set
*bset
)
2695 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2696 (struct isl_basic_map
*)bset
);
2699 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
2709 isl_ctx_deref(set
->ctx
);
2710 for (i
= 0; i
< set
->n
; ++i
)
2711 isl_basic_set_free(set
->p
[i
]);
2712 isl_space_free(set
->dim
);
2718 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2723 fprintf(out
, "null set\n");
2727 fprintf(out
, "%*s", indent
, "");
2728 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2729 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2731 for (i
= 0; i
< set
->n
; ++i
) {
2732 fprintf(out
, "%*s", indent
, "");
2733 fprintf(out
, "basic set %d:\n", i
);
2734 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2738 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2743 fprintf(out
, "null map\n");
2747 fprintf(out
, "%*s", indent
, "");
2748 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2749 "flags: %x, n_name: %d\n",
2750 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2751 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2752 for (i
= 0; i
< map
->n
; ++i
) {
2753 fprintf(out
, "%*s", indent
, "");
2754 fprintf(out
, "basic map %d:\n", i
);
2755 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2759 struct isl_basic_map
*isl_basic_map_intersect_domain(
2760 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2762 struct isl_basic_map
*bmap_domain
;
2767 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2768 bset
->dim
, isl_dim_param
), goto error
);
2770 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2771 isl_assert(bset
->ctx
,
2772 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2774 bmap
= isl_basic_map_cow(bmap
);
2777 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2778 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2779 bmap_domain
= isl_basic_map_from_domain(bset
);
2780 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2782 bmap
= isl_basic_map_simplify(bmap
);
2783 return isl_basic_map_finalize(bmap
);
2785 isl_basic_map_free(bmap
);
2786 isl_basic_set_free(bset
);
2790 struct isl_basic_map
*isl_basic_map_intersect_range(
2791 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2793 struct isl_basic_map
*bmap_range
;
2798 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2799 bset
->dim
, isl_dim_param
), goto error
);
2801 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2802 isl_assert(bset
->ctx
,
2803 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2805 if (isl_basic_set_plain_is_universe(bset
)) {
2806 isl_basic_set_free(bset
);
2810 bmap
= isl_basic_map_cow(bmap
);
2813 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2814 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2815 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2816 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2818 bmap
= isl_basic_map_simplify(bmap
);
2819 return isl_basic_map_finalize(bmap
);
2821 isl_basic_map_free(bmap
);
2822 isl_basic_set_free(bset
);
2826 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
2827 __isl_keep isl_vec
*vec
)
2834 return isl_bool_error
;
2836 total
= 1 + isl_basic_map_total_dim(bmap
);
2837 if (total
!= vec
->size
)
2838 return isl_bool_error
;
2842 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2843 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2844 if (!isl_int_is_zero(s
)) {
2846 return isl_bool_false
;
2850 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2851 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2852 if (isl_int_is_neg(s
)) {
2854 return isl_bool_false
;
2860 return isl_bool_true
;
2863 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
2864 __isl_keep isl_vec
*vec
)
2866 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2869 struct isl_basic_map
*isl_basic_map_intersect(
2870 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2872 struct isl_vec
*sample
= NULL
;
2874 if (!bmap1
|| !bmap2
)
2877 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2878 bmap2
->dim
, isl_dim_param
), goto error
);
2879 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2880 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2881 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2882 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2883 return isl_basic_map_intersect(bmap2
, bmap1
);
2885 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2886 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2887 isl_assert(bmap1
->ctx
,
2888 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2890 if (isl_basic_map_plain_is_empty(bmap1
)) {
2891 isl_basic_map_free(bmap2
);
2894 if (isl_basic_map_plain_is_empty(bmap2
)) {
2895 isl_basic_map_free(bmap1
);
2899 if (bmap1
->sample
&&
2900 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2901 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2902 sample
= isl_vec_copy(bmap1
->sample
);
2903 else if (bmap2
->sample
&&
2904 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2905 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2906 sample
= isl_vec_copy(bmap2
->sample
);
2908 bmap1
= isl_basic_map_cow(bmap1
);
2911 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2912 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2913 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2916 isl_vec_free(sample
);
2918 isl_vec_free(bmap1
->sample
);
2919 bmap1
->sample
= sample
;
2922 bmap1
= isl_basic_map_simplify(bmap1
);
2923 return isl_basic_map_finalize(bmap1
);
2926 isl_vec_free(sample
);
2927 isl_basic_map_free(bmap1
);
2928 isl_basic_map_free(bmap2
);
2932 struct isl_basic_set
*isl_basic_set_intersect(
2933 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2935 return (struct isl_basic_set
*)
2936 isl_basic_map_intersect(
2937 (struct isl_basic_map
*)bset1
,
2938 (struct isl_basic_map
*)bset2
);
2941 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2942 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2944 return isl_basic_set_intersect(bset1
, bset2
);
2947 /* Special case of isl_map_intersect, where both map1 and map2
2948 * are convex, without any divs and such that either map1 or map2
2949 * contains a single constraint. This constraint is then simply
2950 * added to the other map.
2952 static __isl_give isl_map
*map_intersect_add_constraint(
2953 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2955 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2956 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2957 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2958 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2960 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2961 return isl_map_intersect(map2
, map1
);
2963 isl_assert(map2
->ctx
,
2964 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2966 map1
= isl_map_cow(map1
);
2969 if (isl_map_plain_is_empty(map1
)) {
2973 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2974 if (map2
->p
[0]->n_eq
== 1)
2975 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2977 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2978 map2
->p
[0]->ineq
[0]);
2980 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2981 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2985 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2986 isl_basic_map_free(map1
->p
[0]);
2999 /* map2 may be either a parameter domain or a map living in the same
3002 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3003 __isl_take isl_map
*map2
)
3012 if ((isl_map_plain_is_empty(map1
) ||
3013 isl_map_plain_is_universe(map2
)) &&
3014 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3018 if ((isl_map_plain_is_empty(map2
) ||
3019 isl_map_plain_is_universe(map1
)) &&
3020 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3025 if (map1
->n
== 1 && map2
->n
== 1 &&
3026 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3027 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3028 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3029 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3030 return map_intersect_add_constraint(map1
, map2
);
3032 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3033 isl_space_dim(map2
->dim
, isl_dim_param
))
3034 isl_assert(map1
->ctx
,
3035 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3037 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3038 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3039 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3041 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3042 map1
->n
* map2
->n
, flags
);
3045 for (i
= 0; i
< map1
->n
; ++i
)
3046 for (j
= 0; j
< map2
->n
; ++j
) {
3047 struct isl_basic_map
*part
;
3048 part
= isl_basic_map_intersect(
3049 isl_basic_map_copy(map1
->p
[i
]),
3050 isl_basic_map_copy(map2
->p
[j
]));
3051 if (isl_basic_map_is_empty(part
) < 0)
3052 part
= isl_basic_map_free(part
);
3053 result
= isl_map_add_basic_map(result
, part
);
3066 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3067 __isl_take isl_map
*map2
)
3071 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3072 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3073 "spaces don't match", goto error
);
3074 return map_intersect_internal(map1
, map2
);
3081 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3082 __isl_take isl_map
*map2
)
3084 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3087 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3089 return (struct isl_set
*)
3090 isl_map_intersect((struct isl_map
*)set1
,
3091 (struct isl_map
*)set2
);
3094 /* map_intersect_internal accepts intersections
3095 * with parameter domains, so we can just call that function.
3097 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3098 __isl_take isl_set
*params
)
3100 return map_intersect_internal(map
, params
);
3103 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3104 __isl_take isl_map
*map2
)
3106 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3109 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3110 __isl_take isl_set
*params
)
3112 return isl_map_intersect_params(set
, params
);
3115 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3118 unsigned pos
, n1
, n2
;
3122 bmap
= isl_basic_map_cow(bmap
);
3125 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3126 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3127 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3128 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3129 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3130 return isl_basic_map_reset_space(bmap
, space
);
3133 static __isl_give isl_basic_map
*basic_map_space_reset(
3134 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3140 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3143 space
= isl_basic_map_get_space(bmap
);
3144 space
= isl_space_reset(space
, type
);
3145 bmap
= isl_basic_map_reset_space(bmap
, space
);
3149 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3150 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3151 unsigned pos
, unsigned n
)
3154 struct isl_basic_map
*res
;
3155 struct isl_dim_map
*dim_map
;
3156 unsigned total
, off
;
3157 enum isl_dim_type t
;
3160 return basic_map_space_reset(bmap
, type
);
3165 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3167 total
= isl_basic_map_total_dim(bmap
) + n
;
3168 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3170 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3172 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3174 unsigned size
= isl_basic_map_dim(bmap
, t
);
3175 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3177 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3178 pos
, size
- pos
, off
+ pos
+ n
);
3180 off
+= isl_space_dim(res_dim
, t
);
3182 isl_dim_map_div(dim_map
, bmap
, off
);
3184 res
= isl_basic_map_alloc_space(res_dim
,
3185 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3186 if (isl_basic_map_is_rational(bmap
))
3187 res
= isl_basic_map_set_rational(res
);
3188 if (isl_basic_map_plain_is_empty(bmap
)) {
3189 isl_basic_map_free(bmap
);
3191 return isl_basic_map_set_to_empty(res
);
3193 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3194 return isl_basic_map_finalize(res
);
3197 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3198 __isl_take isl_basic_set
*bset
,
3199 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3201 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3204 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3205 enum isl_dim_type type
, unsigned n
)
3209 return isl_basic_map_insert_dims(bmap
, type
,
3210 isl_basic_map_dim(bmap
, type
), n
);
3213 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3214 enum isl_dim_type type
, unsigned n
)
3218 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3219 return isl_basic_map_add_dims(bset
, type
, n
);
3221 isl_basic_set_free(bset
);
3225 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3226 enum isl_dim_type type
)
3230 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3233 space
= isl_map_get_space(map
);
3234 space
= isl_space_reset(space
, type
);
3235 map
= isl_map_reset_space(map
, space
);
3239 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3240 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3245 return map_space_reset(map
, type
);
3247 map
= isl_map_cow(map
);
3251 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3255 for (i
= 0; i
< map
->n
; ++i
) {
3256 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3267 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3268 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3270 return isl_map_insert_dims(set
, type
, pos
, n
);
3273 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3274 enum isl_dim_type type
, unsigned n
)
3278 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3281 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3282 enum isl_dim_type type
, unsigned n
)
3286 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3287 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3293 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3294 __isl_take isl_basic_map
*bmap
,
3295 enum isl_dim_type dst_type
, unsigned dst_pos
,
3296 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3298 struct isl_dim_map
*dim_map
;
3299 struct isl_basic_map
*res
;
3300 enum isl_dim_type t
;
3301 unsigned total
, off
;
3308 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3311 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3314 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3316 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3317 pos(bmap
->dim
, src_type
) + src_pos
+
3318 ((src_type
< dst_type
) ? n
: 0)) {
3319 bmap
= isl_basic_map_cow(bmap
);
3323 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3324 src_type
, src_pos
, n
);
3328 bmap
= isl_basic_map_finalize(bmap
);
3333 total
= isl_basic_map_total_dim(bmap
);
3334 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3337 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3338 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3339 if (t
== dst_type
) {
3340 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3343 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3346 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3347 dst_pos
, size
- dst_pos
, off
);
3348 off
+= size
- dst_pos
;
3349 } else if (t
== src_type
) {
3350 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3353 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3354 src_pos
+ n
, size
- src_pos
- n
, off
);
3355 off
+= size
- src_pos
- n
;
3357 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3361 isl_dim_map_div(dim_map
, bmap
, off
);
3363 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3364 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3365 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3369 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3370 src_type
, src_pos
, n
);
3374 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3375 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3376 bmap
= isl_basic_map_finalize(bmap
);
3380 isl_basic_map_free(bmap
);
3384 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3385 enum isl_dim_type dst_type
, unsigned dst_pos
,
3386 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3388 return (isl_basic_set
*)isl_basic_map_move_dims(
3389 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3392 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3393 enum isl_dim_type dst_type
, unsigned dst_pos
,
3394 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3398 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3399 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3400 src_type
, src_pos
, n
);
3406 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3407 enum isl_dim_type dst_type
, unsigned dst_pos
,
3408 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3417 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3420 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3423 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3425 map
= isl_map_cow(map
);
3429 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3433 for (i
= 0; i
< map
->n
; ++i
) {
3434 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3436 src_type
, src_pos
, n
);
3447 /* Move the specified dimensions to the last columns right before
3448 * the divs. Don't change the dimension specification of bmap.
3449 * That's the responsibility of the caller.
3451 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3452 enum isl_dim_type type
, unsigned first
, unsigned n
)
3454 struct isl_dim_map
*dim_map
;
3455 struct isl_basic_map
*res
;
3456 enum isl_dim_type t
;
3457 unsigned total
, off
;
3461 if (pos(bmap
->dim
, type
) + first
+ n
==
3462 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3465 total
= isl_basic_map_total_dim(bmap
);
3466 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3469 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3470 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3472 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3475 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3476 first
, n
, total
- bmap
->n_div
- n
);
3477 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3478 first
+ n
, size
- (first
+ n
), off
);
3479 off
+= size
- (first
+ n
);
3481 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3485 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3487 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3488 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3489 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3493 /* Insert "n" rows in the divs of "bmap".
3495 * The number of columns is not changed, which means that the last
3496 * dimensions of "bmap" are being reintepreted as the new divs.
3497 * The space of "bmap" is not adjusted, however, which means
3498 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3499 * from the space of "bmap" is the responsibility of the caller.
3501 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3509 bmap
= isl_basic_map_cow(bmap
);
3513 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3514 old
= bmap
->block2
.data
;
3515 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3516 (bmap
->extra
+ n
) * (1 + row_size
));
3517 if (!bmap
->block2
.data
)
3518 return isl_basic_map_free(bmap
);
3519 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3521 return isl_basic_map_free(bmap
);
3522 for (i
= 0; i
< n
; ++i
) {
3523 new_div
[i
] = bmap
->block2
.data
+
3524 (bmap
->extra
+ i
) * (1 + row_size
);
3525 isl_seq_clr(new_div
[i
], 1 + row_size
);
3527 for (i
= 0; i
< bmap
->extra
; ++i
)
3528 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3530 bmap
->div
= new_div
;
3537 /* Drop constraints from "bmap" that only involve the variables
3538 * of "type" in the range [first, first + n] that are not related
3539 * to any of the variables outside that interval.
3540 * These constraints cannot influence the values for the variables
3541 * outside the interval, except in case they cause "bmap" to be empty.
3542 * Only drop the constraints if "bmap" is known to be non-empty.
3544 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
3545 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3546 unsigned first
, unsigned n
)
3550 unsigned dim
, n_div
;
3553 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
3555 return isl_basic_map_free(bmap
);
3559 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
3560 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
3561 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
3563 return isl_basic_map_free(bmap
);
3564 first
+= isl_basic_map_offset(bmap
, type
) - 1;
3565 for (i
= 0; i
< first
; ++i
)
3567 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
3570 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
3575 /* Turn the n dimensions of type type, starting at first
3576 * into existentially quantified variables.
3578 * If a subset of the projected out variables are unrelated
3579 * to any of the variables that remain, then the constraints
3580 * involving this subset are simply dropped first.
3582 __isl_give isl_basic_map
*isl_basic_map_project_out(
3583 __isl_take isl_basic_map
*bmap
,
3584 enum isl_dim_type type
, unsigned first
, unsigned n
)
3587 return basic_map_space_reset(bmap
, type
);
3588 if (type
== isl_dim_div
)
3589 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
3590 "cannot project out existentially quantified variables",
3591 return isl_basic_map_free(bmap
));
3593 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
3597 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3598 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3600 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3603 bmap
= move_last(bmap
, type
, first
, n
);
3604 bmap
= isl_basic_map_cow(bmap
);
3605 bmap
= insert_div_rows(bmap
, n
);
3609 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3612 bmap
= isl_basic_map_simplify(bmap
);
3613 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3614 return isl_basic_map_finalize(bmap
);
3616 isl_basic_map_free(bmap
);
3620 /* Turn the n dimensions of type type, starting at first
3621 * into existentially quantified variables.
3623 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3624 enum isl_dim_type type
, unsigned first
, unsigned n
)
3626 return (isl_basic_set
*)isl_basic_map_project_out(
3627 (isl_basic_map
*)bset
, type
, first
, n
);
3630 /* Turn the n dimensions of type type, starting at first
3631 * into existentially quantified variables.
3633 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3634 enum isl_dim_type type
, unsigned first
, unsigned n
)
3642 return map_space_reset(map
, type
);
3644 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3646 map
= isl_map_cow(map
);
3650 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3654 for (i
= 0; i
< map
->n
; ++i
) {
3655 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3666 /* Turn the n dimensions of type type, starting at first
3667 * into existentially quantified variables.
3669 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3670 enum isl_dim_type type
, unsigned first
, unsigned n
)
3672 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3675 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3679 for (i
= 0; i
< n
; ++i
) {
3680 j
= isl_basic_map_alloc_div(bmap
);
3683 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3687 isl_basic_map_free(bmap
);
3691 struct isl_basic_map
*isl_basic_map_apply_range(
3692 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3694 isl_space
*dim_result
= NULL
;
3695 struct isl_basic_map
*bmap
;
3696 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3697 struct isl_dim_map
*dim_map1
, *dim_map2
;
3699 if (!bmap1
|| !bmap2
)
3701 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3702 bmap2
->dim
, isl_dim_param
))
3703 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3704 "parameters don't match", goto error
);
3705 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
3706 bmap2
->dim
, isl_dim_in
))
3707 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3708 "spaces don't match", goto error
);
3710 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3711 isl_space_copy(bmap2
->dim
));
3713 n_in
= isl_basic_map_n_in(bmap1
);
3714 n_out
= isl_basic_map_n_out(bmap2
);
3715 n
= isl_basic_map_n_out(bmap1
);
3716 nparam
= isl_basic_map_n_param(bmap1
);
3718 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3719 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3720 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3721 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3722 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3723 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3724 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3725 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3726 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3727 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3728 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3730 bmap
= isl_basic_map_alloc_space(dim_result
,
3731 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3732 bmap1
->n_eq
+ bmap2
->n_eq
,
3733 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3734 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3735 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3736 bmap
= add_divs(bmap
, n
);
3737 bmap
= isl_basic_map_simplify(bmap
);
3738 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3739 return isl_basic_map_finalize(bmap
);
3741 isl_basic_map_free(bmap1
);
3742 isl_basic_map_free(bmap2
);
3746 struct isl_basic_set
*isl_basic_set_apply(
3747 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3752 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3755 return (struct isl_basic_set
*)
3756 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3758 isl_basic_set_free(bset
);
3759 isl_basic_map_free(bmap
);
3763 struct isl_basic_map
*isl_basic_map_apply_domain(
3764 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3766 if (!bmap1
|| !bmap2
)
3769 isl_assert(bmap1
->ctx
,
3770 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3771 isl_assert(bmap1
->ctx
,
3772 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3775 bmap1
= isl_basic_map_reverse(bmap1
);
3776 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3777 return isl_basic_map_reverse(bmap1
);
3779 isl_basic_map_free(bmap1
);
3780 isl_basic_map_free(bmap2
);
3784 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3785 * A \cap B -> f(A) + f(B)
3787 struct isl_basic_map
*isl_basic_map_sum(
3788 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3790 unsigned n_in
, n_out
, nparam
, total
, pos
;
3791 struct isl_basic_map
*bmap
= NULL
;
3792 struct isl_dim_map
*dim_map1
, *dim_map2
;
3795 if (!bmap1
|| !bmap2
)
3798 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3801 nparam
= isl_basic_map_n_param(bmap1
);
3802 n_in
= isl_basic_map_n_in(bmap1
);
3803 n_out
= isl_basic_map_n_out(bmap1
);
3805 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3806 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3807 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3808 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3809 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3810 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3811 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3812 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3813 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3814 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3815 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3817 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3818 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3819 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3820 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3821 for (i
= 0; i
< n_out
; ++i
) {
3822 int j
= isl_basic_map_alloc_equality(bmap
);
3825 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3826 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3827 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3828 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3830 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3831 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3832 bmap
= add_divs(bmap
, 2 * n_out
);
3834 bmap
= isl_basic_map_simplify(bmap
);
3835 return isl_basic_map_finalize(bmap
);
3837 isl_basic_map_free(bmap
);
3838 isl_basic_map_free(bmap1
);
3839 isl_basic_map_free(bmap2
);
3843 /* Given two maps A -> f(A) and B -> g(B), construct a map
3844 * A \cap B -> f(A) + f(B)
3846 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3848 struct isl_map
*result
;
3854 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3856 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3857 map1
->n
* map2
->n
, 0);
3860 for (i
= 0; i
< map1
->n
; ++i
)
3861 for (j
= 0; j
< map2
->n
; ++j
) {
3862 struct isl_basic_map
*part
;
3863 part
= isl_basic_map_sum(
3864 isl_basic_map_copy(map1
->p
[i
]),
3865 isl_basic_map_copy(map2
->p
[j
]));
3866 if (isl_basic_map_is_empty(part
))
3867 isl_basic_map_free(part
);
3869 result
= isl_map_add_basic_map(result
, part
);
3882 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3883 __isl_take isl_set
*set2
)
3885 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3888 /* Given a basic map A -> f(A), construct A -> -f(A).
3890 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3895 bmap
= isl_basic_map_cow(bmap
);
3899 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3900 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3901 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3902 for (j
= 0; j
< n
; ++j
)
3903 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3904 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3905 for (j
= 0; j
< n
; ++j
)
3906 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3907 for (i
= 0; i
< bmap
->n_div
; ++i
)
3908 for (j
= 0; j
< n
; ++j
)
3909 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3910 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3911 return isl_basic_map_finalize(bmap
);
3914 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3916 return isl_basic_map_neg(bset
);
3919 /* Given a map A -> f(A), construct A -> -f(A).
3921 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3925 map
= isl_map_cow(map
);
3929 for (i
= 0; i
< map
->n
; ++i
) {
3930 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3941 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3943 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3946 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3947 * A -> floor(f(A)/d).
3949 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3952 unsigned n_in
, n_out
, nparam
, total
, pos
;
3953 struct isl_basic_map
*result
= NULL
;
3954 struct isl_dim_map
*dim_map
;
3960 nparam
= isl_basic_map_n_param(bmap
);
3961 n_in
= isl_basic_map_n_in(bmap
);
3962 n_out
= isl_basic_map_n_out(bmap
);
3964 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3965 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3966 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3967 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3968 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3969 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3971 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3972 bmap
->n_div
+ n_out
,
3973 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3974 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3975 result
= add_divs(result
, n_out
);
3976 for (i
= 0; i
< n_out
; ++i
) {
3978 j
= isl_basic_map_alloc_inequality(result
);
3981 isl_seq_clr(result
->ineq
[j
], 1+total
);
3982 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3983 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3984 j
= isl_basic_map_alloc_inequality(result
);
3987 isl_seq_clr(result
->ineq
[j
], 1+total
);
3988 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3989 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3990 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3993 result
= isl_basic_map_simplify(result
);
3994 return isl_basic_map_finalize(result
);
3996 isl_basic_map_free(result
);
4000 /* Given a map A -> f(A) and an integer d, construct a map
4001 * A -> floor(f(A)/d).
4003 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
4007 map
= isl_map_cow(map
);
4011 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4012 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4013 for (i
= 0; i
< map
->n
; ++i
) {
4014 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4025 /* Given a map A -> f(A) and an integer d, construct a map
4026 * A -> floor(f(A)/d).
4028 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4029 __isl_take isl_val
*d
)
4033 if (!isl_val_is_int(d
))
4034 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4035 "expecting integer denominator", goto error
);
4036 map
= isl_map_floordiv(map
, d
->n
);
4045 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
4051 i
= isl_basic_map_alloc_equality(bmap
);
4054 nparam
= isl_basic_map_n_param(bmap
);
4055 n_in
= isl_basic_map_n_in(bmap
);
4056 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4057 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4058 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4059 return isl_basic_map_finalize(bmap
);
4061 isl_basic_map_free(bmap
);
4065 /* Add a constraints to "bmap" expressing i_pos < o_pos
4067 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
4073 i
= isl_basic_map_alloc_inequality(bmap
);
4076 nparam
= isl_basic_map_n_param(bmap
);
4077 n_in
= isl_basic_map_n_in(bmap
);
4078 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4079 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4080 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4081 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4082 return isl_basic_map_finalize(bmap
);
4084 isl_basic_map_free(bmap
);
4088 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4090 static __isl_give isl_basic_map
*var_less_or_equal(
4091 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4097 i
= isl_basic_map_alloc_inequality(bmap
);
4100 nparam
= isl_basic_map_n_param(bmap
);
4101 n_in
= isl_basic_map_n_in(bmap
);
4102 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4103 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4104 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4105 return isl_basic_map_finalize(bmap
);
4107 isl_basic_map_free(bmap
);
4111 /* Add a constraints to "bmap" expressing i_pos > o_pos
4113 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
4119 i
= isl_basic_map_alloc_inequality(bmap
);
4122 nparam
= isl_basic_map_n_param(bmap
);
4123 n_in
= isl_basic_map_n_in(bmap
);
4124 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4125 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4126 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4127 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4128 return isl_basic_map_finalize(bmap
);
4130 isl_basic_map_free(bmap
);
4134 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4136 static __isl_give isl_basic_map
*var_more_or_equal(
4137 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4143 i
= isl_basic_map_alloc_inequality(bmap
);
4146 nparam
= isl_basic_map_n_param(bmap
);
4147 n_in
= isl_basic_map_n_in(bmap
);
4148 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4149 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4150 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4151 return isl_basic_map_finalize(bmap
);
4153 isl_basic_map_free(bmap
);
4157 __isl_give isl_basic_map
*isl_basic_map_equal(
4158 __isl_take isl_space
*dim
, unsigned n_equal
)
4161 struct isl_basic_map
*bmap
;
4162 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4165 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4166 bmap
= var_equal(bmap
, i
);
4167 return isl_basic_map_finalize(bmap
);
4170 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4172 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4176 struct isl_basic_map
*bmap
;
4177 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4180 for (i
= 0; i
< pos
&& bmap
; ++i
)
4181 bmap
= var_equal(bmap
, i
);
4183 bmap
= var_less(bmap
, pos
);
4184 return isl_basic_map_finalize(bmap
);
4187 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4189 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4190 __isl_take isl_space
*dim
, unsigned pos
)
4193 isl_basic_map
*bmap
;
4195 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4196 for (i
= 0; i
< pos
; ++i
)
4197 bmap
= var_equal(bmap
, i
);
4198 bmap
= var_less_or_equal(bmap
, pos
);
4199 return isl_basic_map_finalize(bmap
);
4202 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4204 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4208 struct isl_basic_map
*bmap
;
4209 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4212 for (i
= 0; i
< pos
&& bmap
; ++i
)
4213 bmap
= var_equal(bmap
, i
);
4215 bmap
= var_more(bmap
, pos
);
4216 return isl_basic_map_finalize(bmap
);
4219 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4221 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4222 __isl_take isl_space
*dim
, unsigned pos
)
4225 isl_basic_map
*bmap
;
4227 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4228 for (i
= 0; i
< pos
; ++i
)
4229 bmap
= var_equal(bmap
, i
);
4230 bmap
= var_more_or_equal(bmap
, pos
);
4231 return isl_basic_map_finalize(bmap
);
4234 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4235 unsigned n
, int equal
)
4237 struct isl_map
*map
;
4240 if (n
== 0 && equal
)
4241 return isl_map_universe(dims
);
4243 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4245 for (i
= 0; i
+ 1 < n
; ++i
)
4246 map
= isl_map_add_basic_map(map
,
4247 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4250 map
= isl_map_add_basic_map(map
,
4251 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4253 map
= isl_map_add_basic_map(map
,
4254 isl_basic_map_less_at(dims
, n
- 1));
4256 isl_space_free(dims
);
4261 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4265 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4268 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4270 return map_lex_lte_first(dim
, n
, 0);
4273 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4275 return map_lex_lte_first(dim
, n
, 1);
4278 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4280 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4283 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4285 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4288 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4289 unsigned n
, int equal
)
4291 struct isl_map
*map
;
4294 if (n
== 0 && equal
)
4295 return isl_map_universe(dims
);
4297 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4299 for (i
= 0; i
+ 1 < n
; ++i
)
4300 map
= isl_map_add_basic_map(map
,
4301 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4304 map
= isl_map_add_basic_map(map
,
4305 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4307 map
= isl_map_add_basic_map(map
,
4308 isl_basic_map_more_at(dims
, n
- 1));
4310 isl_space_free(dims
);
4315 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4319 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4322 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4324 return map_lex_gte_first(dim
, n
, 0);
4327 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4329 return map_lex_gte_first(dim
, n
, 1);
4332 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4334 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4337 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4339 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4342 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4343 __isl_take isl_set
*set2
)
4346 map
= isl_map_lex_le(isl_set_get_space(set1
));
4347 map
= isl_map_intersect_domain(map
, set1
);
4348 map
= isl_map_intersect_range(map
, set2
);
4352 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4353 __isl_take isl_set
*set2
)
4356 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4357 map
= isl_map_intersect_domain(map
, set1
);
4358 map
= isl_map_intersect_range(map
, set2
);
4362 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4363 __isl_take isl_set
*set2
)
4366 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4367 map
= isl_map_intersect_domain(map
, set1
);
4368 map
= isl_map_intersect_range(map
, set2
);
4372 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4373 __isl_take isl_set
*set2
)
4376 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4377 map
= isl_map_intersect_domain(map
, set1
);
4378 map
= isl_map_intersect_range(map
, set2
);
4382 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4383 __isl_take isl_map
*map2
)
4386 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4387 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4388 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4392 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4393 __isl_take isl_map
*map2
)
4396 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4397 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4398 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4402 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4403 __isl_take isl_map
*map2
)
4406 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4407 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4408 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4412 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4413 __isl_take isl_map
*map2
)
4416 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4417 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4418 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4422 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4423 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4425 struct isl_basic_map
*bmap
;
4427 bset
= isl_basic_set_cow(bset
);
4431 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4432 isl_space_free(bset
->dim
);
4433 bmap
= (struct isl_basic_map
*) bset
;
4435 return isl_basic_map_finalize(bmap
);
4437 isl_basic_set_free(bset
);
4438 isl_space_free(dim
);
4442 /* For a div d = floor(f/m), add the constraint
4446 static int add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
4447 unsigned pos
, isl_int
*div
)
4450 unsigned total
= isl_basic_map_total_dim(bmap
);
4452 i
= isl_basic_map_alloc_inequality(bmap
);
4455 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4456 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4461 /* For a div d = floor(f/m), add the constraint
4463 * -(f-(n-1)) + m d >= 0
4465 static int add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
4466 unsigned pos
, isl_int
*div
)
4469 unsigned total
= isl_basic_map_total_dim(bmap
);
4471 i
= isl_basic_map_alloc_inequality(bmap
);
4474 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4475 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
4476 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
4477 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
4482 /* For a div d = floor(f/m), add the constraints
4485 * -(f-(n-1)) + m d >= 0
4487 * Note that the second constraint is the negation of
4491 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4492 unsigned pos
, isl_int
*div
)
4494 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
4496 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
4501 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4502 unsigned pos
, isl_int
*div
)
4504 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4508 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4510 unsigned total
= isl_basic_map_total_dim(bmap
);
4511 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4513 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4517 /* For each known div d = floor(f/m), add the constraints
4520 * -(f-(n-1)) + m d >= 0
4522 * Remove duplicate constraints in case of some these div constraints
4523 * already appear in "bmap".
4525 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
4526 __isl_take isl_basic_map
*bmap
)
4532 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4536 bmap
= add_known_div_constraints(bmap
);
4537 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
4538 bmap
= isl_basic_map_finalize(bmap
);
4542 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4544 * In particular, if this div is of the form d = floor(f/m),
4545 * then add the constraint
4549 * if sign < 0 or the constraint
4551 * -(f-(n-1)) + m d >= 0
4555 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
4556 unsigned div
, int sign
)
4564 total
= isl_basic_map_total_dim(bmap
);
4565 div_pos
= total
- bmap
->n_div
+ div
;
4568 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4570 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4573 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4575 return isl_basic_map_add_div_constraints(bset
, div
);
4578 struct isl_basic_set
*isl_basic_map_underlying_set(
4579 struct isl_basic_map
*bmap
)
4583 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4585 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4586 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4587 return (struct isl_basic_set
*)bmap
;
4588 bmap
= isl_basic_map_cow(bmap
);
4591 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4594 bmap
->extra
-= bmap
->n_div
;
4596 bmap
= isl_basic_map_finalize(bmap
);
4597 return (struct isl_basic_set
*)bmap
;
4599 isl_basic_map_free(bmap
);
4603 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4604 __isl_take isl_basic_set
*bset
)
4606 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4609 /* Replace each element in "list" by the result of applying
4610 * isl_basic_map_underlying_set to the element.
4612 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
4613 __isl_take isl_basic_map_list
*list
)
4620 n
= isl_basic_map_list_n_basic_map(list
);
4621 for (i
= 0; i
< n
; ++i
) {
4622 isl_basic_map
*bmap
;
4623 isl_basic_set
*bset
;
4625 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
4626 bset
= isl_basic_set_underlying_set(bmap
);
4627 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
4633 struct isl_basic_map
*isl_basic_map_overlying_set(
4634 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4636 struct isl_basic_map
*bmap
;
4637 struct isl_ctx
*ctx
;
4644 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4645 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4646 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4648 if (like
->n_div
== 0) {
4649 isl_space
*space
= isl_basic_map_get_space(like
);
4650 isl_basic_map_free(like
);
4651 return isl_basic_map_reset_space(bset
, space
);
4653 bset
= isl_basic_set_cow(bset
);
4656 total
= bset
->dim
->n_out
+ bset
->extra
;
4657 bmap
= (struct isl_basic_map
*)bset
;
4658 isl_space_free(bmap
->dim
);
4659 bmap
->dim
= isl_space_copy(like
->dim
);
4662 bmap
->n_div
= like
->n_div
;
4663 bmap
->extra
+= like
->n_div
;
4667 ltotal
= total
- bmap
->extra
+ like
->extra
;
4670 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4671 bmap
->extra
* (1 + 1 + total
));
4672 if (isl_blk_is_error(bmap
->block2
))
4674 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4678 for (i
= 0; i
< bmap
->extra
; ++i
)
4679 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4680 for (i
= 0; i
< like
->n_div
; ++i
) {
4681 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4682 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4684 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
4686 isl_basic_map_free(like
);
4687 bmap
= isl_basic_map_simplify(bmap
);
4688 bmap
= isl_basic_map_finalize(bmap
);
4691 isl_basic_map_free(like
);
4692 isl_basic_set_free(bset
);
4696 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4697 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4699 return (struct isl_basic_set
*)
4700 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4703 struct isl_set
*isl_set_from_underlying_set(
4704 struct isl_set
*set
, struct isl_basic_set
*like
)
4710 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4712 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4713 isl_basic_set_free(like
);
4716 set
= isl_set_cow(set
);
4719 for (i
= 0; i
< set
->n
; ++i
) {
4720 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4721 isl_basic_set_copy(like
));
4725 isl_space_free(set
->dim
);
4726 set
->dim
= isl_space_copy(like
->dim
);
4729 isl_basic_set_free(like
);
4732 isl_basic_set_free(like
);
4737 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4741 map
= isl_map_cow(map
);
4744 map
->dim
= isl_space_cow(map
->dim
);
4748 for (i
= 1; i
< map
->n
; ++i
)
4749 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4751 for (i
= 0; i
< map
->n
; ++i
) {
4752 map
->p
[i
] = (struct isl_basic_map
*)
4753 isl_basic_map_underlying_set(map
->p
[i
]);
4758 map
->dim
= isl_space_underlying(map
->dim
, 0);
4760 isl_space_free(map
->dim
);
4761 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4765 return (struct isl_set
*)map
;
4771 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4773 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4776 /* Replace the space of "bmap" by "space".
4778 * If the space of "bmap" is identical to "space" (including the identifiers
4779 * of the input and output dimensions), then simply return the original input.
4781 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4782 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
4788 equal
= isl_space_is_equal(bmap
->dim
, space
);
4789 if (equal
>= 0 && equal
)
4790 equal
= isl_space_match(bmap
->dim
, isl_dim_in
,
4792 if (equal
>= 0 && equal
)
4793 equal
= isl_space_match(bmap
->dim
, isl_dim_out
,
4794 space
, isl_dim_out
);
4798 isl_space_free(space
);
4801 bmap
= isl_basic_map_cow(bmap
);
4802 if (!bmap
|| !space
)
4805 isl_space_free(bmap
->dim
);
4808 bmap
= isl_basic_map_finalize(bmap
);
4812 isl_basic_map_free(bmap
);
4813 isl_space_free(space
);
4817 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4818 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4820 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4824 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4825 __isl_take isl_space
*dim
)
4829 map
= isl_map_cow(map
);
4833 for (i
= 0; i
< map
->n
; ++i
) {
4834 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4835 isl_space_copy(dim
));
4839 isl_space_free(map
->dim
);
4845 isl_space_free(dim
);
4849 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4850 __isl_take isl_space
*dim
)
4852 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4855 /* Compute the parameter domain of the given basic set.
4857 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4862 if (isl_basic_set_is_params(bset
))
4865 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4866 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4867 space
= isl_basic_set_get_space(bset
);
4868 space
= isl_space_params(space
);
4869 bset
= isl_basic_set_reset_space(bset
, space
);
4873 /* Construct a zero-dimensional basic set with the given parameter domain.
4875 __isl_give isl_basic_set
*isl_basic_set_from_params(
4876 __isl_take isl_basic_set
*bset
)
4879 space
= isl_basic_set_get_space(bset
);
4880 space
= isl_space_set_from_params(space
);
4881 bset
= isl_basic_set_reset_space(bset
, space
);
4885 /* Compute the parameter domain of the given set.
4887 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4892 if (isl_set_is_params(set
))
4895 n
= isl_set_dim(set
, isl_dim_set
);
4896 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4897 space
= isl_set_get_space(set
);
4898 space
= isl_space_params(space
);
4899 set
= isl_set_reset_space(set
, space
);
4903 /* Construct a zero-dimensional set with the given parameter domain.
4905 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4908 space
= isl_set_get_space(set
);
4909 space
= isl_space_set_from_params(space
);
4910 set
= isl_set_reset_space(set
, space
);
4914 /* Compute the parameter domain of the given map.
4916 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4921 n
= isl_map_dim(map
, isl_dim_in
);
4922 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4923 n
= isl_map_dim(map
, isl_dim_out
);
4924 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4925 space
= isl_map_get_space(map
);
4926 space
= isl_space_params(space
);
4927 map
= isl_map_reset_space(map
, space
);
4931 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4938 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
4940 n_out
= isl_basic_map_n_out(bmap
);
4941 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
4943 return isl_basic_map_reset_space(bmap
, space
);
4946 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4950 return isl_space_may_be_set(bmap
->dim
);
4953 /* Is this basic map actually a set?
4954 * Users should never call this function. Outside of isl,
4955 * the type should indicate whether something is a set or a map.
4957 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4961 return isl_space_is_set(bmap
->dim
);
4964 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4968 if (isl_basic_map_is_set(bmap
))
4970 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4973 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4974 __isl_take isl_basic_map
*bmap
)
4978 isl_basic_map
*domain
;
4979 int nparam
, n_in
, n_out
;
4982 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4983 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4984 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4986 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4987 domain
= isl_basic_map_universe(dim
);
4989 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4990 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4991 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4993 total
= isl_basic_map_total_dim(bmap
);
4995 for (i
= 0; i
< n_in
; ++i
) {
4996 k
= isl_basic_map_alloc_equality(bmap
);
4999 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5000 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
5001 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
5004 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5005 return isl_basic_map_finalize(bmap
);
5007 isl_basic_map_free(bmap
);
5011 __isl_give isl_basic_map
*isl_basic_map_range_map(
5012 __isl_take isl_basic_map
*bmap
)
5016 isl_basic_map
*range
;
5017 int nparam
, n_in
, n_out
;
5020 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5021 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5022 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5024 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5025 range
= isl_basic_map_universe(dim
);
5027 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5028 bmap
= isl_basic_map_apply_range(bmap
, range
);
5029 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5031 total
= isl_basic_map_total_dim(bmap
);
5033 for (i
= 0; i
< n_out
; ++i
) {
5034 k
= isl_basic_map_alloc_equality(bmap
);
5037 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5038 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
5039 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
5042 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5043 return isl_basic_map_finalize(bmap
);
5045 isl_basic_map_free(bmap
);
5049 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5053 return isl_space_may_be_set(map
->dim
);
5056 /* Is this map actually a set?
5057 * Users should never call this function. Outside of isl,
5058 * the type should indicate whether something is a set or a map.
5060 int isl_map_is_set(__isl_keep isl_map
*map
)
5064 return isl_space_is_set(map
->dim
);
5067 struct isl_set
*isl_map_range(struct isl_map
*map
)
5070 struct isl_set
*set
;
5074 if (isl_map_is_set(map
))
5075 return (isl_set
*)map
;
5077 map
= isl_map_cow(map
);
5081 set
= (struct isl_set
*) map
;
5082 set
->dim
= isl_space_range(set
->dim
);
5085 for (i
= 0; i
< map
->n
; ++i
) {
5086 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5090 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5091 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5098 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5102 map
= isl_map_cow(map
);
5106 map
->dim
= isl_space_domain_map(map
->dim
);
5109 for (i
= 0; i
< map
->n
; ++i
) {
5110 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5114 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5115 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5122 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5125 isl_space
*range_dim
;
5127 map
= isl_map_cow(map
);
5131 range_dim
= isl_space_range(isl_map_get_space(map
));
5132 range_dim
= isl_space_from_range(range_dim
);
5133 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5134 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5137 for (i
= 0; i
< map
->n
; ++i
) {
5138 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5142 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5143 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5150 /* Given a wrapped map of the form A[B -> C],
5151 * return the map A[B -> C] -> B.
5153 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5160 if (!isl_set_has_tuple_id(set
))
5161 return isl_map_domain_map(isl_set_unwrap(set
));
5163 id
= isl_set_get_tuple_id(set
);
5164 map
= isl_map_domain_map(isl_set_unwrap(set
));
5165 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5170 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
5171 __isl_take isl_space
*dim
)
5174 struct isl_map
*map
= NULL
;
5176 set
= isl_set_cow(set
);
5179 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
5180 map
= (struct isl_map
*)set
;
5181 for (i
= 0; i
< set
->n
; ++i
) {
5182 map
->p
[i
] = isl_basic_map_from_basic_set(
5183 set
->p
[i
], isl_space_copy(dim
));
5187 isl_space_free(map
->dim
);
5191 isl_space_free(dim
);
5196 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5197 __isl_take isl_basic_set
*bset
)
5199 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5202 __isl_give isl_basic_map
*isl_basic_map_from_range(
5203 __isl_take isl_basic_set
*bset
)
5206 space
= isl_basic_set_get_space(bset
);
5207 space
= isl_space_from_range(space
);
5208 bset
= isl_basic_set_reset_space(bset
, space
);
5209 return (isl_basic_map
*)bset
;
5212 /* Create a relation with the given set as range.
5213 * The domain of the created relation is a zero-dimensional
5214 * flat anonymous space.
5216 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5219 space
= isl_set_get_space(set
);
5220 space
= isl_space_from_range(space
);
5221 set
= isl_set_reset_space(set
, space
);
5222 return (struct isl_map
*)set
;
5225 /* Create a relation with the given set as domain.
5226 * The range of the created relation is a zero-dimensional
5227 * flat anonymous space.
5229 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5231 return isl_map_reverse(isl_map_from_range(set
));
5234 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5235 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5237 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5240 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5241 __isl_take isl_set
*range
)
5243 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5246 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
5249 struct isl_map
*map
;
5254 isl_die(dim
->ctx
, isl_error_internal
,
5255 "negative number of basic maps", goto error
);
5256 map
= isl_alloc(dim
->ctx
, struct isl_map
,
5257 sizeof(struct isl_map
) +
5258 (n
- 1) * sizeof(struct isl_basic_map
*));
5262 map
->ctx
= dim
->ctx
;
5263 isl_ctx_ref(map
->ctx
);
5271 isl_space_free(dim
);
5275 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5276 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5279 struct isl_map
*map
;
5282 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5286 map
= isl_map_alloc_space(dims
, n
, flags
);
5290 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5292 struct isl_basic_map
*bmap
;
5293 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5294 bmap
= isl_basic_map_set_to_empty(bmap
);
5298 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5300 struct isl_basic_set
*bset
;
5301 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5302 bset
= isl_basic_set_set_to_empty(bset
);
5306 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5308 struct isl_basic_map
*bmap
;
5309 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5310 bmap
= isl_basic_map_finalize(bmap
);
5314 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5316 struct isl_basic_set
*bset
;
5317 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5318 bset
= isl_basic_set_finalize(bset
);
5322 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5325 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5326 isl_basic_map
*bmap
;
5328 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5329 for (i
= 0; i
< total
; ++i
) {
5330 int k
= isl_basic_map_alloc_inequality(bmap
);
5333 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5334 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5338 isl_basic_map_free(bmap
);
5342 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5344 return isl_basic_map_nat_universe(dim
);
5347 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5349 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5352 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5354 return isl_map_nat_universe(dim
);
5357 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5359 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5362 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5364 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5367 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5369 struct isl_map
*map
;
5372 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5373 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5377 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5379 struct isl_set
*set
;
5382 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5383 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5387 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5390 struct isl_map
*dup
;
5394 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5395 for (i
= 0; i
< map
->n
; ++i
)
5396 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5400 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5401 __isl_take isl_basic_map
*bmap
)
5405 if (isl_basic_map_plain_is_empty(bmap
)) {
5406 isl_basic_map_free(bmap
);
5409 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5410 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5411 map
->p
[map
->n
] = bmap
;
5413 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5419 isl_basic_map_free(bmap
);
5423 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
5433 isl_ctx_deref(map
->ctx
);
5434 for (i
= 0; i
< map
->n
; ++i
)
5435 isl_basic_map_free(map
->p
[i
]);
5436 isl_space_free(map
->dim
);
5442 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5443 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5447 bmap
= isl_basic_map_cow(bmap
);
5448 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5449 j
= isl_basic_map_alloc_equality(bmap
);
5452 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5453 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5454 isl_int_set_si(bmap
->eq
[j
][0], value
);
5455 bmap
= isl_basic_map_simplify(bmap
);
5456 return isl_basic_map_finalize(bmap
);
5458 isl_basic_map_free(bmap
);
5462 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5463 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5467 bmap
= isl_basic_map_cow(bmap
);
5468 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5469 j
= isl_basic_map_alloc_equality(bmap
);
5472 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5473 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5474 isl_int_set(bmap
->eq
[j
][0], value
);
5475 bmap
= isl_basic_map_simplify(bmap
);
5476 return isl_basic_map_finalize(bmap
);
5478 isl_basic_map_free(bmap
);
5482 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5483 enum isl_dim_type type
, unsigned pos
, int value
)
5487 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5488 return isl_basic_map_fix_pos_si(bmap
,
5489 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5491 isl_basic_map_free(bmap
);
5495 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5496 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5500 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5501 return isl_basic_map_fix_pos(bmap
,
5502 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5504 isl_basic_map_free(bmap
);
5508 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5509 * to be equal to "v".
5511 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5512 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5516 if (!isl_val_is_int(v
))
5517 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5518 "expecting integer value", goto error
);
5519 if (pos
>= isl_basic_map_dim(bmap
, type
))
5520 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5521 "index out of bounds", goto error
);
5522 pos
+= isl_basic_map_offset(bmap
, type
);
5523 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5527 isl_basic_map_free(bmap
);
5532 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5533 * to be equal to "v".
5535 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5536 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5538 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5541 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5542 enum isl_dim_type type
, unsigned pos
, int value
)
5544 return (struct isl_basic_set
*)
5545 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5549 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5550 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5552 return (struct isl_basic_set
*)
5553 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5557 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5558 unsigned input
, int value
)
5560 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5563 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5564 unsigned dim
, int value
)
5566 return (struct isl_basic_set
*)
5567 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5568 isl_dim_set
, dim
, value
);
5571 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5573 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5580 isl_basic_map_free(map
->p
[i
]);
5581 if (i
!= map
->n
- 1) {
5582 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5583 map
->p
[i
] = map
->p
[map
->n
- 1];
5590 /* Perform "fn" on each basic map of "map", where we may not be holding
5591 * the only reference to "map".
5592 * In particular, "fn" should be a semantics preserving operation
5593 * that we want to apply to all copies of "map". We therefore need
5594 * to be careful not to modify "map" in a way that breaks "map"
5595 * in case anything goes wrong.
5597 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5598 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5600 struct isl_basic_map
*bmap
;
5606 for (i
= map
->n
- 1; i
>= 0; --i
) {
5607 bmap
= isl_basic_map_copy(map
->p
[i
]);
5611 isl_basic_map_free(map
->p
[i
]);
5613 if (remove_if_empty(map
, i
) < 0)
5623 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5624 enum isl_dim_type type
, unsigned pos
, int value
)
5628 map
= isl_map_cow(map
);
5632 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5633 for (i
= map
->n
- 1; i
>= 0; --i
) {
5634 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5635 if (remove_if_empty(map
, i
) < 0)
5638 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5645 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5646 enum isl_dim_type type
, unsigned pos
, int value
)
5648 return (struct isl_set
*)
5649 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5652 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5653 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5657 map
= isl_map_cow(map
);
5661 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5662 for (i
= 0; i
< map
->n
; ++i
) {
5663 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5667 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5674 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5675 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5677 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5680 /* Fix the value of the variable at position "pos" of type "type" of "map"
5681 * to be equal to "v".
5683 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5684 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5688 map
= isl_map_cow(map
);
5692 if (!isl_val_is_int(v
))
5693 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5694 "expecting integer value", goto error
);
5695 if (pos
>= isl_map_dim(map
, type
))
5696 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5697 "index out of bounds", goto error
);
5698 for (i
= map
->n
- 1; i
>= 0; --i
) {
5699 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5701 if (remove_if_empty(map
, i
) < 0)
5704 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5713 /* Fix the value of the variable at position "pos" of type "type" of "set"
5714 * to be equal to "v".
5716 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5717 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5719 return isl_map_fix_val(set
, type
, pos
, v
);
5722 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5723 unsigned input
, int value
)
5725 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5728 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5730 return (struct isl_set
*)
5731 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5734 static __isl_give isl_basic_map
*basic_map_bound_si(
5735 __isl_take isl_basic_map
*bmap
,
5736 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5742 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5743 pos
+= isl_basic_map_offset(bmap
, type
);
5744 bmap
= isl_basic_map_cow(bmap
);
5745 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5746 j
= isl_basic_map_alloc_inequality(bmap
);
5749 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5751 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5752 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5754 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5755 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5757 bmap
= isl_basic_map_simplify(bmap
);
5758 return isl_basic_map_finalize(bmap
);
5760 isl_basic_map_free(bmap
);
5764 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5765 __isl_take isl_basic_map
*bmap
,
5766 enum isl_dim_type type
, unsigned pos
, int value
)
5768 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5771 /* Constrain the values of the given dimension to be no greater than "value".
5773 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5774 __isl_take isl_basic_map
*bmap
,
5775 enum isl_dim_type type
, unsigned pos
, int value
)
5777 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5780 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5781 unsigned dim
, isl_int value
)
5785 bset
= isl_basic_set_cow(bset
);
5786 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5787 j
= isl_basic_set_alloc_inequality(bset
);
5790 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5791 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5792 isl_int_neg(bset
->ineq
[j
][0], value
);
5793 bset
= isl_basic_set_simplify(bset
);
5794 return isl_basic_set_finalize(bset
);
5796 isl_basic_set_free(bset
);
5800 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5801 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5805 map
= isl_map_cow(map
);
5809 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5810 for (i
= 0; i
< map
->n
; ++i
) {
5811 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5812 type
, pos
, value
, upper
);
5816 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5823 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5824 enum isl_dim_type type
, unsigned pos
, int value
)
5826 return map_bound_si(map
, type
, pos
, value
, 0);
5829 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5830 enum isl_dim_type type
, unsigned pos
, int value
)
5832 return map_bound_si(map
, type
, pos
, value
, 1);
5835 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5836 enum isl_dim_type type
, unsigned pos
, int value
)
5838 return (struct isl_set
*)
5839 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5842 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5843 enum isl_dim_type type
, unsigned pos
, int value
)
5845 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5848 /* Bound the given variable of "bmap" from below (or above is "upper"
5849 * is set) to "value".
5851 static __isl_give isl_basic_map
*basic_map_bound(
5852 __isl_take isl_basic_map
*bmap
,
5853 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5859 if (pos
>= isl_basic_map_dim(bmap
, type
))
5860 isl_die(bmap
->ctx
, isl_error_invalid
,
5861 "index out of bounds", goto error
);
5862 pos
+= isl_basic_map_offset(bmap
, type
);
5863 bmap
= isl_basic_map_cow(bmap
);
5864 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5865 j
= isl_basic_map_alloc_inequality(bmap
);
5868 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5870 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5871 isl_int_set(bmap
->ineq
[j
][0], value
);
5873 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5874 isl_int_neg(bmap
->ineq
[j
][0], value
);
5876 bmap
= isl_basic_map_simplify(bmap
);
5877 return isl_basic_map_finalize(bmap
);
5879 isl_basic_map_free(bmap
);
5883 /* Bound the given variable of "map" from below (or above is "upper"
5884 * is set) to "value".
5886 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5887 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5891 map
= isl_map_cow(map
);
5895 if (pos
>= isl_map_dim(map
, type
))
5896 isl_die(map
->ctx
, isl_error_invalid
,
5897 "index out of bounds", goto error
);
5898 for (i
= map
->n
- 1; i
>= 0; --i
) {
5899 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5900 if (remove_if_empty(map
, i
) < 0)
5903 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5910 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5911 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5913 return map_bound(map
, type
, pos
, value
, 0);
5916 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5917 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5919 return map_bound(map
, type
, pos
, value
, 1);
5922 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5923 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5925 return isl_map_lower_bound(set
, type
, pos
, value
);
5928 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5929 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5931 return isl_map_upper_bound(set
, type
, pos
, value
);
5934 /* Force the values of the variable at position "pos" of type "type" of "set"
5935 * to be no smaller than "value".
5937 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
5938 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5942 if (!isl_val_is_int(value
))
5943 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5944 "expecting integer value", goto error
);
5945 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
5946 isl_val_free(value
);
5949 isl_val_free(value
);
5954 /* Force the values of the variable at position "pos" of type "type" of "set"
5955 * to be no greater than "value".
5957 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
5958 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5962 if (!isl_val_is_int(value
))
5963 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5964 "expecting integer value", goto error
);
5965 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
5966 isl_val_free(value
);
5969 isl_val_free(value
);
5974 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5979 set
= isl_set_cow(set
);
5983 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5984 for (i
= 0; i
< set
->n
; ++i
) {
5985 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5995 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5999 map
= isl_map_cow(map
);
6003 map
->dim
= isl_space_reverse(map
->dim
);
6006 for (i
= 0; i
< map
->n
; ++i
) {
6007 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6011 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6018 static struct isl_map
*isl_basic_map_partial_lexopt(
6019 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
6020 struct isl_set
**empty
, int max
)
6022 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
6025 struct isl_map
*isl_basic_map_partial_lexmax(
6026 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
6027 struct isl_set
**empty
)
6029 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
6032 struct isl_map
*isl_basic_map_partial_lexmin(
6033 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
6034 struct isl_set
**empty
)
6036 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
6039 struct isl_set
*isl_basic_set_partial_lexmin(
6040 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
6041 struct isl_set
**empty
)
6043 return (struct isl_set
*)
6044 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
6048 struct isl_set
*isl_basic_set_partial_lexmax(
6049 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
6050 struct isl_set
**empty
)
6052 return (struct isl_set
*)
6053 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
6057 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
6058 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
6059 __isl_give isl_set
**empty
)
6061 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
6064 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
6065 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
6066 __isl_give isl_set
**empty
)
6068 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
6071 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
6072 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
6073 __isl_give isl_set
**empty
)
6075 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
6078 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
6079 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
6080 __isl_give isl_set
**empty
)
6082 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
6085 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
6086 __isl_take isl_basic_map
*bmap
, int max
)
6088 isl_basic_set
*dom
= NULL
;
6089 isl_space
*dom_space
;
6093 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
6094 dom
= isl_basic_set_universe(dom_space
);
6095 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
6097 isl_basic_map_free(bmap
);
6101 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
6102 __isl_take isl_basic_map
*bmap
)
6104 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
6108 #define TYPE isl_pw_multi_aff
6110 #define SUFFIX _pw_multi_aff
6112 #define EMPTY isl_pw_multi_aff_empty
6114 #define ADD isl_pw_multi_aff_union_add
6115 #include "isl_map_lexopt_templ.c"
6117 /* Given a map "map", compute the lexicographically minimal
6118 * (or maximal) image element for each domain element in dom,
6119 * in the form of an isl_pw_multi_aff.
6120 * If "empty" is not NULL, then set *empty to those elements in dom that
6121 * do not have an image element.
6123 * We first compute the lexicographically minimal or maximal element
6124 * in the first basic map. This results in a partial solution "res"
6125 * and a subset "todo" of dom that still need to be handled.
6126 * We then consider each of the remaining maps in "map" and successively
6127 * update both "res" and "todo".
6128 * If "empty" is NULL, then the todo sets are not needed and therefore
6129 * also not computed.
6131 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6132 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6133 __isl_give isl_set
**empty
, int max
)
6136 isl_pw_multi_aff
*res
;
6142 if (isl_map_plain_is_empty(map
)) {
6147 return isl_pw_multi_aff_from_map(map
);
6150 res
= basic_map_partial_lexopt_pw_multi_aff(
6151 isl_basic_map_copy(map
->p
[0]),
6152 isl_set_copy(dom
), empty
, max
);
6156 for (i
= 1; i
< map
->n
; ++i
) {
6157 isl_pw_multi_aff
*res_i
;
6159 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6160 isl_basic_map_copy(map
->p
[i
]),
6161 isl_set_copy(dom
), empty
, max
);
6164 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6166 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6169 todo
= isl_set_intersect(todo
, *empty
);
6188 #define TYPE isl_map
6192 #define EMPTY isl_map_empty
6194 #define ADD isl_map_union_disjoint
6195 #include "isl_map_lexopt_templ.c"
6197 /* Given a map "map", compute the lexicographically minimal
6198 * (or maximal) image element for each domain element in dom.
6199 * Set *empty to those elements in dom that do not have an image element.
6201 * We first compute the lexicographically minimal or maximal element
6202 * in the first basic map. This results in a partial solution "res"
6203 * and a subset "todo" of dom that still need to be handled.
6204 * We then consider each of the remaining maps in "map" and successively
6205 * update both "res" and "todo".
6207 * Let res^k and todo^k be the results after k steps and let i = k + 1.
6208 * Assume we are computing the lexicographical maximum.
6209 * We first compute the lexicographically maximal element in basic map i.
6210 * This results in a partial solution res_i and a subset todo_i.
6211 * Then we combine these results with those obtain for the first k basic maps
6212 * to obtain a result that is valid for the first k+1 basic maps.
6213 * In particular, the set where there is no solution is the set where
6214 * there is no solution for the first k basic maps and also no solution
6215 * for the ith basic map, i.e.,
6217 * todo^i = todo^k * todo_i
6219 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
6220 * solutions, arbitrarily breaking ties in favor of res^k.
6221 * That is, when res^k(a) >= res_i(a), we pick res^k and
6222 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
6223 * the lexicographic order.)
6224 * In practice, we compute
6226 * res^k * (res_i . "<=")
6230 * res_i * (res^k . "<")
6232 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
6233 * where only one of res^k and res_i provides a solution and we simply pick
6240 * Note that we only compute these intersections when dom(res^k) intersects
6241 * dom(res_i). Otherwise, the only effect of these intersections is to
6242 * potentially break up res^k and res_i into smaller pieces.
6243 * We want to avoid such splintering as much as possible.
6244 * In fact, an earlier implementation of this function would look for
6245 * better results in the domain of res^k and for extra results in todo^k,
6246 * but this would always result in a splintering according to todo^k,
6247 * even when the domain of basic map i is disjoint from the domains of
6248 * the previous basic maps.
6250 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6251 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6252 __isl_give isl_set
**empty
, int max
)
6255 struct isl_map
*res
;
6256 struct isl_set
*todo
;
6261 if (isl_map_plain_is_empty(map
)) {
6269 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6270 isl_set_copy(dom
), &todo
, max
);
6272 for (i
= 1; i
< map
->n
; ++i
) {
6276 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
6278 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
6279 isl_set_copy(dom
), &todo_i
, max
);
6282 lt
= isl_map_lex_lt(isl_space_copy(dim
));
6283 le
= isl_map_lex_le(dim
);
6285 lt
= isl_map_lex_gt(isl_space_copy(dim
));
6286 le
= isl_map_lex_ge(dim
);
6288 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
6289 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
6290 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6291 le
= isl_map_intersect(le
, isl_map_copy(res
));
6293 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6294 res
= isl_map_intersect_domain(res
,
6295 isl_set_copy(todo_i
));
6296 res_i
= isl_map_intersect_domain(res_i
,
6297 isl_set_copy(todo
));
6300 res
= isl_map_union_disjoint(res
, res_i
);
6301 res
= isl_map_union_disjoint(res
, lt
);
6302 res
= isl_map_union_disjoint(res
, le
);
6304 todo
= isl_set_intersect(todo
, todo_i
);
6324 __isl_give isl_map
*isl_map_partial_lexmax(
6325 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6326 __isl_give isl_set
**empty
)
6328 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6331 __isl_give isl_map
*isl_map_partial_lexmin(
6332 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6333 __isl_give isl_set
**empty
)
6335 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6338 __isl_give isl_set
*isl_set_partial_lexmin(
6339 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6340 __isl_give isl_set
**empty
)
6342 return (struct isl_set
*)
6343 isl_map_partial_lexmin((struct isl_map
*)set
,
6347 __isl_give isl_set
*isl_set_partial_lexmax(
6348 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6349 __isl_give isl_set
**empty
)
6351 return (struct isl_set
*)
6352 isl_map_partial_lexmax((struct isl_map
*)set
,
6356 /* Compute the lexicographic minimum (or maximum if "max" is set)
6357 * of "bmap" over its domain.
6359 * Since we are not interested in the part of the domain space where
6360 * there is no solution, we initialize the domain to those constraints
6361 * of "bmap" that only involve the parameters and the input dimensions.
6362 * This relieves the parametric programming engine from detecting those
6363 * inequalities and transferring them to the context. More importantly,
6364 * it ensures that those inequalities are transferred first and not
6365 * intermixed with inequalities that actually split the domain.
6367 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6371 isl_basic_map
*copy
;
6374 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6375 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6376 copy
= isl_basic_map_copy(bmap
);
6377 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6378 isl_dim_div
, 0, n_div
);
6379 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6380 isl_dim_out
, 0, n_out
);
6381 dom
= isl_basic_map_domain(copy
);
6382 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6385 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6387 return isl_basic_map_lexopt(bmap
, 0);
6390 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6392 return isl_basic_map_lexopt(bmap
, 1);
6395 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6397 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6400 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6402 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6405 /* Extract the first and only affine expression from list
6406 * and then add it to *pwaff with the given dom.
6407 * This domain is known to be disjoint from other domains
6408 * because of the way isl_basic_map_foreach_lexmax works.
6410 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6411 __isl_take isl_aff_list
*list
, void *user
)
6413 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6415 isl_pw_aff
**pwaff
= user
;
6416 isl_pw_aff
*pwaff_i
;
6420 if (isl_aff_list_n_aff(list
) != 1)
6421 isl_die(ctx
, isl_error_internal
,
6422 "expecting single element list", goto error
);
6424 aff
= isl_aff_list_get_aff(list
, 0);
6425 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6427 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6429 isl_aff_list_free(list
);
6433 isl_basic_set_free(dom
);
6434 isl_aff_list_free(list
);
6438 /* Given a basic map with one output dimension, compute the minimum or
6439 * maximum of that dimension as an isl_pw_aff.
6441 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6442 * call update_dim_opt on each leaf of the result.
6444 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6447 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6451 dim
= isl_space_from_domain(isl_space_domain(dim
));
6452 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6453 pwaff
= isl_pw_aff_empty(dim
);
6455 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6457 return isl_pw_aff_free(pwaff
);
6462 /* Compute the minimum or maximum of the given output dimension
6463 * as a function of the parameters and the input dimensions,
6464 * but independently of the other output dimensions.
6466 * We first project out the other output dimension and then compute
6467 * the "lexicographic" maximum in each basic map, combining the results
6468 * using isl_pw_aff_union_max.
6470 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6477 n_out
= isl_map_dim(map
, isl_dim_out
);
6478 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6479 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6484 isl_space
*dim
= isl_map_get_space(map
);
6486 return isl_pw_aff_empty(dim
);
6489 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6490 for (i
= 1; i
< map
->n
; ++i
) {
6491 isl_pw_aff
*pwaff_i
;
6493 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6494 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6502 /* Compute the maximum of the given output dimension as a function of the
6503 * parameters and input dimensions, but independently of
6504 * the other output dimensions.
6506 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6508 return map_dim_opt(map
, pos
, 1);
6511 /* Compute the minimum or maximum of the given set dimension
6512 * as a function of the parameters,
6513 * but independently of the other set dimensions.
6515 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6518 return map_dim_opt(set
, pos
, max
);
6521 /* Compute the maximum of the given set dimension as a function of the
6522 * parameters, but independently of the other set dimensions.
6524 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6526 return set_dim_opt(set
, pos
, 1);
6529 /* Compute the minimum of the given set dimension as a function of the
6530 * parameters, but independently of the other set dimensions.
6532 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6534 return set_dim_opt(set
, pos
, 0);
6537 /* Apply a preimage specified by "mat" on the parameters of "bset".
6538 * bset is assumed to have only parameters and divs.
6540 static struct isl_basic_set
*basic_set_parameter_preimage(
6541 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6548 bset
->dim
= isl_space_cow(bset
->dim
);
6552 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6554 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6556 bset
->dim
->nparam
= 0;
6557 bset
->dim
->n_out
= nparam
;
6558 bset
= isl_basic_set_preimage(bset
, mat
);
6560 bset
->dim
->nparam
= bset
->dim
->n_out
;
6561 bset
->dim
->n_out
= 0;
6566 isl_basic_set_free(bset
);
6570 /* Apply a preimage specified by "mat" on the parameters of "set".
6571 * set is assumed to have only parameters and divs.
6573 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
6574 __isl_take isl_mat
*mat
)
6582 nparam
= isl_set_dim(set
, isl_dim_param
);
6584 if (mat
->n_row
!= 1 + nparam
)
6585 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
6586 "unexpected number of rows", goto error
);
6588 space
= isl_set_get_space(set
);
6589 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
6590 isl_dim_param
, 0, nparam
);
6591 set
= isl_set_reset_space(set
, space
);
6592 set
= isl_set_preimage(set
, mat
);
6593 nparam
= isl_set_dim(set
, isl_dim_out
);
6594 space
= isl_set_get_space(set
);
6595 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
6596 isl_dim_out
, 0, nparam
);
6597 set
= isl_set_reset_space(set
, space
);
6605 /* Intersect the basic set "bset" with the affine space specified by the
6606 * equalities in "eq".
6608 static struct isl_basic_set
*basic_set_append_equalities(
6609 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6617 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6622 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6623 for (i
= 0; i
< eq
->n_row
; ++i
) {
6624 k
= isl_basic_set_alloc_equality(bset
);
6627 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6628 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6632 bset
= isl_basic_set_gauss(bset
, NULL
);
6633 bset
= isl_basic_set_finalize(bset
);
6638 isl_basic_set_free(bset
);
6642 /* Intersect the set "set" with the affine space specified by the
6643 * equalities in "eq".
6645 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6653 for (i
= 0; i
< set
->n
; ++i
) {
6654 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6667 /* Given a basic set "bset" that only involves parameters and existentially
6668 * quantified variables, return the index of the first equality
6669 * that only involves parameters. If there is no such equality then
6670 * return bset->n_eq.
6672 * This function assumes that isl_basic_set_gauss has been called on "bset".
6674 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6677 unsigned nparam
, n_div
;
6682 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6683 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6685 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6686 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6693 /* Compute an explicit representation for the existentially quantified
6694 * variables in "bset" by computing the "minimal value" of the set
6695 * variables. Since there are no set variables, the computation of
6696 * the minimal value essentially computes an explicit representation
6697 * of the non-empty part(s) of "bset".
6699 * The input only involves parameters and existentially quantified variables.
6700 * All equalities among parameters have been removed.
6702 * Since the existentially quantified variables in the result are in general
6703 * going to be different from those in the input, we first replace
6704 * them by the minimal number of variables based on their equalities.
6705 * This should simplify the parametric integer programming.
6707 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6709 isl_morph
*morph1
, *morph2
;
6715 if (bset
->n_eq
== 0)
6716 return isl_basic_set_lexmin(bset
);
6718 morph1
= isl_basic_set_parameter_compression(bset
);
6719 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6720 bset
= isl_basic_set_lift(bset
);
6721 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6722 bset
= isl_morph_basic_set(morph2
, bset
);
6723 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6724 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6726 set
= isl_basic_set_lexmin(bset
);
6728 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6733 /* Project the given basic set onto its parameter domain, possibly introducing
6734 * new, explicit, existential variables in the constraints.
6735 * The input has parameters and (possibly implicit) existential variables.
6736 * The output has the same parameters, but only
6737 * explicit existentially quantified variables.
6739 * The actual projection is performed by pip, but pip doesn't seem
6740 * to like equalities very much, so we first remove the equalities
6741 * among the parameters by performing a variable compression on
6742 * the parameters. Afterward, an inverse transformation is performed
6743 * and the equalities among the parameters are inserted back in.
6745 * The variable compression on the parameters may uncover additional
6746 * equalities that were only implicit before. We therefore check
6747 * if there are any new parameter equalities in the result and
6748 * if so recurse. The removal of parameter equalities is required
6749 * for the parameter compression performed by base_compute_divs.
6751 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6755 struct isl_mat
*T
, *T2
;
6756 struct isl_set
*set
;
6759 bset
= isl_basic_set_cow(bset
);
6763 if (bset
->n_eq
== 0)
6764 return base_compute_divs(bset
);
6766 bset
= isl_basic_set_gauss(bset
, NULL
);
6769 if (isl_basic_set_plain_is_empty(bset
))
6770 return isl_set_from_basic_set(bset
);
6772 i
= first_parameter_equality(bset
);
6773 if (i
== bset
->n_eq
)
6774 return base_compute_divs(bset
);
6776 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6777 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6779 eq
= isl_mat_cow(eq
);
6780 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6781 if (T
&& T
->n_col
== 0) {
6785 bset
= isl_basic_set_set_to_empty(bset
);
6786 return isl_set_from_basic_set(bset
);
6788 bset
= basic_set_parameter_preimage(bset
, T
);
6790 i
= first_parameter_equality(bset
);
6793 else if (i
== bset
->n_eq
)
6794 set
= base_compute_divs(bset
);
6796 set
= parameter_compute_divs(bset
);
6797 set
= set_parameter_preimage(set
, T2
);
6798 set
= set_append_equalities(set
, eq
);
6802 /* Insert the divs from "ls" before those of "bmap".
6804 * The number of columns is not changed, which means that the last
6805 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6806 * The caller is responsible for removing the same number of dimensions
6807 * from the space of "bmap".
6809 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6810 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6816 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6820 old_n_div
= bmap
->n_div
;
6821 bmap
= insert_div_rows(bmap
, n_div
);
6825 for (i
= 0; i
< n_div
; ++i
) {
6826 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6827 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6833 /* Replace the space of "bmap" by the space and divs of "ls".
6835 * If "ls" has any divs, then we simplify the result since we may
6836 * have discovered some additional equalities that could simplify
6837 * the div expressions.
6839 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6840 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6844 bmap
= isl_basic_map_cow(bmap
);
6848 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6849 bmap
= insert_divs_from_local_space(bmap
, ls
);
6853 isl_space_free(bmap
->dim
);
6854 bmap
->dim
= isl_local_space_get_space(ls
);
6858 isl_local_space_free(ls
);
6860 bmap
= isl_basic_map_simplify(bmap
);
6861 bmap
= isl_basic_map_finalize(bmap
);
6864 isl_basic_map_free(bmap
);
6865 isl_local_space_free(ls
);
6869 /* Replace the space of "map" by the space and divs of "ls".
6871 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6872 __isl_take isl_local_space
*ls
)
6876 map
= isl_map_cow(map
);
6880 for (i
= 0; i
< map
->n
; ++i
) {
6881 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6882 isl_local_space_copy(ls
));
6886 isl_space_free(map
->dim
);
6887 map
->dim
= isl_local_space_get_space(ls
);
6891 isl_local_space_free(ls
);
6894 isl_local_space_free(ls
);
6899 /* Compute an explicit representation for the existentially
6900 * quantified variables for which do not know any explicit representation yet.
6902 * We first sort the existentially quantified variables so that the
6903 * existentially quantified variables for which we already have an explicit
6904 * representation are placed before those for which we do not.
6905 * The input dimensions, the output dimensions and the existentially
6906 * quantified variables for which we already have an explicit
6907 * representation are then turned into parameters.
6908 * compute_divs returns a map with the same parameters and
6909 * no input or output dimensions and the dimension specification
6910 * is reset to that of the input, including the existentially quantified
6911 * variables for which we already had an explicit representation.
6913 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6915 struct isl_basic_set
*bset
;
6916 struct isl_set
*set
;
6917 struct isl_map
*map
;
6919 isl_local_space
*ls
;
6926 bmap
= isl_basic_map_sort_divs(bmap
);
6927 bmap
= isl_basic_map_cow(bmap
);
6931 n_known
= isl_basic_map_first_unknown_div(bmap
);
6933 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
6935 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6936 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6937 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6938 dim
= isl_space_set_alloc(bmap
->ctx
,
6939 nparam
+ n_in
+ n_out
+ n_known
, 0);
6943 ls
= isl_basic_map_get_local_space(bmap
);
6944 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6945 n_known
, bmap
->n_div
- n_known
);
6947 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6948 swap_div(bmap
, i
- n_known
, i
);
6949 bmap
->n_div
-= n_known
;
6950 bmap
->extra
-= n_known
;
6952 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6953 bset
= (struct isl_basic_set
*)bmap
;
6955 set
= parameter_compute_divs(bset
);
6956 map
= (struct isl_map
*)set
;
6957 map
= replace_space_by_local_space(map
, ls
);
6961 isl_basic_map_free(bmap
);
6965 /* Remove the explicit representation of local variable "div",
6968 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
6969 __isl_take isl_basic_map
*bmap
, int div
)
6973 known
= isl_basic_map_div_is_known(bmap
, div
);
6975 return isl_basic_map_free(bmap
);
6979 bmap
= isl_basic_map_cow(bmap
);
6982 isl_int_set_si(bmap
->div
[div
][0], 0);
6986 /* Does local variable "div" of "bmap" have an explicit representation?
6988 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
6991 return isl_bool_error
;
6992 if (div
< 0 || div
>= isl_basic_map_dim(bmap
, isl_dim_div
))
6993 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6994 "position out of bounds", return isl_bool_error
);
6995 return !isl_int_is_zero(bmap
->div
[div
][0]);
6998 /* Return the position of the first local variable that does not
6999 * have an explicit representation.
7000 * Return the total number of local variables if they all have
7001 * an explicit representation.
7002 * Return -1 on error.
7004 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7011 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7012 if (!isl_basic_map_div_is_known(bmap
, i
))
7018 /* Does "bmap" have an explicit representation for all local variables?
7020 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7024 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7025 first
= isl_basic_map_first_unknown_div(bmap
);
7027 return isl_bool_error
;
7031 /* Do all basic maps in "map" have an explicit representation
7032 * for all local variables?
7034 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7039 return isl_bool_error
;
7041 for (i
= 0; i
< map
->n
; ++i
) {
7042 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7047 return isl_bool_true
;
7050 /* If bmap contains any unknown divs, then compute explicit
7051 * expressions for them. However, this computation may be
7052 * quite expensive, so first try to remove divs that aren't
7055 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
7058 struct isl_map
*map
;
7060 known
= isl_basic_map_divs_known(bmap
);
7064 return isl_map_from_basic_map(bmap
);
7066 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7068 known
= isl_basic_map_divs_known(bmap
);
7072 return isl_map_from_basic_map(bmap
);
7074 map
= compute_divs(bmap
);
7077 isl_basic_map_free(bmap
);
7081 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
7085 struct isl_map
*res
;
7092 known
= isl_map_divs_known(map
);
7100 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7101 for (i
= 1 ; i
< map
->n
; ++i
) {
7103 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7104 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7105 res
= isl_map_union_disjoint(res
, r2
);
7107 res
= isl_map_union(res
, r2
);
7114 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7116 return (struct isl_set
*)
7117 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
7120 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7122 return (struct isl_set
*)
7123 isl_map_compute_divs((struct isl_map
*)set
);
7126 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7129 struct isl_set
*set
;
7134 map
= isl_map_cow(map
);
7138 set
= (struct isl_set
*)map
;
7139 set
->dim
= isl_space_domain(set
->dim
);
7142 for (i
= 0; i
< map
->n
; ++i
) {
7143 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7147 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7148 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7155 /* Return the union of "map1" and "map2", where we assume for now that
7156 * "map1" and "map2" are disjoint. Note that the basic maps inside
7157 * "map1" or "map2" may not be disjoint from each other.
7158 * Also note that this function is also called from isl_map_union,
7159 * which takes care of handling the situation where "map1" and "map2"
7160 * may not be disjoint.
7162 * If one of the inputs is empty, we can simply return the other input.
7163 * Similarly, if one of the inputs is universal, then it is equal to the union.
7165 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7166 __isl_take isl_map
*map2
)
7170 struct isl_map
*map
= NULL
;
7176 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7177 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7178 "spaces don't match", goto error
);
7189 is_universe
= isl_map_plain_is_universe(map1
);
7190 if (is_universe
< 0)
7197 is_universe
= isl_map_plain_is_universe(map2
);
7198 if (is_universe
< 0)
7205 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7206 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7207 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7209 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7210 map1
->n
+ map2
->n
, flags
);
7213 for (i
= 0; i
< map1
->n
; ++i
) {
7214 map
= isl_map_add_basic_map(map
,
7215 isl_basic_map_copy(map1
->p
[i
]));
7219 for (i
= 0; i
< map2
->n
; ++i
) {
7220 map
= isl_map_add_basic_map(map
,
7221 isl_basic_map_copy(map2
->p
[i
]));
7235 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7236 * guaranteed to be disjoint by the caller.
7238 * Note that this functions is called from within isl_map_make_disjoint,
7239 * so we have to be careful not to touch the constraints of the inputs
7242 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7243 __isl_take isl_map
*map2
)
7245 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7248 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7249 * not be disjoint. The parameters are assumed to have been aligned.
7251 * We currently simply call map_union_disjoint, the internal operation
7252 * of which does not really depend on the inputs being disjoint.
7253 * If the result contains more than one basic map, then we clear
7254 * the disjoint flag since the result may contain basic maps from
7255 * both inputs and these are not guaranteed to be disjoint.
7257 * As a special case, if "map1" and "map2" are obviously equal,
7258 * then we simply return "map1".
7260 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7261 __isl_take isl_map
*map2
)
7268 equal
= isl_map_plain_is_equal(map1
, map2
);
7276 map1
= map_union_disjoint(map1
, map2
);
7280 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7288 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7291 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7292 __isl_take isl_map
*map2
)
7294 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7297 struct isl_set
*isl_set_union_disjoint(
7298 struct isl_set
*set1
, struct isl_set
*set2
)
7300 return (struct isl_set
*)
7301 isl_map_union_disjoint(
7302 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
7305 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7307 return (struct isl_set
*)
7308 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7311 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7314 * "map" and "set" are assumed to be compatible and non-NULL.
7316 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7317 __isl_take isl_set
*set
,
7318 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7319 __isl_take isl_basic_set
*bset
))
7322 struct isl_map
*result
;
7325 if (isl_set_plain_is_universe(set
)) {
7330 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7331 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7332 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7334 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7335 map
->n
* set
->n
, flags
);
7336 for (i
= 0; result
&& i
< map
->n
; ++i
)
7337 for (j
= 0; j
< set
->n
; ++j
) {
7338 result
= isl_map_add_basic_map(result
,
7339 fn(isl_basic_map_copy(map
->p
[i
]),
7340 isl_basic_set_copy(set
->p
[j
])));
7350 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7351 __isl_take isl_set
*set
)
7356 if (!isl_map_compatible_range(map
, set
))
7357 isl_die(set
->ctx
, isl_error_invalid
,
7358 "incompatible spaces", goto error
);
7360 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7367 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7368 __isl_take isl_set
*set
)
7370 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7373 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7374 __isl_take isl_set
*set
)
7379 if (!isl_map_compatible_domain(map
, set
))
7380 isl_die(set
->ctx
, isl_error_invalid
,
7381 "incompatible spaces", goto error
);
7383 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7390 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7391 __isl_take isl_set
*set
)
7393 return isl_map_align_params_map_map_and(map
, set
,
7394 &map_intersect_domain
);
7397 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7398 __isl_take isl_map
*map2
)
7402 map1
= isl_map_reverse(map1
);
7403 map1
= isl_map_apply_range(map1
, map2
);
7404 return isl_map_reverse(map1
);
7411 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7412 __isl_take isl_map
*map2
)
7414 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7417 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7418 __isl_take isl_map
*map2
)
7420 isl_space
*dim_result
;
7421 struct isl_map
*result
;
7427 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7428 isl_space_copy(map2
->dim
));
7430 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7433 for (i
= 0; i
< map1
->n
; ++i
)
7434 for (j
= 0; j
< map2
->n
; ++j
) {
7435 result
= isl_map_add_basic_map(result
,
7436 isl_basic_map_apply_range(
7437 isl_basic_map_copy(map1
->p
[i
]),
7438 isl_basic_map_copy(map2
->p
[j
])));
7444 if (result
&& result
->n
<= 1)
7445 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7453 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7454 __isl_take isl_map
*map2
)
7456 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7460 * returns range - domain
7462 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7464 isl_space
*target_space
;
7465 struct isl_basic_set
*bset
;
7472 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7473 bmap
->dim
, isl_dim_out
),
7475 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7476 dim
= isl_basic_map_n_in(bmap
);
7477 nparam
= isl_basic_map_n_param(bmap
);
7478 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7479 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7480 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7481 for (i
= 0; i
< dim
; ++i
) {
7482 int j
= isl_basic_map_alloc_equality(bmap
);
7484 bmap
= isl_basic_map_free(bmap
);
7487 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7488 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7489 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
7490 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7492 bset
= isl_basic_map_domain(bmap
);
7493 bset
= isl_basic_set_reset_space(bset
, target_space
);
7496 isl_basic_map_free(bmap
);
7501 * returns range - domain
7503 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7507 struct isl_set
*result
;
7512 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7513 map
->dim
, isl_dim_out
),
7515 dim
= isl_map_get_space(map
);
7516 dim
= isl_space_domain(dim
);
7517 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7520 for (i
= 0; i
< map
->n
; ++i
)
7521 result
= isl_set_add_basic_set(result
,
7522 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7531 * returns [domain -> range] -> range - domain
7533 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7534 __isl_take isl_basic_map
*bmap
)
7538 isl_basic_map
*domain
;
7542 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7543 bmap
->dim
, isl_dim_out
))
7544 isl_die(bmap
->ctx
, isl_error_invalid
,
7545 "domain and range don't match", goto error
);
7547 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7548 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7550 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7551 domain
= isl_basic_map_universe(dim
);
7553 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7554 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7555 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7557 total
= isl_basic_map_total_dim(bmap
);
7559 for (i
= 0; i
< n
; ++i
) {
7560 k
= isl_basic_map_alloc_equality(bmap
);
7563 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7564 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7565 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7566 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7569 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7570 return isl_basic_map_finalize(bmap
);
7572 isl_basic_map_free(bmap
);
7577 * returns [domain -> range] -> range - domain
7579 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7582 isl_space
*domain_dim
;
7587 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7588 map
->dim
, isl_dim_out
))
7589 isl_die(map
->ctx
, isl_error_invalid
,
7590 "domain and range don't match", goto error
);
7592 map
= isl_map_cow(map
);
7596 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7597 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7598 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7601 for (i
= 0; i
< map
->n
; ++i
) {
7602 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7606 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7613 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7615 struct isl_basic_map
*bmap
;
7623 nparam
= dims
->nparam
;
7625 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7629 for (i
= 0; i
< dim
; ++i
) {
7630 int j
= isl_basic_map_alloc_equality(bmap
);
7633 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7634 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7635 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7637 return isl_basic_map_finalize(bmap
);
7639 isl_basic_map_free(bmap
);
7643 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7647 if (dim
->n_in
!= dim
->n_out
)
7648 isl_die(dim
->ctx
, isl_error_invalid
,
7649 "number of input and output dimensions needs to be "
7650 "the same", goto error
);
7651 return basic_map_identity(dim
);
7653 isl_space_free(dim
);
7657 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7659 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7662 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7664 isl_space
*dim
= isl_set_get_space(set
);
7666 id
= isl_map_identity(isl_space_map_from_set(dim
));
7667 return isl_map_intersect_range(id
, set
);
7670 /* Construct a basic set with all set dimensions having only non-negative
7673 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7674 __isl_take isl_space
*space
)
7679 struct isl_basic_set
*bset
;
7683 nparam
= space
->nparam
;
7685 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7688 for (i
= 0; i
< dim
; ++i
) {
7689 int k
= isl_basic_set_alloc_inequality(bset
);
7692 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7693 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7697 isl_basic_set_free(bset
);
7701 /* Construct the half-space x_pos >= 0.
7703 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7707 isl_basic_set
*nonneg
;
7709 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7710 k
= isl_basic_set_alloc_inequality(nonneg
);
7713 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7714 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7716 return isl_basic_set_finalize(nonneg
);
7718 isl_basic_set_free(nonneg
);
7722 /* Construct the half-space x_pos <= -1.
7724 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7729 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7730 k
= isl_basic_set_alloc_inequality(neg
);
7733 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7734 isl_int_set_si(neg
->ineq
[k
][0], -1);
7735 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7737 return isl_basic_set_finalize(neg
);
7739 isl_basic_set_free(neg
);
7743 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7744 enum isl_dim_type type
, unsigned first
, unsigned n
)
7748 isl_basic_set
*nonneg
;
7756 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7758 offset
= pos(set
->dim
, type
);
7759 for (i
= 0; i
< n
; ++i
) {
7760 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7761 offset
+ first
+ i
);
7762 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
7764 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7773 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7774 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7781 if (isl_set_plain_is_empty(set
)) {
7786 return fn(set
, signs
, user
);
7789 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7791 half
= isl_set_intersect(half
, isl_set_copy(set
));
7792 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7796 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7798 half
= isl_set_intersect(half
, set
);
7799 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7805 /* Call "fn" on the intersections of "set" with each of the orthants
7806 * (except for obviously empty intersections). The orthant is identified
7807 * by the signs array, with each entry having value 1 or -1 according
7808 * to the sign of the corresponding variable.
7810 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7811 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7821 if (isl_set_plain_is_empty(set
))
7824 nparam
= isl_set_dim(set
, isl_dim_param
);
7825 nvar
= isl_set_dim(set
, isl_dim_set
);
7827 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7829 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7837 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7839 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7842 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
7843 __isl_keep isl_basic_map
*bmap2
)
7846 struct isl_map
*map1
;
7847 struct isl_map
*map2
;
7849 if (!bmap1
|| !bmap2
)
7850 return isl_bool_error
;
7852 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7853 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7855 is_subset
= isl_map_is_subset(map1
, map2
);
7863 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7864 __isl_keep isl_basic_set
*bset2
)
7866 return isl_basic_map_is_subset(bset1
, bset2
);
7869 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
7870 __isl_keep isl_basic_map
*bmap2
)
7874 if (!bmap1
|| !bmap2
)
7875 return isl_bool_error
;
7876 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7877 if (is_subset
!= isl_bool_true
)
7879 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7883 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
7884 __isl_keep isl_basic_set
*bset2
)
7886 return isl_basic_map_is_equal(
7887 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7890 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
7896 return isl_bool_error
;
7897 for (i
= 0; i
< map
->n
; ++i
) {
7898 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7900 return isl_bool_error
;
7902 return isl_bool_false
;
7904 return isl_bool_true
;
7907 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7909 return map
? map
->n
== 0 : isl_bool_error
;
7912 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
7914 return set
? set
->n
== 0 : isl_bool_error
;
7917 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
7919 return isl_map_is_empty((struct isl_map
*)set
);
7922 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7927 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7930 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7935 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7938 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7943 return isl_bool_error
;
7944 is_subset
= isl_map_is_subset(map1
, map2
);
7945 if (is_subset
!= isl_bool_true
)
7947 is_subset
= isl_map_is_subset(map2
, map1
);
7951 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7953 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7956 isl_bool
isl_basic_map_is_strict_subset(
7957 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7961 if (!bmap1
|| !bmap2
)
7962 return isl_bool_error
;
7963 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7964 if (is_subset
!= isl_bool_true
)
7966 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7967 if (is_subset
== isl_bool_error
)
7972 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
7973 __isl_keep isl_map
*map2
)
7978 return isl_bool_error
;
7979 is_subset
= isl_map_is_subset(map1
, map2
);
7980 if (is_subset
!= isl_bool_true
)
7982 is_subset
= isl_map_is_subset(map2
, map1
);
7983 if (is_subset
== isl_bool_error
)
7988 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
7989 __isl_keep isl_set
*set2
)
7991 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7994 /* Is "bmap" obviously equal to the universe with the same space?
7996 * That is, does it not have any constraints?
7998 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8001 return isl_bool_error
;
8002 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8005 /* Is "bset" obviously equal to the universe with the same space?
8007 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8009 return isl_basic_map_plain_is_universe(bset
);
8012 /* If "c" does not involve any existentially quantified variables,
8013 * then set *univ to false and abort
8015 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8017 isl_bool
*univ
= user
;
8020 n
= isl_constraint_dim(c
, isl_dim_div
);
8021 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8022 isl_constraint_free(c
);
8023 if (*univ
< 0 || !*univ
)
8024 return isl_stat_error
;
8028 /* Is "bmap" equal to the universe with the same space?
8030 * First check if it is obviously equal to the universe.
8031 * If not and if there are any constraints not involving
8032 * existentially quantified variables, then it is certainly
8033 * not equal to the universe.
8034 * Otherwise, check if the universe is a subset of "bmap".
8036 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8039 isl_basic_map
*test
;
8041 univ
= isl_basic_map_plain_is_universe(bmap
);
8042 if (univ
< 0 || univ
)
8044 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8045 return isl_bool_false
;
8046 univ
= isl_bool_true
;
8047 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8049 return isl_bool_error
;
8050 if (univ
< 0 || !univ
)
8052 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8053 univ
= isl_basic_map_is_subset(test
, bmap
);
8054 isl_basic_map_free(test
);
8058 /* Is "bset" equal to the universe with the same space?
8060 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8062 return isl_basic_map_is_universe(bset
);
8065 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8070 return isl_bool_error
;
8072 for (i
= 0; i
< map
->n
; ++i
) {
8073 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8078 return isl_bool_false
;
8081 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8083 return isl_map_plain_is_universe((isl_map
*) set
);
8086 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8088 struct isl_basic_set
*bset
= NULL
;
8089 struct isl_vec
*sample
= NULL
;
8090 isl_bool empty
, non_empty
;
8093 return isl_bool_error
;
8095 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8096 return isl_bool_true
;
8098 if (isl_basic_map_plain_is_universe(bmap
))
8099 return isl_bool_false
;
8101 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8102 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8103 copy
= isl_basic_map_remove_redundancies(copy
);
8104 empty
= isl_basic_map_plain_is_empty(copy
);
8105 isl_basic_map_free(copy
);
8109 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8111 return isl_bool_error
;
8113 return isl_bool_false
;
8114 isl_vec_free(bmap
->sample
);
8115 bmap
->sample
= NULL
;
8116 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8118 return isl_bool_error
;
8119 sample
= isl_basic_set_sample_vec(bset
);
8121 return isl_bool_error
;
8122 empty
= sample
->size
== 0;
8123 isl_vec_free(bmap
->sample
);
8124 bmap
->sample
= sample
;
8126 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8131 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8134 return isl_bool_error
;
8135 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8138 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8141 return isl_bool_error
;
8142 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8145 /* Is "bmap" known to be non-empty?
8147 * That is, is the cached sample still valid?
8149 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8154 return isl_bool_error
;
8156 return isl_bool_false
;
8157 total
= 1 + isl_basic_map_total_dim(bmap
);
8158 if (bmap
->sample
->size
!= total
)
8159 return isl_bool_false
;
8160 return isl_basic_map_contains(bmap
, bmap
->sample
);
8163 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8165 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
8168 struct isl_map
*isl_basic_map_union(
8169 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8171 struct isl_map
*map
;
8172 if (!bmap1
|| !bmap2
)
8175 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8177 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8180 map
= isl_map_add_basic_map(map
, bmap1
);
8181 map
= isl_map_add_basic_map(map
, bmap2
);
8184 isl_basic_map_free(bmap1
);
8185 isl_basic_map_free(bmap2
);
8189 struct isl_set
*isl_basic_set_union(
8190 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8192 return (struct isl_set
*)isl_basic_map_union(
8193 (struct isl_basic_map
*)bset1
,
8194 (struct isl_basic_map
*)bset2
);
8197 /* Order divs such that any div only depends on previous divs */
8198 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
8206 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8208 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8210 if (isl_int_is_zero(bmap
->div
[i
][0]))
8212 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8217 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8218 "integer division depends on itself",
8219 return isl_basic_map_free(bmap
));
8220 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8226 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8228 return (struct isl_basic_set
*)
8229 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
8232 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8239 for (i
= 0; i
< map
->n
; ++i
) {
8240 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8251 /* Apply the expansion computed by isl_merge_divs.
8252 * The expansion itself is given by "exp" while the resulting
8253 * list of divs is given by "div".
8255 * Move the integer divisions of "bset" into the right position
8256 * according to "exp" and then introduce the additional integer
8257 * divisions, adding div constraints.
8258 * The moving should be done first to avoid moving coefficients
8259 * in the definitions of the extra integer divisions.
8261 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8262 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8267 bset
= isl_basic_set_cow(bset
);
8271 if (div
->n_row
< bset
->n_div
)
8272 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8273 "not an expansion", goto error
);
8275 n_div
= bset
->n_div
;
8276 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
8277 div
->n_row
- n_div
, 0,
8278 2 * (div
->n_row
- n_div
));
8280 for (i
= n_div
; i
< div
->n_row
; ++i
)
8281 if (isl_basic_set_alloc_div(bset
) < 0)
8284 for (j
= n_div
- 1; j
>= 0; --j
) {
8287 isl_basic_map_swap_div(bset
, j
, exp
[j
]);
8290 for (i
= 0; i
< div
->n_row
; ++i
) {
8291 if (j
< n_div
&& exp
[j
] == i
) {
8294 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
8295 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
8303 isl_basic_set_free(bset
);
8308 /* Look for a div in dst that corresponds to the div "div" in src.
8309 * The divs before "div" in src and dst are assumed to be the same.
8311 * Returns -1 if no corresponding div was found and the position
8312 * of the corresponding div in dst otherwise.
8314 static int find_div(struct isl_basic_map
*dst
,
8315 struct isl_basic_map
*src
, unsigned div
)
8319 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8321 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8322 for (i
= div
; i
< dst
->n_div
; ++i
)
8323 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8324 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8325 dst
->n_div
- div
) == -1)
8330 /* Align the divs of "dst" to those of "src", adding divs from "src"
8331 * if needed. That is, make sure that the first src->n_div divs
8332 * of the result are equal to those of src.
8334 * The result is not finalized as by design it will have redundant
8335 * divs if any divs from "src" were copied.
8337 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8338 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8341 int known
, extended
;
8345 return isl_basic_map_free(dst
);
8347 if (src
->n_div
== 0)
8350 known
= isl_basic_map_divs_known(src
);
8352 return isl_basic_map_free(dst
);
8354 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8355 "some src divs are unknown",
8356 return isl_basic_map_free(dst
));
8358 src
= isl_basic_map_order_divs(src
);
8361 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8362 for (i
= 0; i
< src
->n_div
; ++i
) {
8363 int j
= find_div(dst
, src
, i
);
8366 int extra
= src
->n_div
- i
;
8367 dst
= isl_basic_map_cow(dst
);
8370 dst
= isl_basic_map_extend_space(dst
,
8371 isl_space_copy(dst
->dim
),
8372 extra
, 0, 2 * extra
);
8375 j
= isl_basic_map_alloc_div(dst
);
8377 return isl_basic_map_free(dst
);
8378 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8379 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8380 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8381 return isl_basic_map_free(dst
);
8384 isl_basic_map_swap_div(dst
, i
, j
);
8389 struct isl_basic_set
*isl_basic_set_align_divs(
8390 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8392 return (struct isl_basic_set
*)isl_basic_map_align_divs(
8393 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
8396 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8404 map
= isl_map_compute_divs(map
);
8405 map
= isl_map_cow(map
);
8409 for (i
= 1; i
< map
->n
; ++i
)
8410 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8411 for (i
= 1; i
< map
->n
; ++i
) {
8412 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8414 return isl_map_free(map
);
8417 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8421 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8423 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
8426 /* Align the divs of the basic maps in "map" to those
8427 * of the basic maps in "list", as well as to the other basic maps in "map".
8428 * The elements in "list" are assumed to have known divs.
8430 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8431 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8435 map
= isl_map_compute_divs(map
);
8436 map
= isl_map_cow(map
);
8438 return isl_map_free(map
);
8442 n
= isl_basic_map_list_n_basic_map(list
);
8443 for (i
= 0; i
< n
; ++i
) {
8444 isl_basic_map
*bmap
;
8446 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8447 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8448 isl_basic_map_free(bmap
);
8451 return isl_map_free(map
);
8453 return isl_map_align_divs(map
);
8456 /* Align the divs of each element of "list" to those of "bmap".
8457 * Both "bmap" and the elements of "list" are assumed to have known divs.
8459 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8460 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8465 return isl_basic_map_list_free(list
);
8467 n
= isl_basic_map_list_n_basic_map(list
);
8468 for (i
= 0; i
< n
; ++i
) {
8469 isl_basic_map
*bmap_i
;
8471 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8472 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8473 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8479 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8480 __isl_take isl_map
*map
)
8484 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8485 map
= isl_map_intersect_domain(map
, set
);
8486 set
= isl_map_range(map
);
8494 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8495 __isl_take isl_map
*map
)
8497 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8500 /* There is no need to cow as removing empty parts doesn't change
8501 * the meaning of the set.
8503 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8510 for (i
= map
->n
- 1; i
>= 0; --i
)
8511 remove_if_empty(map
, i
);
8516 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8518 return (struct isl_set
*)
8519 isl_map_remove_empty_parts((struct isl_map
*)set
);
8522 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8524 struct isl_basic_map
*bmap
;
8525 if (!map
|| map
->n
== 0)
8527 bmap
= map
->p
[map
->n
-1];
8528 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8529 return isl_basic_map_copy(bmap
);
8532 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8534 return (struct isl_basic_set
*)
8535 isl_map_copy_basic_map((struct isl_map
*)set
);
8538 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8539 __isl_keep isl_basic_map
*bmap
)
8545 for (i
= map
->n
-1; i
>= 0; --i
) {
8546 if (map
->p
[i
] != bmap
)
8548 map
= isl_map_cow(map
);
8551 isl_basic_map_free(map
->p
[i
]);
8552 if (i
!= map
->n
-1) {
8553 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8554 map
->p
[i
] = map
->p
[map
->n
-1];
8565 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8566 struct isl_basic_set
*bset
)
8568 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8569 (struct isl_basic_map
*)bset
);
8572 /* Given two basic sets bset1 and bset2, compute the maximal difference
8573 * between the values of dimension pos in bset1 and those in bset2
8574 * for any common value of the parameters and dimensions preceding pos.
8576 static enum isl_lp_result
basic_set_maximal_difference_at(
8577 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8578 int pos
, isl_int
*opt
)
8581 struct isl_basic_map
*bmap1
= NULL
;
8582 struct isl_basic_map
*bmap2
= NULL
;
8583 struct isl_ctx
*ctx
;
8584 struct isl_vec
*obj
;
8587 unsigned dim1
, dim2
;
8588 enum isl_lp_result res
;
8590 if (!bset1
|| !bset2
)
8591 return isl_lp_error
;
8593 nparam
= isl_basic_set_n_param(bset1
);
8594 dim1
= isl_basic_set_n_dim(bset1
);
8595 dim2
= isl_basic_set_n_dim(bset2
);
8596 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8597 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8598 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8599 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8600 if (!bmap1
|| !bmap2
)
8602 bmap1
= isl_basic_map_cow(bmap1
);
8603 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8604 pos
, (dim1
- pos
) + (dim2
- pos
),
8605 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8606 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8609 total
= isl_basic_map_total_dim(bmap1
);
8611 obj
= isl_vec_alloc(ctx
, 1 + total
);
8614 isl_seq_clr(obj
->block
.data
, 1 + total
);
8615 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8616 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8617 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8619 isl_basic_map_free(bmap1
);
8623 isl_basic_map_free(bmap2
);
8625 isl_basic_map_free(bmap1
);
8626 return isl_lp_error
;
8629 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8630 * for any common value of the parameters and dimensions preceding pos
8631 * in both basic sets, the values of dimension pos in bset1 are
8632 * smaller or larger than those in bset2.
8635 * 1 if bset1 follows bset2
8636 * -1 if bset1 precedes bset2
8637 * 0 if bset1 and bset2 are incomparable
8638 * -2 if some error occurred.
8640 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8641 struct isl_basic_set
*bset2
, int pos
)
8644 enum isl_lp_result res
;
8649 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8651 if (res
== isl_lp_empty
)
8653 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8654 res
== isl_lp_unbounded
)
8656 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8665 /* Given two basic sets bset1 and bset2, check whether
8666 * for any common value of the parameters and dimensions preceding pos
8667 * there is a value of dimension pos in bset1 that is larger
8668 * than a value of the same dimension in bset2.
8671 * 1 if there exists such a pair
8672 * 0 if there is no such pair, but there is a pair of equal values
8674 * -2 if some error occurred.
8676 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8677 __isl_keep isl_basic_set
*bset2
, int pos
)
8680 enum isl_lp_result res
;
8685 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8687 if (res
== isl_lp_empty
)
8689 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8690 res
== isl_lp_unbounded
)
8692 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8694 else if (res
== isl_lp_ok
)
8703 /* Given two sets set1 and set2, check whether
8704 * for any common value of the parameters and dimensions preceding pos
8705 * there is a value of dimension pos in set1 that is larger
8706 * than a value of the same dimension in set2.
8709 * 1 if there exists such a pair
8710 * 0 if there is no such pair, but there is a pair of equal values
8712 * -2 if some error occurred.
8714 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8715 __isl_keep isl_set
*set2
, int pos
)
8723 for (i
= 0; i
< set1
->n
; ++i
)
8724 for (j
= 0; j
< set2
->n
; ++j
) {
8726 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8727 if (f
== 1 || f
== -2)
8736 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8737 unsigned pos
, isl_int
*val
)
8745 total
= isl_basic_map_total_dim(bmap
);
8746 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8747 for (; d
+1 > pos
; --d
)
8748 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8752 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8754 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8756 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8759 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8765 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8766 unsigned pos
, isl_int
*val
)
8778 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8781 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8782 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8783 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8784 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8788 isl_int_set(*val
, v
);
8794 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8795 unsigned pos
, isl_int
*val
)
8797 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8801 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8804 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8807 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8808 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8810 if (pos
>= isl_basic_map_dim(bmap
, type
))
8812 return isl_basic_map_plain_has_fixed_var(bmap
,
8813 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8816 /* If "bmap" obviously lies on a hyperplane where the given dimension
8817 * has a fixed value, then return that value.
8818 * Otherwise return NaN.
8820 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8821 __isl_keep isl_basic_map
*bmap
,
8822 enum isl_dim_type type
, unsigned pos
)
8830 ctx
= isl_basic_map_get_ctx(bmap
);
8831 v
= isl_val_alloc(ctx
);
8834 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8836 return isl_val_free(v
);
8838 isl_int_set_si(v
->d
, 1);
8842 return isl_val_nan(ctx
);
8845 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8846 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8848 if (pos
>= isl_map_dim(map
, type
))
8850 return isl_map_plain_has_fixed_var(map
,
8851 map_offset(map
, type
) - 1 + pos
, val
);
8854 /* If "map" obviously lies on a hyperplane where the given dimension
8855 * has a fixed value, then return that value.
8856 * Otherwise return NaN.
8858 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8859 enum isl_dim_type type
, unsigned pos
)
8867 ctx
= isl_map_get_ctx(map
);
8868 v
= isl_val_alloc(ctx
);
8871 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8873 return isl_val_free(v
);
8875 isl_int_set_si(v
->d
, 1);
8879 return isl_val_nan(ctx
);
8882 /* If "set" obviously lies on a hyperplane where the given dimension
8883 * has a fixed value, then return that value.
8884 * Otherwise return NaN.
8886 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8887 enum isl_dim_type type
, unsigned pos
)
8889 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8892 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8893 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8895 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8898 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8899 * then return this fixed value in *val.
8901 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8902 unsigned dim
, isl_int
*val
)
8904 return isl_basic_set_plain_has_fixed_var(bset
,
8905 isl_basic_set_n_param(bset
) + dim
, val
);
8908 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8909 * then return this fixed value in *val.
8911 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8912 unsigned dim
, isl_int
*val
)
8914 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8917 /* Check if input variable in has fixed value and if so and if val is not NULL,
8918 * then return this fixed value in *val.
8920 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8921 unsigned in
, isl_int
*val
)
8923 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8926 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8927 * and if val is not NULL, then return this lower bound in *val.
8929 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8930 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8932 int i
, i_eq
= -1, i_ineq
= -1;
8939 total
= isl_basic_set_total_dim(bset
);
8940 nparam
= isl_basic_set_n_param(bset
);
8941 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8942 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8948 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8949 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8951 if (i_eq
!= -1 || i_ineq
!= -1)
8955 if (i_eq
== -1 && i_ineq
== -1)
8957 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8958 /* The coefficient should always be one due to normalization. */
8959 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8961 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8963 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8964 total
- nparam
- dim
- 1) != -1)
8967 isl_int_neg(*val
, c
[0]);
8971 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8972 unsigned dim
, isl_int
*val
)
8984 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8988 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8990 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8991 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8993 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8997 isl_int_set(*val
, v
);
9003 /* Return -1 if the constraint "c1" should be sorted before "c2"
9004 * and 1 if it should be sorted after "c2".
9005 * Return 0 if the two constraints are the same (up to the constant term).
9007 * In particular, if a constraint involves later variables than another
9008 * then it is sorted after this other constraint.
9009 * uset_gist depends on constraints without existentially quantified
9010 * variables sorting first.
9012 * For constraints that have the same latest variable, those
9013 * with the same coefficient for this latest variable (first in absolute value
9014 * and then in actual value) are grouped together.
9015 * This is useful for detecting pairs of constraints that can
9016 * be chained in their printed representation.
9018 * Finally, within a group, constraints are sorted according to
9019 * their coefficients (excluding the constant term).
9021 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9023 isl_int
**c1
= (isl_int
**) p1
;
9024 isl_int
**c2
= (isl_int
**) p2
;
9026 unsigned size
= *(unsigned *) arg
;
9029 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9030 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9035 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9038 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9042 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9045 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9046 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9047 * and 0 if the two constraints are the same (up to the constant term).
9049 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9050 isl_int
*c1
, isl_int
*c2
)
9056 total
= isl_basic_map_total_dim(bmap
);
9057 return sort_constraint_cmp(&c1
, &c2
, &total
);
9060 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9061 __isl_take isl_basic_map
*bmap
)
9067 if (bmap
->n_ineq
== 0)
9069 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9071 total
= isl_basic_map_total_dim(bmap
);
9072 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9073 &sort_constraint_cmp
, &total
) < 0)
9074 return isl_basic_map_free(bmap
);
9078 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9079 __isl_take isl_basic_set
*bset
)
9081 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
9082 (struct isl_basic_map
*)bset
);
9085 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
9089 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9091 bmap
= isl_basic_map_remove_redundancies(bmap
);
9092 bmap
= isl_basic_map_sort_constraints(bmap
);
9094 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9098 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
9100 return (struct isl_basic_set
*)isl_basic_map_normalize(
9101 (struct isl_basic_map
*)bset
);
9104 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
9105 const __isl_keep isl_basic_map
*bmap2
)
9110 if (!bmap1
|| !bmap2
)
9115 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9116 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9117 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9118 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
9119 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
9120 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
9121 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9122 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
9123 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9124 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9125 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9127 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9129 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9131 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9132 return bmap1
->n_eq
- bmap2
->n_eq
;
9133 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9134 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9135 if (bmap1
->n_div
!= bmap2
->n_div
)
9136 return bmap1
->n_div
- bmap2
->n_div
;
9137 total
= isl_basic_map_total_dim(bmap1
);
9138 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9139 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9143 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9144 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9148 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9149 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9156 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
9157 const __isl_keep isl_basic_set
*bset2
)
9159 return isl_basic_map_plain_cmp(bset1
, bset2
);
9162 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9168 if (set1
->n
!= set2
->n
)
9169 return set1
->n
- set2
->n
;
9171 for (i
= 0; i
< set1
->n
; ++i
) {
9172 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9180 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9181 __isl_keep isl_basic_map
*bmap2
)
9183 if (!bmap1
|| !bmap2
)
9184 return isl_bool_error
;
9185 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9188 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9189 __isl_keep isl_basic_set
*bset2
)
9191 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
9192 (isl_basic_map
*)bset2
);
9195 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9197 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
9198 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
9200 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9203 /* Sort the basic maps of "map" and remove duplicate basic maps.
9205 * While removing basic maps, we make sure that the basic maps remain
9206 * sorted because isl_map_normalize expects the basic maps of the result
9209 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9213 map
= isl_map_remove_empty_parts(map
);
9216 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9217 for (i
= map
->n
- 1; i
>= 1; --i
) {
9218 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9220 isl_basic_map_free(map
->p
[i
-1]);
9221 for (j
= i
; j
< map
->n
; ++j
)
9222 map
->p
[j
- 1] = map
->p
[j
];
9229 /* Remove obvious duplicates among the basic maps of "map".
9231 * Unlike isl_map_normalize, this function does not remove redundant
9232 * constraints and only removes duplicates that have exactly the same
9233 * constraints in the input. It does sort the constraints and
9234 * the basic maps to ease the detection of duplicates.
9236 * If "map" has already been normalized or if the basic maps are
9237 * disjoint, then there can be no duplicates.
9239 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9242 isl_basic_map
*bmap
;
9248 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9250 for (i
= 0; i
< map
->n
; ++i
) {
9251 bmap
= isl_basic_map_copy(map
->p
[i
]);
9252 bmap
= isl_basic_map_sort_constraints(bmap
);
9254 return isl_map_free(map
);
9255 isl_basic_map_free(map
->p
[i
]);
9259 map
= sort_and_remove_duplicates(map
);
9263 /* We normalize in place, but if anything goes wrong we need
9264 * to return NULL, so we need to make sure we don't change the
9265 * meaning of any possible other copies of map.
9267 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9270 struct isl_basic_map
*bmap
;
9274 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9276 for (i
= 0; i
< map
->n
; ++i
) {
9277 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9280 isl_basic_map_free(map
->p
[i
]);
9284 map
= sort_and_remove_duplicates(map
);
9286 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9293 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9295 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
9298 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9299 __isl_keep isl_map
*map2
)
9305 return isl_bool_error
;
9308 return isl_bool_true
;
9309 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9310 return isl_bool_false
;
9312 map1
= isl_map_copy(map1
);
9313 map2
= isl_map_copy(map2
);
9314 map1
= isl_map_normalize(map1
);
9315 map2
= isl_map_normalize(map2
);
9318 equal
= map1
->n
== map2
->n
;
9319 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9320 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9330 return isl_bool_error
;
9333 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9334 __isl_keep isl_set
*set2
)
9336 return isl_map_plain_is_equal((struct isl_map
*)set1
,
9337 (struct isl_map
*)set2
);
9340 /* Return an interval that ranges from min to max (inclusive)
9342 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
9343 isl_int min
, isl_int max
)
9346 struct isl_basic_set
*bset
= NULL
;
9348 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
9352 k
= isl_basic_set_alloc_inequality(bset
);
9355 isl_int_set_si(bset
->ineq
[k
][1], 1);
9356 isl_int_neg(bset
->ineq
[k
][0], min
);
9358 k
= isl_basic_set_alloc_inequality(bset
);
9361 isl_int_set_si(bset
->ineq
[k
][1], -1);
9362 isl_int_set(bset
->ineq
[k
][0], max
);
9366 isl_basic_set_free(bset
);
9370 /* Return the basic maps in "map" as a list.
9372 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9373 __isl_keep isl_map
*map
)
9377 isl_basic_map_list
*list
;
9381 ctx
= isl_map_get_ctx(map
);
9382 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9384 for (i
= 0; i
< map
->n
; ++i
) {
9385 isl_basic_map
*bmap
;
9387 bmap
= isl_basic_map_copy(map
->p
[i
]);
9388 list
= isl_basic_map_list_add(list
, bmap
);
9394 /* Return the intersection of the elements in the non-empty list "list".
9395 * All elements are assumed to live in the same space.
9397 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9398 __isl_take isl_basic_map_list
*list
)
9401 isl_basic_map
*bmap
;
9405 n
= isl_basic_map_list_n_basic_map(list
);
9407 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9408 "expecting non-empty list", goto error
);
9410 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9411 for (i
= 1; i
< n
; ++i
) {
9412 isl_basic_map
*bmap_i
;
9414 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9415 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9418 isl_basic_map_list_free(list
);
9421 isl_basic_map_list_free(list
);
9425 /* Return the intersection of the elements in the non-empty list "list".
9426 * All elements are assumed to live in the same space.
9428 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9429 __isl_take isl_basic_set_list
*list
)
9431 return isl_basic_map_list_intersect(list
);
9434 /* Return the union of the elements in the non-empty list "list".
9435 * All elements are assumed to live in the same space.
9437 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9444 n
= isl_set_list_n_set(list
);
9446 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9447 "expecting non-empty list", goto error
);
9449 set
= isl_set_list_get_set(list
, 0);
9450 for (i
= 1; i
< n
; ++i
) {
9453 set_i
= isl_set_list_get_set(list
, i
);
9454 set
= isl_set_union(set
, set_i
);
9457 isl_set_list_free(list
);
9460 isl_set_list_free(list
);
9464 /* Return the Cartesian product of the basic sets in list (in the given order).
9466 __isl_give isl_basic_set
*isl_basic_set_list_product(
9467 __isl_take
struct isl_basic_set_list
*list
)
9475 struct isl_basic_set
*product
= NULL
;
9479 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
9480 isl_assert(list
->ctx
, list
->p
[0], goto error
);
9481 nparam
= isl_basic_set_n_param(list
->p
[0]);
9482 dim
= isl_basic_set_n_dim(list
->p
[0]);
9483 extra
= list
->p
[0]->n_div
;
9484 n_eq
= list
->p
[0]->n_eq
;
9485 n_ineq
= list
->p
[0]->n_ineq
;
9486 for (i
= 1; i
< list
->n
; ++i
) {
9487 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9488 isl_assert(list
->ctx
,
9489 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9490 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9491 extra
+= list
->p
[i
]->n_div
;
9492 n_eq
+= list
->p
[i
]->n_eq
;
9493 n_ineq
+= list
->p
[i
]->n_ineq
;
9495 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9500 for (i
= 0; i
< list
->n
; ++i
) {
9501 isl_basic_set_add_constraints(product
,
9502 isl_basic_set_copy(list
->p
[i
]), dim
);
9503 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9505 isl_basic_set_list_free(list
);
9508 isl_basic_set_free(product
);
9509 isl_basic_set_list_free(list
);
9513 struct isl_basic_map
*isl_basic_map_product(
9514 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9516 isl_space
*dim_result
= NULL
;
9517 struct isl_basic_map
*bmap
;
9518 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9519 struct isl_dim_map
*dim_map1
, *dim_map2
;
9521 if (!bmap1
|| !bmap2
)
9524 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9525 bmap2
->dim
, isl_dim_param
), goto error
);
9526 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9527 isl_space_copy(bmap2
->dim
));
9529 in1
= isl_basic_map_n_in(bmap1
);
9530 in2
= isl_basic_map_n_in(bmap2
);
9531 out1
= isl_basic_map_n_out(bmap1
);
9532 out2
= isl_basic_map_n_out(bmap2
);
9533 nparam
= isl_basic_map_n_param(bmap1
);
9535 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9536 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9537 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9538 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9539 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9540 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9541 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9542 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9543 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9544 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9545 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9547 bmap
= isl_basic_map_alloc_space(dim_result
,
9548 bmap1
->n_div
+ bmap2
->n_div
,
9549 bmap1
->n_eq
+ bmap2
->n_eq
,
9550 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9551 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9552 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9553 bmap
= isl_basic_map_simplify(bmap
);
9554 return isl_basic_map_finalize(bmap
);
9556 isl_basic_map_free(bmap1
);
9557 isl_basic_map_free(bmap2
);
9561 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9562 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9564 isl_basic_map
*prod
;
9566 prod
= isl_basic_map_product(bmap1
, bmap2
);
9567 prod
= isl_basic_map_flatten(prod
);
9571 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9572 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9574 return isl_basic_map_flat_range_product(bset1
, bset2
);
9577 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9578 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9580 isl_space
*space_result
= NULL
;
9581 isl_basic_map
*bmap
;
9582 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9583 struct isl_dim_map
*dim_map1
, *dim_map2
;
9585 if (!bmap1
|| !bmap2
)
9588 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9589 isl_space_copy(bmap2
->dim
));
9591 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9592 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9593 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9594 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9596 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9597 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9598 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9599 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9600 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9601 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9602 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9603 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9604 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9605 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9606 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9608 bmap
= isl_basic_map_alloc_space(space_result
,
9609 bmap1
->n_div
+ bmap2
->n_div
,
9610 bmap1
->n_eq
+ bmap2
->n_eq
,
9611 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9612 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9613 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9614 bmap
= isl_basic_map_simplify(bmap
);
9615 return isl_basic_map_finalize(bmap
);
9617 isl_basic_map_free(bmap1
);
9618 isl_basic_map_free(bmap2
);
9622 __isl_give isl_basic_map
*isl_basic_map_range_product(
9623 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9625 isl_space
*dim_result
= NULL
;
9626 isl_basic_map
*bmap
;
9627 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9628 struct isl_dim_map
*dim_map1
, *dim_map2
;
9630 if (!bmap1
|| !bmap2
)
9633 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9634 bmap2
->dim
, isl_dim_param
))
9635 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9636 "parameters don't match", goto error
);
9638 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9639 isl_space_copy(bmap2
->dim
));
9641 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9642 out1
= isl_basic_map_n_out(bmap1
);
9643 out2
= isl_basic_map_n_out(bmap2
);
9644 nparam
= isl_basic_map_n_param(bmap1
);
9646 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9647 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9648 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9649 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9650 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9651 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9652 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9653 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9654 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9655 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9656 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9658 bmap
= isl_basic_map_alloc_space(dim_result
,
9659 bmap1
->n_div
+ bmap2
->n_div
,
9660 bmap1
->n_eq
+ bmap2
->n_eq
,
9661 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9662 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9663 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9664 bmap
= isl_basic_map_simplify(bmap
);
9665 return isl_basic_map_finalize(bmap
);
9667 isl_basic_map_free(bmap1
);
9668 isl_basic_map_free(bmap2
);
9672 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9673 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9675 isl_basic_map
*prod
;
9677 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9678 prod
= isl_basic_map_flatten_range(prod
);
9682 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9683 * and collect the results.
9684 * The result live in the space obtained by calling "space_product"
9685 * on the spaces of "map1" and "map2".
9686 * If "remove_duplicates" is set then the result may contain duplicates
9687 * (even if the inputs do not) and so we try and remove the obvious
9690 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9691 __isl_take isl_map
*map2
,
9692 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
9693 __isl_take isl_space
*right
),
9694 __isl_give isl_basic_map
*(*basic_map_product
)(
9695 __isl_take isl_basic_map
*left
,
9696 __isl_take isl_basic_map
*right
),
9697 int remove_duplicates
)
9700 struct isl_map
*result
;
9706 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9707 map2
->dim
, isl_dim_param
), goto error
);
9709 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9710 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9711 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9713 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
9714 isl_space_copy(map2
->dim
)),
9715 map1
->n
* map2
->n
, flags
);
9718 for (i
= 0; i
< map1
->n
; ++i
)
9719 for (j
= 0; j
< map2
->n
; ++j
) {
9720 struct isl_basic_map
*part
;
9721 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9722 isl_basic_map_copy(map2
->p
[j
]));
9723 if (isl_basic_map_is_empty(part
))
9724 isl_basic_map_free(part
);
9726 result
= isl_map_add_basic_map(result
, part
);
9730 if (remove_duplicates
)
9731 result
= isl_map_remove_obvious_duplicates(result
);
9741 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9743 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9744 __isl_take isl_map
*map2
)
9746 return map_product(map1
, map2
, &isl_space_product
,
9747 &isl_basic_map_product
, 0);
9750 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9751 __isl_take isl_map
*map2
)
9753 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9756 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9758 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9759 __isl_take isl_map
*map2
)
9763 prod
= isl_map_product(map1
, map2
);
9764 prod
= isl_map_flatten(prod
);
9768 /* Given two set A and B, construct its Cartesian product A x B.
9770 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9772 return isl_map_range_product(set1
, set2
);
9775 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9776 __isl_take isl_set
*set2
)
9778 return isl_map_flat_range_product(set1
, set2
);
9781 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9783 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9784 __isl_take isl_map
*map2
)
9786 return map_product(map1
, map2
, &isl_space_domain_product
,
9787 &isl_basic_map_domain_product
, 1);
9790 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9792 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9793 __isl_take isl_map
*map2
)
9795 return map_product(map1
, map2
, &isl_space_range_product
,
9796 &isl_basic_map_range_product
, 1);
9799 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9800 __isl_take isl_map
*map2
)
9802 return isl_map_align_params_map_map_and(map1
, map2
,
9803 &map_domain_product_aligned
);
9806 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9807 __isl_take isl_map
*map2
)
9809 return isl_map_align_params_map_map_and(map1
, map2
,
9810 &map_range_product_aligned
);
9813 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
9815 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
9818 int total1
, keep1
, total2
, keep2
;
9822 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9823 !isl_space_range_is_wrapping(map
->dim
))
9824 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9825 "not a product", return isl_map_free(map
));
9827 space
= isl_map_get_space(map
);
9828 total1
= isl_space_dim(space
, isl_dim_in
);
9829 total2
= isl_space_dim(space
, isl_dim_out
);
9830 space
= isl_space_factor_domain(space
);
9831 keep1
= isl_space_dim(space
, isl_dim_in
);
9832 keep2
= isl_space_dim(space
, isl_dim_out
);
9833 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
9834 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
9835 map
= isl_map_reset_space(map
, space
);
9840 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
9842 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
9845 int total1
, keep1
, total2
, keep2
;
9849 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9850 !isl_space_range_is_wrapping(map
->dim
))
9851 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9852 "not a product", return isl_map_free(map
));
9854 space
= isl_map_get_space(map
);
9855 total1
= isl_space_dim(space
, isl_dim_in
);
9856 total2
= isl_space_dim(space
, isl_dim_out
);
9857 space
= isl_space_factor_range(space
);
9858 keep1
= isl_space_dim(space
, isl_dim_in
);
9859 keep2
= isl_space_dim(space
, isl_dim_out
);
9860 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
9861 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
9862 map
= isl_map_reset_space(map
, space
);
9867 /* Given a map of the form [A -> B] -> C, return the map A -> C.
9869 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
9876 if (!isl_space_domain_is_wrapping(map
->dim
))
9877 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9878 "domain is not a product", return isl_map_free(map
));
9880 space
= isl_map_get_space(map
);
9881 total
= isl_space_dim(space
, isl_dim_in
);
9882 space
= isl_space_domain_factor_domain(space
);
9883 keep
= isl_space_dim(space
, isl_dim_in
);
9884 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
9885 map
= isl_map_reset_space(map
, space
);
9890 /* Given a map of the form [A -> B] -> C, return the map B -> C.
9892 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
9899 if (!isl_space_domain_is_wrapping(map
->dim
))
9900 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9901 "domain is not a product", return isl_map_free(map
));
9903 space
= isl_map_get_space(map
);
9904 total
= isl_space_dim(space
, isl_dim_in
);
9905 space
= isl_space_domain_factor_range(space
);
9906 keep
= isl_space_dim(space
, isl_dim_in
);
9907 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
9908 map
= isl_map_reset_space(map
, space
);
9913 /* Given a map A -> [B -> C], extract the map A -> B.
9915 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
9922 if (!isl_space_range_is_wrapping(map
->dim
))
9923 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9924 "range is not a product", return isl_map_free(map
));
9926 space
= isl_map_get_space(map
);
9927 total
= isl_space_dim(space
, isl_dim_out
);
9928 space
= isl_space_range_factor_domain(space
);
9929 keep
= isl_space_dim(space
, isl_dim_out
);
9930 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
9931 map
= isl_map_reset_space(map
, space
);
9936 /* Given a map A -> [B -> C], extract the map A -> C.
9938 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
9945 if (!isl_space_range_is_wrapping(map
->dim
))
9946 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9947 "range is not a product", return isl_map_free(map
));
9949 space
= isl_map_get_space(map
);
9950 total
= isl_space_dim(space
, isl_dim_out
);
9951 space
= isl_space_range_factor_range(space
);
9952 keep
= isl_space_dim(space
, isl_dim_out
);
9953 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
9954 map
= isl_map_reset_space(map
, space
);
9959 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9961 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9962 __isl_take isl_map
*map2
)
9966 prod
= isl_map_domain_product(map1
, map2
);
9967 prod
= isl_map_flatten_domain(prod
);
9971 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9973 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9974 __isl_take isl_map
*map2
)
9978 prod
= isl_map_range_product(map1
, map2
);
9979 prod
= isl_map_flatten_range(prod
);
9983 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9986 uint32_t hash
= isl_hash_init();
9991 bmap
= isl_basic_map_copy(bmap
);
9992 bmap
= isl_basic_map_normalize(bmap
);
9995 total
= isl_basic_map_total_dim(bmap
);
9996 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9997 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9999 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10000 isl_hash_hash(hash
, c_hash
);
10002 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10003 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10005 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10006 isl_hash_hash(hash
, c_hash
);
10008 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10009 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10011 if (isl_int_is_zero(bmap
->div
[i
][0]))
10013 isl_hash_byte(hash
, i
& 0xFF);
10014 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10015 isl_hash_hash(hash
, c_hash
);
10017 isl_basic_map_free(bmap
);
10021 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10023 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
10026 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10033 map
= isl_map_copy(map
);
10034 map
= isl_map_normalize(map
);
10038 hash
= isl_hash_init();
10039 for (i
= 0; i
< map
->n
; ++i
) {
10040 uint32_t bmap_hash
;
10041 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10042 isl_hash_hash(hash
, bmap_hash
);
10050 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10052 return isl_map_get_hash((isl_map
*)set
);
10055 /* Check if the value for dimension dim is completely determined
10056 * by the values of the other parameters and variables.
10057 * That is, check if dimension dim is involved in an equality.
10059 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
10066 nparam
= isl_basic_set_n_param(bset
);
10067 for (i
= 0; i
< bset
->n_eq
; ++i
)
10068 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
10073 /* Check if the value for dimension dim is completely determined
10074 * by the values of the other parameters and variables.
10075 * That is, check if dimension dim is involved in an equality
10076 * for each of the subsets.
10078 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
10084 for (i
= 0; i
< set
->n
; ++i
) {
10086 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
10093 /* Return the number of basic maps in the (current) representation of "map".
10095 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10097 return map
? map
->n
: 0;
10100 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10102 return set
? set
->n
: 0;
10105 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10106 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10111 return isl_stat_error
;
10113 for (i
= 0; i
< map
->n
; ++i
)
10114 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10115 return isl_stat_error
;
10117 return isl_stat_ok
;
10120 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10121 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10126 return isl_stat_error
;
10128 for (i
= 0; i
< set
->n
; ++i
)
10129 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10130 return isl_stat_error
;
10132 return isl_stat_ok
;
10135 /* Return a list of basic sets, the union of which is equal to "set".
10137 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10138 __isl_keep isl_set
*set
)
10141 isl_basic_set_list
*list
;
10146 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10147 for (i
= 0; i
< set
->n
; ++i
) {
10148 isl_basic_set
*bset
;
10150 bset
= isl_basic_set_copy(set
->p
[i
]);
10151 list
= isl_basic_set_list_add(list
, bset
);
10157 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10164 bset
= isl_basic_set_cow(bset
);
10168 dim
= isl_basic_set_get_space(bset
);
10169 dim
= isl_space_lift(dim
, bset
->n_div
);
10172 isl_space_free(bset
->dim
);
10174 bset
->extra
-= bset
->n_div
;
10177 bset
= isl_basic_set_finalize(bset
);
10181 isl_basic_set_free(bset
);
10185 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10191 set
= isl_set_align_divs(set
);
10196 set
= isl_set_cow(set
);
10200 n_div
= set
->p
[0]->n_div
;
10201 dim
= isl_set_get_space(set
);
10202 dim
= isl_space_lift(dim
, n_div
);
10205 isl_space_free(set
->dim
);
10208 for (i
= 0; i
< set
->n
; ++i
) {
10209 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10220 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
10223 struct isl_basic_map
*bmap
;
10230 set
= isl_set_align_divs(set
);
10235 dim
= isl_set_get_space(set
);
10236 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
10238 return isl_map_identity(isl_space_map_from_set(dim
));
10241 n_div
= set
->p
[0]->n_div
;
10242 dim
= isl_space_map_from_set(dim
);
10243 n_param
= isl_space_dim(dim
, isl_dim_param
);
10244 n_set
= isl_space_dim(dim
, isl_dim_in
);
10245 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
10246 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
10247 for (i
= 0; i
< n_set
; ++i
)
10248 bmap
= var_equal(bmap
, i
);
10250 total
= n_param
+ n_set
+ n_set
+ n_div
;
10251 for (i
= 0; i
< n_div
; ++i
) {
10252 k
= isl_basic_map_alloc_inequality(bmap
);
10255 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
10256 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
10257 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
10258 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
10259 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
10260 set
->p
[0]->div
[i
][0]);
10262 l
= isl_basic_map_alloc_inequality(bmap
);
10265 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
10266 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
10267 set
->p
[0]->div
[i
][0]);
10268 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
10272 bmap
= isl_basic_map_simplify(bmap
);
10273 bmap
= isl_basic_map_finalize(bmap
);
10274 return isl_map_from_basic_map(bmap
);
10277 isl_basic_map_free(bmap
);
10281 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10289 dim
= isl_basic_set_total_dim(bset
);
10290 size
+= bset
->n_eq
* (1 + dim
);
10291 size
+= bset
->n_ineq
* (1 + dim
);
10292 size
+= bset
->n_div
* (2 + dim
);
10297 int isl_set_size(__isl_keep isl_set
*set
)
10305 for (i
= 0; i
< set
->n
; ++i
)
10306 size
+= isl_basic_set_size(set
->p
[i
]);
10311 /* Check if there is any lower bound (if lower == 0) and/or upper
10312 * bound (if upper == 0) on the specified dim.
10314 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10315 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10320 return isl_bool_error
;
10322 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
),
10323 return isl_bool_error
);
10325 pos
+= isl_basic_map_offset(bmap
, type
);
10327 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10328 if (isl_int_is_zero(bmap
->div
[i
][0]))
10330 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10331 return isl_bool_true
;
10334 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10335 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10336 return isl_bool_true
;
10338 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10339 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10346 return lower
&& upper
;
10349 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10350 enum isl_dim_type type
, unsigned pos
)
10352 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10355 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10356 enum isl_dim_type type
, unsigned pos
)
10358 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10361 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10362 enum isl_dim_type type
, unsigned pos
)
10364 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10367 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10368 enum isl_dim_type type
, unsigned pos
)
10375 for (i
= 0; i
< map
->n
; ++i
) {
10377 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10378 if (bounded
< 0 || !bounded
)
10385 /* Return 1 if the specified dim is involved in both an upper bound
10386 * and a lower bound.
10388 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10389 enum isl_dim_type type
, unsigned pos
)
10391 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
10394 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10396 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10397 enum isl_dim_type type
, unsigned pos
,
10398 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10399 enum isl_dim_type type
, unsigned pos
))
10404 return isl_bool_error
;
10406 for (i
= 0; i
< map
->n
; ++i
) {
10408 bounded
= fn(map
->p
[i
], type
, pos
);
10409 if (bounded
< 0 || bounded
)
10413 return isl_bool_false
;
10416 /* Return 1 if the specified dim is involved in any lower bound.
10418 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10419 enum isl_dim_type type
, unsigned pos
)
10421 return has_any_bound(set
, type
, pos
,
10422 &isl_basic_map_dim_has_lower_bound
);
10425 /* Return 1 if the specified dim is involved in any upper bound.
10427 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10428 enum isl_dim_type type
, unsigned pos
)
10430 return has_any_bound(set
, type
, pos
,
10431 &isl_basic_map_dim_has_upper_bound
);
10434 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10436 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10437 enum isl_dim_type type
, unsigned pos
,
10438 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10439 enum isl_dim_type type
, unsigned pos
))
10444 return isl_bool_error
;
10446 for (i
= 0; i
< map
->n
; ++i
) {
10448 bounded
= fn(map
->p
[i
], type
, pos
);
10449 if (bounded
< 0 || !bounded
)
10453 return isl_bool_true
;
10456 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10458 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10459 enum isl_dim_type type
, unsigned pos
)
10461 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10464 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10466 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10467 enum isl_dim_type type
, unsigned pos
)
10469 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10472 /* For each of the "n" variables starting at "first", determine
10473 * the sign of the variable and put the results in the first "n"
10474 * elements of the array "signs".
10476 * 1 means that the variable is non-negative
10477 * -1 means that the variable is non-positive
10478 * 0 means the variable attains both positive and negative values.
10480 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10481 unsigned first
, unsigned n
, int *signs
)
10483 isl_vec
*bound
= NULL
;
10484 struct isl_tab
*tab
= NULL
;
10485 struct isl_tab_undo
*snap
;
10488 if (!bset
|| !signs
)
10491 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10492 tab
= isl_tab_from_basic_set(bset
, 0);
10493 if (!bound
|| !tab
)
10496 isl_seq_clr(bound
->el
, bound
->size
);
10497 isl_int_set_si(bound
->el
[0], -1);
10499 snap
= isl_tab_snap(tab
);
10500 for (i
= 0; i
< n
; ++i
) {
10503 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10504 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10506 empty
= tab
->empty
;
10507 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10508 if (isl_tab_rollback(tab
, snap
) < 0)
10516 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10517 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10519 empty
= tab
->empty
;
10520 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10521 if (isl_tab_rollback(tab
, snap
) < 0)
10524 signs
[i
] = empty
? -1 : 0;
10528 isl_vec_free(bound
);
10532 isl_vec_free(bound
);
10536 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10537 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10539 if (!bset
|| !signs
)
10541 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10544 first
+= pos(bset
->dim
, type
) - 1;
10545 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10548 /* Is it possible for the integer division "div" to depend (possibly
10549 * indirectly) on any output dimensions?
10551 * If the div is undefined, then we conservatively assume that it
10552 * may depend on them.
10553 * Otherwise, we check if it actually depends on them or on any integer
10554 * divisions that may depend on them.
10556 static int div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10559 unsigned n_out
, o_out
;
10560 unsigned n_div
, o_div
;
10562 if (isl_int_is_zero(bmap
->div
[div
][0]))
10565 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10566 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10568 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10571 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10572 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10574 for (i
= 0; i
< n_div
; ++i
) {
10575 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10577 if (div_may_involve_output(bmap
, i
))
10584 /* Return the first integer division of "bmap" in the range
10585 * [first, first + n[ that may depend on any output dimensions and
10586 * that has a non-zero coefficient in "c" (where the first coefficient
10587 * in "c" corresponds to integer division "first").
10589 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10590 isl_int
*c
, int first
, int n
)
10597 for (k
= first
; k
< first
+ n
; ++k
) {
10598 if (isl_int_is_zero(c
[k
]))
10600 if (div_may_involve_output(bmap
, k
))
10607 /* Look for a pair of inequality constraints in "bmap" of the form
10609 * -l + i >= 0 or i >= l
10611 * n + l - i >= 0 or i <= l + n
10613 * with n < "m" and i the output dimension at position "pos".
10614 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10615 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10616 * and earlier output dimensions, as well as integer divisions that do
10617 * not involve any of the output dimensions.
10619 * Return the index of the first inequality constraint or bmap->n_ineq
10620 * if no such pair can be found.
10622 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10623 int pos
, isl_int m
)
10628 unsigned n_div
, o_div
;
10629 unsigned n_out
, o_out
;
10635 ctx
= isl_basic_map_get_ctx(bmap
);
10636 total
= isl_basic_map_total_dim(bmap
);
10637 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10638 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10639 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10640 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10641 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10642 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10644 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10645 n_out
- (pos
+ 1)) != -1)
10647 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10650 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10651 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10654 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10655 bmap
->ineq
[j
] + 1, total
))
10659 if (j
>= bmap
->n_ineq
)
10661 isl_int_add(bmap
->ineq
[i
][0],
10662 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10663 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10664 isl_int_sub(bmap
->ineq
[i
][0],
10665 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10668 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10674 return bmap
->n_ineq
;
10677 /* Return the index of the equality of "bmap" that defines
10678 * the output dimension "pos" in terms of earlier dimensions.
10679 * The equality may also involve integer divisions, as long
10680 * as those integer divisions are defined in terms of
10681 * parameters or input dimensions.
10682 * In this case, *div is set to the number of integer divisions and
10683 * *ineq is set to the number of inequality constraints (provided
10684 * div and ineq are not NULL).
10686 * The equality may also involve a single integer division involving
10687 * the output dimensions (typically only output dimension "pos") as
10688 * long as the coefficient of output dimension "pos" is 1 or -1 and
10689 * there is a pair of constraints i >= l and i <= l + n, with i referring
10690 * to output dimension "pos", l an expression involving only earlier
10691 * dimensions and n smaller than the coefficient of the integer division
10692 * in the equality. In this case, the output dimension can be defined
10693 * in terms of a modulo expression that does not involve the integer division.
10694 * *div is then set to this single integer division and
10695 * *ineq is set to the index of constraint i >= l.
10697 * Return bmap->n_eq if there is no such equality.
10698 * Return -1 on error.
10700 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10701 int pos
, int *div
, int *ineq
)
10704 unsigned n_out
, o_out
;
10705 unsigned n_div
, o_div
;
10710 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10711 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10712 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10713 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10716 *ineq
= bmap
->n_ineq
;
10719 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10720 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10722 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10723 n_out
- (pos
+ 1)) != -1)
10725 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10729 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10730 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10732 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10733 k
+ 1, n_div
- (k
+1)) < n_div
)
10735 l
= find_modulo_constraint_pair(bmap
, pos
,
10736 bmap
->eq
[j
][o_div
+ k
]);
10739 if (l
>= bmap
->n_ineq
)
10751 /* Check if the given basic map is obviously single-valued.
10752 * In particular, for each output dimension, check that there is
10753 * an equality that defines the output dimension in terms of
10754 * earlier dimensions.
10756 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10762 return isl_bool_error
;
10764 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10766 for (i
= 0; i
< n_out
; ++i
) {
10769 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
10772 return isl_bool_error
;
10773 if (eq
>= bmap
->n_eq
)
10774 return isl_bool_false
;
10777 return isl_bool_true
;
10780 /* Check if the given basic map is single-valued.
10781 * We simply compute
10785 * and check if the result is a subset of the identity mapping.
10787 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10790 isl_basic_map
*test
;
10794 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10798 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10799 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10801 space
= isl_basic_map_get_space(bmap
);
10802 space
= isl_space_map_from_set(isl_space_range(space
));
10803 id
= isl_basic_map_identity(space
);
10805 sv
= isl_basic_map_is_subset(test
, id
);
10807 isl_basic_map_free(test
);
10808 isl_basic_map_free(id
);
10813 /* Check if the given map is obviously single-valued.
10815 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10818 return isl_bool_error
;
10820 return isl_bool_true
;
10822 return isl_bool_false
;
10824 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10827 /* Check if the given map is single-valued.
10828 * We simply compute
10832 * and check if the result is a subset of the identity mapping.
10834 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
10841 sv
= isl_map_plain_is_single_valued(map
);
10845 test
= isl_map_reverse(isl_map_copy(map
));
10846 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10848 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10849 id
= isl_map_identity(dim
);
10851 sv
= isl_map_is_subset(test
, id
);
10853 isl_map_free(test
);
10859 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
10863 map
= isl_map_copy(map
);
10864 map
= isl_map_reverse(map
);
10865 in
= isl_map_is_single_valued(map
);
10871 /* Check if the given map is obviously injective.
10873 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10877 map
= isl_map_copy(map
);
10878 map
= isl_map_reverse(map
);
10879 in
= isl_map_plain_is_single_valued(map
);
10885 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
10889 sv
= isl_map_is_single_valued(map
);
10893 return isl_map_is_injective(map
);
10896 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
10898 return isl_map_is_single_valued((isl_map
*)set
);
10901 int isl_map_is_translation(__isl_keep isl_map
*map
)
10906 delta
= isl_map_deltas(isl_map_copy(map
));
10907 ok
= isl_set_is_singleton(delta
);
10908 isl_set_free(delta
);
10913 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10915 if (isl_seq_first_non_zero(p
, pos
) != -1)
10917 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10922 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10931 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10934 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10935 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10936 for (j
= 0; j
< nvar
; ++j
) {
10937 int lower
= 0, upper
= 0;
10938 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10939 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10941 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10945 if (i
< bset
->n_eq
)
10947 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10948 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10950 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10952 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10957 if (!lower
|| !upper
)
10964 int isl_set_is_box(__isl_keep isl_set
*set
)
10971 return isl_basic_set_is_box(set
->p
[0]);
10974 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10977 return isl_bool_error
;
10979 return isl_space_is_wrapping(bset
->dim
);
10982 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
10985 return isl_bool_error
;
10987 return isl_space_is_wrapping(set
->dim
);
10990 /* Modify the space of "map" through a call to "change".
10991 * If "can_change" is set (not NULL), then first call it to check
10992 * if the modification is allowed, printing the error message "cannot_change"
10995 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
10996 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
10997 const char *cannot_change
,
10998 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11006 ok
= can_change
? can_change(map
) : isl_bool_true
;
11008 return isl_map_free(map
);
11010 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11011 return isl_map_free(map
));
11013 space
= change(isl_map_get_space(map
));
11014 map
= isl_map_reset_space(map
, space
);
11019 /* Is the domain of "map" a wrapped relation?
11021 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11024 return isl_bool_error
;
11026 return isl_space_domain_is_wrapping(map
->dim
);
11029 /* Is the range of "map" a wrapped relation?
11031 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11034 return isl_bool_error
;
11036 return isl_space_range_is_wrapping(map
->dim
);
11039 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11041 bmap
= isl_basic_map_cow(bmap
);
11045 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11049 bmap
= isl_basic_map_finalize(bmap
);
11051 return (isl_basic_set
*)bmap
;
11053 isl_basic_map_free(bmap
);
11057 /* Given a map A -> B, return the set (A -> B).
11059 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11061 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11064 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11066 bset
= isl_basic_set_cow(bset
);
11070 bset
->dim
= isl_space_unwrap(bset
->dim
);
11074 bset
= isl_basic_set_finalize(bset
);
11076 return (isl_basic_map
*)bset
;
11078 isl_basic_set_free(bset
);
11082 /* Given a set (A -> B), return the map A -> B.
11083 * Error out if "set" is not of the form (A -> B).
11085 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11087 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11088 "not a wrapping set", &isl_space_unwrap
);
11091 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11092 enum isl_dim_type type
)
11097 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11100 bmap
= isl_basic_map_cow(bmap
);
11104 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11108 bmap
= isl_basic_map_finalize(bmap
);
11112 isl_basic_map_free(bmap
);
11116 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11117 enum isl_dim_type type
)
11124 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11127 map
= isl_map_cow(map
);
11131 for (i
= 0; i
< map
->n
; ++i
) {
11132 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11136 map
->dim
= isl_space_reset(map
->dim
, type
);
11146 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11151 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11154 bmap
= isl_basic_map_cow(bmap
);
11158 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11162 bmap
= isl_basic_map_finalize(bmap
);
11166 isl_basic_map_free(bmap
);
11170 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11172 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
11175 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11176 __isl_take isl_basic_map
*bmap
)
11181 if (!bmap
->dim
->nested
[0])
11184 bmap
= isl_basic_map_cow(bmap
);
11188 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11192 bmap
= isl_basic_map_finalize(bmap
);
11196 isl_basic_map_free(bmap
);
11200 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11201 __isl_take isl_basic_map
*bmap
)
11206 if (!bmap
->dim
->nested
[1])
11209 bmap
= isl_basic_map_cow(bmap
);
11213 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11217 bmap
= isl_basic_map_finalize(bmap
);
11221 isl_basic_map_free(bmap
);
11225 /* Remove any internal structure from the spaces of domain and range of "map".
11227 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11232 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11235 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11238 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11240 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
11243 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11245 isl_space
*dim
, *flat_dim
;
11248 dim
= isl_set_get_space(set
);
11249 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11250 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11251 map
= isl_map_intersect_domain(map
, set
);
11256 /* Remove any internal structure from the space of the domain of "map".
11258 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11263 if (!map
->dim
->nested
[0])
11266 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11269 /* Remove any internal structure from the space of the range of "map".
11271 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11276 if (!map
->dim
->nested
[1])
11279 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11282 /* Reorder the dimensions of "bmap" according to the given dim_map
11283 * and set the dimension specification to "dim" and
11284 * perform Gaussian elimination on the result.
11286 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11287 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11289 isl_basic_map
*res
;
11292 bmap
= isl_basic_map_cow(bmap
);
11293 if (!bmap
|| !dim
|| !dim_map
)
11296 flags
= bmap
->flags
;
11297 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11298 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11299 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11300 res
= isl_basic_map_alloc_space(dim
,
11301 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11302 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11304 res
->flags
= flags
;
11305 res
= isl_basic_map_gauss(res
, NULL
);
11306 res
= isl_basic_map_finalize(res
);
11310 isl_basic_map_free(bmap
);
11311 isl_space_free(dim
);
11315 /* Reorder the dimensions of "map" according to given reordering.
11317 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11318 __isl_take isl_reordering
*r
)
11321 struct isl_dim_map
*dim_map
;
11323 map
= isl_map_cow(map
);
11324 dim_map
= isl_dim_map_from_reordering(r
);
11325 if (!map
|| !r
|| !dim_map
)
11328 for (i
= 0; i
< map
->n
; ++i
) {
11329 struct isl_dim_map
*dim_map_i
;
11331 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11333 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11334 isl_space_copy(r
->dim
), dim_map_i
);
11340 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11342 isl_reordering_free(r
);
11348 isl_reordering_free(r
);
11352 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11353 __isl_take isl_reordering
*r
)
11355 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
11358 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11359 __isl_take isl_space
*model
)
11363 if (!map
|| !model
)
11366 ctx
= isl_space_get_ctx(model
);
11367 if (!isl_space_has_named_params(model
))
11368 isl_die(ctx
, isl_error_invalid
,
11369 "model has unnamed parameters", goto error
);
11370 if (!isl_space_has_named_params(map
->dim
))
11371 isl_die(ctx
, isl_error_invalid
,
11372 "relation has unnamed parameters", goto error
);
11373 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11374 isl_reordering
*exp
;
11376 model
= isl_space_drop_dims(model
, isl_dim_in
,
11377 0, isl_space_dim(model
, isl_dim_in
));
11378 model
= isl_space_drop_dims(model
, isl_dim_out
,
11379 0, isl_space_dim(model
, isl_dim_out
));
11380 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11381 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11382 map
= isl_map_realign(map
, exp
);
11385 isl_space_free(model
);
11388 isl_space_free(model
);
11393 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11394 __isl_take isl_space
*model
)
11396 return isl_map_align_params(set
, model
);
11399 /* Align the parameters of "bmap" to those of "model", introducing
11400 * additional parameters if needed.
11402 __isl_give isl_basic_map
*isl_basic_map_align_params(
11403 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11407 if (!bmap
|| !model
)
11410 ctx
= isl_space_get_ctx(model
);
11411 if (!isl_space_has_named_params(model
))
11412 isl_die(ctx
, isl_error_invalid
,
11413 "model has unnamed parameters", goto error
);
11414 if (!isl_space_has_named_params(bmap
->dim
))
11415 isl_die(ctx
, isl_error_invalid
,
11416 "relation has unnamed parameters", goto error
);
11417 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11418 isl_reordering
*exp
;
11419 struct isl_dim_map
*dim_map
;
11421 model
= isl_space_drop_dims(model
, isl_dim_in
,
11422 0, isl_space_dim(model
, isl_dim_in
));
11423 model
= isl_space_drop_dims(model
, isl_dim_out
,
11424 0, isl_space_dim(model
, isl_dim_out
));
11425 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11426 exp
= isl_reordering_extend_space(exp
,
11427 isl_basic_map_get_space(bmap
));
11428 dim_map
= isl_dim_map_from_reordering(exp
);
11429 bmap
= isl_basic_map_realign(bmap
,
11430 exp
? isl_space_copy(exp
->dim
) : NULL
,
11431 isl_dim_map_extend(dim_map
, bmap
));
11432 isl_reordering_free(exp
);
11436 isl_space_free(model
);
11439 isl_space_free(model
);
11440 isl_basic_map_free(bmap
);
11444 /* Align the parameters of "bset" to those of "model", introducing
11445 * additional parameters if needed.
11447 __isl_give isl_basic_set
*isl_basic_set_align_params(
11448 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11450 return isl_basic_map_align_params(bset
, model
);
11453 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11454 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11455 enum isl_dim_type c2
, enum isl_dim_type c3
,
11456 enum isl_dim_type c4
, enum isl_dim_type c5
)
11458 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11459 struct isl_mat
*mat
;
11465 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11466 isl_basic_map_total_dim(bmap
) + 1);
11469 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11470 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11471 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11472 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11473 isl_int_set(mat
->row
[i
][pos
],
11474 bmap
->eq
[i
][off
+ k
]);
11482 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11483 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11484 enum isl_dim_type c2
, enum isl_dim_type c3
,
11485 enum isl_dim_type c4
, enum isl_dim_type c5
)
11487 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11488 struct isl_mat
*mat
;
11494 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11495 isl_basic_map_total_dim(bmap
) + 1);
11498 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11499 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11500 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11501 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11502 isl_int_set(mat
->row
[i
][pos
],
11503 bmap
->ineq
[i
][off
+ k
]);
11511 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11512 __isl_take isl_space
*dim
,
11513 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11514 enum isl_dim_type c2
, enum isl_dim_type c3
,
11515 enum isl_dim_type c4
, enum isl_dim_type c5
)
11517 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11518 isl_basic_map
*bmap
;
11524 if (!dim
|| !eq
|| !ineq
)
11527 if (eq
->n_col
!= ineq
->n_col
)
11528 isl_die(dim
->ctx
, isl_error_invalid
,
11529 "equalities and inequalities matrices should have "
11530 "same number of columns", goto error
);
11532 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11534 if (eq
->n_col
< total
)
11535 isl_die(dim
->ctx
, isl_error_invalid
,
11536 "number of columns too small", goto error
);
11538 extra
= eq
->n_col
- total
;
11540 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11541 eq
->n_row
, ineq
->n_row
);
11544 for (i
= 0; i
< extra
; ++i
) {
11545 k
= isl_basic_map_alloc_div(bmap
);
11548 isl_int_set_si(bmap
->div
[k
][0], 0);
11550 for (i
= 0; i
< eq
->n_row
; ++i
) {
11551 l
= isl_basic_map_alloc_equality(bmap
);
11554 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11555 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11556 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11557 isl_int_set(bmap
->eq
[l
][off
+ k
],
11563 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11564 l
= isl_basic_map_alloc_inequality(bmap
);
11567 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11568 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11569 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11570 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11571 ineq
->row
[i
][pos
]);
11577 isl_space_free(dim
);
11579 isl_mat_free(ineq
);
11581 bmap
= isl_basic_map_simplify(bmap
);
11582 return isl_basic_map_finalize(bmap
);
11584 isl_space_free(dim
);
11586 isl_mat_free(ineq
);
11590 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11591 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11592 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11594 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
11595 c1
, c2
, c3
, c4
, isl_dim_in
);
11598 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11599 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11600 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11602 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
11603 c1
, c2
, c3
, c4
, isl_dim_in
);
11606 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11607 __isl_take isl_space
*dim
,
11608 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11609 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11611 return (isl_basic_set
*)
11612 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11613 c1
, c2
, c3
, c4
, isl_dim_in
);
11616 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11619 return isl_bool_error
;
11621 return isl_space_can_zip(bmap
->dim
);
11624 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11627 return isl_bool_error
;
11629 return isl_space_can_zip(map
->dim
);
11632 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11633 * (A -> C) -> (B -> D).
11635 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11644 if (!isl_basic_map_can_zip(bmap
))
11645 isl_die(bmap
->ctx
, isl_error_invalid
,
11646 "basic map cannot be zipped", goto error
);
11647 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11648 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11649 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11650 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11651 bmap
= isl_basic_map_cow(bmap
);
11652 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11655 bmap
->dim
= isl_space_zip(bmap
->dim
);
11658 bmap
= isl_basic_map_mark_final(bmap
);
11661 isl_basic_map_free(bmap
);
11665 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11666 * (A -> C) -> (B -> D).
11668 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11675 if (!isl_map_can_zip(map
))
11676 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11679 map
= isl_map_cow(map
);
11683 for (i
= 0; i
< map
->n
; ++i
) {
11684 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11689 map
->dim
= isl_space_zip(map
->dim
);
11699 /* Can we apply isl_basic_map_curry to "bmap"?
11700 * That is, does it have a nested relation in its domain?
11702 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11705 return isl_bool_error
;
11707 return isl_space_can_curry(bmap
->dim
);
11710 /* Can we apply isl_map_curry to "map"?
11711 * That is, does it have a nested relation in its domain?
11713 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
11716 return isl_bool_error
;
11718 return isl_space_can_curry(map
->dim
);
11721 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11724 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11730 if (!isl_basic_map_can_curry(bmap
))
11731 isl_die(bmap
->ctx
, isl_error_invalid
,
11732 "basic map cannot be curried", goto error
);
11733 bmap
= isl_basic_map_cow(bmap
);
11736 bmap
->dim
= isl_space_curry(bmap
->dim
);
11739 bmap
= isl_basic_map_mark_final(bmap
);
11742 isl_basic_map_free(bmap
);
11746 /* Given a map (A -> B) -> C, return the corresponding map
11749 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11751 return isl_map_change_space(map
, &isl_map_can_curry
,
11752 "map cannot be curried", &isl_space_curry
);
11755 /* Can isl_map_range_curry be applied to "map"?
11756 * That is, does it have a nested relation in its range,
11757 * the domain of which is itself a nested relation?
11759 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
11762 return isl_bool_error
;
11764 return isl_space_can_range_curry(map
->dim
);
11767 /* Given a map A -> ((B -> C) -> D), return the corresponding map
11768 * A -> (B -> (C -> D)).
11770 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
11772 return isl_map_change_space(map
, &isl_map_can_range_curry
,
11773 "map range cannot be curried",
11774 &isl_space_range_curry
);
11777 /* Can we apply isl_basic_map_uncurry to "bmap"?
11778 * That is, does it have a nested relation in its domain?
11780 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11783 return isl_bool_error
;
11785 return isl_space_can_uncurry(bmap
->dim
);
11788 /* Can we apply isl_map_uncurry to "map"?
11789 * That is, does it have a nested relation in its domain?
11791 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
11794 return isl_bool_error
;
11796 return isl_space_can_uncurry(map
->dim
);
11799 /* Given a basic map A -> (B -> C), return the corresponding basic map
11802 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11808 if (!isl_basic_map_can_uncurry(bmap
))
11809 isl_die(bmap
->ctx
, isl_error_invalid
,
11810 "basic map cannot be uncurried",
11811 return isl_basic_map_free(bmap
));
11812 bmap
= isl_basic_map_cow(bmap
);
11815 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11817 return isl_basic_map_free(bmap
);
11818 bmap
= isl_basic_map_mark_final(bmap
);
11822 /* Given a map A -> (B -> C), return the corresponding map
11825 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11827 return isl_map_change_space(map
, &isl_map_can_uncurry
,
11828 "map cannot be uncurried", &isl_space_uncurry
);
11831 /* Construct a basic map mapping the domain of the affine expression
11832 * to a one-dimensional range prescribed by the affine expression.
11834 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11838 isl_local_space
*ls
;
11839 isl_basic_map
*bmap
;
11844 ls
= isl_aff_get_local_space(aff
);
11845 bmap
= isl_basic_map_from_local_space(ls
);
11846 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11847 k
= isl_basic_map_alloc_equality(bmap
);
11851 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11852 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11853 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11854 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11855 aff
->v
->size
- (pos
+ 1));
11858 bmap
= isl_basic_map_finalize(bmap
);
11862 isl_basic_map_free(bmap
);
11866 /* Construct a map mapping the domain of the affine expression
11867 * to a one-dimensional range prescribed by the affine expression.
11869 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11871 isl_basic_map
*bmap
;
11873 bmap
= isl_basic_map_from_aff(aff
);
11874 return isl_map_from_basic_map(bmap
);
11877 /* Construct a basic map mapping the domain the multi-affine expression
11878 * to its range, with each dimension in the range equated to the
11879 * corresponding affine expression.
11881 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11882 __isl_take isl_multi_aff
*maff
)
11886 isl_basic_map
*bmap
;
11891 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11892 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11893 "invalid space", goto error
);
11895 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11896 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11898 for (i
= 0; i
< maff
->n
; ++i
) {
11900 isl_basic_map
*bmap_i
;
11902 aff
= isl_aff_copy(maff
->p
[i
]);
11903 bmap_i
= isl_basic_map_from_aff(aff
);
11905 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11908 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11910 isl_multi_aff_free(maff
);
11913 isl_multi_aff_free(maff
);
11917 /* Construct a map mapping the domain the multi-affine expression
11918 * to its range, with each dimension in the range equated to the
11919 * corresponding affine expression.
11921 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11923 isl_basic_map
*bmap
;
11925 bmap
= isl_basic_map_from_multi_aff(maff
);
11926 return isl_map_from_basic_map(bmap
);
11929 /* Construct a basic map mapping a domain in the given space to
11930 * to an n-dimensional range, with n the number of elements in the list,
11931 * where each coordinate in the range is prescribed by the
11932 * corresponding affine expression.
11933 * The domains of all affine expressions in the list are assumed to match
11936 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11937 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11941 isl_basic_map
*bmap
;
11946 dim
= isl_space_from_domain(domain_dim
);
11947 bmap
= isl_basic_map_universe(dim
);
11949 for (i
= 0; i
< list
->n
; ++i
) {
11951 isl_basic_map
*bmap_i
;
11953 aff
= isl_aff_copy(list
->p
[i
]);
11954 bmap_i
= isl_basic_map_from_aff(aff
);
11956 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11959 isl_aff_list_free(list
);
11963 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11964 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11966 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11969 /* Construct a basic map where the given dimensions are equal to each other.
11971 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11972 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11974 isl_basic_map
*bmap
= NULL
;
11980 if (pos1
>= isl_space_dim(space
, type1
))
11981 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11982 "index out of bounds", goto error
);
11983 if (pos2
>= isl_space_dim(space
, type2
))
11984 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11985 "index out of bounds", goto error
);
11987 if (type1
== type2
&& pos1
== pos2
)
11988 return isl_basic_map_universe(space
);
11990 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11991 i
= isl_basic_map_alloc_equality(bmap
);
11994 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11995 pos1
+= isl_basic_map_offset(bmap
, type1
);
11996 pos2
+= isl_basic_map_offset(bmap
, type2
);
11997 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11998 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11999 bmap
= isl_basic_map_finalize(bmap
);
12000 isl_space_free(space
);
12003 isl_space_free(space
);
12004 isl_basic_map_free(bmap
);
12008 /* Add a constraint imposing that the given two dimensions are equal.
12010 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12011 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12015 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12017 bmap
= isl_basic_map_intersect(bmap
, eq
);
12022 /* Add a constraint imposing that the given two dimensions are equal.
12024 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12025 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12027 isl_basic_map
*bmap
;
12029 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12031 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12036 /* Add a constraint imposing that the given two dimensions have opposite values.
12038 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12039 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12041 isl_basic_map
*bmap
= NULL
;
12047 if (pos1
>= isl_map_dim(map
, type1
))
12048 isl_die(map
->ctx
, isl_error_invalid
,
12049 "index out of bounds", goto error
);
12050 if (pos2
>= isl_map_dim(map
, type2
))
12051 isl_die(map
->ctx
, isl_error_invalid
,
12052 "index out of bounds", goto error
);
12054 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12055 i
= isl_basic_map_alloc_equality(bmap
);
12058 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12059 pos1
+= isl_basic_map_offset(bmap
, type1
);
12060 pos2
+= isl_basic_map_offset(bmap
, type2
);
12061 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12062 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12063 bmap
= isl_basic_map_finalize(bmap
);
12065 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12069 isl_basic_map_free(bmap
);
12074 /* Construct a constraint imposing that the value of the first dimension is
12075 * greater than or equal to that of the second.
12077 static __isl_give isl_constraint
*constraint_order_ge(
12078 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12079 enum isl_dim_type type2
, int pos2
)
12086 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12088 if (pos1
>= isl_constraint_dim(c
, type1
))
12089 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12090 "index out of bounds", return isl_constraint_free(c
));
12091 if (pos2
>= isl_constraint_dim(c
, type2
))
12092 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12093 "index out of bounds", return isl_constraint_free(c
));
12095 if (type1
== type2
&& pos1
== pos2
)
12098 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12099 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12104 /* Add a constraint imposing that the value of the first dimension is
12105 * greater than or equal to that of the second.
12107 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12108 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12113 if (type1
== type2
&& pos1
== pos2
)
12115 space
= isl_basic_map_get_space(bmap
);
12116 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12117 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12122 /* Add a constraint imposing that the value of the first dimension is
12123 * greater than or equal to that of the second.
12125 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12126 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12131 if (type1
== type2
&& pos1
== pos2
)
12133 space
= isl_map_get_space(map
);
12134 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12135 map
= isl_map_add_constraint(map
, c
);
12140 /* Add a constraint imposing that the value of the first dimension is
12141 * less than or equal to that of the second.
12143 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12144 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12146 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12149 /* Construct a basic map where the value of the first dimension is
12150 * greater than that of the second.
12152 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12153 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12155 isl_basic_map
*bmap
= NULL
;
12161 if (pos1
>= isl_space_dim(space
, type1
))
12162 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12163 "index out of bounds", goto error
);
12164 if (pos2
>= isl_space_dim(space
, type2
))
12165 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12166 "index out of bounds", goto error
);
12168 if (type1
== type2
&& pos1
== pos2
)
12169 return isl_basic_map_empty(space
);
12171 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12172 i
= isl_basic_map_alloc_inequality(bmap
);
12174 return isl_basic_map_free(bmap
);
12175 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12176 pos1
+= isl_basic_map_offset(bmap
, type1
);
12177 pos2
+= isl_basic_map_offset(bmap
, type2
);
12178 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12179 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12180 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12181 bmap
= isl_basic_map_finalize(bmap
);
12185 isl_space_free(space
);
12186 isl_basic_map_free(bmap
);
12190 /* Add a constraint imposing that the value of the first dimension is
12191 * greater than that of the second.
12193 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12194 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12198 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12200 bmap
= isl_basic_map_intersect(bmap
, gt
);
12205 /* Add a constraint imposing that the value of the first dimension is
12206 * greater than that of the second.
12208 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12209 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12211 isl_basic_map
*bmap
;
12213 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12215 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12220 /* Add a constraint imposing that the value of the first dimension is
12221 * smaller than that of the second.
12223 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12224 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12226 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12229 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12233 isl_local_space
*ls
;
12238 if (!isl_basic_map_divs_known(bmap
))
12239 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12240 "some divs are unknown", return NULL
);
12242 ls
= isl_basic_map_get_local_space(bmap
);
12243 div
= isl_local_space_get_div(ls
, pos
);
12244 isl_local_space_free(ls
);
12249 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12252 return isl_basic_map_get_div(bset
, pos
);
12255 /* Plug in "subs" for dimension "type", "pos" of "bset".
12257 * Let i be the dimension to replace and let "subs" be of the form
12261 * Any integer division with a non-zero coefficient for i,
12263 * floor((a i + g)/m)
12267 * floor((a f + d g)/(m d))
12269 * Constraints of the form
12277 * We currently require that "subs" is an integral expression.
12278 * Handling rational expressions may require us to add stride constraints
12279 * as we do in isl_basic_set_preimage_multi_aff.
12281 __isl_give isl_basic_set
*isl_basic_set_substitute(
12282 __isl_take isl_basic_set
*bset
,
12283 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12289 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12292 bset
= isl_basic_set_cow(bset
);
12293 if (!bset
|| !subs
)
12296 ctx
= isl_basic_set_get_ctx(bset
);
12297 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12298 isl_die(ctx
, isl_error_invalid
,
12299 "spaces don't match", goto error
);
12300 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12301 isl_die(ctx
, isl_error_unsupported
,
12302 "cannot handle divs yet", goto error
);
12303 if (!isl_int_is_one(subs
->v
->el
[0]))
12304 isl_die(ctx
, isl_error_invalid
,
12305 "can only substitute integer expressions", goto error
);
12307 pos
+= isl_basic_set_offset(bset
, type
);
12311 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12312 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12314 isl_int_set(v
, bset
->eq
[i
][pos
]);
12315 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12316 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12317 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12320 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12321 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12323 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12324 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12325 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12326 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12329 for (i
= 0; i
< bset
->n_div
; ++i
) {
12330 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12332 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12333 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12334 isl_seq_combine(bset
->div
[i
] + 1,
12335 subs
->v
->el
[0], bset
->div
[i
] + 1,
12336 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12337 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12342 bset
= isl_basic_set_simplify(bset
);
12343 return isl_basic_set_finalize(bset
);
12345 isl_basic_set_free(bset
);
12349 /* Plug in "subs" for dimension "type", "pos" of "set".
12351 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12352 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12356 if (set
&& isl_set_plain_is_empty(set
))
12359 set
= isl_set_cow(set
);
12363 for (i
= set
->n
- 1; i
>= 0; --i
) {
12364 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12365 if (remove_if_empty(set
, i
) < 0)
12375 /* Check if the range of "ma" is compatible with the domain or range
12376 * (depending on "type") of "bmap".
12377 * Return -1 if anything is wrong.
12379 static int check_basic_map_compatible_range_multi_aff(
12380 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12381 __isl_keep isl_multi_aff
*ma
)
12384 isl_space
*ma_space
;
12386 ma_space
= isl_multi_aff_get_space(ma
);
12388 m
= isl_space_match(bmap
->dim
, isl_dim_param
, ma_space
, isl_dim_param
);
12392 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12393 "parameters don't match", goto error
);
12394 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12398 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12399 "spaces don't match", goto error
);
12401 isl_space_free(ma_space
);
12404 isl_space_free(ma_space
);
12408 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12409 * coefficients before the transformed range of dimensions,
12410 * the "n_after" coefficients after the transformed range of dimensions
12411 * and the coefficients of the other divs in "bmap".
12413 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12414 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12419 isl_local_space
*ls
;
12424 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12428 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12429 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12430 for (i
= 0; i
< n_div
; ++i
) {
12431 int o_bmap
= 0, o_ls
= 0;
12433 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12434 o_bmap
+= 1 + 1 + n_param
;
12435 o_ls
+= 1 + 1 + n_param
;
12436 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12437 o_bmap
+= n_before
;
12438 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12439 ls
->div
->row
[i
] + o_ls
, n_set
);
12442 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12444 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12445 ls
->div
->row
[i
] + o_ls
, n_div
);
12448 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12449 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
12453 isl_local_space_free(ls
);
12456 isl_local_space_free(ls
);
12460 /* How many stride constraints does "ma" enforce?
12461 * That is, how many of the affine expressions have a denominator
12462 * different from one?
12464 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12469 for (i
= 0; i
< ma
->n
; ++i
)
12470 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12476 /* For each affine expression in ma of the form
12478 * x_i = (f_i y + h_i)/m_i
12480 * with m_i different from one, add a constraint to "bmap"
12483 * f_i y + h_i = m_i alpha_i
12485 * with alpha_i an additional existentially quantified variable.
12487 * The input variables of "ma" correspond to a subset of the variables
12488 * of "bmap". There are "n_before" variables in "bmap" before this
12489 * subset and "n_after" variables after this subset.
12490 * The integer divisions of the affine expressions in "ma" are assumed
12491 * to have been aligned. There are "n_div_ma" of them and
12492 * they appear first in "bmap", straight after the "n_after" variables.
12494 static __isl_give isl_basic_map
*add_ma_strides(
12495 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12496 int n_before
, int n_after
, int n_div_ma
)
12504 total
= isl_basic_map_total_dim(bmap
);
12505 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12506 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12507 for (i
= 0; i
< ma
->n
; ++i
) {
12508 int o_bmap
= 0, o_ma
= 1;
12510 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12512 div
= isl_basic_map_alloc_div(bmap
);
12513 k
= isl_basic_map_alloc_equality(bmap
);
12514 if (div
< 0 || k
< 0)
12516 isl_int_set_si(bmap
->div
[div
][0], 0);
12517 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12518 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12519 o_bmap
+= 1 + n_param
;
12520 o_ma
+= 1 + n_param
;
12521 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12522 o_bmap
+= n_before
;
12523 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12524 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12527 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12529 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12530 ma
->p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12531 o_bmap
+= n_div_ma
;
12533 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12534 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12540 isl_basic_map_free(bmap
);
12544 /* Replace the domain or range space (depending on "type) of "space" by "set".
12546 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12547 enum isl_dim_type type
, __isl_take isl_space
*set
)
12549 if (type
== isl_dim_in
) {
12550 space
= isl_space_range(space
);
12551 space
= isl_space_map_from_domain_and_range(set
, space
);
12553 space
= isl_space_domain(space
);
12554 space
= isl_space_map_from_domain_and_range(space
, set
);
12560 /* Compute the preimage of the domain or range (depending on "type")
12561 * of "bmap" under the function represented by "ma".
12562 * In other words, plug in "ma" in the domain or range of "bmap".
12563 * The result is a basic map that lives in the same space as "bmap"
12564 * except that the domain or range has been replaced by
12565 * the domain space of "ma".
12567 * If bmap is represented by
12569 * A(p) + S u + B x + T v + C(divs) >= 0,
12571 * where u and x are input and output dimensions if type == isl_dim_out
12572 * while x and v are input and output dimensions if type == isl_dim_in,
12573 * and ma is represented by
12575 * x = D(p) + F(y) + G(divs')
12577 * then the result is
12579 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12581 * The divs in the input set are similarly adjusted.
12584 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12588 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12589 * B_i G(divs') + c_i(divs))/n_i)
12591 * If bmap is not a rational map and if F(y) involves any denominators
12593 * x_i = (f_i y + h_i)/m_i
12595 * then additional constraints are added to ensure that we only
12596 * map back integer points. That is we enforce
12598 * f_i y + h_i = m_i alpha_i
12600 * with alpha_i an additional existentially quantified variable.
12602 * We first copy over the divs from "ma".
12603 * Then we add the modified constraints and divs from "bmap".
12604 * Finally, we add the stride constraints, if needed.
12606 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12607 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12608 __isl_take isl_multi_aff
*ma
)
12612 isl_basic_map
*res
= NULL
;
12613 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12614 isl_int f
, c1
, c2
, g
;
12615 int rational
, strides
;
12622 ma
= isl_multi_aff_align_divs(ma
);
12625 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12628 if (type
== isl_dim_in
) {
12630 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12632 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12635 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12636 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12638 space
= isl_multi_aff_get_domain_space(ma
);
12639 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12640 rational
= isl_basic_map_is_rational(bmap
);
12641 strides
= rational
? 0 : multi_aff_strides(ma
);
12642 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12643 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12645 res
= isl_basic_map_set_rational(res
);
12647 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12648 if (isl_basic_map_alloc_div(res
) < 0)
12651 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12654 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12655 k
= isl_basic_map_alloc_equality(res
);
12658 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12659 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12662 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12663 k
= isl_basic_map_alloc_inequality(res
);
12666 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12667 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12670 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12671 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12672 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12675 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12676 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12681 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
12687 isl_basic_map_free(bmap
);
12688 isl_multi_aff_free(ma
);
12689 res
= isl_basic_set_simplify(res
);
12690 return isl_basic_map_finalize(res
);
12696 isl_basic_map_free(bmap
);
12697 isl_multi_aff_free(ma
);
12698 isl_basic_map_free(res
);
12702 /* Compute the preimage of "bset" under the function represented by "ma".
12703 * In other words, plug in "ma" in "bset". The result is a basic set
12704 * that lives in the domain space of "ma".
12706 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12707 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12709 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12712 /* Compute the preimage of the domain of "bmap" under the function
12713 * represented by "ma".
12714 * In other words, plug in "ma" in the domain of "bmap".
12715 * The result is a basic map that lives in the same space as "bmap"
12716 * except that the domain has been replaced by the domain space of "ma".
12718 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12719 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12721 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12724 /* Compute the preimage of the range of "bmap" under the function
12725 * represented by "ma".
12726 * In other words, plug in "ma" in the range of "bmap".
12727 * The result is a basic map that lives in the same space as "bmap"
12728 * except that the range has been replaced by the domain space of "ma".
12730 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12731 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12733 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12736 /* Check if the range of "ma" is compatible with the domain or range
12737 * (depending on "type") of "map".
12738 * Return -1 if anything is wrong.
12740 static int check_map_compatible_range_multi_aff(
12741 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12742 __isl_keep isl_multi_aff
*ma
)
12745 isl_space
*ma_space
;
12747 ma_space
= isl_multi_aff_get_space(ma
);
12748 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12749 isl_space_free(ma_space
);
12751 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12752 "spaces don't match", return -1);
12756 /* Compute the preimage of the domain or range (depending on "type")
12757 * of "map" under the function represented by "ma".
12758 * In other words, plug in "ma" in the domain or range of "map".
12759 * The result is a map that lives in the same space as "map"
12760 * except that the domain or range has been replaced by
12761 * the domain space of "ma".
12763 * The parameters are assumed to have been aligned.
12765 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
12766 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12771 map
= isl_map_cow(map
);
12772 ma
= isl_multi_aff_align_divs(ma
);
12775 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
12778 for (i
= 0; i
< map
->n
; ++i
) {
12779 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
12780 isl_multi_aff_copy(ma
));
12785 space
= isl_multi_aff_get_domain_space(ma
);
12786 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
12788 isl_space_free(map
->dim
);
12793 isl_multi_aff_free(ma
);
12795 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
12796 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
12799 isl_multi_aff_free(ma
);
12804 /* Compute the preimage of the domain or range (depending on "type")
12805 * of "map" under the function represented by "ma".
12806 * In other words, plug in "ma" in the domain or range of "map".
12807 * The result is a map that lives in the same space as "map"
12808 * except that the domain or range has been replaced by
12809 * the domain space of "ma".
12811 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
12812 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12817 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
12818 return map_preimage_multi_aff(map
, type
, ma
);
12820 if (!isl_space_has_named_params(map
->dim
) ||
12821 !isl_space_has_named_params(ma
->space
))
12822 isl_die(map
->ctx
, isl_error_invalid
,
12823 "unaligned unnamed parameters", goto error
);
12824 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
12825 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
12827 return map_preimage_multi_aff(map
, type
, ma
);
12829 isl_multi_aff_free(ma
);
12830 return isl_map_free(map
);
12833 /* Compute the preimage of "set" under the function represented by "ma".
12834 * In other words, plug in "ma" in "set". The result is a set
12835 * that lives in the domain space of "ma".
12837 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
12838 __isl_take isl_multi_aff
*ma
)
12840 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
12843 /* Compute the preimage of the domain of "map" under the function
12844 * represented by "ma".
12845 * In other words, plug in "ma" in the domain of "map".
12846 * The result is a map that lives in the same space as "map"
12847 * except that the domain has been replaced by the domain space of "ma".
12849 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12850 __isl_take isl_multi_aff
*ma
)
12852 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12855 /* Compute the preimage of the range of "map" under the function
12856 * represented by "ma".
12857 * In other words, plug in "ma" in the range of "map".
12858 * The result is a map that lives in the same space as "map"
12859 * except that the range has been replaced by the domain space of "ma".
12861 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
12862 __isl_take isl_multi_aff
*ma
)
12864 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
12867 /* Compute the preimage of "map" under the function represented by "pma".
12868 * In other words, plug in "pma" in the domain or range of "map".
12869 * The result is a map that lives in the same space as "map",
12870 * except that the space of type "type" has been replaced by
12871 * the domain space of "pma".
12873 * The parameters of "map" and "pma" are assumed to have been aligned.
12875 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
12876 __isl_take isl_map
*map
, enum isl_dim_type type
,
12877 __isl_take isl_pw_multi_aff
*pma
)
12886 isl_pw_multi_aff_free(pma
);
12887 res
= isl_map_empty(isl_map_get_space(map
));
12892 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12893 isl_multi_aff_copy(pma
->p
[0].maff
));
12894 if (type
== isl_dim_in
)
12895 res
= isl_map_intersect_domain(res
,
12896 isl_map_copy(pma
->p
[0].set
));
12898 res
= isl_map_intersect_range(res
,
12899 isl_map_copy(pma
->p
[0].set
));
12901 for (i
= 1; i
< pma
->n
; ++i
) {
12904 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12905 isl_multi_aff_copy(pma
->p
[i
].maff
));
12906 if (type
== isl_dim_in
)
12907 res_i
= isl_map_intersect_domain(res_i
,
12908 isl_map_copy(pma
->p
[i
].set
));
12910 res_i
= isl_map_intersect_range(res_i
,
12911 isl_map_copy(pma
->p
[i
].set
));
12912 res
= isl_map_union(res
, res_i
);
12915 isl_pw_multi_aff_free(pma
);
12919 isl_pw_multi_aff_free(pma
);
12924 /* Compute the preimage of "map" under the function represented by "pma".
12925 * In other words, plug in "pma" in the domain or range of "map".
12926 * The result is a map that lives in the same space as "map",
12927 * except that the space of type "type" has been replaced by
12928 * the domain space of "pma".
12930 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
12931 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
12936 if (isl_space_match(map
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
12937 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12939 if (!isl_space_has_named_params(map
->dim
) ||
12940 !isl_space_has_named_params(pma
->dim
))
12941 isl_die(map
->ctx
, isl_error_invalid
,
12942 "unaligned unnamed parameters", goto error
);
12943 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
12944 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
12946 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12948 isl_pw_multi_aff_free(pma
);
12949 return isl_map_free(map
);
12952 /* Compute the preimage of "set" under the function represented by "pma".
12953 * In other words, plug in "pma" in "set". The result is a set
12954 * that lives in the domain space of "pma".
12956 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
12957 __isl_take isl_pw_multi_aff
*pma
)
12959 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
12962 /* Compute the preimage of the domain of "map" under the function
12963 * represented by "pma".
12964 * In other words, plug in "pma" in the domain of "map".
12965 * The result is a map that lives in the same space as "map",
12966 * except that domain space has been replaced by the domain space of "pma".
12968 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
12969 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12971 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
12974 /* Compute the preimage of the range of "map" under the function
12975 * represented by "pma".
12976 * In other words, plug in "pma" in the range of "map".
12977 * The result is a map that lives in the same space as "map",
12978 * except that range space has been replaced by the domain space of "pma".
12980 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
12981 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12983 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
12986 /* Compute the preimage of "map" under the function represented by "mpa".
12987 * In other words, plug in "mpa" in the domain or range of "map".
12988 * The result is a map that lives in the same space as "map",
12989 * except that the space of type "type" has been replaced by
12990 * the domain space of "mpa".
12992 * If the map does not involve any constraints that refer to the
12993 * dimensions of the substituted space, then the only possible
12994 * effect of "mpa" on the map is to map the space to a different space.
12995 * We create a separate isl_multi_aff to effectuate this change
12996 * in order to avoid spurious splitting of the map along the pieces
12999 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13000 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13003 isl_pw_multi_aff
*pma
;
13008 n
= isl_map_dim(map
, type
);
13009 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
13013 space
= isl_multi_pw_aff_get_space(mpa
);
13014 isl_multi_pw_aff_free(mpa
);
13015 ma
= isl_multi_aff_zero(space
);
13016 return isl_map_preimage_multi_aff(map
, type
, ma
);
13019 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13020 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13023 isl_multi_pw_aff_free(mpa
);
13027 /* Compute the preimage of "map" under the function represented by "mpa".
13028 * In other words, plug in "mpa" in the domain "map".
13029 * The result is a map that lives in the same space as "map",
13030 * except that domain space has been replaced by the domain space of "mpa".
13032 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13033 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13035 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13038 /* Compute the preimage of "set" by the function represented by "mpa".
13039 * In other words, plug in "mpa" in "set".
13041 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13042 __isl_take isl_multi_pw_aff
*mpa
)
13044 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);