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_space_private.h"
23 #include "isl_equalities.h"
24 #include <isl_lp_private.h>
28 #include <isl_reordering.h>
29 #include "isl_sample.h"
33 #include <isl_mat_private.h>
34 #include <isl_vec_private.h>
35 #include <isl_dim_map.h>
36 #include <isl_local_space_private.h>
37 #include <isl_aff_private.h>
38 #include <isl_options_private.h>
39 #include <isl_morph.h>
40 #include <isl_val_private.h>
41 #include <isl/deprecated/map_int.h>
42 #include <isl/deprecated/set_int.h>
44 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
47 case isl_dim_param
: return dim
->nparam
;
48 case isl_dim_in
: return dim
->n_in
;
49 case isl_dim_out
: return dim
->n_out
;
50 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
55 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
58 case isl_dim_param
: return 1;
59 case isl_dim_in
: return 1 + dim
->nparam
;
60 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
65 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
66 enum isl_dim_type type
)
71 case isl_dim_cst
: return 1;
74 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
75 case isl_dim_div
: return bmap
->n_div
;
76 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
81 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
83 return map
? n(map
->dim
, type
) : 0;
86 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
88 return set
? n(set
->dim
, type
) : 0;
91 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
92 enum isl_dim_type type
)
94 isl_space
*dim
= bmap
->dim
;
96 case isl_dim_cst
: return 0;
97 case isl_dim_param
: return 1;
98 case isl_dim_in
: return 1 + dim
->nparam
;
99 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
100 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
105 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
106 enum isl_dim_type type
)
108 return isl_basic_map_offset(bset
, type
);
111 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
113 return pos(map
->dim
, type
);
116 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
117 enum isl_dim_type type
)
119 return isl_basic_map_dim(bset
, type
);
122 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
124 return isl_basic_set_dim(bset
, isl_dim_set
);
127 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
129 return isl_basic_set_dim(bset
, isl_dim_param
);
132 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
136 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
139 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
141 return isl_set_dim(set
, isl_dim_set
);
144 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
146 return isl_set_dim(set
, isl_dim_param
);
149 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
151 return bmap
? bmap
->dim
->n_in
: 0;
154 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
156 return bmap
? bmap
->dim
->n_out
: 0;
159 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
161 return bmap
? bmap
->dim
->nparam
: 0;
164 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
166 return bmap
? bmap
->n_div
: 0;
169 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
171 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
174 unsigned isl_map_n_in(const struct isl_map
*map
)
176 return map
? map
->dim
->n_in
: 0;
179 unsigned isl_map_n_out(const struct isl_map
*map
)
181 return map
? map
->dim
->n_out
: 0;
184 unsigned isl_map_n_param(const struct isl_map
*map
)
186 return map
? map
->dim
->nparam
: 0;
189 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
194 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
197 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
198 set
->dim
, isl_dim_set
);
201 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
202 struct isl_basic_set
*bset
)
207 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
210 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
211 bset
->dim
, isl_dim_set
);
214 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
219 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
222 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
223 set
->dim
, isl_dim_set
);
226 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
227 struct isl_basic_set
*bset
)
232 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
235 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
236 bset
->dim
, isl_dim_set
);
239 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
241 return bmap
? bmap
->ctx
: NULL
;
244 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
246 return bset
? bset
->ctx
: NULL
;
249 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
251 return map
? map
->ctx
: NULL
;
254 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
256 return set
? set
->ctx
: NULL
;
259 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
263 return isl_space_copy(bmap
->dim
);
266 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
270 return isl_space_copy(bset
->dim
);
273 /* Extract the divs in "bmap" as a matrix.
275 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
286 ctx
= isl_basic_map_get_ctx(bmap
);
287 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
288 cols
= 1 + 1 + total
+ bmap
->n_div
;
289 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
293 for (i
= 0; i
< bmap
->n_div
; ++i
)
294 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
299 /* Extract the divs in "bset" as a matrix.
301 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
303 return isl_basic_map_get_divs(bset
);
306 __isl_give isl_local_space
*isl_basic_map_get_local_space(
307 __isl_keep isl_basic_map
*bmap
)
314 div
= isl_basic_map_get_divs(bmap
);
315 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
318 __isl_give isl_local_space
*isl_basic_set_get_local_space(
319 __isl_keep isl_basic_set
*bset
)
321 return isl_basic_map_get_local_space(bset
);
324 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
325 __isl_take isl_local_space
*ls
)
334 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
335 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
336 n_div
, 0, 2 * n_div
);
338 for (i
= 0; i
< n_div
; ++i
)
339 if (isl_basic_map_alloc_div(bmap
) < 0)
342 for (i
= 0; i
< n_div
; ++i
) {
343 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
344 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
348 isl_local_space_free(ls
);
351 isl_local_space_free(ls
);
352 isl_basic_map_free(bmap
);
356 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
357 __isl_take isl_local_space
*ls
)
359 return isl_basic_map_from_local_space(ls
);
362 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
366 return isl_space_copy(map
->dim
);
369 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
373 return isl_space_copy(set
->dim
);
376 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
377 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
379 bmap
= isl_basic_map_cow(bmap
);
382 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
385 bmap
= isl_basic_map_finalize(bmap
);
388 isl_basic_map_free(bmap
);
392 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
393 __isl_take isl_basic_set
*bset
, const char *s
)
395 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
398 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
399 enum isl_dim_type type
)
401 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
404 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
405 enum isl_dim_type type
, const char *s
)
409 map
= isl_map_cow(map
);
413 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
417 for (i
= 0; i
< map
->n
; ++i
) {
418 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
429 /* Replace the identifier of the tuple of type "type" by "id".
431 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
432 __isl_take isl_basic_map
*bmap
,
433 enum isl_dim_type type
, __isl_take isl_id
*id
)
435 bmap
= isl_basic_map_cow(bmap
);
438 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
440 return isl_basic_map_free(bmap
);
441 bmap
= isl_basic_map_finalize(bmap
);
448 /* Replace the identifier of the tuple by "id".
450 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
451 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
453 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
456 /* Does the input or output tuple have a name?
458 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
460 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
463 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
464 enum isl_dim_type type
)
466 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
469 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
472 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
475 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
476 enum isl_dim_type type
, __isl_take isl_id
*id
)
478 map
= isl_map_cow(map
);
482 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
484 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
490 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
491 __isl_take isl_id
*id
)
493 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
496 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
497 enum isl_dim_type type
)
499 map
= isl_map_cow(map
);
503 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
505 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
508 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
510 return isl_map_reset_tuple_id(set
, isl_dim_set
);
513 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
515 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
518 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
519 enum isl_dim_type type
)
521 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
524 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
526 return isl_map_has_tuple_id(set
, isl_dim_set
);
529 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
531 return isl_map_get_tuple_id(set
, isl_dim_set
);
534 /* Does the set tuple have a name?
536 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
538 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
542 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
544 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
547 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
549 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
552 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
553 enum isl_dim_type type
, unsigned pos
)
555 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
558 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
559 enum isl_dim_type type
, unsigned pos
)
561 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
564 /* Does the given dimension have a name?
566 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
567 enum isl_dim_type type
, unsigned pos
)
569 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
572 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
573 enum isl_dim_type type
, unsigned pos
)
575 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
578 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
579 enum isl_dim_type type
, unsigned pos
)
581 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
584 /* Does the given dimension have a name?
586 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
587 enum isl_dim_type type
, unsigned pos
)
589 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
592 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
593 __isl_take isl_basic_map
*bmap
,
594 enum isl_dim_type type
, unsigned pos
, const char *s
)
596 bmap
= isl_basic_map_cow(bmap
);
599 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
602 return isl_basic_map_finalize(bmap
);
604 isl_basic_map_free(bmap
);
608 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
609 enum isl_dim_type type
, unsigned pos
, const char *s
)
613 map
= isl_map_cow(map
);
617 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
621 for (i
= 0; i
< map
->n
; ++i
) {
622 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
633 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
634 __isl_take isl_basic_set
*bset
,
635 enum isl_dim_type type
, unsigned pos
, const char *s
)
637 return (isl_basic_set
*)isl_basic_map_set_dim_name(
638 (isl_basic_map
*)bset
, type
, pos
, s
);
641 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
642 enum isl_dim_type type
, unsigned pos
, const char *s
)
644 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
647 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
648 enum isl_dim_type type
, unsigned pos
)
650 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
653 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
654 enum isl_dim_type type
, unsigned pos
)
656 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
659 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
660 enum isl_dim_type type
, unsigned pos
)
662 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
665 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
666 enum isl_dim_type type
, unsigned pos
)
668 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
671 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
672 enum isl_dim_type type
, unsigned pos
)
674 return isl_map_has_dim_id(set
, type
, pos
);
677 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
678 enum isl_dim_type type
, unsigned pos
)
680 return isl_map_get_dim_id(set
, type
, pos
);
683 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
684 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
686 map
= isl_map_cow(map
);
690 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
692 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
698 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
699 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
701 return isl_map_set_dim_id(set
, type
, pos
, id
);
704 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
705 __isl_keep isl_id
*id
)
709 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
712 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
713 __isl_keep isl_id
*id
)
715 return isl_map_find_dim_by_id(set
, type
, id
);
718 /* Return the position of the dimension of the given type and name
720 * Return -1 if no such dimension can be found.
722 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
723 enum isl_dim_type type
, const char *name
)
727 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
730 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
735 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
738 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
741 return isl_map_find_dim_by_name(set
, type
, name
);
744 /* Reset the user pointer on all identifiers of parameters and tuples
745 * of the space of "map".
747 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
751 space
= isl_map_get_space(map
);
752 space
= isl_space_reset_user(space
);
753 map
= isl_map_reset_space(map
, space
);
758 /* Reset the user pointer on all identifiers of parameters and tuples
759 * of the space of "set".
761 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
763 return isl_map_reset_user(set
);
766 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
770 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
773 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
775 return isl_basic_map_is_rational(bset
);
778 /* Does "bmap" contain any rational points?
780 * If "bmap" has an equality for each dimension, equating the dimension
781 * to an integer constant, then it has no rational points, even if it
782 * is marked as rational.
784 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
786 int has_rational
= 1;
791 if (isl_basic_map_plain_is_empty(bmap
))
793 if (!isl_basic_map_is_rational(bmap
))
795 bmap
= isl_basic_map_copy(bmap
);
796 bmap
= isl_basic_map_implicit_equalities(bmap
);
799 total
= isl_basic_map_total_dim(bmap
);
800 if (bmap
->n_eq
== total
) {
802 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
803 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
806 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
807 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
809 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
817 isl_basic_map_free(bmap
);
822 /* Does "map" contain any rational points?
824 int isl_map_has_rational(__isl_keep isl_map
*map
)
831 for (i
= 0; i
< map
->n
; ++i
) {
832 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
833 if (has_rational
< 0)
841 /* Does "set" contain any rational points?
843 int isl_set_has_rational(__isl_keep isl_set
*set
)
845 return isl_map_has_rational(set
);
848 /* Is this basic set a parameter domain?
850 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
854 return isl_space_is_params(bset
->dim
);
857 /* Is this set a parameter domain?
859 int isl_set_is_params(__isl_keep isl_set
*set
)
863 return isl_space_is_params(set
->dim
);
866 /* Is this map actually a parameter domain?
867 * Users should never call this function. Outside of isl,
868 * a map can never be a parameter domain.
870 int isl_map_is_params(__isl_keep isl_map
*map
)
874 return isl_space_is_params(map
->dim
);
877 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
878 struct isl_basic_map
*bmap
, unsigned extra
,
879 unsigned n_eq
, unsigned n_ineq
)
882 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
887 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
888 if (isl_blk_is_error(bmap
->block
))
891 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
892 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
896 bmap
->block2
= isl_blk_empty();
899 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
900 if (isl_blk_is_error(bmap
->block2
))
903 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
908 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
909 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
911 for (i
= 0; i
< extra
; ++i
)
912 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
916 bmap
->c_size
= n_eq
+ n_ineq
;
917 bmap
->eq
= bmap
->ineq
+ n_ineq
;
926 isl_basic_map_free(bmap
);
930 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
931 unsigned nparam
, unsigned dim
, unsigned extra
,
932 unsigned n_eq
, unsigned n_ineq
)
934 struct isl_basic_map
*bmap
;
937 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
941 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
942 return (struct isl_basic_set
*)bmap
;
945 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
946 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
948 struct isl_basic_map
*bmap
;
951 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
952 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
953 return (struct isl_basic_set
*)bmap
;
959 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
960 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
962 struct isl_basic_map
*bmap
;
966 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
971 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
977 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
978 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
979 unsigned n_eq
, unsigned n_ineq
)
981 struct isl_basic_map
*bmap
;
984 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
988 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
992 static void dup_constraints(
993 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
996 unsigned total
= isl_basic_map_total_dim(src
);
998 for (i
= 0; i
< src
->n_eq
; ++i
) {
999 int j
= isl_basic_map_alloc_equality(dst
);
1000 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1003 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1004 int j
= isl_basic_map_alloc_inequality(dst
);
1005 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1008 for (i
= 0; i
< src
->n_div
; ++i
) {
1009 int j
= isl_basic_map_alloc_div(dst
);
1010 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1012 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1015 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
1017 struct isl_basic_map
*dup
;
1021 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1022 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1025 dup_constraints(dup
, bmap
);
1026 dup
->flags
= bmap
->flags
;
1027 dup
->sample
= isl_vec_copy(bmap
->sample
);
1031 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1033 struct isl_basic_map
*dup
;
1035 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
1036 return (struct isl_basic_set
*)dup
;
1039 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
1044 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1048 return isl_basic_set_dup(bset
);
1051 struct isl_set
*isl_set_copy(struct isl_set
*set
)
1060 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
1065 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1069 bmap
= isl_basic_map_dup(bmap
);
1071 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1075 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1084 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1089 if (--bmap
->ref
> 0)
1092 isl_ctx_deref(bmap
->ctx
);
1094 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1096 isl_blk_free(bmap
->ctx
, bmap
->block
);
1097 isl_vec_free(bmap
->sample
);
1098 isl_space_free(bmap
->dim
);
1104 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1106 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1109 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1111 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1114 __isl_give isl_map
*isl_map_align_params_map_map_and(
1115 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1116 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1117 __isl_take isl_map
*map2
))
1121 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1122 return fn(map1
, map2
);
1123 if (!isl_space_has_named_params(map1
->dim
) ||
1124 !isl_space_has_named_params(map2
->dim
))
1125 isl_die(map1
->ctx
, isl_error_invalid
,
1126 "unaligned unnamed parameters", goto error
);
1127 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1128 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1129 return fn(map1
, map2
);
1136 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1137 __isl_keep isl_map
*map2
,
1138 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1144 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1145 return fn(map1
, map2
);
1146 if (!isl_space_has_named_params(map1
->dim
) ||
1147 !isl_space_has_named_params(map2
->dim
))
1148 isl_die(map1
->ctx
, isl_error_invalid
,
1149 "unaligned unnamed parameters", return -1);
1150 map1
= isl_map_copy(map1
);
1151 map2
= isl_map_copy(map2
);
1152 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1153 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1160 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1162 struct isl_ctx
*ctx
;
1166 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1167 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1169 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1170 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1171 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1172 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1173 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1174 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1176 int j
= isl_basic_map_alloc_inequality(bmap
);
1180 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1181 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1188 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1189 bmap
->extra
- bmap
->n_div
);
1190 return bmap
->n_eq
++;
1193 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1195 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1198 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1202 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1207 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1209 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1212 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1217 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1219 if (pos
!= bmap
->n_eq
- 1) {
1221 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1222 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1228 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1230 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1233 /* Turn inequality "pos" of "bmap" into an equality.
1235 * In particular, we move the inequality in front of the equalities
1236 * and move the last inequality in the position of the moved inequality.
1237 * Note that isl_tab_make_equalities_explicit depends on this particular
1238 * change in the ordering of the constraints.
1240 void isl_basic_map_inequality_to_equality(
1241 struct isl_basic_map
*bmap
, unsigned pos
)
1245 t
= bmap
->ineq
[pos
];
1246 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1247 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1252 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1253 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1254 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1255 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1258 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1260 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1263 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1265 struct isl_ctx
*ctx
;
1269 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1270 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1271 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1272 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1273 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1274 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1275 1 + isl_basic_map_total_dim(bmap
),
1276 bmap
->extra
- bmap
->n_div
);
1277 return bmap
->n_ineq
++;
1280 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1282 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1285 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1289 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1294 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1296 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1299 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1304 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1306 if (pos
!= bmap
->n_ineq
- 1) {
1307 t
= bmap
->ineq
[pos
];
1308 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1309 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1310 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1316 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1318 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1321 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1326 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1329 k
= isl_basic_map_alloc_equality(bmap
);
1332 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1335 isl_basic_map_free(bmap
);
1339 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1342 return (isl_basic_set
*)
1343 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1346 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1351 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1354 k
= isl_basic_map_alloc_inequality(bmap
);
1357 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1360 isl_basic_map_free(bmap
);
1364 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1367 return (isl_basic_set
*)
1368 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1371 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1375 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1376 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1377 1 + 1 + isl_basic_map_total_dim(bmap
),
1378 bmap
->extra
- bmap
->n_div
);
1379 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1380 return bmap
->n_div
++;
1383 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1385 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1388 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1392 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1397 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1399 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1402 /* Copy constraint from src to dst, putting the vars of src at offset
1403 * dim_off in dst and the divs of src at offset div_off in dst.
1404 * If both sets are actually map, then dim_off applies to the input
1407 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1408 struct isl_basic_map
*src_map
, isl_int
*src
,
1409 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1411 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1412 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1413 unsigned src_in
= isl_basic_map_n_in(src_map
);
1414 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1415 unsigned src_out
= isl_basic_map_n_out(src_map
);
1416 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1417 isl_int_set(dst
[0], src
[0]);
1418 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1419 if (dst_nparam
> src_nparam
)
1420 isl_seq_clr(dst
+1+src_nparam
,
1421 dst_nparam
- src_nparam
);
1422 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1423 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1425 isl_min(dst_in
-in_off
, src_in
));
1426 if (dst_in
-in_off
> src_in
)
1427 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1428 dst_in
- in_off
- src_in
);
1429 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1430 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1431 src
+1+src_nparam
+src_in
,
1432 isl_min(dst_out
-out_off
, src_out
));
1433 if (dst_out
-out_off
> src_out
)
1434 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1435 dst_out
- out_off
- src_out
);
1436 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1437 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1438 src
+1+src_nparam
+src_in
+src_out
,
1439 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1440 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1441 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1442 div_off
+src_map
->n_div
,
1443 dst_map
->n_div
- div_off
- src_map
->n_div
);
1446 static void copy_div(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 isl_int_set(dst
[0], src
[0]);
1451 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1454 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1455 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1460 if (!bmap1
|| !bmap2
)
1463 div_off
= bmap1
->n_div
;
1465 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1466 int i1
= isl_basic_map_alloc_equality(bmap1
);
1469 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1470 i_pos
, o_pos
, div_off
);
1473 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1474 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1477 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1478 i_pos
, o_pos
, div_off
);
1481 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1482 int i1
= isl_basic_map_alloc_div(bmap1
);
1485 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1486 i_pos
, o_pos
, div_off
);
1489 isl_basic_map_free(bmap2
);
1494 isl_basic_map_free(bmap1
);
1495 isl_basic_map_free(bmap2
);
1499 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1500 struct isl_basic_set
*bset2
, unsigned pos
)
1502 return (struct isl_basic_set
*)
1503 add_constraints((struct isl_basic_map
*)bset1
,
1504 (struct isl_basic_map
*)bset2
, 0, pos
);
1507 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1508 __isl_take isl_space
*dim
, unsigned extra
,
1509 unsigned n_eq
, unsigned n_ineq
)
1511 struct isl_basic_map
*ext
;
1521 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1522 base
->extra
>= base
->n_div
+ extra
;
1524 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1525 room_for_ineq(base
, n_ineq
)) {
1526 isl_space_free(dim
);
1530 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1531 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1532 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1533 extra
+= base
->extra
;
1535 n_ineq
+= base
->n_ineq
;
1537 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1543 ext
->sample
= isl_vec_copy(base
->sample
);
1544 flags
= base
->flags
;
1545 ext
= add_constraints(ext
, base
, 0, 0);
1548 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1554 isl_space_free(dim
);
1555 isl_basic_map_free(base
);
1559 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1560 __isl_take isl_space
*dim
, unsigned extra
,
1561 unsigned n_eq
, unsigned n_ineq
)
1563 return (struct isl_basic_set
*)
1564 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1565 extra
, n_eq
, n_ineq
);
1568 struct isl_basic_map
*isl_basic_map_extend_constraints(
1569 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1573 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1577 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1578 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1579 unsigned n_eq
, unsigned n_ineq
)
1581 struct isl_basic_map
*bmap
;
1586 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1590 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1593 isl_basic_map_free(base
);
1597 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1598 unsigned nparam
, unsigned dim
, unsigned extra
,
1599 unsigned n_eq
, unsigned n_ineq
)
1601 return (struct isl_basic_set
*)
1602 isl_basic_map_extend((struct isl_basic_map
*)base
,
1603 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1606 struct isl_basic_set
*isl_basic_set_extend_constraints(
1607 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1609 return (struct isl_basic_set
*)
1610 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1614 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1616 return (struct isl_basic_set
*)
1617 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1620 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1625 if (bmap
->ref
> 1) {
1627 bmap
= isl_basic_map_dup(bmap
);
1630 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1631 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1636 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1644 return isl_set_dup(set
);
1647 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1655 return isl_map_dup(map
);
1658 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1659 unsigned a_len
, unsigned b_len
)
1661 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1662 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1663 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1666 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1667 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1675 isl_assert(bmap
->ctx
,
1676 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1678 if (n1
== 0 || n2
== 0)
1681 bmap
= isl_basic_map_cow(bmap
);
1685 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1686 if (isl_blk_is_error(blk
))
1689 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1691 bmap
->eq
[i
] + pos
, n1
, n2
);
1693 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1695 bmap
->ineq
[i
] + pos
, n1
, n2
);
1697 for (i
= 0; i
< bmap
->n_div
; ++i
)
1699 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1701 isl_blk_free(bmap
->ctx
, blk
);
1703 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1704 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1705 return isl_basic_map_finalize(bmap
);
1707 isl_basic_map_free(bmap
);
1711 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1712 __isl_take isl_basic_set
*bset
, unsigned n
)
1720 nparam
= isl_basic_set_n_param(bset
);
1721 dim
= isl_basic_set_n_dim(bset
);
1722 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1724 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1726 isl_basic_set_free(bset
);
1730 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1736 total
= isl_basic_map_total_dim(bmap
);
1737 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1738 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1740 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1742 i
= isl_basic_map_alloc_equality(bmap
);
1746 isl_int_set_si(bmap
->eq
[i
][0], 1);
1747 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1748 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1749 isl_vec_free(bmap
->sample
);
1750 bmap
->sample
= NULL
;
1751 return isl_basic_map_finalize(bmap
);
1753 isl_basic_map_free(bmap
);
1757 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1759 return (struct isl_basic_set
*)
1760 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1763 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1766 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1768 isl_int
*t
= bmap
->div
[a
];
1769 bmap
->div
[a
] = bmap
->div
[b
];
1773 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1774 * div definitions accordingly.
1776 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1779 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1781 swap_div(bmap
, a
, b
);
1783 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1784 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1786 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1787 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1789 for (i
= 0; i
< bmap
->n_div
; ++i
)
1790 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1791 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1794 /* Eliminate the specified n dimensions starting at first from the
1795 * constraints, without removing the dimensions from the space.
1796 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1798 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1799 enum isl_dim_type type
, unsigned first
, unsigned n
)
1808 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1809 isl_die(map
->ctx
, isl_error_invalid
,
1810 "index out of bounds", goto error
);
1812 map
= isl_map_cow(map
);
1816 for (i
= 0; i
< map
->n
; ++i
) {
1817 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1827 /* Eliminate the specified n dimensions starting at first from the
1828 * constraints, without removing the dimensions from the space.
1829 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1831 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1832 enum isl_dim_type type
, unsigned first
, unsigned n
)
1834 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1837 /* Eliminate the specified n dimensions starting at first from the
1838 * constraints, without removing the dimensions from the space.
1839 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1841 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1842 unsigned first
, unsigned n
)
1844 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1847 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1848 __isl_take isl_basic_map
*bmap
)
1852 bmap
= isl_basic_map_eliminate_vars(bmap
,
1853 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1857 return isl_basic_map_finalize(bmap
);
1860 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1861 __isl_take isl_basic_set
*bset
)
1863 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1864 (struct isl_basic_map
*)bset
);
1867 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1876 map
= isl_map_cow(map
);
1880 for (i
= 0; i
< map
->n
; ++i
) {
1881 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1891 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1893 return isl_map_remove_divs(set
);
1896 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1897 enum isl_dim_type type
, unsigned first
, unsigned n
)
1901 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1903 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1905 bmap
= isl_basic_map_eliminate_vars(bmap
,
1906 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1909 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1911 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1914 isl_basic_map_free(bmap
);
1918 /* Return true if the definition of the given div (recursively) involves
1919 * any of the given variables.
1921 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1922 unsigned first
, unsigned n
)
1925 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1927 if (isl_int_is_zero(bmap
->div
[div
][0]))
1929 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1932 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1933 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1935 if (div_involves_vars(bmap
, i
, first
, n
))
1942 /* Try and add a lower and/or upper bound on "div" to "bmap"
1943 * based on inequality "i".
1944 * "total" is the total number of variables (excluding the divs).
1945 * "v" is a temporary object that can be used during the calculations.
1946 * If "lb" is set, then a lower bound should be constructed.
1947 * If "ub" is set, then an upper bound should be constructed.
1949 * The calling function has already checked that the inequality does not
1950 * reference "div", but we still need to check that the inequality is
1951 * of the right form. We'll consider the case where we want to construct
1952 * a lower bound. The construction of upper bounds is similar.
1954 * Let "div" be of the form
1956 * q = floor((a + f(x))/d)
1958 * We essentially check if constraint "i" is of the form
1962 * so that we can use it to derive a lower bound on "div".
1963 * However, we allow a slightly more general form
1967 * with the condition that the coefficients of g(x) - f(x) are all
1969 * Rewriting this constraint as
1973 * adding a + f(x) to both sides and dividing by d, we obtain
1975 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1977 * Taking the floor on both sides, we obtain
1979 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1983 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1985 * In the case of an upper bound, we construct the constraint
1987 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1990 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1991 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1992 unsigned total
, isl_int v
, int lb
, int ub
)
1996 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1998 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1999 bmap
->div
[div
][1 + 1 + j
]);
2000 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2003 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2004 bmap
->div
[div
][1 + 1 + j
]);
2005 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2011 bmap
= isl_basic_map_cow(bmap
);
2012 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2014 int k
= isl_basic_map_alloc_inequality(bmap
);
2017 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2018 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2019 bmap
->div
[div
][1 + j
]);
2020 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2021 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2023 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2026 int k
= isl_basic_map_alloc_inequality(bmap
);
2029 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2030 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2031 bmap
->div
[div
][1 + j
]);
2032 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2033 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2035 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2038 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2041 isl_basic_map_free(bmap
);
2045 /* This function is called right before "div" is eliminated from "bmap"
2046 * using Fourier-Motzkin.
2047 * Look through the constraints of "bmap" for constraints on the argument
2048 * of the integer division and use them to construct constraints on the
2049 * integer division itself. These constraints can then be combined
2050 * during the Fourier-Motzkin elimination.
2051 * Note that it is only useful to introduce lower bounds on "div"
2052 * if "bmap" already contains upper bounds on "div" as the newly
2053 * introduce lower bounds can then be combined with the pre-existing
2054 * upper bounds. Similarly for upper bounds.
2055 * We therefore first check if "bmap" contains any lower and/or upper bounds
2058 * It is interesting to note that the introduction of these constraints
2059 * can indeed lead to more accurate results, even when compared to
2060 * deriving constraints on the argument of "div" from constraints on "div".
2061 * Consider, for example, the set
2063 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2065 * The second constraint can be rewritten as
2067 * 2 * [(-i-2j+3)/4] + k >= 0
2069 * from which we can derive
2071 * -i - 2j + 3 >= -2k
2077 * Combined with the first constraint, we obtain
2079 * -3 <= 3 + 2k or k >= -3
2081 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2082 * the first constraint, we obtain
2084 * [(i + 2j)/4] >= [-3/4] = -1
2086 * Combining this constraint with the second constraint, we obtain
2090 static __isl_give isl_basic_map
*insert_bounds_on_div(
2091 __isl_take isl_basic_map
*bmap
, int div
)
2094 int check_lb
, check_ub
;
2101 if (isl_int_is_zero(bmap
->div
[div
][0]))
2104 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2108 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2109 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2116 if (!check_lb
&& !check_ub
)
2121 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2122 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2125 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2126 check_lb
, check_ub
);
2134 /* Remove all divs (recursively) involving any of the given dimensions
2135 * in their definitions.
2137 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2138 __isl_take isl_basic_map
*bmap
,
2139 enum isl_dim_type type
, unsigned first
, unsigned n
)
2145 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2147 first
+= isl_basic_map_offset(bmap
, type
);
2149 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2150 if (!div_involves_vars(bmap
, i
, first
, n
))
2152 bmap
= insert_bounds_on_div(bmap
, i
);
2153 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2161 isl_basic_map_free(bmap
);
2165 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2166 __isl_take isl_basic_set
*bset
,
2167 enum isl_dim_type type
, unsigned first
, unsigned n
)
2169 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2172 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2173 enum isl_dim_type type
, unsigned first
, unsigned n
)
2182 map
= isl_map_cow(map
);
2186 for (i
= 0; i
< map
->n
; ++i
) {
2187 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2198 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2199 enum isl_dim_type type
, unsigned first
, unsigned n
)
2201 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2205 /* Does the desciption of "bmap" depend on the specified dimensions?
2206 * We also check whether the dimensions appear in any of the div definitions.
2207 * In principle there is no need for this check. If the dimensions appear
2208 * in a div definition, they also appear in the defining constraints of that
2211 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2212 enum isl_dim_type type
, unsigned first
, unsigned n
)
2219 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2220 isl_die(bmap
->ctx
, isl_error_invalid
,
2221 "index out of bounds", return -1);
2223 first
+= isl_basic_map_offset(bmap
, type
);
2224 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2225 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2227 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2228 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2230 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2231 if (isl_int_is_zero(bmap
->div
[i
][0]))
2233 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2240 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2241 enum isl_dim_type type
, unsigned first
, unsigned n
)
2248 if (first
+ n
> isl_map_dim(map
, type
))
2249 isl_die(map
->ctx
, isl_error_invalid
,
2250 "index out of bounds", return -1);
2252 for (i
= 0; i
< map
->n
; ++i
) {
2253 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2255 if (involves
< 0 || involves
)
2262 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2263 enum isl_dim_type type
, unsigned first
, unsigned n
)
2265 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2268 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2269 enum isl_dim_type type
, unsigned first
, unsigned n
)
2271 return isl_map_involves_dims(set
, type
, first
, n
);
2274 /* Return true if the definition of the given div is unknown or depends
2277 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2280 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2282 if (isl_int_is_zero(bmap
->div
[div
][0]))
2285 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2286 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2288 if (div_is_unknown(bmap
, i
))
2295 /* Remove all divs that are unknown or defined in terms of unknown divs.
2297 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2298 __isl_take isl_basic_map
*bmap
)
2305 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2306 if (!div_is_unknown(bmap
, i
))
2308 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2317 /* Remove all divs that are unknown or defined in terms of unknown divs.
2319 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2320 __isl_take isl_basic_set
*bset
)
2322 return isl_basic_map_remove_unknown_divs(bset
);
2325 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2334 map
= isl_map_cow(map
);
2338 for (i
= 0; i
< map
->n
; ++i
) {
2339 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2349 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2351 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2354 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2355 __isl_take isl_basic_set
*bset
,
2356 enum isl_dim_type type
, unsigned first
, unsigned n
)
2358 return (isl_basic_set
*)
2359 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2362 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2363 enum isl_dim_type type
, unsigned first
, unsigned n
)
2370 map
= isl_map_cow(map
);
2373 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2375 for (i
= 0; i
< map
->n
; ++i
) {
2376 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2377 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2381 map
= isl_map_drop(map
, type
, first
, n
);
2388 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2389 enum isl_dim_type type
, unsigned first
, unsigned n
)
2391 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2394 /* Project out n inputs starting at first using Fourier-Motzkin */
2395 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2396 unsigned first
, unsigned n
)
2398 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2401 static void dump_term(struct isl_basic_map
*bmap
,
2402 isl_int c
, int pos
, FILE *out
)
2405 unsigned in
= isl_basic_map_n_in(bmap
);
2406 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2407 unsigned nparam
= isl_basic_map_n_param(bmap
);
2409 isl_int_print(out
, c
, 0);
2411 if (!isl_int_is_one(c
))
2412 isl_int_print(out
, c
, 0);
2413 if (pos
< 1 + nparam
) {
2414 name
= isl_space_get_dim_name(bmap
->dim
,
2415 isl_dim_param
, pos
- 1);
2417 fprintf(out
, "%s", name
);
2419 fprintf(out
, "p%d", pos
- 1);
2420 } else if (pos
< 1 + nparam
+ in
)
2421 fprintf(out
, "i%d", pos
- 1 - nparam
);
2422 else if (pos
< 1 + nparam
+ dim
)
2423 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2425 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2429 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2430 int sign
, FILE *out
)
2434 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2438 for (i
= 0, first
= 1; i
< len
; ++i
) {
2439 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2442 fprintf(out
, " + ");
2444 isl_int_abs(v
, c
[i
]);
2445 dump_term(bmap
, v
, i
, out
);
2452 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2453 const char *op
, FILE *out
, int indent
)
2457 fprintf(out
, "%*s", indent
, "");
2459 dump_constraint_sign(bmap
, c
, 1, out
);
2460 fprintf(out
, " %s ", op
);
2461 dump_constraint_sign(bmap
, c
, -1, out
);
2465 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2466 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2468 fprintf(out
, "%*s", indent
, "");
2469 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2474 static void dump_constraints(struct isl_basic_map
*bmap
,
2475 isl_int
**c
, unsigned n
,
2476 const char *op
, FILE *out
, int indent
)
2480 for (i
= 0; i
< n
; ++i
)
2481 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2484 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2488 unsigned total
= isl_basic_map_total_dim(bmap
);
2490 for (j
= 0; j
< 1 + total
; ++j
) {
2491 if (isl_int_is_zero(exp
[j
]))
2493 if (!first
&& isl_int_is_pos(exp
[j
]))
2495 dump_term(bmap
, exp
[j
], j
, out
);
2500 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2504 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2505 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2507 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2508 fprintf(out
, "%*s", indent
, "");
2509 fprintf(out
, "e%d = [(", i
);
2510 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2512 isl_int_print(out
, bmap
->div
[i
][0], 0);
2513 fprintf(out
, "]\n");
2517 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2518 FILE *out
, int indent
)
2521 fprintf(out
, "null basic set\n");
2525 fprintf(out
, "%*s", indent
, "");
2526 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2527 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2528 bset
->extra
, bset
->flags
);
2529 dump((struct isl_basic_map
*)bset
, out
, indent
);
2532 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2533 FILE *out
, int indent
)
2536 fprintf(out
, "null basic map\n");
2540 fprintf(out
, "%*s", indent
, "");
2541 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2542 "flags: %x, n_name: %d\n",
2544 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2545 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2546 dump(bmap
, out
, indent
);
2549 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2554 total
= isl_basic_map_total_dim(bmap
);
2555 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2556 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2557 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2558 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2562 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2565 struct isl_set
*set
;
2569 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2570 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2571 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2572 sizeof(struct isl_set
) +
2573 (n
- 1) * sizeof(struct isl_basic_set
*));
2577 set
->ctx
= dim
->ctx
;
2578 isl_ctx_ref(set
->ctx
);
2586 isl_space_free(dim
);
2590 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2591 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2593 struct isl_set
*set
;
2596 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2600 set
= isl_set_alloc_space(dims
, n
, flags
);
2604 /* Make sure "map" has room for at least "n" more basic maps.
2606 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2609 struct isl_map
*grown
= NULL
;
2613 isl_assert(map
->ctx
, n
>= 0, goto error
);
2614 if (map
->n
+ n
<= map
->size
)
2616 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2619 for (i
= 0; i
< map
->n
; ++i
) {
2620 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2628 isl_map_free(grown
);
2633 /* Make sure "set" has room for at least "n" more basic sets.
2635 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2637 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2640 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2643 struct isl_set
*dup
;
2648 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2651 for (i
= 0; i
< set
->n
; ++i
)
2652 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2656 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2658 return isl_map_from_basic_map(bset
);
2661 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2663 struct isl_map
*map
;
2668 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2669 return isl_map_add_basic_map(map
, bmap
);
2672 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2673 __isl_take isl_basic_set
*bset
)
2675 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2676 (struct isl_basic_map
*)bset
);
2679 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
2689 isl_ctx_deref(set
->ctx
);
2690 for (i
= 0; i
< set
->n
; ++i
)
2691 isl_basic_set_free(set
->p
[i
]);
2692 isl_space_free(set
->dim
);
2698 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2703 fprintf(out
, "null set\n");
2707 fprintf(out
, "%*s", indent
, "");
2708 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2709 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2711 for (i
= 0; i
< set
->n
; ++i
) {
2712 fprintf(out
, "%*s", indent
, "");
2713 fprintf(out
, "basic set %d:\n", i
);
2714 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2718 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2723 fprintf(out
, "null map\n");
2727 fprintf(out
, "%*s", indent
, "");
2728 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2729 "flags: %x, n_name: %d\n",
2730 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2731 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2732 for (i
= 0; i
< map
->n
; ++i
) {
2733 fprintf(out
, "%*s", indent
, "");
2734 fprintf(out
, "basic map %d:\n", i
);
2735 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2739 struct isl_basic_map
*isl_basic_map_intersect_domain(
2740 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2742 struct isl_basic_map
*bmap_domain
;
2747 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2748 bset
->dim
, isl_dim_param
), goto error
);
2750 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2751 isl_assert(bset
->ctx
,
2752 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2754 bmap
= isl_basic_map_cow(bmap
);
2757 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2758 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2759 bmap_domain
= isl_basic_map_from_domain(bset
);
2760 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2762 bmap
= isl_basic_map_simplify(bmap
);
2763 return isl_basic_map_finalize(bmap
);
2765 isl_basic_map_free(bmap
);
2766 isl_basic_set_free(bset
);
2770 struct isl_basic_map
*isl_basic_map_intersect_range(
2771 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2773 struct isl_basic_map
*bmap_range
;
2778 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2779 bset
->dim
, isl_dim_param
), goto error
);
2781 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2782 isl_assert(bset
->ctx
,
2783 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2785 if (isl_basic_set_is_universe(bset
)) {
2786 isl_basic_set_free(bset
);
2790 bmap
= isl_basic_map_cow(bmap
);
2793 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2794 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2795 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2796 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2798 bmap
= isl_basic_map_simplify(bmap
);
2799 return isl_basic_map_finalize(bmap
);
2801 isl_basic_map_free(bmap
);
2802 isl_basic_set_free(bset
);
2806 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2815 total
= 1 + isl_basic_map_total_dim(bmap
);
2816 if (total
!= vec
->size
)
2821 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2822 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2823 if (!isl_int_is_zero(s
)) {
2829 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2830 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2831 if (isl_int_is_neg(s
)) {
2842 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2844 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2847 struct isl_basic_map
*isl_basic_map_intersect(
2848 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2850 struct isl_vec
*sample
= NULL
;
2852 if (!bmap1
|| !bmap2
)
2855 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2856 bmap2
->dim
, isl_dim_param
), goto error
);
2857 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2858 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2859 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2860 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2861 return isl_basic_map_intersect(bmap2
, bmap1
);
2863 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2864 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2865 isl_assert(bmap1
->ctx
,
2866 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2868 if (bmap1
->sample
&&
2869 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2870 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2871 sample
= isl_vec_copy(bmap1
->sample
);
2872 else if (bmap2
->sample
&&
2873 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2874 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2875 sample
= isl_vec_copy(bmap2
->sample
);
2877 bmap1
= isl_basic_map_cow(bmap1
);
2880 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2881 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2882 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2885 isl_vec_free(sample
);
2887 isl_vec_free(bmap1
->sample
);
2888 bmap1
->sample
= sample
;
2891 bmap1
= isl_basic_map_simplify(bmap1
);
2892 return isl_basic_map_finalize(bmap1
);
2895 isl_vec_free(sample
);
2896 isl_basic_map_free(bmap1
);
2897 isl_basic_map_free(bmap2
);
2901 struct isl_basic_set
*isl_basic_set_intersect(
2902 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2904 return (struct isl_basic_set
*)
2905 isl_basic_map_intersect(
2906 (struct isl_basic_map
*)bset1
,
2907 (struct isl_basic_map
*)bset2
);
2910 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2911 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2913 return isl_basic_set_intersect(bset1
, bset2
);
2916 /* Special case of isl_map_intersect, where both map1 and map2
2917 * are convex, without any divs and such that either map1 or map2
2918 * contains a single constraint. This constraint is then simply
2919 * added to the other map.
2921 static __isl_give isl_map
*map_intersect_add_constraint(
2922 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2924 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2925 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2926 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2927 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2929 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2930 return isl_map_intersect(map2
, map1
);
2932 isl_assert(map2
->ctx
,
2933 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2935 map1
= isl_map_cow(map1
);
2938 if (isl_map_plain_is_empty(map1
)) {
2942 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2943 if (map2
->p
[0]->n_eq
== 1)
2944 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2946 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2947 map2
->p
[0]->ineq
[0]);
2949 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2950 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2954 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2955 isl_basic_map_free(map1
->p
[0]);
2968 /* map2 may be either a parameter domain or a map living in the same
2971 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2972 __isl_take isl_map
*map2
)
2981 if ((isl_map_plain_is_empty(map1
) ||
2982 isl_map_plain_is_universe(map2
)) &&
2983 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2987 if ((isl_map_plain_is_empty(map2
) ||
2988 isl_map_plain_is_universe(map1
)) &&
2989 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2994 if (map1
->n
== 1 && map2
->n
== 1 &&
2995 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2996 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2997 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2998 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2999 return map_intersect_add_constraint(map1
, map2
);
3001 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3002 isl_space_dim(map2
->dim
, isl_dim_param
))
3003 isl_assert(map1
->ctx
,
3004 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3006 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3007 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3008 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3010 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3011 map1
->n
* map2
->n
, flags
);
3014 for (i
= 0; i
< map1
->n
; ++i
)
3015 for (j
= 0; j
< map2
->n
; ++j
) {
3016 struct isl_basic_map
*part
;
3017 part
= isl_basic_map_intersect(
3018 isl_basic_map_copy(map1
->p
[i
]),
3019 isl_basic_map_copy(map2
->p
[j
]));
3020 if (isl_basic_map_is_empty(part
) < 0)
3021 part
= isl_basic_map_free(part
);
3022 result
= isl_map_add_basic_map(result
, part
);
3035 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3036 __isl_take isl_map
*map2
)
3040 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3041 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3042 "spaces don't match", goto error
);
3043 return map_intersect_internal(map1
, map2
);
3050 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3051 __isl_take isl_map
*map2
)
3053 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3056 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3058 return (struct isl_set
*)
3059 isl_map_intersect((struct isl_map
*)set1
,
3060 (struct isl_map
*)set2
);
3063 /* map_intersect_internal accepts intersections
3064 * with parameter domains, so we can just call that function.
3066 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3067 __isl_take isl_set
*params
)
3069 return map_intersect_internal(map
, params
);
3072 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3073 __isl_take isl_map
*map2
)
3075 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3078 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3079 __isl_take isl_set
*params
)
3081 return isl_map_intersect_params(set
, params
);
3084 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3087 struct isl_basic_set
*bset
;
3092 bmap
= isl_basic_map_cow(bmap
);
3095 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3096 in
= isl_basic_map_n_in(bmap
);
3097 bset
= isl_basic_set_from_basic_map(bmap
);
3098 bset
= isl_basic_set_swap_vars(bset
, in
);
3099 return isl_basic_map_from_basic_set(bset
, dim
);
3102 static __isl_give isl_basic_map
*basic_map_space_reset(
3103 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3109 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3112 space
= isl_basic_map_get_space(bmap
);
3113 space
= isl_space_reset(space
, type
);
3114 bmap
= isl_basic_map_reset_space(bmap
, space
);
3118 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3119 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3120 unsigned pos
, unsigned n
)
3123 struct isl_basic_map
*res
;
3124 struct isl_dim_map
*dim_map
;
3125 unsigned total
, off
;
3126 enum isl_dim_type t
;
3129 return basic_map_space_reset(bmap
, type
);
3134 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3136 total
= isl_basic_map_total_dim(bmap
) + n
;
3137 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3139 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3141 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3143 unsigned size
= isl_basic_map_dim(bmap
, t
);
3144 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3146 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3147 pos
, size
- pos
, off
+ pos
+ n
);
3149 off
+= isl_space_dim(res_dim
, t
);
3151 isl_dim_map_div(dim_map
, bmap
, off
);
3153 res
= isl_basic_map_alloc_space(res_dim
,
3154 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3155 if (isl_basic_map_is_rational(bmap
))
3156 res
= isl_basic_map_set_rational(res
);
3157 if (isl_basic_map_plain_is_empty(bmap
)) {
3158 isl_basic_map_free(bmap
);
3160 return isl_basic_map_set_to_empty(res
);
3162 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3163 return isl_basic_map_finalize(res
);
3166 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3167 __isl_take isl_basic_set
*bset
,
3168 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3170 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3173 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3174 enum isl_dim_type type
, unsigned n
)
3178 return isl_basic_map_insert_dims(bmap
, type
,
3179 isl_basic_map_dim(bmap
, type
), n
);
3182 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3183 enum isl_dim_type type
, unsigned n
)
3187 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3188 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3190 isl_basic_set_free(bset
);
3194 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3195 enum isl_dim_type type
)
3199 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3202 space
= isl_map_get_space(map
);
3203 space
= isl_space_reset(space
, type
);
3204 map
= isl_map_reset_space(map
, space
);
3208 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3209 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3214 return map_space_reset(map
, type
);
3216 map
= isl_map_cow(map
);
3220 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3224 for (i
= 0; i
< map
->n
; ++i
) {
3225 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3236 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3237 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3239 return isl_map_insert_dims(set
, type
, pos
, n
);
3242 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3243 enum isl_dim_type type
, unsigned n
)
3247 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3250 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3251 enum isl_dim_type type
, unsigned n
)
3255 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3256 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3262 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3263 __isl_take isl_basic_map
*bmap
,
3264 enum isl_dim_type dst_type
, unsigned dst_pos
,
3265 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3267 struct isl_dim_map
*dim_map
;
3268 struct isl_basic_map
*res
;
3269 enum isl_dim_type t
;
3270 unsigned total
, off
;
3277 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3280 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3283 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3285 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3286 pos(bmap
->dim
, src_type
) + src_pos
+
3287 ((src_type
< dst_type
) ? n
: 0)) {
3288 bmap
= isl_basic_map_cow(bmap
);
3292 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3293 src_type
, src_pos
, n
);
3297 bmap
= isl_basic_map_finalize(bmap
);
3302 total
= isl_basic_map_total_dim(bmap
);
3303 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3306 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3307 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3308 if (t
== dst_type
) {
3309 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3312 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3315 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3316 dst_pos
, size
- dst_pos
, off
);
3317 off
+= size
- dst_pos
;
3318 } else if (t
== src_type
) {
3319 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3322 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3323 src_pos
+ n
, size
- src_pos
- n
, off
);
3324 off
+= size
- src_pos
- n
;
3326 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3330 isl_dim_map_div(dim_map
, bmap
, off
);
3332 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3333 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3334 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3338 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3339 src_type
, src_pos
, n
);
3343 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3344 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3345 bmap
= isl_basic_map_finalize(bmap
);
3349 isl_basic_map_free(bmap
);
3353 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3354 enum isl_dim_type dst_type
, unsigned dst_pos
,
3355 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3357 return (isl_basic_set
*)isl_basic_map_move_dims(
3358 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3361 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3362 enum isl_dim_type dst_type
, unsigned dst_pos
,
3363 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3367 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3368 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3369 src_type
, src_pos
, n
);
3375 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3376 enum isl_dim_type dst_type
, unsigned dst_pos
,
3377 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3386 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3389 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3392 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3394 map
= isl_map_cow(map
);
3398 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3402 for (i
= 0; i
< map
->n
; ++i
) {
3403 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3405 src_type
, src_pos
, n
);
3416 /* Move the specified dimensions to the last columns right before
3417 * the divs. Don't change the dimension specification of bmap.
3418 * That's the responsibility of the caller.
3420 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3421 enum isl_dim_type type
, unsigned first
, unsigned n
)
3423 struct isl_dim_map
*dim_map
;
3424 struct isl_basic_map
*res
;
3425 enum isl_dim_type t
;
3426 unsigned total
, off
;
3430 if (pos(bmap
->dim
, type
) + first
+ n
==
3431 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3434 total
= isl_basic_map_total_dim(bmap
);
3435 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3438 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3439 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3441 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3444 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3445 first
, n
, total
- bmap
->n_div
- n
);
3446 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3447 first
+ n
, size
- (first
+ n
), off
);
3448 off
+= size
- (first
+ n
);
3450 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3454 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3456 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3457 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3458 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3462 /* Insert "n" rows in the divs of "bmap".
3464 * The number of columns is not changed, which means that the last
3465 * dimensions of "bmap" are being reintepreted as the new divs.
3466 * The space of "bmap" is not adjusted, however, which means
3467 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3468 * from the space of "bmap" is the responsibility of the caller.
3470 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3478 bmap
= isl_basic_map_cow(bmap
);
3482 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3483 old
= bmap
->block2
.data
;
3484 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3485 (bmap
->extra
+ n
) * (1 + row_size
));
3486 if (!bmap
->block2
.data
)
3487 return isl_basic_map_free(bmap
);
3488 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3490 return isl_basic_map_free(bmap
);
3491 for (i
= 0; i
< n
; ++i
) {
3492 new_div
[i
] = bmap
->block2
.data
+
3493 (bmap
->extra
+ i
) * (1 + row_size
);
3494 isl_seq_clr(new_div
[i
], 1 + row_size
);
3496 for (i
= 0; i
< bmap
->extra
; ++i
)
3497 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3499 bmap
->div
= new_div
;
3506 /* Turn the n dimensions of type type, starting at first
3507 * into existentially quantified variables.
3509 __isl_give isl_basic_map
*isl_basic_map_project_out(
3510 __isl_take isl_basic_map
*bmap
,
3511 enum isl_dim_type type
, unsigned first
, unsigned n
)
3514 return basic_map_space_reset(bmap
, type
);
3519 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3520 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3522 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3525 bmap
= move_last(bmap
, type
, first
, n
);
3526 bmap
= isl_basic_map_cow(bmap
);
3527 bmap
= insert_div_rows(bmap
, n
);
3531 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3534 bmap
= isl_basic_map_simplify(bmap
);
3535 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3536 return isl_basic_map_finalize(bmap
);
3538 isl_basic_map_free(bmap
);
3542 /* Turn the n dimensions of type type, starting at first
3543 * into existentially quantified variables.
3545 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3546 enum isl_dim_type type
, unsigned first
, unsigned n
)
3548 return (isl_basic_set
*)isl_basic_map_project_out(
3549 (isl_basic_map
*)bset
, type
, first
, n
);
3552 /* Turn the n dimensions of type type, starting at first
3553 * into existentially quantified variables.
3555 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3556 enum isl_dim_type type
, unsigned first
, unsigned n
)
3564 return map_space_reset(map
, type
);
3566 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3568 map
= isl_map_cow(map
);
3572 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3576 for (i
= 0; i
< map
->n
; ++i
) {
3577 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3588 /* Turn the n dimensions of type type, starting at first
3589 * into existentially quantified variables.
3591 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3592 enum isl_dim_type type
, unsigned first
, unsigned n
)
3594 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3597 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3601 for (i
= 0; i
< n
; ++i
) {
3602 j
= isl_basic_map_alloc_div(bmap
);
3605 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3609 isl_basic_map_free(bmap
);
3613 struct isl_basic_map
*isl_basic_map_apply_range(
3614 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3616 isl_space
*dim_result
= NULL
;
3617 struct isl_basic_map
*bmap
;
3618 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3619 struct isl_dim_map
*dim_map1
, *dim_map2
;
3621 if (!bmap1
|| !bmap2
)
3623 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3624 bmap2
->dim
, isl_dim_param
))
3625 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3626 "parameters don't match", goto error
);
3627 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
3628 bmap2
->dim
, isl_dim_in
))
3629 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3630 "spaces don't match", goto error
);
3632 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3633 isl_space_copy(bmap2
->dim
));
3635 n_in
= isl_basic_map_n_in(bmap1
);
3636 n_out
= isl_basic_map_n_out(bmap2
);
3637 n
= isl_basic_map_n_out(bmap1
);
3638 nparam
= isl_basic_map_n_param(bmap1
);
3640 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3641 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3642 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3643 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3644 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3645 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3646 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3647 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3648 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3649 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3650 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3652 bmap
= isl_basic_map_alloc_space(dim_result
,
3653 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3654 bmap1
->n_eq
+ bmap2
->n_eq
,
3655 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3656 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3657 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3658 bmap
= add_divs(bmap
, n
);
3659 bmap
= isl_basic_map_simplify(bmap
);
3660 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3661 return isl_basic_map_finalize(bmap
);
3663 isl_basic_map_free(bmap1
);
3664 isl_basic_map_free(bmap2
);
3668 struct isl_basic_set
*isl_basic_set_apply(
3669 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3674 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3677 return (struct isl_basic_set
*)
3678 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3680 isl_basic_set_free(bset
);
3681 isl_basic_map_free(bmap
);
3685 struct isl_basic_map
*isl_basic_map_apply_domain(
3686 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3688 if (!bmap1
|| !bmap2
)
3691 isl_assert(bmap1
->ctx
,
3692 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3693 isl_assert(bmap1
->ctx
,
3694 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3697 bmap1
= isl_basic_map_reverse(bmap1
);
3698 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3699 return isl_basic_map_reverse(bmap1
);
3701 isl_basic_map_free(bmap1
);
3702 isl_basic_map_free(bmap2
);
3706 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3707 * A \cap B -> f(A) + f(B)
3709 struct isl_basic_map
*isl_basic_map_sum(
3710 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3712 unsigned n_in
, n_out
, nparam
, total
, pos
;
3713 struct isl_basic_map
*bmap
= NULL
;
3714 struct isl_dim_map
*dim_map1
, *dim_map2
;
3717 if (!bmap1
|| !bmap2
)
3720 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3723 nparam
= isl_basic_map_n_param(bmap1
);
3724 n_in
= isl_basic_map_n_in(bmap1
);
3725 n_out
= isl_basic_map_n_out(bmap1
);
3727 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3728 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3729 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3730 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3731 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3732 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3733 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3734 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3735 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3736 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3737 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3739 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3740 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3741 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3742 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3743 for (i
= 0; i
< n_out
; ++i
) {
3744 int j
= isl_basic_map_alloc_equality(bmap
);
3747 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3748 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3749 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3750 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3752 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3753 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3754 bmap
= add_divs(bmap
, 2 * n_out
);
3756 bmap
= isl_basic_map_simplify(bmap
);
3757 return isl_basic_map_finalize(bmap
);
3759 isl_basic_map_free(bmap
);
3760 isl_basic_map_free(bmap1
);
3761 isl_basic_map_free(bmap2
);
3765 /* Given two maps A -> f(A) and B -> g(B), construct a map
3766 * A \cap B -> f(A) + f(B)
3768 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3770 struct isl_map
*result
;
3776 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3778 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3779 map1
->n
* map2
->n
, 0);
3782 for (i
= 0; i
< map1
->n
; ++i
)
3783 for (j
= 0; j
< map2
->n
; ++j
) {
3784 struct isl_basic_map
*part
;
3785 part
= isl_basic_map_sum(
3786 isl_basic_map_copy(map1
->p
[i
]),
3787 isl_basic_map_copy(map2
->p
[j
]));
3788 if (isl_basic_map_is_empty(part
))
3789 isl_basic_map_free(part
);
3791 result
= isl_map_add_basic_map(result
, part
);
3804 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3805 __isl_take isl_set
*set2
)
3807 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3810 /* Given a basic map A -> f(A), construct A -> -f(A).
3812 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3817 bmap
= isl_basic_map_cow(bmap
);
3821 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3822 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3823 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3824 for (j
= 0; j
< n
; ++j
)
3825 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3826 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3827 for (j
= 0; j
< n
; ++j
)
3828 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3829 for (i
= 0; i
< bmap
->n_div
; ++i
)
3830 for (j
= 0; j
< n
; ++j
)
3831 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3832 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3833 return isl_basic_map_finalize(bmap
);
3836 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3838 return isl_basic_map_neg(bset
);
3841 /* Given a map A -> f(A), construct A -> -f(A).
3843 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3847 map
= isl_map_cow(map
);
3851 for (i
= 0; i
< map
->n
; ++i
) {
3852 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3863 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3865 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3868 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3869 * A -> floor(f(A)/d).
3871 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3874 unsigned n_in
, n_out
, nparam
, total
, pos
;
3875 struct isl_basic_map
*result
= NULL
;
3876 struct isl_dim_map
*dim_map
;
3882 nparam
= isl_basic_map_n_param(bmap
);
3883 n_in
= isl_basic_map_n_in(bmap
);
3884 n_out
= isl_basic_map_n_out(bmap
);
3886 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3887 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3888 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3889 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3890 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3891 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3893 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3894 bmap
->n_div
+ n_out
,
3895 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3896 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3897 result
= add_divs(result
, n_out
);
3898 for (i
= 0; i
< n_out
; ++i
) {
3900 j
= isl_basic_map_alloc_inequality(result
);
3903 isl_seq_clr(result
->ineq
[j
], 1+total
);
3904 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3905 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3906 j
= isl_basic_map_alloc_inequality(result
);
3909 isl_seq_clr(result
->ineq
[j
], 1+total
);
3910 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3911 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3912 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3915 result
= isl_basic_map_simplify(result
);
3916 return isl_basic_map_finalize(result
);
3918 isl_basic_map_free(result
);
3922 /* Given a map A -> f(A) and an integer d, construct a map
3923 * A -> floor(f(A)/d).
3925 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3929 map
= isl_map_cow(map
);
3933 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3934 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3935 for (i
= 0; i
< map
->n
; ++i
) {
3936 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3947 /* Given a map A -> f(A) and an integer d, construct a map
3948 * A -> floor(f(A)/d).
3950 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
3951 __isl_take isl_val
*d
)
3955 if (!isl_val_is_int(d
))
3956 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
3957 "expecting integer denominator", goto error
);
3958 map
= isl_map_floordiv(map
, d
->n
);
3967 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3973 i
= isl_basic_map_alloc_equality(bmap
);
3976 nparam
= isl_basic_map_n_param(bmap
);
3977 n_in
= isl_basic_map_n_in(bmap
);
3978 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3979 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3980 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3981 return isl_basic_map_finalize(bmap
);
3983 isl_basic_map_free(bmap
);
3987 /* Add a constraints to "bmap" expressing i_pos < o_pos
3989 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3995 i
= isl_basic_map_alloc_inequality(bmap
);
3998 nparam
= isl_basic_map_n_param(bmap
);
3999 n_in
= isl_basic_map_n_in(bmap
);
4000 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4001 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4002 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4003 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4004 return isl_basic_map_finalize(bmap
);
4006 isl_basic_map_free(bmap
);
4010 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4012 static __isl_give isl_basic_map
*var_less_or_equal(
4013 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4019 i
= isl_basic_map_alloc_inequality(bmap
);
4022 nparam
= isl_basic_map_n_param(bmap
);
4023 n_in
= isl_basic_map_n_in(bmap
);
4024 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4025 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4026 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4027 return isl_basic_map_finalize(bmap
);
4029 isl_basic_map_free(bmap
);
4033 /* Add a constraints to "bmap" expressing i_pos > o_pos
4035 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
4041 i
= isl_basic_map_alloc_inequality(bmap
);
4044 nparam
= isl_basic_map_n_param(bmap
);
4045 n_in
= isl_basic_map_n_in(bmap
);
4046 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4047 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4048 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4049 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4050 return isl_basic_map_finalize(bmap
);
4052 isl_basic_map_free(bmap
);
4056 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4058 static __isl_give isl_basic_map
*var_more_or_equal(
4059 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4065 i
= isl_basic_map_alloc_inequality(bmap
);
4068 nparam
= isl_basic_map_n_param(bmap
);
4069 n_in
= isl_basic_map_n_in(bmap
);
4070 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4071 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4072 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4073 return isl_basic_map_finalize(bmap
);
4075 isl_basic_map_free(bmap
);
4079 __isl_give isl_basic_map
*isl_basic_map_equal(
4080 __isl_take isl_space
*dim
, unsigned n_equal
)
4083 struct isl_basic_map
*bmap
;
4084 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4087 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4088 bmap
= var_equal(bmap
, i
);
4089 return isl_basic_map_finalize(bmap
);
4092 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4094 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4098 struct isl_basic_map
*bmap
;
4099 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4102 for (i
= 0; i
< pos
&& bmap
; ++i
)
4103 bmap
= var_equal(bmap
, i
);
4105 bmap
= var_less(bmap
, pos
);
4106 return isl_basic_map_finalize(bmap
);
4109 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4111 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4112 __isl_take isl_space
*dim
, unsigned pos
)
4115 isl_basic_map
*bmap
;
4117 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4118 for (i
= 0; i
< pos
; ++i
)
4119 bmap
= var_equal(bmap
, i
);
4120 bmap
= var_less_or_equal(bmap
, pos
);
4121 return isl_basic_map_finalize(bmap
);
4124 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4126 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4130 struct isl_basic_map
*bmap
;
4131 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4134 for (i
= 0; i
< pos
&& bmap
; ++i
)
4135 bmap
= var_equal(bmap
, i
);
4137 bmap
= var_more(bmap
, pos
);
4138 return isl_basic_map_finalize(bmap
);
4141 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4143 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4144 __isl_take isl_space
*dim
, unsigned pos
)
4147 isl_basic_map
*bmap
;
4149 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4150 for (i
= 0; i
< pos
; ++i
)
4151 bmap
= var_equal(bmap
, i
);
4152 bmap
= var_more_or_equal(bmap
, pos
);
4153 return isl_basic_map_finalize(bmap
);
4156 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4157 unsigned n
, int equal
)
4159 struct isl_map
*map
;
4162 if (n
== 0 && equal
)
4163 return isl_map_universe(dims
);
4165 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4167 for (i
= 0; i
+ 1 < n
; ++i
)
4168 map
= isl_map_add_basic_map(map
,
4169 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4172 map
= isl_map_add_basic_map(map
,
4173 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4175 map
= isl_map_add_basic_map(map
,
4176 isl_basic_map_less_at(dims
, n
- 1));
4178 isl_space_free(dims
);
4183 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4187 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4190 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4192 return map_lex_lte_first(dim
, n
, 0);
4195 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4197 return map_lex_lte_first(dim
, n
, 1);
4200 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4202 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4205 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4207 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4210 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4211 unsigned n
, int equal
)
4213 struct isl_map
*map
;
4216 if (n
== 0 && equal
)
4217 return isl_map_universe(dims
);
4219 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4221 for (i
= 0; i
+ 1 < n
; ++i
)
4222 map
= isl_map_add_basic_map(map
,
4223 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4226 map
= isl_map_add_basic_map(map
,
4227 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4229 map
= isl_map_add_basic_map(map
,
4230 isl_basic_map_more_at(dims
, n
- 1));
4232 isl_space_free(dims
);
4237 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4241 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4244 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4246 return map_lex_gte_first(dim
, n
, 0);
4249 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4251 return map_lex_gte_first(dim
, n
, 1);
4254 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4256 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4259 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4261 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4264 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4265 __isl_take isl_set
*set2
)
4268 map
= isl_map_lex_le(isl_set_get_space(set1
));
4269 map
= isl_map_intersect_domain(map
, set1
);
4270 map
= isl_map_intersect_range(map
, set2
);
4274 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4275 __isl_take isl_set
*set2
)
4278 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4279 map
= isl_map_intersect_domain(map
, set1
);
4280 map
= isl_map_intersect_range(map
, set2
);
4284 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4285 __isl_take isl_set
*set2
)
4288 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4289 map
= isl_map_intersect_domain(map
, set1
);
4290 map
= isl_map_intersect_range(map
, set2
);
4294 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4295 __isl_take isl_set
*set2
)
4298 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4299 map
= isl_map_intersect_domain(map
, set1
);
4300 map
= isl_map_intersect_range(map
, set2
);
4304 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4305 __isl_take isl_map
*map2
)
4308 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4309 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4310 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4314 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4315 __isl_take isl_map
*map2
)
4318 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4319 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4320 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4324 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4325 __isl_take isl_map
*map2
)
4328 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4329 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4330 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4334 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4335 __isl_take isl_map
*map2
)
4338 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4339 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4340 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4344 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4345 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4347 struct isl_basic_map
*bmap
;
4349 bset
= isl_basic_set_cow(bset
);
4353 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4354 isl_space_free(bset
->dim
);
4355 bmap
= (struct isl_basic_map
*) bset
;
4357 return isl_basic_map_finalize(bmap
);
4359 isl_basic_set_free(bset
);
4360 isl_space_free(dim
);
4364 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4368 if (bmap
->dim
->n_in
== 0)
4369 return (struct isl_basic_set
*)bmap
;
4370 bmap
= isl_basic_map_cow(bmap
);
4373 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4376 bmap
= isl_basic_map_finalize(bmap
);
4377 return (struct isl_basic_set
*)bmap
;
4379 isl_basic_map_free(bmap
);
4383 /* For a div d = floor(f/m), add the constraint
4387 static int add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
4388 unsigned pos
, isl_int
*div
)
4391 unsigned total
= isl_basic_map_total_dim(bmap
);
4393 i
= isl_basic_map_alloc_inequality(bmap
);
4396 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4397 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4402 /* For a div d = floor(f/m), add the constraint
4404 * -(f-(n-1)) + m d >= 0
4406 static int add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
4407 unsigned pos
, isl_int
*div
)
4410 unsigned total
= isl_basic_map_total_dim(bmap
);
4412 i
= isl_basic_map_alloc_inequality(bmap
);
4415 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4416 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
4417 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
4418 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
4423 /* For a div d = floor(f/m), add the constraints
4426 * -(f-(n-1)) + m d >= 0
4428 * Note that the second constraint is the negation of
4432 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4433 unsigned pos
, isl_int
*div
)
4435 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
4437 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
4442 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4443 unsigned pos
, isl_int
*div
)
4445 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4449 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4451 unsigned total
= isl_basic_map_total_dim(bmap
);
4452 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4454 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4458 /* For each known div d = floor(f/m), add the constraints
4461 * -(f-(n-1)) + m d >= 0
4463 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
4464 __isl_take isl_basic_map
*bmap
)
4471 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4474 bmap
= isl_basic_map_cow(bmap
);
4475 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
4478 for (i
= 0; i
< n_div
; ++i
) {
4479 if (isl_int_is_zero(bmap
->div
[i
][0]))
4481 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4482 return isl_basic_map_free(bmap
);
4485 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
4486 bmap
= isl_basic_map_finalize(bmap
);
4490 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4492 * In particular, if this div is of the form d = floor(f/m),
4493 * then add the constraint
4497 * if sign < 0 or the constraint
4499 * -(f-(n-1)) + m d >= 0
4503 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
4504 unsigned div
, int sign
)
4512 total
= isl_basic_map_total_dim(bmap
);
4513 div_pos
= total
- bmap
->n_div
+ div
;
4516 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4518 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4521 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4523 return isl_basic_map_add_div_constraints(bset
, div
);
4526 struct isl_basic_set
*isl_basic_map_underlying_set(
4527 struct isl_basic_map
*bmap
)
4531 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4533 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4534 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4535 return (struct isl_basic_set
*)bmap
;
4536 bmap
= isl_basic_map_cow(bmap
);
4539 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4542 bmap
->extra
-= bmap
->n_div
;
4544 bmap
= isl_basic_map_finalize(bmap
);
4545 return (struct isl_basic_set
*)bmap
;
4547 isl_basic_map_free(bmap
);
4551 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4552 __isl_take isl_basic_set
*bset
)
4554 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4557 /* Replace each element in "list" by the result of applying
4558 * isl_basic_map_underlying_set to the element.
4560 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
4561 __isl_take isl_basic_map_list
*list
)
4568 n
= isl_basic_map_list_n_basic_map(list
);
4569 for (i
= 0; i
< n
; ++i
) {
4570 isl_basic_map
*bmap
;
4571 isl_basic_set
*bset
;
4573 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
4574 bset
= isl_basic_set_underlying_set(bmap
);
4575 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
4581 struct isl_basic_map
*isl_basic_map_overlying_set(
4582 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4584 struct isl_basic_map
*bmap
;
4585 struct isl_ctx
*ctx
;
4592 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4593 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4594 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4596 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4597 isl_basic_map_free(like
);
4598 return (struct isl_basic_map
*)bset
;
4600 bset
= isl_basic_set_cow(bset
);
4603 total
= bset
->dim
->n_out
+ bset
->extra
;
4604 bmap
= (struct isl_basic_map
*)bset
;
4605 isl_space_free(bmap
->dim
);
4606 bmap
->dim
= isl_space_copy(like
->dim
);
4609 bmap
->n_div
= like
->n_div
;
4610 bmap
->extra
+= like
->n_div
;
4614 ltotal
= total
- bmap
->extra
+ like
->extra
;
4617 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4618 bmap
->extra
* (1 + 1 + total
));
4619 if (isl_blk_is_error(bmap
->block2
))
4621 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4625 for (i
= 0; i
< bmap
->extra
; ++i
)
4626 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4627 for (i
= 0; i
< like
->n_div
; ++i
) {
4628 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4629 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4631 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
4633 isl_basic_map_free(like
);
4634 bmap
= isl_basic_map_simplify(bmap
);
4635 bmap
= isl_basic_map_finalize(bmap
);
4638 isl_basic_map_free(like
);
4639 isl_basic_set_free(bset
);
4643 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4644 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4646 return (struct isl_basic_set
*)
4647 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4650 struct isl_set
*isl_set_from_underlying_set(
4651 struct isl_set
*set
, struct isl_basic_set
*like
)
4657 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4659 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4660 isl_basic_set_free(like
);
4663 set
= isl_set_cow(set
);
4666 for (i
= 0; i
< set
->n
; ++i
) {
4667 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4668 isl_basic_set_copy(like
));
4672 isl_space_free(set
->dim
);
4673 set
->dim
= isl_space_copy(like
->dim
);
4676 isl_basic_set_free(like
);
4679 isl_basic_set_free(like
);
4684 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4688 map
= isl_map_cow(map
);
4691 map
->dim
= isl_space_cow(map
->dim
);
4695 for (i
= 1; i
< map
->n
; ++i
)
4696 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4698 for (i
= 0; i
< map
->n
; ++i
) {
4699 map
->p
[i
] = (struct isl_basic_map
*)
4700 isl_basic_map_underlying_set(map
->p
[i
]);
4705 map
->dim
= isl_space_underlying(map
->dim
, 0);
4707 isl_space_free(map
->dim
);
4708 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4712 return (struct isl_set
*)map
;
4718 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4720 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4723 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4724 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4726 bmap
= isl_basic_map_cow(bmap
);
4730 isl_space_free(bmap
->dim
);
4733 bmap
= isl_basic_map_finalize(bmap
);
4737 isl_basic_map_free(bmap
);
4738 isl_space_free(dim
);
4742 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4743 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4745 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4749 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4750 __isl_take isl_space
*dim
)
4754 map
= isl_map_cow(map
);
4758 for (i
= 0; i
< map
->n
; ++i
) {
4759 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4760 isl_space_copy(dim
));
4764 isl_space_free(map
->dim
);
4770 isl_space_free(dim
);
4774 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4775 __isl_take isl_space
*dim
)
4777 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4780 /* Compute the parameter domain of the given basic set.
4782 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4787 if (isl_basic_set_is_params(bset
))
4790 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4791 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4792 space
= isl_basic_set_get_space(bset
);
4793 space
= isl_space_params(space
);
4794 bset
= isl_basic_set_reset_space(bset
, space
);
4798 /* Construct a zero-dimensional basic set with the given parameter domain.
4800 __isl_give isl_basic_set
*isl_basic_set_from_params(
4801 __isl_take isl_basic_set
*bset
)
4804 space
= isl_basic_set_get_space(bset
);
4805 space
= isl_space_set_from_params(space
);
4806 bset
= isl_basic_set_reset_space(bset
, space
);
4810 /* Compute the parameter domain of the given set.
4812 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4817 if (isl_set_is_params(set
))
4820 n
= isl_set_dim(set
, isl_dim_set
);
4821 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4822 space
= isl_set_get_space(set
);
4823 space
= isl_space_params(space
);
4824 set
= isl_set_reset_space(set
, space
);
4828 /* Construct a zero-dimensional set with the given parameter domain.
4830 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4833 space
= isl_set_get_space(set
);
4834 space
= isl_space_set_from_params(space
);
4835 set
= isl_set_reset_space(set
, space
);
4839 /* Compute the parameter domain of the given map.
4841 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4846 n
= isl_map_dim(map
, isl_dim_in
);
4847 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4848 n
= isl_map_dim(map
, isl_dim_out
);
4849 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4850 space
= isl_map_get_space(map
);
4851 space
= isl_space_params(space
);
4852 map
= isl_map_reset_space(map
, space
);
4856 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4859 struct isl_basic_set
*domain
;
4865 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4867 n_in
= isl_basic_map_n_in(bmap
);
4868 n_out
= isl_basic_map_n_out(bmap
);
4869 domain
= isl_basic_set_from_basic_map(bmap
);
4870 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4872 domain
= isl_basic_set_reset_space(domain
, dim
);
4877 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4881 return isl_space_may_be_set(bmap
->dim
);
4884 /* Is this basic map actually a set?
4885 * Users should never call this function. Outside of isl,
4886 * the type should indicate whether something is a set or a map.
4888 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4892 return isl_space_is_set(bmap
->dim
);
4895 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4899 if (isl_basic_map_is_set(bmap
))
4901 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4904 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4905 __isl_take isl_basic_map
*bmap
)
4909 isl_basic_map
*domain
;
4910 int nparam
, n_in
, n_out
;
4913 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4914 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4915 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4917 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4918 domain
= isl_basic_map_universe(dim
);
4920 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4921 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4922 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4924 total
= isl_basic_map_total_dim(bmap
);
4926 for (i
= 0; i
< n_in
; ++i
) {
4927 k
= isl_basic_map_alloc_equality(bmap
);
4930 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4931 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4932 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4935 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4936 return isl_basic_map_finalize(bmap
);
4938 isl_basic_map_free(bmap
);
4942 __isl_give isl_basic_map
*isl_basic_map_range_map(
4943 __isl_take isl_basic_map
*bmap
)
4947 isl_basic_map
*range
;
4948 int nparam
, n_in
, n_out
;
4951 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4952 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4953 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4955 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4956 range
= isl_basic_map_universe(dim
);
4958 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4959 bmap
= isl_basic_map_apply_range(bmap
, range
);
4960 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4962 total
= isl_basic_map_total_dim(bmap
);
4964 for (i
= 0; i
< n_out
; ++i
) {
4965 k
= isl_basic_map_alloc_equality(bmap
);
4968 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4969 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4970 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4973 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4974 return isl_basic_map_finalize(bmap
);
4976 isl_basic_map_free(bmap
);
4980 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4984 return isl_space_may_be_set(map
->dim
);
4987 /* Is this map actually a set?
4988 * Users should never call this function. Outside of isl,
4989 * the type should indicate whether something is a set or a map.
4991 int isl_map_is_set(__isl_keep isl_map
*map
)
4995 return isl_space_is_set(map
->dim
);
4998 struct isl_set
*isl_map_range(struct isl_map
*map
)
5001 struct isl_set
*set
;
5005 if (isl_map_is_set(map
))
5006 return (isl_set
*)map
;
5008 map
= isl_map_cow(map
);
5012 set
= (struct isl_set
*) map
;
5013 set
->dim
= isl_space_range(set
->dim
);
5016 for (i
= 0; i
< map
->n
; ++i
) {
5017 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5021 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5022 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5029 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5033 map
= isl_map_cow(map
);
5037 map
->dim
= isl_space_domain_map(map
->dim
);
5040 for (i
= 0; i
< map
->n
; ++i
) {
5041 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5045 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5046 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5053 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5056 isl_space
*range_dim
;
5058 map
= isl_map_cow(map
);
5062 range_dim
= isl_space_range(isl_map_get_space(map
));
5063 range_dim
= isl_space_from_range(range_dim
);
5064 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5065 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5068 for (i
= 0; i
< map
->n
; ++i
) {
5069 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5073 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5074 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5081 /* Given a wrapped map of the form A[B -> C],
5082 * return the map A[B -> C] -> B.
5084 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5091 if (!isl_set_has_tuple_id(set
))
5092 return isl_map_domain_map(isl_set_unwrap(set
));
5094 id
= isl_set_get_tuple_id(set
);
5095 map
= isl_map_domain_map(isl_set_unwrap(set
));
5096 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5101 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
5102 __isl_take isl_space
*dim
)
5105 struct isl_map
*map
= NULL
;
5107 set
= isl_set_cow(set
);
5110 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
5111 map
= (struct isl_map
*)set
;
5112 for (i
= 0; i
< set
->n
; ++i
) {
5113 map
->p
[i
] = isl_basic_map_from_basic_set(
5114 set
->p
[i
], isl_space_copy(dim
));
5118 isl_space_free(map
->dim
);
5122 isl_space_free(dim
);
5127 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5128 __isl_take isl_basic_set
*bset
)
5130 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5133 __isl_give isl_basic_map
*isl_basic_map_from_range(
5134 __isl_take isl_basic_set
*bset
)
5137 space
= isl_basic_set_get_space(bset
);
5138 space
= isl_space_from_range(space
);
5139 bset
= isl_basic_set_reset_space(bset
, space
);
5140 return (isl_basic_map
*)bset
;
5143 /* Create a relation with the given set as range.
5144 * The domain of the created relation is a zero-dimensional
5145 * flat anonymous space.
5147 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5150 space
= isl_set_get_space(set
);
5151 space
= isl_space_from_range(space
);
5152 set
= isl_set_reset_space(set
, space
);
5153 return (struct isl_map
*)set
;
5156 /* Create a relation with the given set as domain.
5157 * The range of the created relation is a zero-dimensional
5158 * flat anonymous space.
5160 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5162 return isl_map_reverse(isl_map_from_range(set
));
5165 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5166 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5168 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5171 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5172 __isl_take isl_set
*range
)
5174 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5177 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
5180 struct isl_set
*set
= NULL
;
5184 map
= isl_map_cow(map
);
5187 map
->dim
= isl_space_as_set_space(map
->dim
);
5190 set
= (struct isl_set
*)map
;
5191 for (i
= 0; i
< map
->n
; ++i
) {
5192 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
5202 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
5205 struct isl_map
*map
;
5210 isl_die(dim
->ctx
, isl_error_internal
,
5211 "negative number of basic maps", goto error
);
5212 map
= isl_alloc(dim
->ctx
, struct isl_map
,
5213 sizeof(struct isl_map
) +
5214 (n
- 1) * sizeof(struct isl_basic_map
*));
5218 map
->ctx
= dim
->ctx
;
5219 isl_ctx_ref(map
->ctx
);
5227 isl_space_free(dim
);
5231 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5232 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5235 struct isl_map
*map
;
5238 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5242 map
= isl_map_alloc_space(dims
, n
, flags
);
5246 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5248 struct isl_basic_map
*bmap
;
5249 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5250 bmap
= isl_basic_map_set_to_empty(bmap
);
5254 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5256 struct isl_basic_set
*bset
;
5257 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5258 bset
= isl_basic_set_set_to_empty(bset
);
5262 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5264 struct isl_basic_map
*bmap
;
5267 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5268 bmap
= isl_basic_map_set_to_empty(bmap
);
5272 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5274 struct isl_basic_map
*bmap
;
5277 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5278 bmap
= isl_basic_map_set_to_empty(bmap
);
5282 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5284 struct isl_basic_set
*bset
;
5287 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5288 bset
= isl_basic_set_set_to_empty(bset
);
5292 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5294 struct isl_basic_map
*bmap
;
5295 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5296 bmap
= isl_basic_map_finalize(bmap
);
5300 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5302 struct isl_basic_set
*bset
;
5303 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5304 bset
= isl_basic_set_finalize(bset
);
5308 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5311 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5312 isl_basic_map
*bmap
;
5314 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5315 for (i
= 0; i
< total
; ++i
) {
5316 int k
= isl_basic_map_alloc_inequality(bmap
);
5319 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5320 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5324 isl_basic_map_free(bmap
);
5328 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5330 return isl_basic_map_nat_universe(dim
);
5333 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5335 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5338 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5340 return isl_map_nat_universe(dim
);
5343 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5344 __isl_keep isl_basic_map
*model
)
5348 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5351 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5355 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5358 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5359 __isl_keep isl_set
*model
)
5363 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5366 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5368 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5371 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5375 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5378 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5382 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5385 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5387 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5390 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5394 return isl_set_empty(isl_space_copy(model
->dim
));
5397 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5399 struct isl_map
*map
;
5402 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5403 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5407 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5409 struct isl_set
*set
;
5412 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5413 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5417 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5421 return isl_set_universe(isl_space_copy(model
->dim
));
5424 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5427 struct isl_map
*dup
;
5431 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5432 for (i
= 0; i
< map
->n
; ++i
)
5433 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5437 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5438 __isl_take isl_basic_map
*bmap
)
5442 if (isl_basic_map_plain_is_empty(bmap
)) {
5443 isl_basic_map_free(bmap
);
5446 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5447 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5448 map
->p
[map
->n
] = bmap
;
5450 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5456 isl_basic_map_free(bmap
);
5460 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
5470 isl_ctx_deref(map
->ctx
);
5471 for (i
= 0; i
< map
->n
; ++i
)
5472 isl_basic_map_free(map
->p
[i
]);
5473 isl_space_free(map
->dim
);
5479 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5480 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5484 base
= isl_map_cow(base
);
5488 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5491 for (i
= 0; i
< base
->n
; ++i
) {
5492 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5493 isl_space_copy(base
->dim
), 0, 0, 0);
5503 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5504 unsigned nparam
, unsigned dim
)
5506 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5510 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5511 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5515 bmap
= isl_basic_map_cow(bmap
);
5516 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5517 j
= isl_basic_map_alloc_equality(bmap
);
5520 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5521 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5522 isl_int_set_si(bmap
->eq
[j
][0], value
);
5523 bmap
= isl_basic_map_simplify(bmap
);
5524 return isl_basic_map_finalize(bmap
);
5526 isl_basic_map_free(bmap
);
5530 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5531 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5535 bmap
= isl_basic_map_cow(bmap
);
5536 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5537 j
= isl_basic_map_alloc_equality(bmap
);
5540 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5541 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5542 isl_int_set(bmap
->eq
[j
][0], value
);
5543 bmap
= isl_basic_map_simplify(bmap
);
5544 return isl_basic_map_finalize(bmap
);
5546 isl_basic_map_free(bmap
);
5550 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5551 enum isl_dim_type type
, unsigned pos
, int value
)
5555 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5556 return isl_basic_map_fix_pos_si(bmap
,
5557 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5559 isl_basic_map_free(bmap
);
5563 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5564 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5568 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5569 return isl_basic_map_fix_pos(bmap
,
5570 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5572 isl_basic_map_free(bmap
);
5576 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5577 * to be equal to "v".
5579 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5580 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5584 if (!isl_val_is_int(v
))
5585 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5586 "expecting integer value", goto error
);
5587 if (pos
>= isl_basic_map_dim(bmap
, type
))
5588 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5589 "index out of bounds", goto error
);
5590 pos
+= isl_basic_map_offset(bmap
, type
);
5591 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5595 isl_basic_map_free(bmap
);
5600 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5601 * to be equal to "v".
5603 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5604 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5606 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5609 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5610 enum isl_dim_type type
, unsigned pos
, int value
)
5612 return (struct isl_basic_set
*)
5613 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5617 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5618 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5620 return (struct isl_basic_set
*)
5621 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5625 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5626 unsigned input
, int value
)
5628 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5631 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5632 unsigned dim
, int value
)
5634 return (struct isl_basic_set
*)
5635 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5636 isl_dim_set
, dim
, value
);
5639 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5641 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5648 isl_basic_map_free(map
->p
[i
]);
5649 if (i
!= map
->n
- 1) {
5650 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5651 map
->p
[i
] = map
->p
[map
->n
- 1];
5658 /* Perform "fn" on each basic map of "map", where we may not be holding
5659 * the only reference to "map".
5660 * In particular, "fn" should be a semantics preserving operation
5661 * that we want to apply to all copies of "map". We therefore need
5662 * to be careful not to modify "map" in a way that breaks "map"
5663 * in case anything goes wrong.
5665 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5666 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5668 struct isl_basic_map
*bmap
;
5674 for (i
= map
->n
- 1; i
>= 0; --i
) {
5675 bmap
= isl_basic_map_copy(map
->p
[i
]);
5679 isl_basic_map_free(map
->p
[i
]);
5681 if (remove_if_empty(map
, i
) < 0)
5691 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5692 enum isl_dim_type type
, unsigned pos
, int value
)
5696 map
= isl_map_cow(map
);
5700 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5701 for (i
= map
->n
- 1; i
>= 0; --i
) {
5702 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5703 if (remove_if_empty(map
, i
) < 0)
5706 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5713 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5714 enum isl_dim_type type
, unsigned pos
, int value
)
5716 return (struct isl_set
*)
5717 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5720 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5721 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5725 map
= isl_map_cow(map
);
5729 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5730 for (i
= 0; i
< map
->n
; ++i
) {
5731 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5735 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5742 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5743 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5745 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5748 /* Fix the value of the variable at position "pos" of type "type" of "map"
5749 * to be equal to "v".
5751 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5752 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5756 map
= isl_map_cow(map
);
5760 if (!isl_val_is_int(v
))
5761 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5762 "expecting integer value", goto error
);
5763 if (pos
>= isl_map_dim(map
, type
))
5764 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5765 "index out of bounds", goto error
);
5766 for (i
= map
->n
- 1; i
>= 0; --i
) {
5767 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5769 if (remove_if_empty(map
, i
) < 0)
5772 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5781 /* Fix the value of the variable at position "pos" of type "type" of "set"
5782 * to be equal to "v".
5784 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5785 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5787 return isl_map_fix_val(set
, type
, pos
, v
);
5790 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5791 unsigned input
, int value
)
5793 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5796 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5798 return (struct isl_set
*)
5799 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5802 static __isl_give isl_basic_map
*basic_map_bound_si(
5803 __isl_take isl_basic_map
*bmap
,
5804 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5810 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5811 pos
+= isl_basic_map_offset(bmap
, type
);
5812 bmap
= isl_basic_map_cow(bmap
);
5813 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5814 j
= isl_basic_map_alloc_inequality(bmap
);
5817 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5819 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5820 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5822 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5823 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5825 bmap
= isl_basic_map_simplify(bmap
);
5826 return isl_basic_map_finalize(bmap
);
5828 isl_basic_map_free(bmap
);
5832 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5833 __isl_take isl_basic_map
*bmap
,
5834 enum isl_dim_type type
, unsigned pos
, int value
)
5836 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5839 /* Constrain the values of the given dimension to be no greater than "value".
5841 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5842 __isl_take isl_basic_map
*bmap
,
5843 enum isl_dim_type type
, unsigned pos
, int value
)
5845 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5848 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5849 unsigned dim
, isl_int value
)
5853 bset
= isl_basic_set_cow(bset
);
5854 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5855 j
= isl_basic_set_alloc_inequality(bset
);
5858 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5859 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5860 isl_int_neg(bset
->ineq
[j
][0], value
);
5861 bset
= isl_basic_set_simplify(bset
);
5862 return isl_basic_set_finalize(bset
);
5864 isl_basic_set_free(bset
);
5868 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5869 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5873 map
= isl_map_cow(map
);
5877 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5878 for (i
= 0; i
< map
->n
; ++i
) {
5879 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5880 type
, pos
, value
, upper
);
5884 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5891 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5892 enum isl_dim_type type
, unsigned pos
, int value
)
5894 return map_bound_si(map
, type
, pos
, value
, 0);
5897 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5898 enum isl_dim_type type
, unsigned pos
, int value
)
5900 return map_bound_si(map
, type
, pos
, value
, 1);
5903 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5904 enum isl_dim_type type
, unsigned pos
, int value
)
5906 return (struct isl_set
*)
5907 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5910 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5911 enum isl_dim_type type
, unsigned pos
, int value
)
5913 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5916 /* Bound the given variable of "bmap" from below (or above is "upper"
5917 * is set) to "value".
5919 static __isl_give isl_basic_map
*basic_map_bound(
5920 __isl_take isl_basic_map
*bmap
,
5921 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5927 if (pos
>= isl_basic_map_dim(bmap
, type
))
5928 isl_die(bmap
->ctx
, isl_error_invalid
,
5929 "index out of bounds", goto error
);
5930 pos
+= isl_basic_map_offset(bmap
, type
);
5931 bmap
= isl_basic_map_cow(bmap
);
5932 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5933 j
= isl_basic_map_alloc_inequality(bmap
);
5936 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5938 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5939 isl_int_set(bmap
->ineq
[j
][0], value
);
5941 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5942 isl_int_neg(bmap
->ineq
[j
][0], value
);
5944 bmap
= isl_basic_map_simplify(bmap
);
5945 return isl_basic_map_finalize(bmap
);
5947 isl_basic_map_free(bmap
);
5951 /* Bound the given variable of "map" from below (or above is "upper"
5952 * is set) to "value".
5954 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5955 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5959 map
= isl_map_cow(map
);
5963 if (pos
>= isl_map_dim(map
, type
))
5964 isl_die(map
->ctx
, isl_error_invalid
,
5965 "index out of bounds", goto error
);
5966 for (i
= map
->n
- 1; i
>= 0; --i
) {
5967 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5968 if (remove_if_empty(map
, i
) < 0)
5971 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5978 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5979 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5981 return map_bound(map
, type
, pos
, value
, 0);
5984 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5985 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5987 return map_bound(map
, type
, pos
, value
, 1);
5990 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5991 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5993 return isl_map_lower_bound(set
, type
, pos
, value
);
5996 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5997 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5999 return isl_map_upper_bound(set
, type
, pos
, value
);
6002 /* Force the values of the variable at position "pos" of type "type" of "set"
6003 * to be no smaller than "value".
6005 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6006 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6010 if (!isl_val_is_int(value
))
6011 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6012 "expecting integer value", goto error
);
6013 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6014 isl_val_free(value
);
6017 isl_val_free(value
);
6022 /* Force the values of the variable at position "pos" of type "type" of "set"
6023 * to be no greater than "value".
6025 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6026 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6030 if (!isl_val_is_int(value
))
6031 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6032 "expecting integer value", goto error
);
6033 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6034 isl_val_free(value
);
6037 isl_val_free(value
);
6042 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
6047 set
= isl_set_cow(set
);
6051 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
6052 for (i
= 0; i
< set
->n
; ++i
) {
6053 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
6063 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
6067 map
= isl_map_cow(map
);
6071 map
->dim
= isl_space_reverse(map
->dim
);
6074 for (i
= 0; i
< map
->n
; ++i
) {
6075 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6079 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6086 static struct isl_map
*isl_basic_map_partial_lexopt(
6087 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
6088 struct isl_set
**empty
, int max
)
6090 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
6093 struct isl_map
*isl_basic_map_partial_lexmax(
6094 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
6095 struct isl_set
**empty
)
6097 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
6100 struct isl_map
*isl_basic_map_partial_lexmin(
6101 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
6102 struct isl_set
**empty
)
6104 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
6107 struct isl_set
*isl_basic_set_partial_lexmin(
6108 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
6109 struct isl_set
**empty
)
6111 return (struct isl_set
*)
6112 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
6116 struct isl_set
*isl_basic_set_partial_lexmax(
6117 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
6118 struct isl_set
**empty
)
6120 return (struct isl_set
*)
6121 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
6125 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
6126 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
6127 __isl_give isl_set
**empty
)
6129 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
6132 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
6133 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
6134 __isl_give isl_set
**empty
)
6136 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
6139 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
6140 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
6141 __isl_give isl_set
**empty
)
6143 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
6146 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
6147 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
6148 __isl_give isl_set
**empty
)
6150 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
6153 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
6154 __isl_take isl_basic_map
*bmap
, int max
)
6156 isl_basic_set
*dom
= NULL
;
6157 isl_space
*dom_space
;
6161 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
6162 dom
= isl_basic_set_universe(dom_space
);
6163 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
6165 isl_basic_map_free(bmap
);
6169 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
6170 __isl_take isl_basic_map
*bmap
)
6172 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
6176 #define TYPE isl_pw_multi_aff
6178 #define SUFFIX _pw_multi_aff
6180 #define EMPTY isl_pw_multi_aff_empty
6182 #define ADD isl_pw_multi_aff_union_add
6183 #include "isl_map_lexopt_templ.c"
6185 /* Given a map "map", compute the lexicographically minimal
6186 * (or maximal) image element for each domain element in dom,
6187 * in the form of an isl_pw_multi_aff.
6188 * Set *empty to those elements in dom that do not have an image element.
6190 * We first compute the lexicographically minimal or maximal element
6191 * in the first basic map. This results in a partial solution "res"
6192 * and a subset "todo" of dom that still need to be handled.
6193 * We then consider each of the remaining maps in "map" and successively
6194 * update both "res" and "todo".
6196 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6197 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6198 __isl_give isl_set
**empty
, int max
)
6201 isl_pw_multi_aff
*res
;
6207 if (isl_map_plain_is_empty(map
)) {
6212 return isl_pw_multi_aff_from_map(map
);
6215 res
= basic_map_partial_lexopt_pw_multi_aff(
6216 isl_basic_map_copy(map
->p
[0]),
6217 isl_set_copy(dom
), &todo
, max
);
6219 for (i
= 1; i
< map
->n
; ++i
) {
6220 isl_pw_multi_aff
*res_i
;
6223 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6224 isl_basic_map_copy(map
->p
[i
]),
6225 isl_set_copy(dom
), &todo_i
, max
);
6228 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6230 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6232 todo
= isl_set_intersect(todo
, todo_i
);
6253 #define TYPE isl_map
6257 #define EMPTY isl_map_empty
6259 #define ADD isl_map_union_disjoint
6260 #include "isl_map_lexopt_templ.c"
6262 /* Given a map "map", compute the lexicographically minimal
6263 * (or maximal) image element for each domain element in dom.
6264 * Set *empty to those elements in dom that do not have an image element.
6266 * We first compute the lexicographically minimal or maximal element
6267 * in the first basic map. This results in a partial solution "res"
6268 * and a subset "todo" of dom that still need to be handled.
6269 * We then consider each of the remaining maps in "map" and successively
6270 * update both "res" and "todo".
6272 * Let res^k and todo^k be the results after k steps and let i = k + 1.
6273 * Assume we are computing the lexicographical maximum.
6274 * We first compute the lexicographically maximal element in basic map i.
6275 * This results in a partial solution res_i and a subset todo_i.
6276 * Then we combine these results with those obtain for the first k basic maps
6277 * to obtain a result that is valid for the first k+1 basic maps.
6278 * In particular, the set where there is no solution is the set where
6279 * there is no solution for the first k basic maps and also no solution
6280 * for the ith basic map, i.e.,
6282 * todo^i = todo^k * todo_i
6284 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
6285 * solutions, arbitrarily breaking ties in favor of res^k.
6286 * That is, when res^k(a) >= res_i(a), we pick res^k and
6287 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
6288 * the lexicographic order.)
6289 * In practice, we compute
6291 * res^k * (res_i . "<=")
6295 * res_i * (res^k . "<")
6297 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
6298 * where only one of res^k and res_i provides a solution and we simply pick
6305 * Note that we only compute these intersections when dom(res^k) intersects
6306 * dom(res_i). Otherwise, the only effect of these intersections is to
6307 * potentially break up res^k and res_i into smaller pieces.
6308 * We want to avoid such splintering as much as possible.
6309 * In fact, an earlier implementation of this function would look for
6310 * better results in the domain of res^k and for extra results in todo^k,
6311 * but this would always result in a splintering according to todo^k,
6312 * even when the domain of basic map i is disjoint from the domains of
6313 * the previous basic maps.
6315 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6316 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6317 __isl_give isl_set
**empty
, int max
)
6320 struct isl_map
*res
;
6321 struct isl_set
*todo
;
6326 if (isl_map_plain_is_empty(map
)) {
6334 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6335 isl_set_copy(dom
), &todo
, max
);
6337 for (i
= 1; i
< map
->n
; ++i
) {
6341 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
6343 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
6344 isl_set_copy(dom
), &todo_i
, max
);
6347 lt
= isl_map_lex_lt(isl_space_copy(dim
));
6348 le
= isl_map_lex_le(dim
);
6350 lt
= isl_map_lex_gt(isl_space_copy(dim
));
6351 le
= isl_map_lex_ge(dim
);
6353 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
6354 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
6355 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6356 le
= isl_map_intersect(le
, isl_map_copy(res
));
6358 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6359 res
= isl_map_intersect_domain(res
,
6360 isl_set_copy(todo_i
));
6361 res_i
= isl_map_intersect_domain(res_i
,
6362 isl_set_copy(todo
));
6365 res
= isl_map_union_disjoint(res
, res_i
);
6366 res
= isl_map_union_disjoint(res
, lt
);
6367 res
= isl_map_union_disjoint(res
, le
);
6369 todo
= isl_set_intersect(todo
, todo_i
);
6389 __isl_give isl_map
*isl_map_partial_lexmax(
6390 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6391 __isl_give isl_set
**empty
)
6393 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6396 __isl_give isl_map
*isl_map_partial_lexmin(
6397 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6398 __isl_give isl_set
**empty
)
6400 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6403 __isl_give isl_set
*isl_set_partial_lexmin(
6404 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6405 __isl_give isl_set
**empty
)
6407 return (struct isl_set
*)
6408 isl_map_partial_lexmin((struct isl_map
*)set
,
6412 __isl_give isl_set
*isl_set_partial_lexmax(
6413 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6414 __isl_give isl_set
**empty
)
6416 return (struct isl_set
*)
6417 isl_map_partial_lexmax((struct isl_map
*)set
,
6421 /* Compute the lexicographic minimum (or maximum if "max" is set)
6422 * of "bmap" over its domain.
6424 * Since we are not interested in the part of the domain space where
6425 * there is no solution, we initialize the domain to those constraints
6426 * of "bmap" that only involve the parameters and the input dimensions.
6427 * This relieves the parametric programming engine from detecting those
6428 * inequalities and transferring them to the context. More importantly,
6429 * it ensures that those inequalities are transferred first and not
6430 * intermixed with inequalities that actually split the domain.
6432 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6436 isl_basic_map
*copy
;
6439 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6440 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6441 copy
= isl_basic_map_copy(bmap
);
6442 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6443 isl_dim_div
, 0, n_div
);
6444 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6445 isl_dim_out
, 0, n_out
);
6446 dom
= isl_basic_map_domain(copy
);
6447 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6450 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6452 return isl_basic_map_lexopt(bmap
, 0);
6455 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6457 return isl_basic_map_lexopt(bmap
, 1);
6460 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6462 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6465 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6467 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6470 /* Extract the first and only affine expression from list
6471 * and then add it to *pwaff with the given dom.
6472 * This domain is known to be disjoint from other domains
6473 * because of the way isl_basic_map_foreach_lexmax works.
6475 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6476 __isl_take isl_aff_list
*list
, void *user
)
6478 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6480 isl_pw_aff
**pwaff
= user
;
6481 isl_pw_aff
*pwaff_i
;
6485 if (isl_aff_list_n_aff(list
) != 1)
6486 isl_die(ctx
, isl_error_internal
,
6487 "expecting single element list", goto error
);
6489 aff
= isl_aff_list_get_aff(list
, 0);
6490 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6492 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6494 isl_aff_list_free(list
);
6498 isl_basic_set_free(dom
);
6499 isl_aff_list_free(list
);
6503 /* Given a basic map with one output dimension, compute the minimum or
6504 * maximum of that dimension as an isl_pw_aff.
6506 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6507 * call update_dim_opt on each leaf of the result.
6509 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6512 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6516 dim
= isl_space_from_domain(isl_space_domain(dim
));
6517 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6518 pwaff
= isl_pw_aff_empty(dim
);
6520 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6522 return isl_pw_aff_free(pwaff
);
6527 /* Compute the minimum or maximum of the given output dimension
6528 * as a function of the parameters and the input dimensions,
6529 * but independently of the other output dimensions.
6531 * We first project out the other output dimension and then compute
6532 * the "lexicographic" maximum in each basic map, combining the results
6533 * using isl_pw_aff_union_max.
6535 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6542 n_out
= isl_map_dim(map
, isl_dim_out
);
6543 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6544 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6549 isl_space
*dim
= isl_map_get_space(map
);
6551 return isl_pw_aff_empty(dim
);
6554 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6555 for (i
= 1; i
< map
->n
; ++i
) {
6556 isl_pw_aff
*pwaff_i
;
6558 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6559 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6567 /* Compute the maximum of the given output dimension as a function of the
6568 * parameters and input dimensions, but independently of
6569 * the other output dimensions.
6571 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6573 return map_dim_opt(map
, pos
, 1);
6576 /* Compute the minimum or maximum of the given set dimension
6577 * as a function of the parameters,
6578 * but independently of the other set dimensions.
6580 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6583 return map_dim_opt(set
, pos
, max
);
6586 /* Compute the maximum of the given set dimension as a function of the
6587 * parameters, but independently of the other set dimensions.
6589 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6591 return set_dim_opt(set
, pos
, 1);
6594 /* Compute the minimum of the given set dimension as a function of the
6595 * parameters, but independently of the other set dimensions.
6597 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6599 return set_dim_opt(set
, pos
, 0);
6602 /* Apply a preimage specified by "mat" on the parameters of "bset".
6603 * bset is assumed to have only parameters and divs.
6605 static struct isl_basic_set
*basic_set_parameter_preimage(
6606 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6613 bset
->dim
= isl_space_cow(bset
->dim
);
6617 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6619 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6621 bset
->dim
->nparam
= 0;
6622 bset
->dim
->n_out
= nparam
;
6623 bset
= isl_basic_set_preimage(bset
, mat
);
6625 bset
->dim
->nparam
= bset
->dim
->n_out
;
6626 bset
->dim
->n_out
= 0;
6631 isl_basic_set_free(bset
);
6635 /* Apply a preimage specified by "mat" on the parameters of "set".
6636 * set is assumed to have only parameters and divs.
6638 static struct isl_set
*set_parameter_preimage(
6639 struct isl_set
*set
, struct isl_mat
*mat
)
6641 isl_space
*dim
= NULL
;
6647 dim
= isl_space_copy(set
->dim
);
6648 dim
= isl_space_cow(dim
);
6652 nparam
= isl_set_dim(set
, isl_dim_param
);
6654 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6657 dim
->n_out
= nparam
;
6658 isl_set_reset_space(set
, dim
);
6659 set
= isl_set_preimage(set
, mat
);
6662 dim
= isl_space_copy(set
->dim
);
6663 dim
= isl_space_cow(dim
);
6666 dim
->nparam
= dim
->n_out
;
6668 isl_set_reset_space(set
, dim
);
6671 isl_space_free(dim
);
6678 /* Intersect the basic set "bset" with the affine space specified by the
6679 * equalities in "eq".
6681 static struct isl_basic_set
*basic_set_append_equalities(
6682 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6690 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6695 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6696 for (i
= 0; i
< eq
->n_row
; ++i
) {
6697 k
= isl_basic_set_alloc_equality(bset
);
6700 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6701 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6705 bset
= isl_basic_set_gauss(bset
, NULL
);
6706 bset
= isl_basic_set_finalize(bset
);
6711 isl_basic_set_free(bset
);
6715 /* Intersect the set "set" with the affine space specified by the
6716 * equalities in "eq".
6718 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6726 for (i
= 0; i
< set
->n
; ++i
) {
6727 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6740 /* Given a basic set "bset" that only involves parameters and existentially
6741 * quantified variables, return the index of the first equality
6742 * that only involves parameters. If there is no such equality then
6743 * return bset->n_eq.
6745 * This function assumes that isl_basic_set_gauss has been called on "bset".
6747 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6750 unsigned nparam
, n_div
;
6755 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6756 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6758 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6759 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6766 /* Compute an explicit representation for the existentially quantified
6767 * variables in "bset" by computing the "minimal value" of the set
6768 * variables. Since there are no set variables, the computation of
6769 * the minimal value essentially computes an explicit representation
6770 * of the non-empty part(s) of "bset".
6772 * The input only involves parameters and existentially quantified variables.
6773 * All equalities among parameters have been removed.
6775 * Since the existentially quantified variables in the result are in general
6776 * going to be different from those in the input, we first replace
6777 * them by the minimal number of variables based on their equalities.
6778 * This should simplify the parametric integer programming.
6780 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6782 isl_morph
*morph1
, *morph2
;
6788 if (bset
->n_eq
== 0)
6789 return isl_basic_set_lexmin(bset
);
6791 morph1
= isl_basic_set_parameter_compression(bset
);
6792 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6793 bset
= isl_basic_set_lift(bset
);
6794 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6795 bset
= isl_morph_basic_set(morph2
, bset
);
6796 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6797 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6799 set
= isl_basic_set_lexmin(bset
);
6801 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6806 /* Project the given basic set onto its parameter domain, possibly introducing
6807 * new, explicit, existential variables in the constraints.
6808 * The input has parameters and (possibly implicit) existential variables.
6809 * The output has the same parameters, but only
6810 * explicit existentially quantified variables.
6812 * The actual projection is performed by pip, but pip doesn't seem
6813 * to like equalities very much, so we first remove the equalities
6814 * among the parameters by performing a variable compression on
6815 * the parameters. Afterward, an inverse transformation is performed
6816 * and the equalities among the parameters are inserted back in.
6818 * The variable compression on the parameters may uncover additional
6819 * equalities that were only implicit before. We therefore check
6820 * if there are any new parameter equalities in the result and
6821 * if so recurse. The removal of parameter equalities is required
6822 * for the parameter compression performed by base_compute_divs.
6824 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6828 struct isl_mat
*T
, *T2
;
6829 struct isl_set
*set
;
6832 bset
= isl_basic_set_cow(bset
);
6836 if (bset
->n_eq
== 0)
6837 return base_compute_divs(bset
);
6839 bset
= isl_basic_set_gauss(bset
, NULL
);
6842 if (isl_basic_set_plain_is_empty(bset
))
6843 return isl_set_from_basic_set(bset
);
6845 i
= first_parameter_equality(bset
);
6846 if (i
== bset
->n_eq
)
6847 return base_compute_divs(bset
);
6849 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6850 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6852 eq
= isl_mat_cow(eq
);
6853 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6854 if (T
&& T
->n_col
== 0) {
6858 bset
= isl_basic_set_set_to_empty(bset
);
6859 return isl_set_from_basic_set(bset
);
6861 bset
= basic_set_parameter_preimage(bset
, T
);
6863 i
= first_parameter_equality(bset
);
6866 else if (i
== bset
->n_eq
)
6867 set
= base_compute_divs(bset
);
6869 set
= parameter_compute_divs(bset
);
6870 set
= set_parameter_preimage(set
, T2
);
6871 set
= set_append_equalities(set
, eq
);
6875 /* Insert the divs from "ls" before those of "bmap".
6877 * The number of columns is not changed, which means that the last
6878 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6879 * The caller is responsible for removing the same number of dimensions
6880 * from the space of "bmap".
6882 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6883 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6889 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6893 old_n_div
= bmap
->n_div
;
6894 bmap
= insert_div_rows(bmap
, n_div
);
6898 for (i
= 0; i
< n_div
; ++i
) {
6899 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6900 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6906 /* Replace the space of "bmap" by the space and divs of "ls".
6908 * If "ls" has any divs, then we simplify the result since we may
6909 * have discovered some additional equalities that could simplify
6910 * the div expressions.
6912 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6913 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6917 bmap
= isl_basic_map_cow(bmap
);
6921 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6922 bmap
= insert_divs_from_local_space(bmap
, ls
);
6926 isl_space_free(bmap
->dim
);
6927 bmap
->dim
= isl_local_space_get_space(ls
);
6931 isl_local_space_free(ls
);
6933 bmap
= isl_basic_map_simplify(bmap
);
6934 bmap
= isl_basic_map_finalize(bmap
);
6937 isl_basic_map_free(bmap
);
6938 isl_local_space_free(ls
);
6942 /* Replace the space of "map" by the space and divs of "ls".
6944 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6945 __isl_take isl_local_space
*ls
)
6949 map
= isl_map_cow(map
);
6953 for (i
= 0; i
< map
->n
; ++i
) {
6954 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6955 isl_local_space_copy(ls
));
6959 isl_space_free(map
->dim
);
6960 map
->dim
= isl_local_space_get_space(ls
);
6964 isl_local_space_free(ls
);
6967 isl_local_space_free(ls
);
6972 /* Compute an explicit representation for the existentially
6973 * quantified variables for which do not know any explicit representation yet.
6975 * We first sort the existentially quantified variables so that the
6976 * existentially quantified variables for which we already have an explicit
6977 * representation are placed before those for which we do not.
6978 * The input dimensions, the output dimensions and the existentially
6979 * quantified variables for which we already have an explicit
6980 * representation are then turned into parameters.
6981 * compute_divs returns a map with the same parameters and
6982 * no input or output dimensions and the dimension specification
6983 * is reset to that of the input, including the existentially quantified
6984 * variables for which we already had an explicit representation.
6986 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6988 struct isl_basic_set
*bset
;
6989 struct isl_set
*set
;
6990 struct isl_map
*map
;
6992 isl_local_space
*ls
;
6999 bmap
= isl_basic_map_sort_divs(bmap
);
7000 bmap
= isl_basic_map_cow(bmap
);
7004 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
7005 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
7008 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7009 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7010 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7011 dim
= isl_space_set_alloc(bmap
->ctx
,
7012 nparam
+ n_in
+ n_out
+ n_known
, 0);
7016 ls
= isl_basic_map_get_local_space(bmap
);
7017 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7018 n_known
, bmap
->n_div
- n_known
);
7020 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7021 swap_div(bmap
, i
- n_known
, i
);
7022 bmap
->n_div
-= n_known
;
7023 bmap
->extra
-= n_known
;
7025 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7026 bset
= (struct isl_basic_set
*)bmap
;
7028 set
= parameter_compute_divs(bset
);
7029 map
= (struct isl_map
*)set
;
7030 map
= replace_space_by_local_space(map
, ls
);
7034 isl_basic_map_free(bmap
);
7038 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7046 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7047 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7048 if (isl_int_is_zero(bmap
->div
[i
][0]))
7050 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
7056 static int map_divs_known(__isl_keep isl_map
*map
)
7063 for (i
= 0; i
< map
->n
; ++i
) {
7064 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7072 /* If bmap contains any unknown divs, then compute explicit
7073 * expressions for them. However, this computation may be
7074 * quite expensive, so first try to remove divs that aren't
7077 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
7080 struct isl_map
*map
;
7082 known
= isl_basic_map_divs_known(bmap
);
7086 return isl_map_from_basic_map(bmap
);
7088 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7090 known
= isl_basic_map_divs_known(bmap
);
7094 return isl_map_from_basic_map(bmap
);
7096 map
= compute_divs(bmap
);
7099 isl_basic_map_free(bmap
);
7103 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
7107 struct isl_map
*res
;
7114 known
= map_divs_known(map
);
7122 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7123 for (i
= 1 ; i
< map
->n
; ++i
) {
7125 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7126 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7127 res
= isl_map_union_disjoint(res
, r2
);
7129 res
= isl_map_union(res
, r2
);
7136 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7138 return (struct isl_set
*)
7139 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
7142 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7144 return (struct isl_set
*)
7145 isl_map_compute_divs((struct isl_map
*)set
);
7148 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7151 struct isl_set
*set
;
7156 map
= isl_map_cow(map
);
7160 set
= (struct isl_set
*)map
;
7161 set
->dim
= isl_space_domain(set
->dim
);
7164 for (i
= 0; i
< map
->n
; ++i
) {
7165 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7169 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7170 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7177 /* Return the union of "map1" and "map2", where we assume for now that
7178 * "map1" and "map2" are disjoint. Note that the basic maps inside
7179 * "map1" or "map2" may not be disjoint from each other.
7180 * Also note that this function is also called from isl_map_union,
7181 * which takes care of handling the situation where "map1" and "map2"
7182 * may not be disjoint.
7184 * If one of the inputs is empty, we can simply return the other input.
7185 * Similarly, if one of the inputs is universal, then it is equal to the union.
7187 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7188 __isl_take isl_map
*map2
)
7192 struct isl_map
*map
= NULL
;
7198 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7199 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7200 "spaces don't match", goto error
);
7211 is_universe
= isl_map_plain_is_universe(map1
);
7212 if (is_universe
< 0)
7219 is_universe
= isl_map_plain_is_universe(map2
);
7220 if (is_universe
< 0)
7227 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7228 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7229 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7231 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7232 map1
->n
+ map2
->n
, flags
);
7235 for (i
= 0; i
< map1
->n
; ++i
) {
7236 map
= isl_map_add_basic_map(map
,
7237 isl_basic_map_copy(map1
->p
[i
]));
7241 for (i
= 0; i
< map2
->n
; ++i
) {
7242 map
= isl_map_add_basic_map(map
,
7243 isl_basic_map_copy(map2
->p
[i
]));
7257 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7258 * guaranteed to be disjoint by the caller.
7260 * Note that this functions is called from within isl_map_make_disjoint,
7261 * so we have to be careful not to touch the constraints of the inputs
7264 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7265 __isl_take isl_map
*map2
)
7267 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7270 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7271 * not be disjoint. The parameters are assumed to have been aligned.
7273 * We currently simply call map_union_disjoint, the internal operation
7274 * of which does not really depend on the inputs being disjoint.
7275 * If the result contains more than one basic map, then we clear
7276 * the disjoint flag since the result may contain basic maps from
7277 * both inputs and these are not guaranteed to be disjoint.
7279 * As a special case, if "map1" and "map2" are obviously equal,
7280 * then we simply return "map1".
7282 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7283 __isl_take isl_map
*map2
)
7290 equal
= isl_map_plain_is_equal(map1
, map2
);
7298 map1
= map_union_disjoint(map1
, map2
);
7302 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7310 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7313 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7314 __isl_take isl_map
*map2
)
7316 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7319 struct isl_set
*isl_set_union_disjoint(
7320 struct isl_set
*set1
, struct isl_set
*set2
)
7322 return (struct isl_set
*)
7323 isl_map_union_disjoint(
7324 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
7327 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7329 return (struct isl_set
*)
7330 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7333 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7336 * "map" and "set" are assumed to be compatible and non-NULL.
7338 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7339 __isl_take isl_set
*set
,
7340 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7341 __isl_take isl_basic_set
*bset
))
7344 struct isl_map
*result
;
7347 if (isl_set_plain_is_universe(set
)) {
7352 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7353 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7354 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7356 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7357 map
->n
* set
->n
, flags
);
7358 for (i
= 0; result
&& i
< map
->n
; ++i
)
7359 for (j
= 0; j
< set
->n
; ++j
) {
7360 result
= isl_map_add_basic_map(result
,
7361 fn(isl_basic_map_copy(map
->p
[i
]),
7362 isl_basic_set_copy(set
->p
[j
])));
7372 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7373 __isl_take isl_set
*set
)
7378 if (!isl_map_compatible_range(map
, set
))
7379 isl_die(set
->ctx
, isl_error_invalid
,
7380 "incompatible spaces", goto error
);
7382 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7389 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7390 __isl_take isl_set
*set
)
7392 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7395 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7396 __isl_take isl_set
*set
)
7401 if (!isl_map_compatible_domain(map
, set
))
7402 isl_die(set
->ctx
, isl_error_invalid
,
7403 "incompatible spaces", goto error
);
7405 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7412 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7413 __isl_take isl_set
*set
)
7415 return isl_map_align_params_map_map_and(map
, set
,
7416 &map_intersect_domain
);
7419 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7420 __isl_take isl_map
*map2
)
7424 map1
= isl_map_reverse(map1
);
7425 map1
= isl_map_apply_range(map1
, map2
);
7426 return isl_map_reverse(map1
);
7433 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7434 __isl_take isl_map
*map2
)
7436 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7439 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7440 __isl_take isl_map
*map2
)
7442 isl_space
*dim_result
;
7443 struct isl_map
*result
;
7449 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7450 isl_space_copy(map2
->dim
));
7452 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7455 for (i
= 0; i
< map1
->n
; ++i
)
7456 for (j
= 0; j
< map2
->n
; ++j
) {
7457 result
= isl_map_add_basic_map(result
,
7458 isl_basic_map_apply_range(
7459 isl_basic_map_copy(map1
->p
[i
]),
7460 isl_basic_map_copy(map2
->p
[j
])));
7466 if (result
&& result
->n
<= 1)
7467 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7475 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7476 __isl_take isl_map
*map2
)
7478 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7482 * returns range - domain
7484 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7486 isl_space
*dims
, *target_dim
;
7487 struct isl_basic_set
*bset
;
7494 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7495 bmap
->dim
, isl_dim_out
),
7497 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7498 dim
= isl_basic_map_n_in(bmap
);
7499 nparam
= isl_basic_map_n_param(bmap
);
7500 bset
= isl_basic_set_from_basic_map(bmap
);
7501 bset
= isl_basic_set_cow(bset
);
7502 dims
= isl_basic_set_get_space(bset
);
7503 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7504 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7505 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7506 for (i
= 0; i
< dim
; ++i
) {
7507 int j
= isl_basic_map_alloc_equality(
7508 (struct isl_basic_map
*)bset
);
7510 bset
= isl_basic_set_free(bset
);
7513 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7514 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7515 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7516 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7518 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7519 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7522 isl_basic_map_free(bmap
);
7527 * returns range - domain
7529 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7533 struct isl_set
*result
;
7538 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7539 map
->dim
, isl_dim_out
),
7541 dim
= isl_map_get_space(map
);
7542 dim
= isl_space_domain(dim
);
7543 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7546 for (i
= 0; i
< map
->n
; ++i
)
7547 result
= isl_set_add_basic_set(result
,
7548 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7557 * returns [domain -> range] -> range - domain
7559 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7560 __isl_take isl_basic_map
*bmap
)
7564 isl_basic_map
*domain
;
7568 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7569 bmap
->dim
, isl_dim_out
))
7570 isl_die(bmap
->ctx
, isl_error_invalid
,
7571 "domain and range don't match", goto error
);
7573 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7574 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7576 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7577 domain
= isl_basic_map_universe(dim
);
7579 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7580 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7581 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7583 total
= isl_basic_map_total_dim(bmap
);
7585 for (i
= 0; i
< n
; ++i
) {
7586 k
= isl_basic_map_alloc_equality(bmap
);
7589 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7590 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7591 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7592 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7595 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7596 return isl_basic_map_finalize(bmap
);
7598 isl_basic_map_free(bmap
);
7603 * returns [domain -> range] -> range - domain
7605 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7608 isl_space
*domain_dim
;
7613 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7614 map
->dim
, isl_dim_out
))
7615 isl_die(map
->ctx
, isl_error_invalid
,
7616 "domain and range don't match", goto error
);
7618 map
= isl_map_cow(map
);
7622 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7623 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7624 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7627 for (i
= 0; i
< map
->n
; ++i
) {
7628 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7632 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7639 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7641 struct isl_basic_map
*bmap
;
7649 nparam
= dims
->nparam
;
7651 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7655 for (i
= 0; i
< dim
; ++i
) {
7656 int j
= isl_basic_map_alloc_equality(bmap
);
7659 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7660 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7661 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7663 return isl_basic_map_finalize(bmap
);
7665 isl_basic_map_free(bmap
);
7669 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7673 if (dim
->n_in
!= dim
->n_out
)
7674 isl_die(dim
->ctx
, isl_error_invalid
,
7675 "number of input and output dimensions needs to be "
7676 "the same", goto error
);
7677 return basic_map_identity(dim
);
7679 isl_space_free(dim
);
7683 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7685 if (!model
|| !model
->dim
)
7687 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7690 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7692 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7695 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7697 if (!model
|| !model
->dim
)
7699 return isl_map_identity(isl_space_copy(model
->dim
));
7702 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7704 if (!model
|| !model
->dim
)
7706 return isl_map_identity(isl_space_copy(model
->dim
));
7709 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7711 isl_space
*dim
= isl_set_get_space(set
);
7713 id
= isl_map_identity(isl_space_map_from_set(dim
));
7714 return isl_map_intersect_range(id
, set
);
7717 /* Construct a basic set with all set dimensions having only non-negative
7720 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7721 __isl_take isl_space
*space
)
7726 struct isl_basic_set
*bset
;
7730 nparam
= space
->nparam
;
7732 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7735 for (i
= 0; i
< dim
; ++i
) {
7736 int k
= isl_basic_set_alloc_inequality(bset
);
7739 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7740 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7744 isl_basic_set_free(bset
);
7748 /* Construct the half-space x_pos >= 0.
7750 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7754 isl_basic_set
*nonneg
;
7756 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7757 k
= isl_basic_set_alloc_inequality(nonneg
);
7760 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7761 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7763 return isl_basic_set_finalize(nonneg
);
7765 isl_basic_set_free(nonneg
);
7769 /* Construct the half-space x_pos <= -1.
7771 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7776 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7777 k
= isl_basic_set_alloc_inequality(neg
);
7780 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7781 isl_int_set_si(neg
->ineq
[k
][0], -1);
7782 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7784 return isl_basic_set_finalize(neg
);
7786 isl_basic_set_free(neg
);
7790 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7791 enum isl_dim_type type
, unsigned first
, unsigned n
)
7794 isl_basic_set
*nonneg
;
7802 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7804 for (i
= 0; i
< n
; ++i
) {
7805 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7806 pos(set
->dim
, type
) + first
+ i
);
7807 neg
= neg_halfspace(isl_set_get_space(set
),
7808 pos(set
->dim
, type
) + first
+ i
);
7810 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7819 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7820 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7827 if (isl_set_plain_is_empty(set
)) {
7832 return fn(set
, signs
, user
);
7835 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7837 half
= isl_set_intersect(half
, isl_set_copy(set
));
7838 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7842 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7844 half
= isl_set_intersect(half
, set
);
7845 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7851 /* Call "fn" on the intersections of "set" with each of the orthants
7852 * (except for obviously empty intersections). The orthant is identified
7853 * by the signs array, with each entry having value 1 or -1 according
7854 * to the sign of the corresponding variable.
7856 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7857 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7867 if (isl_set_plain_is_empty(set
))
7870 nparam
= isl_set_dim(set
, isl_dim_param
);
7871 nvar
= isl_set_dim(set
, isl_dim_set
);
7873 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7875 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7883 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7885 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7888 int isl_basic_map_is_subset(
7889 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7892 struct isl_map
*map1
;
7893 struct isl_map
*map2
;
7895 if (!bmap1
|| !bmap2
)
7898 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7899 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7901 is_subset
= isl_map_is_subset(map1
, map2
);
7909 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7910 __isl_keep isl_basic_set
*bset2
)
7912 return isl_basic_map_is_subset(bset1
, bset2
);
7915 int isl_basic_map_is_equal(
7916 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7920 if (!bmap1
|| !bmap2
)
7922 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7925 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7929 int isl_basic_set_is_equal(
7930 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7932 return isl_basic_map_is_equal(
7933 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7936 int isl_map_is_empty(struct isl_map
*map
)
7943 for (i
= 0; i
< map
->n
; ++i
) {
7944 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7953 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7955 return map
? map
->n
== 0 : -1;
7958 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7960 return isl_map_plain_is_empty(map
);
7963 int isl_set_plain_is_empty(struct isl_set
*set
)
7965 return set
? set
->n
== 0 : -1;
7968 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7970 return isl_set_plain_is_empty(set
);
7973 int isl_set_is_empty(struct isl_set
*set
)
7975 return isl_map_is_empty((struct isl_map
*)set
);
7978 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7983 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7986 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7991 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7994 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8000 is_subset
= isl_map_is_subset(map1
, map2
);
8003 is_subset
= isl_map_is_subset(map2
, map1
);
8007 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8009 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8012 int isl_basic_map_is_strict_subset(
8013 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8017 if (!bmap1
|| !bmap2
)
8019 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8022 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8023 if (is_subset
== -1)
8028 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
8034 is_subset
= isl_map_is_subset(map1
, map2
);
8037 is_subset
= isl_map_is_subset(map2
, map1
);
8038 if (is_subset
== -1)
8043 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8045 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
8048 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
8052 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8055 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
8059 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
8062 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8069 for (i
= 0; i
< map
->n
; ++i
) {
8070 int r
= isl_basic_map_is_universe(map
->p
[i
]);
8078 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8080 return isl_map_plain_is_universe((isl_map
*) set
);
8083 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
8085 return isl_set_plain_is_universe(set
);
8088 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
8090 struct isl_basic_set
*bset
= NULL
;
8091 struct isl_vec
*sample
= NULL
;
8098 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8101 if (isl_basic_map_is_universe(bmap
))
8104 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8105 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8106 copy
= isl_basic_map_remove_redundancies(copy
);
8107 empty
= isl_basic_map_plain_is_empty(copy
);
8108 isl_basic_map_free(copy
);
8112 total
= 1 + isl_basic_map_total_dim(bmap
);
8113 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
8114 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
8120 isl_vec_free(bmap
->sample
);
8121 bmap
->sample
= NULL
;
8122 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8125 sample
= isl_basic_set_sample_vec(bset
);
8128 empty
= sample
->size
== 0;
8129 isl_vec_free(bmap
->sample
);
8130 bmap
->sample
= sample
;
8132 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8137 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8141 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8144 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
8146 return isl_basic_map_plain_is_empty(bmap
);
8149 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8153 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8156 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
8158 return isl_basic_set_plain_is_empty(bset
);
8161 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
8163 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
8166 struct isl_map
*isl_basic_map_union(
8167 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8169 struct isl_map
*map
;
8170 if (!bmap1
|| !bmap2
)
8173 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8175 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8178 map
= isl_map_add_basic_map(map
, bmap1
);
8179 map
= isl_map_add_basic_map(map
, bmap2
);
8182 isl_basic_map_free(bmap1
);
8183 isl_basic_map_free(bmap2
);
8187 struct isl_set
*isl_basic_set_union(
8188 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8190 return (struct isl_set
*)isl_basic_map_union(
8191 (struct isl_basic_map
*)bset1
,
8192 (struct isl_basic_map
*)bset2
);
8195 /* Order divs such that any div only depends on previous divs */
8196 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
8204 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8206 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8208 if (isl_int_is_zero(bmap
->div
[i
][0]))
8210 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8214 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8220 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8222 return (struct isl_basic_set
*)
8223 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
8226 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8233 for (i
= 0; i
< map
->n
; ++i
) {
8234 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8245 /* Apply the expansion computed by isl_merge_divs.
8246 * The expansion itself is given by "exp" while the resulting
8247 * list of divs is given by "div".
8249 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8250 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8255 bset
= isl_basic_set_cow(bset
);
8259 if (div
->n_row
< bset
->n_div
)
8260 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8261 "not an expansion", goto error
);
8263 n_div
= bset
->n_div
;
8264 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
8265 div
->n_row
- n_div
, 0,
8266 2 * (div
->n_row
- n_div
));
8268 for (i
= n_div
; i
< div
->n_row
; ++i
)
8269 if (isl_basic_set_alloc_div(bset
) < 0)
8273 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
8274 if (j
>= 0 && exp
[j
] == i
) {
8276 isl_basic_map_swap_div(bset
, i
, j
);
8279 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
8280 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
8288 isl_basic_set_free(bset
);
8293 /* Look for a div in dst that corresponds to the div "div" in src.
8294 * The divs before "div" in src and dst are assumed to be the same.
8296 * Returns -1 if no corresponding div was found and the position
8297 * of the corresponding div in dst otherwise.
8299 static int find_div(struct isl_basic_map
*dst
,
8300 struct isl_basic_map
*src
, unsigned div
)
8304 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8306 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8307 for (i
= div
; i
< dst
->n_div
; ++i
)
8308 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8309 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8310 dst
->n_div
- div
) == -1)
8315 /* Align the divs of "dst" to those of "src", adding divs from "src"
8316 * if needed. That is, make sure that the first src->n_div divs
8317 * of the result are equal to those of src.
8319 * The result is not finalized as by design it will have redundant
8320 * divs if any divs from "src" were copied.
8322 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8323 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8326 int known
, extended
;
8330 return isl_basic_map_free(dst
);
8332 if (src
->n_div
== 0)
8335 known
= isl_basic_map_divs_known(src
);
8337 return isl_basic_map_free(dst
);
8339 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8340 "some src divs are unknown",
8341 return isl_basic_map_free(dst
));
8343 src
= isl_basic_map_order_divs(src
);
8346 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8347 for (i
= 0; i
< src
->n_div
; ++i
) {
8348 int j
= find_div(dst
, src
, i
);
8351 int extra
= src
->n_div
- i
;
8352 dst
= isl_basic_map_cow(dst
);
8355 dst
= isl_basic_map_extend_space(dst
,
8356 isl_space_copy(dst
->dim
),
8357 extra
, 0, 2 * extra
);
8360 j
= isl_basic_map_alloc_div(dst
);
8362 return isl_basic_map_free(dst
);
8363 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8364 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8365 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8366 return isl_basic_map_free(dst
);
8369 isl_basic_map_swap_div(dst
, i
, j
);
8374 struct isl_basic_set
*isl_basic_set_align_divs(
8375 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8377 return (struct isl_basic_set
*)isl_basic_map_align_divs(
8378 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
8381 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8389 map
= isl_map_compute_divs(map
);
8390 map
= isl_map_cow(map
);
8394 for (i
= 1; i
< map
->n
; ++i
)
8395 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8396 for (i
= 1; i
< map
->n
; ++i
) {
8397 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8399 return isl_map_free(map
);
8402 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8406 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8408 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
8411 /* Align the divs of the basic maps in "map" to those
8412 * of the basic maps in "list", as well as to the other basic maps in "map".
8413 * The elements in "list" are assumed to have known divs.
8415 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8416 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8420 map
= isl_map_compute_divs(map
);
8421 map
= isl_map_cow(map
);
8423 return isl_map_free(map
);
8427 n
= isl_basic_map_list_n_basic_map(list
);
8428 for (i
= 0; i
< n
; ++i
) {
8429 isl_basic_map
*bmap
;
8431 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8432 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8433 isl_basic_map_free(bmap
);
8436 return isl_map_free(map
);
8438 return isl_map_align_divs(map
);
8441 /* Align the divs of each element of "list" to those of "bmap".
8442 * Both "bmap" and the elements of "list" are assumed to have known divs.
8444 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8445 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8450 return isl_basic_map_list_free(list
);
8452 n
= isl_basic_map_list_n_basic_map(list
);
8453 for (i
= 0; i
< n
; ++i
) {
8454 isl_basic_map
*bmap_i
;
8456 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8457 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8458 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8464 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8465 __isl_take isl_map
*map
)
8469 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8470 map
= isl_map_intersect_domain(map
, set
);
8471 set
= isl_map_range(map
);
8479 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8480 __isl_take isl_map
*map
)
8482 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8485 /* There is no need to cow as removing empty parts doesn't change
8486 * the meaning of the set.
8488 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8495 for (i
= map
->n
- 1; i
>= 0; --i
)
8496 remove_if_empty(map
, i
);
8501 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8503 return (struct isl_set
*)
8504 isl_map_remove_empty_parts((struct isl_map
*)set
);
8507 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8509 struct isl_basic_map
*bmap
;
8510 if (!map
|| map
->n
== 0)
8512 bmap
= map
->p
[map
->n
-1];
8513 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8514 return isl_basic_map_copy(bmap
);
8517 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8519 return (struct isl_basic_set
*)
8520 isl_map_copy_basic_map((struct isl_map
*)set
);
8523 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8524 __isl_keep isl_basic_map
*bmap
)
8530 for (i
= map
->n
-1; i
>= 0; --i
) {
8531 if (map
->p
[i
] != bmap
)
8533 map
= isl_map_cow(map
);
8536 isl_basic_map_free(map
->p
[i
]);
8537 if (i
!= map
->n
-1) {
8538 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8539 map
->p
[i
] = map
->p
[map
->n
-1];
8550 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8551 struct isl_basic_set
*bset
)
8553 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8554 (struct isl_basic_map
*)bset
);
8557 /* Given two basic sets bset1 and bset2, compute the maximal difference
8558 * between the values of dimension pos in bset1 and those in bset2
8559 * for any common value of the parameters and dimensions preceding pos.
8561 static enum isl_lp_result
basic_set_maximal_difference_at(
8562 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8563 int pos
, isl_int
*opt
)
8566 struct isl_basic_map
*bmap1
= NULL
;
8567 struct isl_basic_map
*bmap2
= NULL
;
8568 struct isl_ctx
*ctx
;
8569 struct isl_vec
*obj
;
8572 unsigned dim1
, dim2
;
8573 enum isl_lp_result res
;
8575 if (!bset1
|| !bset2
)
8576 return isl_lp_error
;
8578 nparam
= isl_basic_set_n_param(bset1
);
8579 dim1
= isl_basic_set_n_dim(bset1
);
8580 dim2
= isl_basic_set_n_dim(bset2
);
8581 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8582 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8583 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8584 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8585 if (!bmap1
|| !bmap2
)
8587 bmap1
= isl_basic_map_cow(bmap1
);
8588 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8589 pos
, (dim1
- pos
) + (dim2
- pos
),
8590 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8591 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8594 total
= isl_basic_map_total_dim(bmap1
);
8596 obj
= isl_vec_alloc(ctx
, 1 + total
);
8599 isl_seq_clr(obj
->block
.data
, 1 + total
);
8600 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8601 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8602 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8604 isl_basic_map_free(bmap1
);
8608 isl_basic_map_free(bmap2
);
8610 isl_basic_map_free(bmap1
);
8611 return isl_lp_error
;
8614 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8615 * for any common value of the parameters and dimensions preceding pos
8616 * in both basic sets, the values of dimension pos in bset1 are
8617 * smaller or larger than those in bset2.
8620 * 1 if bset1 follows bset2
8621 * -1 if bset1 precedes bset2
8622 * 0 if bset1 and bset2 are incomparable
8623 * -2 if some error occurred.
8625 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8626 struct isl_basic_set
*bset2
, int pos
)
8629 enum isl_lp_result res
;
8634 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8636 if (res
== isl_lp_empty
)
8638 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8639 res
== isl_lp_unbounded
)
8641 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8650 /* Given two basic sets bset1 and bset2, check whether
8651 * for any common value of the parameters and dimensions preceding pos
8652 * there is a value of dimension pos in bset1 that is larger
8653 * than a value of the same dimension in bset2.
8656 * 1 if there exists such a pair
8657 * 0 if there is no such pair, but there is a pair of equal values
8659 * -2 if some error occurred.
8661 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8662 __isl_keep isl_basic_set
*bset2
, int pos
)
8665 enum isl_lp_result res
;
8670 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8672 if (res
== isl_lp_empty
)
8674 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8675 res
== isl_lp_unbounded
)
8677 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8679 else if (res
== isl_lp_ok
)
8688 /* Given two sets set1 and set2, check whether
8689 * for any common value of the parameters and dimensions preceding pos
8690 * there is a value of dimension pos in set1 that is larger
8691 * than a value of the same dimension in set2.
8694 * 1 if there exists such a pair
8695 * 0 if there is no such pair, but there is a pair of equal values
8697 * -2 if some error occurred.
8699 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8700 __isl_keep isl_set
*set2
, int pos
)
8708 for (i
= 0; i
< set1
->n
; ++i
)
8709 for (j
= 0; j
< set2
->n
; ++j
) {
8711 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8712 if (f
== 1 || f
== -2)
8721 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8722 unsigned pos
, isl_int
*val
)
8730 total
= isl_basic_map_total_dim(bmap
);
8731 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8732 for (; d
+1 > pos
; --d
)
8733 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8737 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8739 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8741 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8744 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8750 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8751 unsigned pos
, isl_int
*val
)
8763 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8766 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8767 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8768 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8769 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8773 isl_int_set(*val
, v
);
8779 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8780 unsigned pos
, isl_int
*val
)
8782 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8786 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8789 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8792 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8793 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8795 if (pos
>= isl_basic_map_dim(bmap
, type
))
8797 return isl_basic_map_plain_has_fixed_var(bmap
,
8798 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8801 /* If "bmap" obviously lies on a hyperplane where the given dimension
8802 * has a fixed value, then return that value.
8803 * Otherwise return NaN.
8805 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8806 __isl_keep isl_basic_map
*bmap
,
8807 enum isl_dim_type type
, unsigned pos
)
8815 ctx
= isl_basic_map_get_ctx(bmap
);
8816 v
= isl_val_alloc(ctx
);
8819 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8821 return isl_val_free(v
);
8823 isl_int_set_si(v
->d
, 1);
8827 return isl_val_nan(ctx
);
8830 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8831 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8833 if (pos
>= isl_map_dim(map
, type
))
8835 return isl_map_plain_has_fixed_var(map
,
8836 map_offset(map
, type
) - 1 + pos
, val
);
8839 /* If "map" obviously lies on a hyperplane where the given dimension
8840 * has a fixed value, then return that value.
8841 * Otherwise return NaN.
8843 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8844 enum isl_dim_type type
, unsigned pos
)
8852 ctx
= isl_map_get_ctx(map
);
8853 v
= isl_val_alloc(ctx
);
8856 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8858 return isl_val_free(v
);
8860 isl_int_set_si(v
->d
, 1);
8864 return isl_val_nan(ctx
);
8867 /* If "set" obviously lies on a hyperplane where the given dimension
8868 * has a fixed value, then return that value.
8869 * Otherwise return NaN.
8871 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8872 enum isl_dim_type type
, unsigned pos
)
8874 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8877 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8878 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8880 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8883 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8884 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8886 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8889 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8890 * then return this fixed value in *val.
8892 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8893 unsigned dim
, isl_int
*val
)
8895 return isl_basic_set_plain_has_fixed_var(bset
,
8896 isl_basic_set_n_param(bset
) + dim
, val
);
8899 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8900 * then return this fixed value in *val.
8902 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8903 unsigned dim
, isl_int
*val
)
8905 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8908 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8909 unsigned dim
, isl_int
*val
)
8911 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8914 /* Check if input variable in has fixed value and if so and if val is not NULL,
8915 * then return this fixed value in *val.
8917 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8918 unsigned in
, isl_int
*val
)
8920 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8923 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8924 * and if val is not NULL, then return this lower bound in *val.
8926 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8927 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8929 int i
, i_eq
= -1, i_ineq
= -1;
8936 total
= isl_basic_set_total_dim(bset
);
8937 nparam
= isl_basic_set_n_param(bset
);
8938 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8939 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8945 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8946 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8948 if (i_eq
!= -1 || i_ineq
!= -1)
8952 if (i_eq
== -1 && i_ineq
== -1)
8954 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8955 /* The coefficient should always be one due to normalization. */
8956 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8958 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8960 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8961 total
- nparam
- dim
- 1) != -1)
8964 isl_int_neg(*val
, c
[0]);
8968 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8969 unsigned dim
, isl_int
*val
)
8981 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8985 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8987 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8988 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8990 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8994 isl_int_set(*val
, v
);
9000 /* uset_gist depends on constraints without existentially quantified
9001 * variables sorting first.
9003 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9005 isl_int
**c1
= (isl_int
**) p1
;
9006 isl_int
**c2
= (isl_int
**) p2
;
9008 unsigned size
= *(unsigned *) arg
;
9010 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9011 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9016 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9019 static struct isl_basic_map
*isl_basic_map_sort_constraints(
9020 struct isl_basic_map
*bmap
)
9026 if (bmap
->n_ineq
== 0)
9028 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9030 total
= isl_basic_map_total_dim(bmap
);
9031 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9032 &sort_constraint_cmp
, &total
) < 0)
9033 return isl_basic_map_free(bmap
);
9037 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9038 __isl_take isl_basic_set
*bset
)
9040 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
9041 (struct isl_basic_map
*)bset
);
9044 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
9048 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9050 bmap
= isl_basic_map_remove_redundancies(bmap
);
9051 bmap
= isl_basic_map_sort_constraints(bmap
);
9053 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9057 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
9059 return (struct isl_basic_set
*)isl_basic_map_normalize(
9060 (struct isl_basic_map
*)bset
);
9063 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
9064 const __isl_keep isl_basic_map
*bmap2
)
9069 if (!bmap1
|| !bmap2
)
9074 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9075 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9076 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9077 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
9078 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
9079 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
9080 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9081 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
9082 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9083 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9084 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9086 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9088 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9090 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9091 return bmap1
->n_eq
- bmap2
->n_eq
;
9092 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9093 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9094 if (bmap1
->n_div
!= bmap2
->n_div
)
9095 return bmap1
->n_div
- bmap2
->n_div
;
9096 total
= isl_basic_map_total_dim(bmap1
);
9097 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9098 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9102 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9103 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9107 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9108 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9115 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
9116 const __isl_keep isl_basic_set
*bset2
)
9118 return isl_basic_map_plain_cmp(bset1
, bset2
);
9121 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9127 if (set1
->n
!= set2
->n
)
9128 return set1
->n
- set2
->n
;
9130 for (i
= 0; i
< set1
->n
; ++i
) {
9131 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9139 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9140 __isl_keep isl_basic_map
*bmap2
)
9142 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9145 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9146 __isl_keep isl_basic_set
*bset2
)
9148 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
9149 (isl_basic_map
*)bset2
);
9152 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9154 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
9155 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
9157 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9160 /* Sort the basic maps of "map" and remove duplicate basic maps.
9162 * While removing basic maps, we make sure that the basic maps remain
9163 * sorted because isl_map_normalize expects the basic maps of the result
9166 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9170 map
= isl_map_remove_empty_parts(map
);
9173 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9174 for (i
= map
->n
- 1; i
>= 1; --i
) {
9175 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9177 isl_basic_map_free(map
->p
[i
-1]);
9178 for (j
= i
; j
< map
->n
; ++j
)
9179 map
->p
[j
- 1] = map
->p
[j
];
9186 /* Remove obvious duplicates among the basic maps of "map".
9188 * Unlike isl_map_normalize, this function does not remove redundant
9189 * constraints and only removes duplicates that have exactly the same
9190 * constraints in the input. It does sort the constraints and
9191 * the basic maps to ease the detection of duplicates.
9193 * If "map" has already been normalized or if the basic maps are
9194 * disjoint, then there can be no duplicates.
9196 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9199 isl_basic_map
*bmap
;
9205 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9207 for (i
= 0; i
< map
->n
; ++i
) {
9208 bmap
= isl_basic_map_copy(map
->p
[i
]);
9209 bmap
= isl_basic_map_sort_constraints(bmap
);
9211 return isl_map_free(map
);
9212 isl_basic_map_free(map
->p
[i
]);
9216 map
= sort_and_remove_duplicates(map
);
9220 /* We normalize in place, but if anything goes wrong we need
9221 * to return NULL, so we need to make sure we don't change the
9222 * meaning of any possible other copies of map.
9224 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9227 struct isl_basic_map
*bmap
;
9231 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9233 for (i
= 0; i
< map
->n
; ++i
) {
9234 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9237 isl_basic_map_free(map
->p
[i
]);
9241 map
= sort_and_remove_duplicates(map
);
9243 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9250 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9252 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
9255 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
9265 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9268 map1
= isl_map_copy(map1
);
9269 map2
= isl_map_copy(map2
);
9270 map1
= isl_map_normalize(map1
);
9271 map2
= isl_map_normalize(map2
);
9274 equal
= map1
->n
== map2
->n
;
9275 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9276 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9289 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
9291 return isl_map_plain_is_equal(map1
, map2
);
9294 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9296 return isl_map_plain_is_equal((struct isl_map
*)set1
,
9297 (struct isl_map
*)set2
);
9300 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9302 return isl_set_plain_is_equal(set1
, set2
);
9305 /* Return an interval that ranges from min to max (inclusive)
9307 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
9308 isl_int min
, isl_int max
)
9311 struct isl_basic_set
*bset
= NULL
;
9313 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
9317 k
= isl_basic_set_alloc_inequality(bset
);
9320 isl_int_set_si(bset
->ineq
[k
][1], 1);
9321 isl_int_neg(bset
->ineq
[k
][0], min
);
9323 k
= isl_basic_set_alloc_inequality(bset
);
9326 isl_int_set_si(bset
->ineq
[k
][1], -1);
9327 isl_int_set(bset
->ineq
[k
][0], max
);
9331 isl_basic_set_free(bset
);
9335 /* Return the basic maps in "map" as a list.
9337 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9338 __isl_keep isl_map
*map
)
9342 isl_basic_map_list
*list
;
9346 ctx
= isl_map_get_ctx(map
);
9347 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9349 for (i
= 0; i
< map
->n
; ++i
) {
9350 isl_basic_map
*bmap
;
9352 bmap
= isl_basic_map_copy(map
->p
[i
]);
9353 list
= isl_basic_map_list_add(list
, bmap
);
9359 /* Return the intersection of the elements in the non-empty list "list".
9360 * All elements are assumed to live in the same space.
9362 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9363 __isl_take isl_basic_map_list
*list
)
9366 isl_basic_map
*bmap
;
9370 n
= isl_basic_map_list_n_basic_map(list
);
9372 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9373 "expecting non-empty list", goto error
);
9375 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9376 for (i
= 1; i
< n
; ++i
) {
9377 isl_basic_map
*bmap_i
;
9379 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9380 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9383 isl_basic_map_list_free(list
);
9386 isl_basic_map_list_free(list
);
9390 /* Return the intersection of the elements in the non-empty list "list".
9391 * All elements are assumed to live in the same space.
9393 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9394 __isl_take isl_basic_set_list
*list
)
9396 return isl_basic_map_list_intersect(list
);
9399 /* Return the Cartesian product of the basic sets in list (in the given order).
9401 __isl_give isl_basic_set
*isl_basic_set_list_product(
9402 __isl_take
struct isl_basic_set_list
*list
)
9410 struct isl_basic_set
*product
= NULL
;
9414 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
9415 isl_assert(list
->ctx
, list
->p
[0], goto error
);
9416 nparam
= isl_basic_set_n_param(list
->p
[0]);
9417 dim
= isl_basic_set_n_dim(list
->p
[0]);
9418 extra
= list
->p
[0]->n_div
;
9419 n_eq
= list
->p
[0]->n_eq
;
9420 n_ineq
= list
->p
[0]->n_ineq
;
9421 for (i
= 1; i
< list
->n
; ++i
) {
9422 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9423 isl_assert(list
->ctx
,
9424 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9425 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9426 extra
+= list
->p
[i
]->n_div
;
9427 n_eq
+= list
->p
[i
]->n_eq
;
9428 n_ineq
+= list
->p
[i
]->n_ineq
;
9430 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9435 for (i
= 0; i
< list
->n
; ++i
) {
9436 isl_basic_set_add_constraints(product
,
9437 isl_basic_set_copy(list
->p
[i
]), dim
);
9438 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9440 isl_basic_set_list_free(list
);
9443 isl_basic_set_free(product
);
9444 isl_basic_set_list_free(list
);
9448 struct isl_basic_map
*isl_basic_map_product(
9449 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9451 isl_space
*dim_result
= NULL
;
9452 struct isl_basic_map
*bmap
;
9453 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9454 struct isl_dim_map
*dim_map1
, *dim_map2
;
9456 if (!bmap1
|| !bmap2
)
9459 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9460 bmap2
->dim
, isl_dim_param
), goto error
);
9461 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9462 isl_space_copy(bmap2
->dim
));
9464 in1
= isl_basic_map_n_in(bmap1
);
9465 in2
= isl_basic_map_n_in(bmap2
);
9466 out1
= isl_basic_map_n_out(bmap1
);
9467 out2
= isl_basic_map_n_out(bmap2
);
9468 nparam
= isl_basic_map_n_param(bmap1
);
9470 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9471 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9472 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9473 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9474 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9475 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9476 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9477 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9478 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9479 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9480 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9482 bmap
= isl_basic_map_alloc_space(dim_result
,
9483 bmap1
->n_div
+ bmap2
->n_div
,
9484 bmap1
->n_eq
+ bmap2
->n_eq
,
9485 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9486 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9487 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9488 bmap
= isl_basic_map_simplify(bmap
);
9489 return isl_basic_map_finalize(bmap
);
9491 isl_basic_map_free(bmap1
);
9492 isl_basic_map_free(bmap2
);
9496 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9497 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9499 isl_basic_map
*prod
;
9501 prod
= isl_basic_map_product(bmap1
, bmap2
);
9502 prod
= isl_basic_map_flatten(prod
);
9506 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9507 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9509 return isl_basic_map_flat_range_product(bset1
, bset2
);
9512 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9513 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9515 isl_space
*space_result
= NULL
;
9516 isl_basic_map
*bmap
;
9517 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9518 struct isl_dim_map
*dim_map1
, *dim_map2
;
9520 if (!bmap1
|| !bmap2
)
9523 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9524 isl_space_copy(bmap2
->dim
));
9526 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9527 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9528 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9529 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9531 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9532 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9533 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9534 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9535 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9536 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9537 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9538 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9539 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9540 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9541 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9543 bmap
= isl_basic_map_alloc_space(space_result
,
9544 bmap1
->n_div
+ bmap2
->n_div
,
9545 bmap1
->n_eq
+ bmap2
->n_eq
,
9546 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9547 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9548 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9549 bmap
= isl_basic_map_simplify(bmap
);
9550 return isl_basic_map_finalize(bmap
);
9552 isl_basic_map_free(bmap1
);
9553 isl_basic_map_free(bmap2
);
9557 __isl_give isl_basic_map
*isl_basic_map_range_product(
9558 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9560 isl_space
*dim_result
= NULL
;
9561 isl_basic_map
*bmap
;
9562 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9563 struct isl_dim_map
*dim_map1
, *dim_map2
;
9565 if (!bmap1
|| !bmap2
)
9568 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9569 bmap2
->dim
, isl_dim_param
))
9570 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9571 "parameters don't match", goto error
);
9573 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9574 isl_space_copy(bmap2
->dim
));
9576 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9577 out1
= isl_basic_map_n_out(bmap1
);
9578 out2
= isl_basic_map_n_out(bmap2
);
9579 nparam
= isl_basic_map_n_param(bmap1
);
9581 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9582 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9583 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9584 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9585 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9586 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9587 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9588 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9589 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9590 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9591 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9593 bmap
= isl_basic_map_alloc_space(dim_result
,
9594 bmap1
->n_div
+ bmap2
->n_div
,
9595 bmap1
->n_eq
+ bmap2
->n_eq
,
9596 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9597 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9598 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9599 bmap
= isl_basic_map_simplify(bmap
);
9600 return isl_basic_map_finalize(bmap
);
9602 isl_basic_map_free(bmap1
);
9603 isl_basic_map_free(bmap2
);
9607 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9608 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9610 isl_basic_map
*prod
;
9612 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9613 prod
= isl_basic_map_flatten_range(prod
);
9617 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9618 * and collect the results.
9619 * The result live in the space obtained by calling "space_product"
9620 * on the spaces of "map1" and "map2".
9621 * If "remove_duplicates" is set then the result may contain duplicates
9622 * (even if the inputs do not) and so we try and remove the obvious
9625 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9626 __isl_take isl_map
*map2
,
9627 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
9628 __isl_take isl_space
*right
),
9629 __isl_give isl_basic_map
*(*basic_map_product
)(
9630 __isl_take isl_basic_map
*left
,
9631 __isl_take isl_basic_map
*right
),
9632 int remove_duplicates
)
9635 struct isl_map
*result
;
9641 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9642 map2
->dim
, isl_dim_param
), goto error
);
9644 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9645 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9646 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9648 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
9649 isl_space_copy(map2
->dim
)),
9650 map1
->n
* map2
->n
, flags
);
9653 for (i
= 0; i
< map1
->n
; ++i
)
9654 for (j
= 0; j
< map2
->n
; ++j
) {
9655 struct isl_basic_map
*part
;
9656 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9657 isl_basic_map_copy(map2
->p
[j
]));
9658 if (isl_basic_map_is_empty(part
))
9659 isl_basic_map_free(part
);
9661 result
= isl_map_add_basic_map(result
, part
);
9665 if (remove_duplicates
)
9666 result
= isl_map_remove_obvious_duplicates(result
);
9676 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9678 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9679 __isl_take isl_map
*map2
)
9681 return map_product(map1
, map2
, &isl_space_product
,
9682 &isl_basic_map_product
, 0);
9685 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9686 __isl_take isl_map
*map2
)
9688 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9691 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9693 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9694 __isl_take isl_map
*map2
)
9698 prod
= isl_map_product(map1
, map2
);
9699 prod
= isl_map_flatten(prod
);
9703 /* Given two set A and B, construct its Cartesian product A x B.
9705 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9707 return isl_map_range_product(set1
, set2
);
9710 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9711 __isl_take isl_set
*set2
)
9713 return isl_map_flat_range_product(set1
, set2
);
9716 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9718 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9719 __isl_take isl_map
*map2
)
9721 return map_product(map1
, map2
, &isl_space_domain_product
,
9722 &isl_basic_map_domain_product
, 1);
9725 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9727 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9728 __isl_take isl_map
*map2
)
9730 return map_product(map1
, map2
, &isl_space_range_product
,
9731 &isl_basic_map_range_product
, 1);
9734 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9735 __isl_take isl_map
*map2
)
9737 return isl_map_align_params_map_map_and(map1
, map2
,
9738 &map_domain_product_aligned
);
9741 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9742 __isl_take isl_map
*map2
)
9744 return isl_map_align_params_map_map_and(map1
, map2
,
9745 &map_range_product_aligned
);
9748 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
9750 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
9753 int total1
, keep1
, total2
, keep2
;
9757 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9758 !isl_space_range_is_wrapping(map
->dim
))
9759 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9760 "not a product", return isl_map_free(map
));
9762 space
= isl_map_get_space(map
);
9763 total1
= isl_space_dim(space
, isl_dim_in
);
9764 total2
= isl_space_dim(space
, isl_dim_out
);
9765 space
= isl_space_factor_domain(space
);
9766 keep1
= isl_space_dim(space
, isl_dim_in
);
9767 keep2
= isl_space_dim(space
, isl_dim_out
);
9768 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
9769 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
9770 map
= isl_map_reset_space(map
, space
);
9775 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
9777 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
9780 int total1
, keep1
, total2
, keep2
;
9784 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9785 !isl_space_range_is_wrapping(map
->dim
))
9786 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9787 "not a product", return isl_map_free(map
));
9789 space
= isl_map_get_space(map
);
9790 total1
= isl_space_dim(space
, isl_dim_in
);
9791 total2
= isl_space_dim(space
, isl_dim_out
);
9792 space
= isl_space_factor_range(space
);
9793 keep1
= isl_space_dim(space
, isl_dim_in
);
9794 keep2
= isl_space_dim(space
, isl_dim_out
);
9795 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
9796 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
9797 map
= isl_map_reset_space(map
, space
);
9802 /* Given a map of the form [A -> B] -> C, return the map A -> C.
9804 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
9811 if (!isl_space_domain_is_wrapping(map
->dim
))
9812 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9813 "domain is not a product", return isl_map_free(map
));
9815 space
= isl_map_get_space(map
);
9816 total
= isl_space_dim(space
, isl_dim_in
);
9817 space
= isl_space_domain_factor_domain(space
);
9818 keep
= isl_space_dim(space
, isl_dim_in
);
9819 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
9820 map
= isl_map_reset_space(map
, space
);
9825 /* Given a map of the form [A -> B] -> C, return the map B -> C.
9827 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
9834 if (!isl_space_domain_is_wrapping(map
->dim
))
9835 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9836 "domain is not a product", return isl_map_free(map
));
9838 space
= isl_map_get_space(map
);
9839 total
= isl_space_dim(space
, isl_dim_in
);
9840 space
= isl_space_domain_factor_range(space
);
9841 keep
= isl_space_dim(space
, isl_dim_in
);
9842 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
9843 map
= isl_map_reset_space(map
, space
);
9848 /* Given a map A -> [B -> C], extract the map A -> B.
9850 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
9857 if (!isl_space_range_is_wrapping(map
->dim
))
9858 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9859 "range is not a product", return isl_map_free(map
));
9861 space
= isl_map_get_space(map
);
9862 total
= isl_space_dim(space
, isl_dim_out
);
9863 space
= isl_space_range_factor_domain(space
);
9864 keep
= isl_space_dim(space
, isl_dim_out
);
9865 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
9866 map
= isl_map_reset_space(map
, space
);
9871 /* Given a map A -> [B -> C], extract the map A -> C.
9873 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
9880 if (!isl_space_range_is_wrapping(map
->dim
))
9881 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9882 "range is not a product", return isl_map_free(map
));
9884 space
= isl_map_get_space(map
);
9885 total
= isl_space_dim(space
, isl_dim_out
);
9886 space
= isl_space_range_factor_range(space
);
9887 keep
= isl_space_dim(space
, isl_dim_out
);
9888 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
9889 map
= isl_map_reset_space(map
, space
);
9894 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9896 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9897 __isl_take isl_map
*map2
)
9901 prod
= isl_map_domain_product(map1
, map2
);
9902 prod
= isl_map_flatten_domain(prod
);
9906 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9908 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9909 __isl_take isl_map
*map2
)
9913 prod
= isl_map_range_product(map1
, map2
);
9914 prod
= isl_map_flatten_range(prod
);
9918 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9921 uint32_t hash
= isl_hash_init();
9926 bmap
= isl_basic_map_copy(bmap
);
9927 bmap
= isl_basic_map_normalize(bmap
);
9930 total
= isl_basic_map_total_dim(bmap
);
9931 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9932 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9934 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9935 isl_hash_hash(hash
, c_hash
);
9937 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9938 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9940 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9941 isl_hash_hash(hash
, c_hash
);
9943 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9944 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9946 if (isl_int_is_zero(bmap
->div
[i
][0]))
9948 isl_hash_byte(hash
, i
& 0xFF);
9949 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9950 isl_hash_hash(hash
, c_hash
);
9952 isl_basic_map_free(bmap
);
9956 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9958 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9961 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9968 map
= isl_map_copy(map
);
9969 map
= isl_map_normalize(map
);
9973 hash
= isl_hash_init();
9974 for (i
= 0; i
< map
->n
; ++i
) {
9976 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9977 isl_hash_hash(hash
, bmap_hash
);
9985 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9987 return isl_map_get_hash((isl_map
*)set
);
9990 /* Check if the value for dimension dim is completely determined
9991 * by the values of the other parameters and variables.
9992 * That is, check if dimension dim is involved in an equality.
9994 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
10001 nparam
= isl_basic_set_n_param(bset
);
10002 for (i
= 0; i
< bset
->n_eq
; ++i
)
10003 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
10008 /* Check if the value for dimension dim is completely determined
10009 * by the values of the other parameters and variables.
10010 * That is, check if dimension dim is involved in an equality
10011 * for each of the subsets.
10013 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
10019 for (i
= 0; i
< set
->n
; ++i
) {
10021 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
10028 /* Return the number of basic maps in the (current) representation of "map".
10030 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10032 return map
? map
->n
: 0;
10035 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10037 return set
? set
->n
: 0;
10040 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10041 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10048 for (i
= 0; i
< map
->n
; ++i
)
10049 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10055 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10056 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10063 for (i
= 0; i
< set
->n
; ++i
)
10064 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10070 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10077 bset
= isl_basic_set_cow(bset
);
10081 dim
= isl_basic_set_get_space(bset
);
10082 dim
= isl_space_lift(dim
, bset
->n_div
);
10085 isl_space_free(bset
->dim
);
10087 bset
->extra
-= bset
->n_div
;
10090 bset
= isl_basic_set_finalize(bset
);
10094 isl_basic_set_free(bset
);
10098 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10104 set
= isl_set_align_divs(set
);
10109 set
= isl_set_cow(set
);
10113 n_div
= set
->p
[0]->n_div
;
10114 dim
= isl_set_get_space(set
);
10115 dim
= isl_space_lift(dim
, n_div
);
10118 isl_space_free(set
->dim
);
10121 for (i
= 0; i
< set
->n
; ++i
) {
10122 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10133 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
10136 struct isl_basic_map
*bmap
;
10143 set
= isl_set_align_divs(set
);
10148 dim
= isl_set_get_space(set
);
10149 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
10151 return isl_map_identity(isl_space_map_from_set(dim
));
10154 n_div
= set
->p
[0]->n_div
;
10155 dim
= isl_space_map_from_set(dim
);
10156 n_param
= isl_space_dim(dim
, isl_dim_param
);
10157 n_set
= isl_space_dim(dim
, isl_dim_in
);
10158 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
10159 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
10160 for (i
= 0; i
< n_set
; ++i
)
10161 bmap
= var_equal(bmap
, i
);
10163 total
= n_param
+ n_set
+ n_set
+ n_div
;
10164 for (i
= 0; i
< n_div
; ++i
) {
10165 k
= isl_basic_map_alloc_inequality(bmap
);
10168 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
10169 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
10170 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
10171 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
10172 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
10173 set
->p
[0]->div
[i
][0]);
10175 l
= isl_basic_map_alloc_inequality(bmap
);
10178 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
10179 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
10180 set
->p
[0]->div
[i
][0]);
10181 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
10185 bmap
= isl_basic_map_simplify(bmap
);
10186 bmap
= isl_basic_map_finalize(bmap
);
10187 return isl_map_from_basic_map(bmap
);
10190 isl_basic_map_free(bmap
);
10194 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10202 dim
= isl_basic_set_total_dim(bset
);
10203 size
+= bset
->n_eq
* (1 + dim
);
10204 size
+= bset
->n_ineq
* (1 + dim
);
10205 size
+= bset
->n_div
* (2 + dim
);
10210 int isl_set_size(__isl_keep isl_set
*set
)
10218 for (i
= 0; i
< set
->n
; ++i
)
10219 size
+= isl_basic_set_size(set
->p
[i
]);
10224 /* Check if there is any lower bound (if lower == 0) and/or upper
10225 * bound (if upper == 0) on the specified dim.
10227 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10228 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10235 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
10237 pos
+= isl_basic_map_offset(bmap
, type
);
10239 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10240 if (isl_int_is_zero(bmap
->div
[i
][0]))
10242 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10246 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10247 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10250 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10251 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10258 return lower
&& upper
;
10261 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10262 enum isl_dim_type type
, unsigned pos
)
10264 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10267 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10268 enum isl_dim_type type
, unsigned pos
)
10270 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10273 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10274 enum isl_dim_type type
, unsigned pos
)
10276 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10279 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10280 enum isl_dim_type type
, unsigned pos
)
10287 for (i
= 0; i
< map
->n
; ++i
) {
10289 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10290 if (bounded
< 0 || !bounded
)
10297 /* Return 1 if the specified dim is involved in both an upper bound
10298 * and a lower bound.
10300 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10301 enum isl_dim_type type
, unsigned pos
)
10303 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
10306 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10308 static int has_any_bound(__isl_keep isl_map
*map
,
10309 enum isl_dim_type type
, unsigned pos
,
10310 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
10311 enum isl_dim_type type
, unsigned pos
))
10318 for (i
= 0; i
< map
->n
; ++i
) {
10320 bounded
= fn(map
->p
[i
], type
, pos
);
10321 if (bounded
< 0 || bounded
)
10328 /* Return 1 if the specified dim is involved in any lower bound.
10330 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10331 enum isl_dim_type type
, unsigned pos
)
10333 return has_any_bound(set
, type
, pos
,
10334 &isl_basic_map_dim_has_lower_bound
);
10337 /* Return 1 if the specified dim is involved in any upper bound.
10339 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10340 enum isl_dim_type type
, unsigned pos
)
10342 return has_any_bound(set
, type
, pos
,
10343 &isl_basic_map_dim_has_upper_bound
);
10346 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10348 static int has_bound(__isl_keep isl_map
*map
,
10349 enum isl_dim_type type
, unsigned pos
,
10350 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
10351 enum isl_dim_type type
, unsigned pos
))
10358 for (i
= 0; i
< map
->n
; ++i
) {
10360 bounded
= fn(map
->p
[i
], type
, pos
);
10361 if (bounded
< 0 || !bounded
)
10368 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10370 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10371 enum isl_dim_type type
, unsigned pos
)
10373 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10376 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10378 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10379 enum isl_dim_type type
, unsigned pos
)
10381 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10384 /* For each of the "n" variables starting at "first", determine
10385 * the sign of the variable and put the results in the first "n"
10386 * elements of the array "signs".
10388 * 1 means that the variable is non-negative
10389 * -1 means that the variable is non-positive
10390 * 0 means the variable attains both positive and negative values.
10392 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10393 unsigned first
, unsigned n
, int *signs
)
10395 isl_vec
*bound
= NULL
;
10396 struct isl_tab
*tab
= NULL
;
10397 struct isl_tab_undo
*snap
;
10400 if (!bset
|| !signs
)
10403 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10404 tab
= isl_tab_from_basic_set(bset
, 0);
10405 if (!bound
|| !tab
)
10408 isl_seq_clr(bound
->el
, bound
->size
);
10409 isl_int_set_si(bound
->el
[0], -1);
10411 snap
= isl_tab_snap(tab
);
10412 for (i
= 0; i
< n
; ++i
) {
10415 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10416 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10418 empty
= tab
->empty
;
10419 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10420 if (isl_tab_rollback(tab
, snap
) < 0)
10428 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10429 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10431 empty
= tab
->empty
;
10432 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10433 if (isl_tab_rollback(tab
, snap
) < 0)
10436 signs
[i
] = empty
? -1 : 0;
10440 isl_vec_free(bound
);
10444 isl_vec_free(bound
);
10448 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10449 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10451 if (!bset
|| !signs
)
10453 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10456 first
+= pos(bset
->dim
, type
) - 1;
10457 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10460 /* Is it possible for the integer division "div" to depend (possibly
10461 * indirectly) on any output dimensions?
10463 * If the div is undefined, then we conservatively assume that it
10464 * may depend on them.
10465 * Otherwise, we check if it actually depends on them or on any integer
10466 * divisions that may depend on them.
10468 static int div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10471 unsigned n_out
, o_out
;
10472 unsigned n_div
, o_div
;
10474 if (isl_int_is_zero(bmap
->div
[div
][0]))
10477 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10478 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10480 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10483 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10484 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10486 for (i
= 0; i
< n_div
; ++i
) {
10487 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10489 if (div_may_involve_output(bmap
, i
))
10496 /* Return the index of the equality of "bmap" that defines
10497 * the output dimension "pos" in terms of earlier dimensions.
10498 * The equality may also involve integer divisions, as long
10499 * as those integer divisions are defined in terms of
10500 * parameters or input dimensions.
10501 * Return bmap->n_eq if there is no such equality.
10502 * Return -1 on error.
10504 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10508 unsigned n_out
, o_out
;
10509 unsigned n_div
, o_div
;
10514 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10515 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10516 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10517 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10519 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10520 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10522 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10523 n_out
- (pos
+ 1)) != -1)
10525 for (k
= 0; k
< n_div
; ++k
) {
10526 if (isl_int_is_zero(bmap
->eq
[j
][o_div
+ k
]))
10528 if (div_may_involve_output(bmap
, k
))
10538 /* Check if the given basic map is obviously single-valued.
10539 * In particular, for each output dimension, check that there is
10540 * an equality that defines the output dimension in terms of
10541 * earlier dimensions.
10543 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10551 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10553 for (i
= 0; i
< n_out
; ++i
) {
10556 eq
= isl_basic_map_output_defining_equality(bmap
, i
);
10559 if (eq
>= bmap
->n_eq
)
10566 /* Check if the given basic map is single-valued.
10567 * We simply compute
10571 * and check if the result is a subset of the identity mapping.
10573 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10576 isl_basic_map
*test
;
10580 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10584 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10585 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10587 space
= isl_basic_map_get_space(bmap
);
10588 space
= isl_space_map_from_set(isl_space_range(space
));
10589 id
= isl_basic_map_identity(space
);
10591 sv
= isl_basic_map_is_subset(test
, id
);
10593 isl_basic_map_free(test
);
10594 isl_basic_map_free(id
);
10599 /* Check if the given map is obviously single-valued.
10601 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10610 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10613 /* Check if the given map is single-valued.
10614 * We simply compute
10618 * and check if the result is a subset of the identity mapping.
10620 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
10627 sv
= isl_map_plain_is_single_valued(map
);
10631 test
= isl_map_reverse(isl_map_copy(map
));
10632 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10634 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10635 id
= isl_map_identity(dim
);
10637 sv
= isl_map_is_subset(test
, id
);
10639 isl_map_free(test
);
10645 int isl_map_is_injective(__isl_keep isl_map
*map
)
10649 map
= isl_map_copy(map
);
10650 map
= isl_map_reverse(map
);
10651 in
= isl_map_is_single_valued(map
);
10657 /* Check if the given map is obviously injective.
10659 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10663 map
= isl_map_copy(map
);
10664 map
= isl_map_reverse(map
);
10665 in
= isl_map_plain_is_single_valued(map
);
10671 int isl_map_is_bijective(__isl_keep isl_map
*map
)
10675 sv
= isl_map_is_single_valued(map
);
10679 return isl_map_is_injective(map
);
10682 int isl_set_is_singleton(__isl_keep isl_set
*set
)
10684 return isl_map_is_single_valued((isl_map
*)set
);
10687 int isl_map_is_translation(__isl_keep isl_map
*map
)
10692 delta
= isl_map_deltas(isl_map_copy(map
));
10693 ok
= isl_set_is_singleton(delta
);
10694 isl_set_free(delta
);
10699 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10701 if (isl_seq_first_non_zero(p
, pos
) != -1)
10703 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10708 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10717 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10720 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10721 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10722 for (j
= 0; j
< nvar
; ++j
) {
10723 int lower
= 0, upper
= 0;
10724 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10725 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10727 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10731 if (i
< bset
->n_eq
)
10733 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10734 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10736 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10738 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10743 if (!lower
|| !upper
)
10750 int isl_set_is_box(__isl_keep isl_set
*set
)
10757 return isl_basic_set_is_box(set
->p
[0]);
10760 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10765 return isl_space_is_wrapping(bset
->dim
);
10768 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
10773 return isl_space_is_wrapping(set
->dim
);
10776 /* Is the domain of "map" a wrapped relation?
10778 int isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
10783 return isl_space_domain_is_wrapping(map
->dim
);
10786 /* Is the range of "map" a wrapped relation?
10788 int isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
10793 return isl_space_range_is_wrapping(map
->dim
);
10796 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
10798 bmap
= isl_basic_map_cow(bmap
);
10802 bmap
->dim
= isl_space_wrap(bmap
->dim
);
10806 bmap
= isl_basic_map_finalize(bmap
);
10808 return (isl_basic_set
*)bmap
;
10810 isl_basic_map_free(bmap
);
10814 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
10818 map
= isl_map_cow(map
);
10822 for (i
= 0; i
< map
->n
; ++i
) {
10823 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
10827 map
->dim
= isl_space_wrap(map
->dim
);
10831 return (isl_set
*)map
;
10837 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
10839 bset
= isl_basic_set_cow(bset
);
10843 bset
->dim
= isl_space_unwrap(bset
->dim
);
10847 bset
= isl_basic_set_finalize(bset
);
10849 return (isl_basic_map
*)bset
;
10851 isl_basic_set_free(bset
);
10855 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
10862 if (!isl_set_is_wrapping(set
))
10863 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
10866 set
= isl_set_cow(set
);
10870 for (i
= 0; i
< set
->n
; ++i
) {
10871 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
10876 set
->dim
= isl_space_unwrap(set
->dim
);
10880 return (isl_map
*)set
;
10886 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
10887 enum isl_dim_type type
)
10892 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
10895 bmap
= isl_basic_map_cow(bmap
);
10899 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
10903 bmap
= isl_basic_map_finalize(bmap
);
10907 isl_basic_map_free(bmap
);
10911 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10912 enum isl_dim_type type
)
10919 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10922 map
= isl_map_cow(map
);
10926 for (i
= 0; i
< map
->n
; ++i
) {
10927 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10931 map
->dim
= isl_space_reset(map
->dim
, type
);
10941 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10946 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10949 bmap
= isl_basic_map_cow(bmap
);
10953 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10957 bmap
= isl_basic_map_finalize(bmap
);
10961 isl_basic_map_free(bmap
);
10965 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10967 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
10970 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10971 __isl_take isl_basic_map
*bmap
)
10976 if (!bmap
->dim
->nested
[0])
10979 bmap
= isl_basic_map_cow(bmap
);
10983 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10987 bmap
= isl_basic_map_finalize(bmap
);
10991 isl_basic_map_free(bmap
);
10995 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10996 __isl_take isl_basic_map
*bmap
)
11001 if (!bmap
->dim
->nested
[1])
11004 bmap
= isl_basic_map_cow(bmap
);
11008 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11012 bmap
= isl_basic_map_finalize(bmap
);
11016 isl_basic_map_free(bmap
);
11020 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11027 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11030 map
= isl_map_cow(map
);
11034 for (i
= 0; i
< map
->n
; ++i
) {
11035 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
11039 map
->dim
= isl_space_flatten(map
->dim
);
11049 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11051 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
11054 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11056 isl_space
*dim
, *flat_dim
;
11059 dim
= isl_set_get_space(set
);
11060 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11061 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11062 map
= isl_map_intersect_domain(map
, set
);
11067 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11074 if (!map
->dim
->nested
[0])
11077 map
= isl_map_cow(map
);
11081 for (i
= 0; i
< map
->n
; ++i
) {
11082 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
11086 map
->dim
= isl_space_flatten_domain(map
->dim
);
11096 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11103 if (!map
->dim
->nested
[1])
11106 map
= isl_map_cow(map
);
11110 for (i
= 0; i
< map
->n
; ++i
) {
11111 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
11115 map
->dim
= isl_space_flatten_range(map
->dim
);
11125 /* Reorder the dimensions of "bmap" according to the given dim_map
11126 * and set the dimension specification to "dim".
11128 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11129 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11131 isl_basic_map
*res
;
11134 bmap
= isl_basic_map_cow(bmap
);
11135 if (!bmap
|| !dim
|| !dim_map
)
11138 flags
= bmap
->flags
;
11139 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11140 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11141 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11142 res
= isl_basic_map_alloc_space(dim
,
11143 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11144 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11146 res
->flags
= flags
;
11147 res
= isl_basic_map_finalize(res
);
11151 isl_basic_map_free(bmap
);
11152 isl_space_free(dim
);
11156 /* Reorder the dimensions of "map" according to given reordering.
11158 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11159 __isl_take isl_reordering
*r
)
11162 struct isl_dim_map
*dim_map
;
11164 map
= isl_map_cow(map
);
11165 dim_map
= isl_dim_map_from_reordering(r
);
11166 if (!map
|| !r
|| !dim_map
)
11169 for (i
= 0; i
< map
->n
; ++i
) {
11170 struct isl_dim_map
*dim_map_i
;
11172 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11174 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11175 isl_space_copy(r
->dim
), dim_map_i
);
11181 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11183 isl_reordering_free(r
);
11189 isl_reordering_free(r
);
11193 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11194 __isl_take isl_reordering
*r
)
11196 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
11199 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11200 __isl_take isl_space
*model
)
11204 if (!map
|| !model
)
11207 ctx
= isl_space_get_ctx(model
);
11208 if (!isl_space_has_named_params(model
))
11209 isl_die(ctx
, isl_error_invalid
,
11210 "model has unnamed parameters", goto error
);
11211 if (!isl_space_has_named_params(map
->dim
))
11212 isl_die(ctx
, isl_error_invalid
,
11213 "relation has unnamed parameters", goto error
);
11214 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11215 isl_reordering
*exp
;
11217 model
= isl_space_drop_dims(model
, isl_dim_in
,
11218 0, isl_space_dim(model
, isl_dim_in
));
11219 model
= isl_space_drop_dims(model
, isl_dim_out
,
11220 0, isl_space_dim(model
, isl_dim_out
));
11221 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11222 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11223 map
= isl_map_realign(map
, exp
);
11226 isl_space_free(model
);
11229 isl_space_free(model
);
11234 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11235 __isl_take isl_space
*model
)
11237 return isl_map_align_params(set
, model
);
11240 /* Align the parameters of "bmap" to those of "model", introducing
11241 * additional parameters if needed.
11243 __isl_give isl_basic_map
*isl_basic_map_align_params(
11244 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11248 if (!bmap
|| !model
)
11251 ctx
= isl_space_get_ctx(model
);
11252 if (!isl_space_has_named_params(model
))
11253 isl_die(ctx
, isl_error_invalid
,
11254 "model has unnamed parameters", goto error
);
11255 if (!isl_space_has_named_params(bmap
->dim
))
11256 isl_die(ctx
, isl_error_invalid
,
11257 "relation has unnamed parameters", goto error
);
11258 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11259 isl_reordering
*exp
;
11260 struct isl_dim_map
*dim_map
;
11262 model
= isl_space_drop_dims(model
, isl_dim_in
,
11263 0, isl_space_dim(model
, isl_dim_in
));
11264 model
= isl_space_drop_dims(model
, isl_dim_out
,
11265 0, isl_space_dim(model
, isl_dim_out
));
11266 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11267 exp
= isl_reordering_extend_space(exp
,
11268 isl_basic_map_get_space(bmap
));
11269 dim_map
= isl_dim_map_from_reordering(exp
);
11270 bmap
= isl_basic_map_realign(bmap
,
11271 exp
? isl_space_copy(exp
->dim
) : NULL
,
11272 isl_dim_map_extend(dim_map
, bmap
));
11273 isl_reordering_free(exp
);
11277 isl_space_free(model
);
11280 isl_space_free(model
);
11281 isl_basic_map_free(bmap
);
11285 /* Align the parameters of "bset" to those of "model", introducing
11286 * additional parameters if needed.
11288 __isl_give isl_basic_set
*isl_basic_set_align_params(
11289 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11291 return isl_basic_map_align_params(bset
, model
);
11294 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11295 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11296 enum isl_dim_type c2
, enum isl_dim_type c3
,
11297 enum isl_dim_type c4
, enum isl_dim_type c5
)
11299 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11300 struct isl_mat
*mat
;
11306 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11307 isl_basic_map_total_dim(bmap
) + 1);
11310 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11311 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11312 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11313 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11314 isl_int_set(mat
->row
[i
][pos
],
11315 bmap
->eq
[i
][off
+ k
]);
11323 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11324 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11325 enum isl_dim_type c2
, enum isl_dim_type c3
,
11326 enum isl_dim_type c4
, enum isl_dim_type c5
)
11328 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11329 struct isl_mat
*mat
;
11335 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11336 isl_basic_map_total_dim(bmap
) + 1);
11339 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11340 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11341 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11342 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11343 isl_int_set(mat
->row
[i
][pos
],
11344 bmap
->ineq
[i
][off
+ k
]);
11352 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11353 __isl_take isl_space
*dim
,
11354 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11355 enum isl_dim_type c2
, enum isl_dim_type c3
,
11356 enum isl_dim_type c4
, enum isl_dim_type c5
)
11358 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11359 isl_basic_map
*bmap
;
11365 if (!dim
|| !eq
|| !ineq
)
11368 if (eq
->n_col
!= ineq
->n_col
)
11369 isl_die(dim
->ctx
, isl_error_invalid
,
11370 "equalities and inequalities matrices should have "
11371 "same number of columns", goto error
);
11373 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11375 if (eq
->n_col
< total
)
11376 isl_die(dim
->ctx
, isl_error_invalid
,
11377 "number of columns too small", goto error
);
11379 extra
= eq
->n_col
- total
;
11381 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11382 eq
->n_row
, ineq
->n_row
);
11385 for (i
= 0; i
< extra
; ++i
) {
11386 k
= isl_basic_map_alloc_div(bmap
);
11389 isl_int_set_si(bmap
->div
[k
][0], 0);
11391 for (i
= 0; i
< eq
->n_row
; ++i
) {
11392 l
= isl_basic_map_alloc_equality(bmap
);
11395 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11396 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11397 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11398 isl_int_set(bmap
->eq
[l
][off
+ k
],
11404 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11405 l
= isl_basic_map_alloc_inequality(bmap
);
11408 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11409 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11410 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11411 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11412 ineq
->row
[i
][pos
]);
11418 isl_space_free(dim
);
11420 isl_mat_free(ineq
);
11422 bmap
= isl_basic_map_simplify(bmap
);
11423 return isl_basic_map_finalize(bmap
);
11425 isl_space_free(dim
);
11427 isl_mat_free(ineq
);
11431 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11432 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11433 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11435 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
11436 c1
, c2
, c3
, c4
, isl_dim_in
);
11439 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11440 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11441 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11443 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
11444 c1
, c2
, c3
, c4
, isl_dim_in
);
11447 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11448 __isl_take isl_space
*dim
,
11449 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11450 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11452 return (isl_basic_set
*)
11453 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11454 c1
, c2
, c3
, c4
, isl_dim_in
);
11457 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11462 return isl_space_can_zip(bmap
->dim
);
11465 int isl_map_can_zip(__isl_keep isl_map
*map
)
11470 return isl_space_can_zip(map
->dim
);
11473 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11474 * (A -> C) -> (B -> D).
11476 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11485 if (!isl_basic_map_can_zip(bmap
))
11486 isl_die(bmap
->ctx
, isl_error_invalid
,
11487 "basic map cannot be zipped", goto error
);
11488 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11489 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11490 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11491 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11492 bmap
= isl_basic_map_cow(bmap
);
11493 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11496 bmap
->dim
= isl_space_zip(bmap
->dim
);
11501 isl_basic_map_free(bmap
);
11505 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11506 * (A -> C) -> (B -> D).
11508 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11515 if (!isl_map_can_zip(map
))
11516 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11519 map
= isl_map_cow(map
);
11523 for (i
= 0; i
< map
->n
; ++i
) {
11524 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11529 map
->dim
= isl_space_zip(map
->dim
);
11539 /* Can we apply isl_basic_map_curry to "bmap"?
11540 * That is, does it have a nested relation in its domain?
11542 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11547 return isl_space_can_curry(bmap
->dim
);
11550 /* Can we apply isl_map_curry to "map"?
11551 * That is, does it have a nested relation in its domain?
11553 int isl_map_can_curry(__isl_keep isl_map
*map
)
11558 return isl_space_can_curry(map
->dim
);
11561 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11564 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11570 if (!isl_basic_map_can_curry(bmap
))
11571 isl_die(bmap
->ctx
, isl_error_invalid
,
11572 "basic map cannot be curried", goto error
);
11573 bmap
= isl_basic_map_cow(bmap
);
11576 bmap
->dim
= isl_space_curry(bmap
->dim
);
11581 isl_basic_map_free(bmap
);
11585 /* Given a map (A -> B) -> C, return the corresponding map
11588 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11595 if (!isl_map_can_curry(map
))
11596 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
11599 map
= isl_map_cow(map
);
11603 for (i
= 0; i
< map
->n
; ++i
) {
11604 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
11609 map
->dim
= isl_space_curry(map
->dim
);
11619 /* Can we apply isl_basic_map_uncurry to "bmap"?
11620 * That is, does it have a nested relation in its domain?
11622 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11627 return isl_space_can_uncurry(bmap
->dim
);
11630 /* Can we apply isl_map_uncurry to "map"?
11631 * That is, does it have a nested relation in its domain?
11633 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
11638 return isl_space_can_uncurry(map
->dim
);
11641 /* Given a basic map A -> (B -> C), return the corresponding basic map
11644 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11650 if (!isl_basic_map_can_uncurry(bmap
))
11651 isl_die(bmap
->ctx
, isl_error_invalid
,
11652 "basic map cannot be uncurried",
11653 return isl_basic_map_free(bmap
));
11654 bmap
= isl_basic_map_cow(bmap
);
11657 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11659 return isl_basic_map_free(bmap
);
11663 /* Given a map A -> (B -> C), return the corresponding map
11666 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11673 if (!isl_map_can_uncurry(map
))
11674 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
11675 return isl_map_free(map
));
11677 map
= isl_map_cow(map
);
11681 for (i
= 0; i
< map
->n
; ++i
) {
11682 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
11684 return isl_map_free(map
);
11687 map
->dim
= isl_space_uncurry(map
->dim
);
11689 return isl_map_free(map
);
11694 /* Construct a basic map mapping the domain of the affine expression
11695 * to a one-dimensional range prescribed by the affine expression.
11697 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11701 isl_local_space
*ls
;
11702 isl_basic_map
*bmap
;
11707 ls
= isl_aff_get_local_space(aff
);
11708 bmap
= isl_basic_map_from_local_space(ls
);
11709 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11710 k
= isl_basic_map_alloc_equality(bmap
);
11714 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11715 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11716 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11717 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11718 aff
->v
->size
- (pos
+ 1));
11721 bmap
= isl_basic_map_finalize(bmap
);
11725 isl_basic_map_free(bmap
);
11729 /* Construct a map mapping the domain of the affine expression
11730 * to a one-dimensional range prescribed by the affine expression.
11732 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11734 isl_basic_map
*bmap
;
11736 bmap
= isl_basic_map_from_aff(aff
);
11737 return isl_map_from_basic_map(bmap
);
11740 /* Construct a basic map mapping the domain the multi-affine expression
11741 * to its range, with each dimension in the range equated to the
11742 * corresponding affine expression.
11744 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11745 __isl_take isl_multi_aff
*maff
)
11749 isl_basic_map
*bmap
;
11754 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11755 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11756 "invalid space", goto error
);
11758 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11759 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11761 for (i
= 0; i
< maff
->n
; ++i
) {
11763 isl_basic_map
*bmap_i
;
11765 aff
= isl_aff_copy(maff
->p
[i
]);
11766 bmap_i
= isl_basic_map_from_aff(aff
);
11768 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11771 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11773 isl_multi_aff_free(maff
);
11776 isl_multi_aff_free(maff
);
11780 /* Construct a map mapping the domain the multi-affine expression
11781 * to its range, with each dimension in the range equated to the
11782 * corresponding affine expression.
11784 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11786 isl_basic_map
*bmap
;
11788 bmap
= isl_basic_map_from_multi_aff(maff
);
11789 return isl_map_from_basic_map(bmap
);
11792 /* Construct a basic map mapping a domain in the given space to
11793 * to an n-dimensional range, with n the number of elements in the list,
11794 * where each coordinate in the range is prescribed by the
11795 * corresponding affine expression.
11796 * The domains of all affine expressions in the list are assumed to match
11799 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11800 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11804 isl_basic_map
*bmap
;
11809 dim
= isl_space_from_domain(domain_dim
);
11810 bmap
= isl_basic_map_universe(dim
);
11812 for (i
= 0; i
< list
->n
; ++i
) {
11814 isl_basic_map
*bmap_i
;
11816 aff
= isl_aff_copy(list
->p
[i
]);
11817 bmap_i
= isl_basic_map_from_aff(aff
);
11819 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11822 isl_aff_list_free(list
);
11826 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11827 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11829 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11832 /* Construct a basic map where the given dimensions are equal to each other.
11834 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11835 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11837 isl_basic_map
*bmap
= NULL
;
11843 if (pos1
>= isl_space_dim(space
, type1
))
11844 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11845 "index out of bounds", goto error
);
11846 if (pos2
>= isl_space_dim(space
, type2
))
11847 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11848 "index out of bounds", goto error
);
11850 if (type1
== type2
&& pos1
== pos2
)
11851 return isl_basic_map_universe(space
);
11853 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11854 i
= isl_basic_map_alloc_equality(bmap
);
11857 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11858 pos1
+= isl_basic_map_offset(bmap
, type1
);
11859 pos2
+= isl_basic_map_offset(bmap
, type2
);
11860 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11861 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11862 bmap
= isl_basic_map_finalize(bmap
);
11863 isl_space_free(space
);
11866 isl_space_free(space
);
11867 isl_basic_map_free(bmap
);
11871 /* Add a constraint imposing that the given two dimensions are equal.
11873 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
11874 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11878 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11880 bmap
= isl_basic_map_intersect(bmap
, eq
);
11885 /* Add a constraint imposing that the given two dimensions are equal.
11887 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
11888 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11890 isl_basic_map
*bmap
;
11892 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11894 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11899 /* Add a constraint imposing that the given two dimensions have opposite values.
11901 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
11902 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11904 isl_basic_map
*bmap
= NULL
;
11910 if (pos1
>= isl_map_dim(map
, type1
))
11911 isl_die(map
->ctx
, isl_error_invalid
,
11912 "index out of bounds", goto error
);
11913 if (pos2
>= isl_map_dim(map
, type2
))
11914 isl_die(map
->ctx
, isl_error_invalid
,
11915 "index out of bounds", goto error
);
11917 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11918 i
= isl_basic_map_alloc_equality(bmap
);
11921 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11922 pos1
+= isl_basic_map_offset(bmap
, type1
);
11923 pos2
+= isl_basic_map_offset(bmap
, type2
);
11924 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11925 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11926 bmap
= isl_basic_map_finalize(bmap
);
11928 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11932 isl_basic_map_free(bmap
);
11937 /* Construct a constraint imposing that the value of the first dimension is
11938 * greater than or equal to that of the second.
11940 static __isl_give isl_constraint
*constraint_order_ge(
11941 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
11942 enum isl_dim_type type2
, int pos2
)
11949 c
= isl_inequality_alloc(isl_local_space_from_space(space
));
11951 if (pos1
>= isl_constraint_dim(c
, type1
))
11952 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
11953 "index out of bounds", return isl_constraint_free(c
));
11954 if (pos2
>= isl_constraint_dim(c
, type2
))
11955 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
11956 "index out of bounds", return isl_constraint_free(c
));
11958 if (type1
== type2
&& pos1
== pos2
)
11961 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11962 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11967 /* Add a constraint imposing that the value of the first dimension is
11968 * greater than or equal to that of the second.
11970 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
11971 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11976 if (type1
== type2
&& pos1
== pos2
)
11978 space
= isl_basic_map_get_space(bmap
);
11979 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
11980 bmap
= isl_basic_map_add_constraint(bmap
, c
);
11985 /* Add a constraint imposing that the value of the first dimension is
11986 * greater than or equal to that of the second.
11988 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
11989 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11994 if (type1
== type2
&& pos1
== pos2
)
11996 space
= isl_map_get_space(map
);
11997 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
11998 map
= isl_map_add_constraint(map
, c
);
12003 /* Add a constraint imposing that the value of the first dimension is
12004 * less than or equal to that of the second.
12006 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12007 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12009 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12012 /* Construct a basic map where the value of the first dimension is
12013 * greater than that of the second.
12015 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12016 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12018 isl_basic_map
*bmap
= NULL
;
12024 if (pos1
>= isl_space_dim(space
, type1
))
12025 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12026 "index out of bounds", goto error
);
12027 if (pos2
>= isl_space_dim(space
, type2
))
12028 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12029 "index out of bounds", goto error
);
12031 if (type1
== type2
&& pos1
== pos2
)
12032 return isl_basic_map_empty(space
);
12034 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12035 i
= isl_basic_map_alloc_inequality(bmap
);
12037 return isl_basic_map_free(bmap
);
12038 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12039 pos1
+= isl_basic_map_offset(bmap
, type1
);
12040 pos2
+= isl_basic_map_offset(bmap
, type2
);
12041 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12042 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12043 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12044 bmap
= isl_basic_map_finalize(bmap
);
12048 isl_space_free(space
);
12049 isl_basic_map_free(bmap
);
12053 /* Add a constraint imposing that the value of the first dimension is
12054 * greater than that of the second.
12056 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12057 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12061 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12063 bmap
= isl_basic_map_intersect(bmap
, gt
);
12068 /* Add a constraint imposing that the value of the first dimension is
12069 * greater than that of the second.
12071 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12072 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12074 isl_basic_map
*bmap
;
12076 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12078 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12083 /* Add a constraint imposing that the value of the first dimension is
12084 * smaller than that of the second.
12086 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12087 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12089 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12092 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12096 isl_local_space
*ls
;
12101 if (!isl_basic_map_divs_known(bmap
))
12102 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12103 "some divs are unknown", return NULL
);
12105 ls
= isl_basic_map_get_local_space(bmap
);
12106 div
= isl_local_space_get_div(ls
, pos
);
12107 isl_local_space_free(ls
);
12112 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12115 return isl_basic_map_get_div(bset
, pos
);
12118 /* Plug in "subs" for dimension "type", "pos" of "bset".
12120 * Let i be the dimension to replace and let "subs" be of the form
12124 * Any integer division with a non-zero coefficient for i,
12126 * floor((a i + g)/m)
12130 * floor((a f + d g)/(m d))
12132 * Constraints of the form
12140 * We currently require that "subs" is an integral expression.
12141 * Handling rational expressions may require us to add stride constraints
12142 * as we do in isl_basic_set_preimage_multi_aff.
12144 __isl_give isl_basic_set
*isl_basic_set_substitute(
12145 __isl_take isl_basic_set
*bset
,
12146 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12152 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12155 bset
= isl_basic_set_cow(bset
);
12156 if (!bset
|| !subs
)
12159 ctx
= isl_basic_set_get_ctx(bset
);
12160 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12161 isl_die(ctx
, isl_error_invalid
,
12162 "spaces don't match", goto error
);
12163 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12164 isl_die(ctx
, isl_error_unsupported
,
12165 "cannot handle divs yet", goto error
);
12166 if (!isl_int_is_one(subs
->v
->el
[0]))
12167 isl_die(ctx
, isl_error_invalid
,
12168 "can only substitute integer expressions", goto error
);
12170 pos
+= isl_basic_set_offset(bset
, type
);
12174 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12175 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12177 isl_int_set(v
, bset
->eq
[i
][pos
]);
12178 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12179 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12180 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12183 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12184 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12186 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12187 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12188 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12189 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12192 for (i
= 0; i
< bset
->n_div
; ++i
) {
12193 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12195 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12196 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12197 isl_seq_combine(bset
->div
[i
] + 1,
12198 subs
->v
->el
[0], bset
->div
[i
] + 1,
12199 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12200 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12205 bset
= isl_basic_set_simplify(bset
);
12206 return isl_basic_set_finalize(bset
);
12208 isl_basic_set_free(bset
);
12212 /* Plug in "subs" for dimension "type", "pos" of "set".
12214 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12215 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12219 if (set
&& isl_set_plain_is_empty(set
))
12222 set
= isl_set_cow(set
);
12226 for (i
= set
->n
- 1; i
>= 0; --i
) {
12227 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12228 if (remove_if_empty(set
, i
) < 0)
12238 /* Check if the range of "ma" is compatible with the domain or range
12239 * (depending on "type") of "bmap".
12240 * Return -1 if anything is wrong.
12242 static int check_basic_map_compatible_range_multi_aff(
12243 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12244 __isl_keep isl_multi_aff
*ma
)
12247 isl_space
*ma_space
;
12249 ma_space
= isl_multi_aff_get_space(ma
);
12251 m
= isl_space_match(bmap
->dim
, isl_dim_param
, ma_space
, isl_dim_param
);
12255 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12256 "parameters don't match", goto error
);
12257 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12261 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12262 "spaces don't match", goto error
);
12264 isl_space_free(ma_space
);
12267 isl_space_free(ma_space
);
12271 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12272 * coefficients before the transformed range of dimensions,
12273 * the "n_after" coefficients after the transformed range of dimensions
12274 * and the coefficients of the other divs in "bmap".
12276 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12277 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12282 isl_local_space
*ls
;
12287 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12291 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12292 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12293 for (i
= 0; i
< n_div
; ++i
) {
12294 int o_bmap
= 0, o_ls
= 0;
12296 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12297 o_bmap
+= 1 + 1 + n_param
;
12298 o_ls
+= 1 + 1 + n_param
;
12299 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12300 o_bmap
+= n_before
;
12301 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12302 ls
->div
->row
[i
] + o_ls
, n_set
);
12305 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12307 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12308 ls
->div
->row
[i
] + o_ls
, n_div
);
12311 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12312 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
12316 isl_local_space_free(ls
);
12319 isl_local_space_free(ls
);
12323 /* How many stride constraints does "ma" enforce?
12324 * That is, how many of the affine expressions have a denominator
12325 * different from one?
12327 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12332 for (i
= 0; i
< ma
->n
; ++i
)
12333 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12339 /* For each affine expression in ma of the form
12341 * x_i = (f_i y + h_i)/m_i
12343 * with m_i different from one, add a constraint to "bmap"
12346 * f_i y + h_i = m_i alpha_i
12348 * with alpha_i an additional existentially quantified variable.
12350 static __isl_give isl_basic_map
*add_ma_strides(
12351 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12352 int n_before
, int n_after
)
12361 total
= isl_basic_map_total_dim(bmap
);
12362 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12363 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12364 n_div
= isl_multi_aff_dim(ma
, isl_dim_div
);
12365 for (i
= 0; i
< ma
->n
; ++i
) {
12366 int o_bmap
= 0, o_ma
= 1;
12368 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12370 div
= isl_basic_map_alloc_div(bmap
);
12371 k
= isl_basic_map_alloc_equality(bmap
);
12372 if (div
< 0 || k
< 0)
12374 isl_int_set_si(bmap
->div
[div
][0], 0);
12375 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12376 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12377 o_bmap
+= 1 + n_param
;
12378 o_ma
+= 1 + n_param
;
12379 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12380 o_bmap
+= n_before
;
12381 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12382 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12385 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12387 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12388 ma
->p
[i
]->v
->el
+ o_ma
, n_div
);
12391 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12392 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12398 isl_basic_map_free(bmap
);
12402 /* Replace the domain or range space (depending on "type) of "space" by "set".
12404 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12405 enum isl_dim_type type
, __isl_take isl_space
*set
)
12407 if (type
== isl_dim_in
) {
12408 space
= isl_space_range(space
);
12409 space
= isl_space_map_from_domain_and_range(set
, space
);
12411 space
= isl_space_domain(space
);
12412 space
= isl_space_map_from_domain_and_range(space
, set
);
12418 /* Compute the preimage of the domain or range (depending on "type")
12419 * of "bmap" under the function represented by "ma".
12420 * In other words, plug in "ma" in the domain or range of "bmap".
12421 * The result is a basic map that lives in the same space as "bmap"
12422 * except that the domain or range has been replaced by
12423 * the domain space of "ma".
12425 * If bmap is represented by
12427 * A(p) + S u + B x + T v + C(divs) >= 0,
12429 * where u and x are input and output dimensions if type == isl_dim_out
12430 * while x and v are input and output dimensions if type == isl_dim_in,
12431 * and ma is represented by
12433 * x = D(p) + F(y) + G(divs')
12435 * then the result is
12437 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12439 * The divs in the input set are similarly adjusted.
12442 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12446 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12447 * B_i G(divs') + c_i(divs))/n_i)
12449 * If bmap is not a rational map and if F(y) involves any denominators
12451 * x_i = (f_i y + h_i)/m_i
12453 * then additional constraints are added to ensure that we only
12454 * map back integer points. That is we enforce
12456 * f_i y + h_i = m_i alpha_i
12458 * with alpha_i an additional existentially quantified variable.
12460 * We first copy over the divs from "ma".
12461 * Then we add the modified constraints and divs from "bmap".
12462 * Finally, we add the stride constraints, if needed.
12464 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12465 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12466 __isl_take isl_multi_aff
*ma
)
12470 isl_basic_map
*res
= NULL
;
12471 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12472 isl_int f
, c1
, c2
, g
;
12473 int rational
, strides
;
12480 ma
= isl_multi_aff_align_divs(ma
);
12483 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12486 if (type
== isl_dim_in
) {
12488 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12490 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12493 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12494 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12496 space
= isl_multi_aff_get_domain_space(ma
);
12497 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12498 rational
= isl_basic_map_is_rational(bmap
);
12499 strides
= rational
? 0 : multi_aff_strides(ma
);
12500 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12501 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12503 res
= isl_basic_map_set_rational(res
);
12505 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12506 if (isl_basic_map_alloc_div(res
) < 0)
12509 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12512 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12513 k
= isl_basic_map_alloc_equality(res
);
12516 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12517 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12520 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12521 k
= isl_basic_map_alloc_inequality(res
);
12524 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12525 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12528 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12529 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12530 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12533 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12534 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12539 res
= add_ma_strides(res
, ma
, n_before
, n_after
);
12545 isl_basic_map_free(bmap
);
12546 isl_multi_aff_free(ma
);
12547 res
= isl_basic_set_simplify(res
);
12548 return isl_basic_map_finalize(res
);
12554 isl_basic_map_free(bmap
);
12555 isl_multi_aff_free(ma
);
12556 isl_basic_map_free(res
);
12560 /* Compute the preimage of "bset" under the function represented by "ma".
12561 * In other words, plug in "ma" in "bset". The result is a basic set
12562 * that lives in the domain space of "ma".
12564 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12565 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12567 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12570 /* Compute the preimage of the domain of "bmap" under the function
12571 * represented by "ma".
12572 * In other words, plug in "ma" in the domain of "bmap".
12573 * The result is a basic map that lives in the same space as "bmap"
12574 * except that the domain has been replaced by the domain space of "ma".
12576 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12577 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12579 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12582 /* Compute the preimage of the range of "bmap" under the function
12583 * represented by "ma".
12584 * In other words, plug in "ma" in the range of "bmap".
12585 * The result is a basic map that lives in the same space as "bmap"
12586 * except that the range has been replaced by the domain space of "ma".
12588 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12589 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12591 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12594 /* Check if the range of "ma" is compatible with the domain or range
12595 * (depending on "type") of "map".
12596 * Return -1 if anything is wrong.
12598 static int check_map_compatible_range_multi_aff(
12599 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12600 __isl_keep isl_multi_aff
*ma
)
12603 isl_space
*ma_space
;
12605 ma_space
= isl_multi_aff_get_space(ma
);
12606 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12607 isl_space_free(ma_space
);
12609 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12610 "spaces don't match", return -1);
12614 /* Compute the preimage of the domain or range (depending on "type")
12615 * of "map" under the function represented by "ma".
12616 * In other words, plug in "ma" in the domain or range of "map".
12617 * The result is a map that lives in the same space as "map"
12618 * except that the domain or range has been replaced by
12619 * the domain space of "ma".
12621 * The parameters are assumed to have been aligned.
12623 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
12624 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12629 map
= isl_map_cow(map
);
12630 ma
= isl_multi_aff_align_divs(ma
);
12633 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
12636 for (i
= 0; i
< map
->n
; ++i
) {
12637 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
12638 isl_multi_aff_copy(ma
));
12643 space
= isl_multi_aff_get_domain_space(ma
);
12644 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
12646 isl_space_free(map
->dim
);
12651 isl_multi_aff_free(ma
);
12653 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
12654 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
12657 isl_multi_aff_free(ma
);
12662 /* Compute the preimage of the domain or range (depending on "type")
12663 * of "map" under the function represented by "ma".
12664 * In other words, plug in "ma" in the domain or range of "map".
12665 * The result is a map that lives in the same space as "map"
12666 * except that the domain or range has been replaced by
12667 * the domain space of "ma".
12669 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
12670 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12675 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
12676 return map_preimage_multi_aff(map
, type
, ma
);
12678 if (!isl_space_has_named_params(map
->dim
) ||
12679 !isl_space_has_named_params(ma
->space
))
12680 isl_die(map
->ctx
, isl_error_invalid
,
12681 "unaligned unnamed parameters", goto error
);
12682 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
12683 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
12685 return map_preimage_multi_aff(map
, type
, ma
);
12687 isl_multi_aff_free(ma
);
12688 return isl_map_free(map
);
12691 /* Compute the preimage of "set" under the function represented by "ma".
12692 * In other words, plug in "ma" in "set". The result is a set
12693 * that lives in the domain space of "ma".
12695 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
12696 __isl_take isl_multi_aff
*ma
)
12698 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
12701 /* Compute the preimage of the domain of "map" under the function
12702 * represented by "ma".
12703 * In other words, plug in "ma" in the domain of "map".
12704 * The result is a map that lives in the same space as "map"
12705 * except that the domain has been replaced by the domain space of "ma".
12707 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12708 __isl_take isl_multi_aff
*ma
)
12710 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12713 /* Compute the preimage of the range of "map" under the function
12714 * represented by "ma".
12715 * In other words, plug in "ma" in the range of "map".
12716 * The result is a map that lives in the same space as "map"
12717 * except that the range has been replaced by the domain space of "ma".
12719 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
12720 __isl_take isl_multi_aff
*ma
)
12722 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
12725 /* Compute the preimage of "map" under the function represented by "pma".
12726 * In other words, plug in "pma" in the domain or range of "map".
12727 * The result is a map that lives in the same space as "map",
12728 * except that the space of type "type" has been replaced by
12729 * the domain space of "pma".
12731 * The parameters of "map" and "pma" are assumed to have been aligned.
12733 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
12734 __isl_take isl_map
*map
, enum isl_dim_type type
,
12735 __isl_take isl_pw_multi_aff
*pma
)
12744 isl_pw_multi_aff_free(pma
);
12745 res
= isl_map_empty(isl_map_get_space(map
));
12750 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12751 isl_multi_aff_copy(pma
->p
[0].maff
));
12752 if (type
== isl_dim_in
)
12753 res
= isl_map_intersect_domain(res
,
12754 isl_map_copy(pma
->p
[0].set
));
12756 res
= isl_map_intersect_range(res
,
12757 isl_map_copy(pma
->p
[0].set
));
12759 for (i
= 1; i
< pma
->n
; ++i
) {
12762 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
12763 isl_multi_aff_copy(pma
->p
[i
].maff
));
12764 if (type
== isl_dim_in
)
12765 res_i
= isl_map_intersect_domain(res_i
,
12766 isl_map_copy(pma
->p
[i
].set
));
12768 res_i
= isl_map_intersect_range(res_i
,
12769 isl_map_copy(pma
->p
[i
].set
));
12770 res
= isl_map_union(res
, res_i
);
12773 isl_pw_multi_aff_free(pma
);
12777 isl_pw_multi_aff_free(pma
);
12782 /* Compute the preimage of "map" under the function represented by "pma".
12783 * In other words, plug in "pma" in the domain or range of "map".
12784 * The result is a map that lives in the same space as "map",
12785 * except that the space of type "type" has been replaced by
12786 * the domain space of "pma".
12788 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
12789 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
12794 if (isl_space_match(map
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
12795 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12797 if (!isl_space_has_named_params(map
->dim
) ||
12798 !isl_space_has_named_params(pma
->dim
))
12799 isl_die(map
->ctx
, isl_error_invalid
,
12800 "unaligned unnamed parameters", goto error
);
12801 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
12802 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
12804 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
12806 isl_pw_multi_aff_free(pma
);
12807 return isl_map_free(map
);
12810 /* Compute the preimage of "set" under the function represented by "pma".
12811 * In other words, plug in "pma" in "set". The result is a set
12812 * that lives in the domain space of "pma".
12814 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
12815 __isl_take isl_pw_multi_aff
*pma
)
12817 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
12820 /* Compute the preimage of the domain of "map" under the function
12821 * represented by "pma".
12822 * In other words, plug in "pma" in the domain of "map".
12823 * The result is a map that lives in the same space as "map",
12824 * except that domain space has been replaced by the domain space of "pma".
12826 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
12827 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12829 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
12832 /* Compute the preimage of the range of "map" under the function
12833 * represented by "pma".
12834 * In other words, plug in "pma" in the range of "map".
12835 * The result is a map that lives in the same space as "map",
12836 * except that range space has been replaced by the domain space of "pma".
12838 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
12839 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
12841 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
12844 /* Compute the preimage of "map" under the function represented by "mpa".
12845 * In other words, plug in "mpa" in the domain or range of "map".
12846 * The result is a map that lives in the same space as "map",
12847 * except that the space of type "type" has been replaced by
12848 * the domain space of "mpa".
12850 * If the map does not involve any constraints that refer to the
12851 * dimensions of the substituted space, then the only possible
12852 * effect of "mpa" on the map is to map the space to a different space.
12853 * We create a separate isl_multi_aff to effectuate this change
12854 * in order to avoid spurious splitting of the map along the pieces
12857 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
12858 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
12861 isl_pw_multi_aff
*pma
;
12866 n
= isl_map_dim(map
, type
);
12867 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
12871 space
= isl_multi_pw_aff_get_space(mpa
);
12872 isl_multi_pw_aff_free(mpa
);
12873 ma
= isl_multi_aff_zero(space
);
12874 return isl_map_preimage_multi_aff(map
, type
, ma
);
12877 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
12878 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
12881 isl_multi_pw_aff_free(mpa
);
12885 /* Compute the preimage of "map" under the function represented by "mpa".
12886 * In other words, plug in "mpa" in the domain "map".
12887 * The result is a map that lives in the same space as "map",
12888 * except that domain space has been replaced by the domain space of "mpa".
12890 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
12891 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
12893 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
12896 /* Compute the preimage of "set" by the function represented by "mpa".
12897 * In other words, plug in "mpa" in "set".
12899 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
12900 __isl_take isl_multi_pw_aff
*mpa
)
12902 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);