2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2016 Sven Verdoolaege
9 * Use of this software is governed by the MIT license
11 * Written by Sven Verdoolaege, K.U.Leuven, Departement
12 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
14 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
19 * CS 42112, 75589 Paris Cedex 12, France
23 #include <isl_ctx_private.h>
24 #include <isl_map_private.h>
27 #include <isl/constraint.h>
28 #include "isl_space_private.h"
29 #include "isl_equalities.h"
30 #include <isl_lp_private.h>
34 #include <isl_reordering.h>
35 #include "isl_sample.h"
39 #include <isl_mat_private.h>
40 #include <isl_vec_private.h>
41 #include <isl_dim_map.h>
42 #include <isl_local_space_private.h>
43 #include <isl_aff_private.h>
44 #include <isl_options_private.h>
45 #include <isl_morph.h>
46 #include <isl_val_private.h>
48 #include <bset_to_bmap.c>
49 #include <bset_from_bmap.c>
50 #include <set_to_map.c>
51 #include <set_from_map.c>
53 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
56 case isl_dim_param
: return dim
->nparam
;
57 case isl_dim_in
: return dim
->n_in
;
58 case isl_dim_out
: return dim
->n_out
;
59 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
64 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return 1;
68 case isl_dim_in
: return 1 + dim
->nparam
;
69 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
74 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
75 enum isl_dim_type type
)
80 case isl_dim_cst
: return 1;
83 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
84 case isl_dim_div
: return bmap
->n_div
;
85 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
90 /* Return the space of "map".
92 __isl_keep isl_space
*isl_map_peek_space(__isl_keep
const isl_map
*map
)
94 return map
? map
->dim
: NULL
;
97 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
99 return map
? n(map
->dim
, type
) : 0;
102 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
104 return set
? n(set
->dim
, type
) : 0;
107 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
108 enum isl_dim_type type
)
117 case isl_dim_cst
: return 0;
118 case isl_dim_param
: return 1;
119 case isl_dim_in
: return 1 + space
->nparam
;
120 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
121 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
127 unsigned isl_basic_set_offset(__isl_keep isl_basic_set
*bset
,
128 enum isl_dim_type type
)
130 return isl_basic_map_offset(bset
, type
);
133 static unsigned map_offset(__isl_keep isl_map
*map
, enum isl_dim_type type
)
135 return pos(map
->dim
, type
);
138 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
139 enum isl_dim_type type
)
141 return isl_basic_map_dim(bset
, type
);
144 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
146 return isl_basic_set_dim(bset
, isl_dim_set
);
149 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
151 return isl_basic_set_dim(bset
, isl_dim_param
);
154 unsigned isl_basic_set_total_dim(__isl_keep
const isl_basic_set
*bset
)
158 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
161 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
163 return isl_set_dim(set
, isl_dim_set
);
166 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
168 return isl_set_dim(set
, isl_dim_param
);
171 unsigned isl_basic_map_n_in(__isl_keep
const isl_basic_map
*bmap
)
173 return bmap
? bmap
->dim
->n_in
: 0;
176 unsigned isl_basic_map_n_out(__isl_keep
const isl_basic_map
*bmap
)
178 return bmap
? bmap
->dim
->n_out
: 0;
181 unsigned isl_basic_map_n_param(__isl_keep
const isl_basic_map
*bmap
)
183 return bmap
? bmap
->dim
->nparam
: 0;
186 unsigned isl_basic_map_n_div(__isl_keep
const isl_basic_map
*bmap
)
188 return bmap
? bmap
->n_div
: 0;
191 unsigned isl_basic_map_total_dim(__isl_keep
const isl_basic_map
*bmap
)
193 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
196 unsigned isl_map_n_in(__isl_keep
const isl_map
*map
)
198 return map
? map
->dim
->n_in
: 0;
201 unsigned isl_map_n_out(__isl_keep
const isl_map
*map
)
203 return map
? map
->dim
->n_out
: 0;
206 unsigned isl_map_n_param(__isl_keep
const isl_map
*map
)
208 return map
? map
->dim
->nparam
: 0;
211 /* Return the number of equality constraints in the description of "bmap".
212 * Return -1 on error.
214 int isl_basic_map_n_equality(__isl_keep isl_basic_map
*bmap
)
221 /* Return the number of equality constraints in the description of "bset".
222 * Return -1 on error.
224 int isl_basic_set_n_equality(__isl_keep isl_basic_set
*bset
)
226 return isl_basic_map_n_equality(bset_to_bmap(bset
));
229 /* Return the number of inequality constraints in the description of "bmap".
230 * Return -1 on error.
232 int isl_basic_map_n_inequality(__isl_keep isl_basic_map
*bmap
)
239 /* Return the number of inequality constraints in the description of "bset".
240 * Return -1 on error.
242 int isl_basic_set_n_inequality(__isl_keep isl_basic_set
*bset
)
244 return isl_basic_map_n_inequality(bset_to_bmap(bset
));
247 /* Do "bmap1" and "bmap2" have the same parameters?
249 static isl_bool
isl_basic_map_has_equal_params(__isl_keep isl_basic_map
*bmap1
,
250 __isl_keep isl_basic_map
*bmap2
)
252 isl_space
*space1
, *space2
;
254 space1
= isl_basic_map_peek_space(bmap1
);
255 space2
= isl_basic_map_peek_space(bmap2
);
256 return isl_space_has_equal_params(space1
, space2
);
259 /* Do "map1" and "map2" have the same parameters?
261 isl_bool
isl_map_has_equal_params(__isl_keep isl_map
*map1
,
262 __isl_keep isl_map
*map2
)
264 isl_space
*space1
, *space2
;
266 space1
= isl_map_peek_space(map1
);
267 space2
= isl_map_peek_space(map2
);
268 return isl_space_has_equal_params(space1
, space2
);
271 /* Do "map" and "set" have the same parameters?
273 static isl_bool
isl_map_set_has_equal_params(__isl_keep isl_map
*map
,
274 __isl_keep isl_set
*set
)
276 return isl_map_has_equal_params(map
, set_to_map(set
));
279 isl_bool
isl_map_compatible_domain(__isl_keep isl_map
*map
,
280 __isl_keep isl_set
*set
)
284 return isl_bool_error
;
285 m
= isl_map_has_equal_params(map
, set_to_map(set
));
288 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
289 set
->dim
, isl_dim_set
);
292 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
293 __isl_keep isl_basic_set
*bset
)
297 return isl_bool_error
;
298 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
301 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
302 bset
->dim
, isl_dim_set
);
305 isl_bool
isl_map_compatible_range(__isl_keep isl_map
*map
,
306 __isl_keep isl_set
*set
)
310 return isl_bool_error
;
311 m
= isl_map_has_equal_params(map
, set_to_map(set
));
314 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
315 set
->dim
, isl_dim_set
);
318 isl_bool
isl_basic_map_compatible_range(__isl_keep isl_basic_map
*bmap
,
319 __isl_keep isl_basic_set
*bset
)
323 return isl_bool_error
;
324 m
= isl_basic_map_has_equal_params(bmap
, bset_to_bmap(bset
));
327 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
328 bset
->dim
, isl_dim_set
);
331 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
333 return bmap
? bmap
->ctx
: NULL
;
336 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
338 return bset
? bset
->ctx
: NULL
;
341 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
343 return map
? map
->ctx
: NULL
;
346 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
348 return set
? set
->ctx
: NULL
;
351 /* Return the space of "bmap".
353 __isl_keep isl_space
*isl_basic_map_peek_space(
354 __isl_keep
const isl_basic_map
*bmap
)
356 return bmap
? bmap
->dim
: NULL
;
359 /* Return the space of "bset".
361 __isl_keep isl_space
*isl_basic_set_peek_space(__isl_keep isl_basic_set
*bset
)
363 return isl_basic_map_peek_space(bset_to_bmap(bset
));
366 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
368 return isl_space_copy(isl_basic_map_peek_space(bmap
));
371 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
373 return isl_basic_map_get_space(bset_to_bmap(bset
));
376 /* Extract the divs in "bmap" as a matrix.
378 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
389 ctx
= isl_basic_map_get_ctx(bmap
);
390 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
391 cols
= 1 + 1 + total
+ bmap
->n_div
;
392 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
396 for (i
= 0; i
< bmap
->n_div
; ++i
)
397 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
402 /* Extract the divs in "bset" as a matrix.
404 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
406 return isl_basic_map_get_divs(bset
);
409 __isl_give isl_local_space
*isl_basic_map_get_local_space(
410 __isl_keep isl_basic_map
*bmap
)
417 div
= isl_basic_map_get_divs(bmap
);
418 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
421 __isl_give isl_local_space
*isl_basic_set_get_local_space(
422 __isl_keep isl_basic_set
*bset
)
424 return isl_basic_map_get_local_space(bset
);
427 /* For each known div d = floor(f/m), add the constraints
430 * -(f-(m-1)) + m d >= 0
432 * Do not finalize the result.
434 static __isl_give isl_basic_map
*add_known_div_constraints(
435 __isl_take isl_basic_map
*bmap
)
442 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
445 bmap
= isl_basic_map_cow(bmap
);
446 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
449 for (i
= 0; i
< n_div
; ++i
) {
450 if (isl_int_is_zero(bmap
->div
[i
][0]))
452 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
453 return isl_basic_map_free(bmap
);
459 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
460 __isl_take isl_local_space
*ls
)
469 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
470 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
471 n_div
, 0, 2 * n_div
);
473 for (i
= 0; i
< n_div
; ++i
)
474 if (isl_basic_map_alloc_div(bmap
) < 0)
477 for (i
= 0; i
< n_div
; ++i
)
478 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
479 bmap
= add_known_div_constraints(bmap
);
481 isl_local_space_free(ls
);
484 isl_local_space_free(ls
);
485 isl_basic_map_free(bmap
);
489 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
490 __isl_take isl_local_space
*ls
)
492 return isl_basic_map_from_local_space(ls
);
495 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
497 return isl_space_copy(isl_map_peek_space(map
));
500 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
504 return isl_space_copy(set
->dim
);
507 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
508 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
510 bmap
= isl_basic_map_cow(bmap
);
513 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
516 bmap
= isl_basic_map_finalize(bmap
);
519 isl_basic_map_free(bmap
);
523 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
524 __isl_take isl_basic_set
*bset
, const char *s
)
526 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
529 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
530 enum isl_dim_type type
)
532 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
535 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
536 enum isl_dim_type type
, const char *s
)
540 map
= isl_map_cow(map
);
544 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
548 for (i
= 0; i
< map
->n
; ++i
) {
549 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
560 /* Replace the identifier of the tuple of type "type" by "id".
562 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
563 __isl_take isl_basic_map
*bmap
,
564 enum isl_dim_type type
, __isl_take isl_id
*id
)
566 bmap
= isl_basic_map_cow(bmap
);
569 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
571 return isl_basic_map_free(bmap
);
572 bmap
= isl_basic_map_finalize(bmap
);
579 /* Replace the identifier of the tuple by "id".
581 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
582 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
584 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
587 /* Does the input or output tuple have a name?
589 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
591 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
594 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
595 enum isl_dim_type type
)
597 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
600 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
603 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
607 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
608 enum isl_dim_type type
, __isl_take isl_id
*id
)
610 map
= isl_map_cow(map
);
614 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
616 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
622 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
623 __isl_take isl_id
*id
)
625 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
628 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
629 enum isl_dim_type type
)
631 map
= isl_map_cow(map
);
635 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
637 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
640 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
642 return isl_map_reset_tuple_id(set
, isl_dim_set
);
645 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
647 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
650 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
651 enum isl_dim_type type
)
653 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
656 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
658 return isl_map_has_tuple_id(set
, isl_dim_set
);
661 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
663 return isl_map_get_tuple_id(set
, isl_dim_set
);
666 /* Does the set tuple have a name?
668 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
671 return isl_bool_error
;
672 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
676 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
678 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
681 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
683 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
686 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
687 enum isl_dim_type type
, unsigned pos
)
689 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
692 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
693 enum isl_dim_type type
, unsigned pos
)
695 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
698 /* Does the given dimension have a name?
700 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
701 enum isl_dim_type type
, unsigned pos
)
704 return isl_bool_error
;
705 return isl_space_has_dim_name(map
->dim
, type
, pos
);
708 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
709 enum isl_dim_type type
, unsigned pos
)
711 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
714 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
715 enum isl_dim_type type
, unsigned pos
)
717 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
720 /* Does the given dimension have a name?
722 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
723 enum isl_dim_type type
, unsigned pos
)
726 return isl_bool_error
;
727 return isl_space_has_dim_name(set
->dim
, type
, pos
);
730 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
731 __isl_take isl_basic_map
*bmap
,
732 enum isl_dim_type type
, unsigned pos
, const char *s
)
734 bmap
= isl_basic_map_cow(bmap
);
737 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
740 return isl_basic_map_finalize(bmap
);
742 isl_basic_map_free(bmap
);
746 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
747 enum isl_dim_type type
, unsigned pos
, const char *s
)
751 map
= isl_map_cow(map
);
755 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
759 for (i
= 0; i
< map
->n
; ++i
) {
760 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
771 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
772 __isl_take isl_basic_set
*bset
,
773 enum isl_dim_type type
, unsigned pos
, const char *s
)
775 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
779 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
780 enum isl_dim_type type
, unsigned pos
, const char *s
)
782 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
786 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
787 enum isl_dim_type type
, unsigned pos
)
790 return isl_bool_error
;
791 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
794 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
795 enum isl_dim_type type
, unsigned pos
)
797 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
800 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
801 enum isl_dim_type type
, unsigned pos
)
803 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
806 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
807 enum isl_dim_type type
, unsigned pos
)
809 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
812 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
813 enum isl_dim_type type
, unsigned pos
)
815 return isl_map_has_dim_id(set
, type
, pos
);
818 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
819 enum isl_dim_type type
, unsigned pos
)
821 return isl_map_get_dim_id(set
, type
, pos
);
824 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
825 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
827 map
= isl_map_cow(map
);
831 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
833 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
839 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
840 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
842 return isl_map_set_dim_id(set
, type
, pos
, id
);
845 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
846 __isl_keep isl_id
*id
)
850 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
853 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
854 __isl_keep isl_id
*id
)
856 return isl_map_find_dim_by_id(set
, type
, id
);
859 /* Return the position of the dimension of the given type and name
861 * Return -1 if no such dimension can be found.
863 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
864 enum isl_dim_type type
, const char *name
)
868 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
871 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
876 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
879 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
882 return isl_map_find_dim_by_name(set
, type
, name
);
885 /* Check whether equality i of bset is a pure stride constraint
886 * on a single dimension, i.e., of the form
890 * with k a constant and e an existentially quantified variable.
892 isl_bool
isl_basic_set_eq_is_stride(__isl_keep isl_basic_set
*bset
, int i
)
901 return isl_bool_error
;
903 if (!isl_int_is_zero(bset
->eq
[i
][0]))
904 return isl_bool_false
;
906 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
907 d
= isl_basic_set_dim(bset
, isl_dim_set
);
908 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
910 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1, nparam
) != -1)
911 return isl_bool_false
;
912 pos1
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
, d
);
914 return isl_bool_false
;
915 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ pos1
+ 1,
917 return isl_bool_false
;
919 pos2
= isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
, n_div
);
921 return isl_bool_false
;
922 if (isl_seq_first_non_zero(bset
->eq
[i
] + 1 + nparam
+ d
+ pos2
+ 1,
923 n_div
- pos2
- 1) != -1)
924 return isl_bool_false
;
925 if (!isl_int_is_one(bset
->eq
[i
][1 + nparam
+ pos1
]) &&
926 !isl_int_is_negone(bset
->eq
[i
][1 + nparam
+ pos1
]))
927 return isl_bool_false
;
929 return isl_bool_true
;
932 /* Reset the user pointer on all identifiers of parameters and tuples
933 * of the space of "map".
935 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
939 space
= isl_map_get_space(map
);
940 space
= isl_space_reset_user(space
);
941 map
= isl_map_reset_space(map
, space
);
946 /* Reset the user pointer on all identifiers of parameters and tuples
947 * of the space of "set".
949 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
951 return isl_map_reset_user(set
);
954 isl_bool
isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
957 return isl_bool_error
;
958 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
961 /* Has "map" been marked as a rational map?
962 * In particular, have all basic maps in "map" been marked this way?
963 * An empty map is not considered to be rational.
964 * Maps where only some of the basic maps are marked rational
967 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
973 return isl_bool_error
;
975 return isl_bool_false
;
976 rational
= isl_basic_map_is_rational(map
->p
[0]);
979 for (i
= 1; i
< map
->n
; ++i
) {
982 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
985 if (rational
!= rational_i
)
986 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
987 "mixed rational and integer basic maps "
988 "not supported", return isl_bool_error
);
994 /* Has "set" been marked as a rational set?
995 * In particular, have all basic set in "set" been marked this way?
996 * An empty set is not considered to be rational.
997 * Sets where only some of the basic sets are marked rational
1000 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
1002 return isl_map_is_rational(set
);
1005 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
1007 return isl_basic_map_is_rational(bset
);
1010 /* Does "bmap" contain any rational points?
1012 * If "bmap" has an equality for each dimension, equating the dimension
1013 * to an integer constant, then it has no rational points, even if it
1014 * is marked as rational.
1016 isl_bool
isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
1018 isl_bool has_rational
= isl_bool_true
;
1022 return isl_bool_error
;
1023 if (isl_basic_map_plain_is_empty(bmap
))
1024 return isl_bool_false
;
1025 if (!isl_basic_map_is_rational(bmap
))
1026 return isl_bool_false
;
1027 bmap
= isl_basic_map_copy(bmap
);
1028 bmap
= isl_basic_map_implicit_equalities(bmap
);
1030 return isl_bool_error
;
1031 total
= isl_basic_map_total_dim(bmap
);
1032 if (bmap
->n_eq
== total
) {
1034 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1035 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
1038 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
1039 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
1041 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
1046 if (i
== bmap
->n_eq
)
1047 has_rational
= isl_bool_false
;
1049 isl_basic_map_free(bmap
);
1051 return has_rational
;
1054 /* Does "map" contain any rational points?
1056 isl_bool
isl_map_has_rational(__isl_keep isl_map
*map
)
1059 isl_bool has_rational
;
1062 return isl_bool_error
;
1063 for (i
= 0; i
< map
->n
; ++i
) {
1064 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
1065 if (has_rational
< 0 || has_rational
)
1066 return has_rational
;
1068 return isl_bool_false
;
1071 /* Does "set" contain any rational points?
1073 isl_bool
isl_set_has_rational(__isl_keep isl_set
*set
)
1075 return isl_map_has_rational(set
);
1078 /* Is this basic set a parameter domain?
1080 isl_bool
isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
1083 return isl_bool_error
;
1084 return isl_space_is_params(bset
->dim
);
1087 /* Is this set a parameter domain?
1089 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
1092 return isl_bool_error
;
1093 return isl_space_is_params(set
->dim
);
1096 /* Is this map actually a parameter domain?
1097 * Users should never call this function. Outside of isl,
1098 * a map can never be a parameter domain.
1100 isl_bool
isl_map_is_params(__isl_keep isl_map
*map
)
1103 return isl_bool_error
;
1104 return isl_space_is_params(map
->dim
);
1107 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
1108 struct isl_basic_map
*bmap
, unsigned extra
,
1109 unsigned n_eq
, unsigned n_ineq
)
1112 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
1117 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
1118 if (isl_blk_is_error(bmap
->block
))
1121 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
1122 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
1126 bmap
->block2
= isl_blk_empty();
1129 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1130 if (isl_blk_is_error(bmap
->block2
))
1133 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1138 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1139 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1141 for (i
= 0; i
< extra
; ++i
)
1142 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1146 bmap
->c_size
= n_eq
+ n_ineq
;
1147 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1148 bmap
->extra
= extra
;
1152 bmap
->sample
= NULL
;
1156 isl_basic_map_free(bmap
);
1160 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1161 unsigned nparam
, unsigned dim
, unsigned extra
,
1162 unsigned n_eq
, unsigned n_ineq
)
1164 struct isl_basic_map
*bmap
;
1167 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1171 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1172 return bset_from_bmap(bmap
);
1175 __isl_give isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1176 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1178 struct isl_basic_map
*bmap
;
1181 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1182 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1183 return bset_from_bmap(bmap
);
1185 isl_space_free(dim
);
1189 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1190 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1192 struct isl_basic_map
*bmap
;
1196 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1201 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1203 isl_space_free(dim
);
1207 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1208 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1209 unsigned n_eq
, unsigned n_ineq
)
1211 struct isl_basic_map
*bmap
;
1214 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1218 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1222 static void dup_constraints(
1223 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1226 unsigned total
= isl_basic_map_total_dim(src
);
1228 for (i
= 0; i
< src
->n_eq
; ++i
) {
1229 int j
= isl_basic_map_alloc_equality(dst
);
1230 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1233 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1234 int j
= isl_basic_map_alloc_inequality(dst
);
1235 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1238 for (i
= 0; i
< src
->n_div
; ++i
) {
1239 int j
= isl_basic_map_alloc_div(dst
);
1240 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1242 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1245 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1247 struct isl_basic_map
*dup
;
1251 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1252 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1255 dup_constraints(dup
, bmap
);
1256 dup
->flags
= bmap
->flags
;
1257 dup
->sample
= isl_vec_copy(bmap
->sample
);
1261 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1263 struct isl_basic_map
*dup
;
1265 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1266 return bset_from_bmap(dup
);
1269 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1274 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1278 return isl_basic_set_dup(bset
);
1281 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1290 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1295 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1299 bmap
= isl_basic_map_dup(bmap
);
1301 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1305 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1314 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1319 if (--bmap
->ref
> 0)
1322 isl_ctx_deref(bmap
->ctx
);
1324 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1326 isl_blk_free(bmap
->ctx
, bmap
->block
);
1327 isl_vec_free(bmap
->sample
);
1328 isl_space_free(bmap
->dim
);
1334 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1336 return isl_basic_map_free(bset_to_bmap(bset
));
1339 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1341 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1344 /* Check that "map" has only named parameters, reporting an error
1347 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1349 return isl_space_check_named_params(isl_map_peek_space(map
));
1352 /* Check that "bmap1" and "bmap2" have the same parameters,
1353 * reporting an error if they do not.
1355 static isl_stat
isl_basic_map_check_equal_params(
1356 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1360 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1362 return isl_stat_error
;
1364 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1365 "parameters don't match", return isl_stat_error
);
1369 __isl_give isl_map
*isl_map_align_params_map_map_and(
1370 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1371 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1372 __isl_take isl_map
*map2
))
1376 if (isl_map_has_equal_params(map1
, map2
))
1377 return fn(map1
, map2
);
1378 if (isl_map_check_named_params(map1
) < 0)
1380 if (isl_map_check_named_params(map2
) < 0)
1382 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1383 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1384 return fn(map1
, map2
);
1391 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1392 __isl_keep isl_map
*map2
,
1393 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1398 return isl_bool_error
;
1399 if (isl_map_has_equal_params(map1
, map2
))
1400 return fn(map1
, map2
);
1401 if (isl_map_check_named_params(map1
) < 0)
1402 return isl_bool_error
;
1403 if (isl_map_check_named_params(map2
) < 0)
1404 return isl_bool_error
;
1405 map1
= isl_map_copy(map1
);
1406 map2
= isl_map_copy(map2
);
1407 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1408 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1415 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1417 struct isl_ctx
*ctx
;
1421 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1422 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1424 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1425 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1426 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1427 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1428 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1429 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1431 int j
= isl_basic_map_alloc_inequality(bmap
);
1435 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1436 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1443 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1444 bmap
->extra
- bmap
->n_div
);
1445 return bmap
->n_eq
++;
1448 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1450 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1453 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1457 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1462 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1464 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1467 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1472 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1474 if (pos
!= bmap
->n_eq
- 1) {
1476 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1477 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1483 /* Turn inequality "pos" of "bmap" into an equality.
1485 * In particular, we move the inequality in front of the equalities
1486 * and move the last inequality in the position of the moved inequality.
1487 * Note that isl_tab_make_equalities_explicit depends on this particular
1488 * change in the ordering of the constraints.
1490 void isl_basic_map_inequality_to_equality(
1491 struct isl_basic_map
*bmap
, unsigned pos
)
1495 t
= bmap
->ineq
[pos
];
1496 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1497 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1502 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1503 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1504 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1505 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1508 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1510 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1513 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1515 struct isl_ctx
*ctx
;
1519 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1520 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1521 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1522 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1523 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1524 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1525 1 + isl_basic_map_total_dim(bmap
),
1526 bmap
->extra
- bmap
->n_div
);
1527 return bmap
->n_ineq
++;
1530 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1532 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1535 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1539 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1544 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1546 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1549 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1554 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1556 if (pos
!= bmap
->n_ineq
- 1) {
1557 t
= bmap
->ineq
[pos
];
1558 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1559 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1560 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1566 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1568 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1571 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1576 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1579 k
= isl_basic_map_alloc_equality(bmap
);
1582 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1585 isl_basic_map_free(bmap
);
1589 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1592 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1595 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1600 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1603 k
= isl_basic_map_alloc_inequality(bmap
);
1606 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1609 isl_basic_map_free(bmap
);
1613 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1616 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1619 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1623 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1624 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1625 1 + 1 + isl_basic_map_total_dim(bmap
),
1626 bmap
->extra
- bmap
->n_div
);
1627 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1628 return bmap
->n_div
++;
1631 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1633 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1636 /* Check that there are "n" dimensions of type "type" starting at "first"
1639 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1640 enum isl_dim_type type
, unsigned first
, unsigned n
)
1645 return isl_stat_error
;
1646 dim
= isl_basic_map_dim(bmap
, type
);
1647 if (first
+ n
> dim
|| first
+ n
< first
)
1648 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1649 "position or range out of bounds",
1650 return isl_stat_error
);
1654 /* Insert an extra integer division, prescribed by "div", to "bmap"
1655 * at (integer division) position "pos".
1657 * The integer division is first added at the end and then moved
1658 * into the right position.
1660 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1661 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1665 bmap
= isl_basic_map_cow(bmap
);
1667 return isl_basic_map_free(bmap
);
1669 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1670 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1671 "unexpected size", return isl_basic_map_free(bmap
));
1672 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1673 return isl_basic_map_free(bmap
);
1675 bmap
= isl_basic_map_extend_space(bmap
,
1676 isl_basic_map_get_space(bmap
), 1, 0, 2);
1677 k
= isl_basic_map_alloc_div(bmap
);
1679 return isl_basic_map_free(bmap
);
1680 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1681 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1683 for (i
= k
; i
> pos
; --i
)
1684 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1689 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1692 return isl_stat_error
;
1693 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1698 /* Copy constraint from src to dst, putting the vars of src at offset
1699 * dim_off in dst and the divs of src at offset div_off in dst.
1700 * If both sets are actually map, then dim_off applies to the input
1703 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1704 struct isl_basic_map
*src_map
, isl_int
*src
,
1705 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1707 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1708 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1709 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1710 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1711 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1712 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1713 isl_int_set(dst
[0], src
[0]);
1714 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1715 if (dst_nparam
> src_nparam
)
1716 isl_seq_clr(dst
+1+src_nparam
,
1717 dst_nparam
- src_nparam
);
1718 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1719 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1721 isl_min(dst_in
-in_off
, src_in
));
1722 if (dst_in
-in_off
> src_in
)
1723 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1724 dst_in
- in_off
- src_in
);
1725 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1726 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1727 src
+1+src_nparam
+src_in
,
1728 isl_min(dst_out
-out_off
, src_out
));
1729 if (dst_out
-out_off
> src_out
)
1730 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1731 dst_out
- out_off
- src_out
);
1732 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1733 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1734 src
+1+src_nparam
+src_in
+src_out
,
1735 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1736 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1737 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1738 div_off
+src_map
->n_div
,
1739 dst_map
->n_div
- div_off
- src_map
->n_div
);
1742 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1743 struct isl_basic_map
*src_map
, isl_int
*src
,
1744 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1746 isl_int_set(dst
[0], src
[0]);
1747 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1750 static __isl_give isl_basic_map
*add_constraints(
1751 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1752 unsigned i_pos
, unsigned o_pos
)
1757 if (!bmap1
|| !bmap2
)
1760 div_off
= bmap1
->n_div
;
1762 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1763 int i1
= isl_basic_map_alloc_equality(bmap1
);
1766 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1767 i_pos
, o_pos
, div_off
);
1770 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1771 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1774 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1775 i_pos
, o_pos
, div_off
);
1778 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1779 int i1
= isl_basic_map_alloc_div(bmap1
);
1782 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1783 i_pos
, o_pos
, div_off
);
1786 isl_basic_map_free(bmap2
);
1791 isl_basic_map_free(bmap1
);
1792 isl_basic_map_free(bmap2
);
1796 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1797 struct isl_basic_set
*bset2
, unsigned pos
)
1799 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1800 bset_to_bmap(bset2
), 0, pos
));
1803 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1804 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1805 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1807 struct isl_basic_map
*ext
;
1817 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1818 base
->extra
>= base
->n_div
+ extra
;
1820 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1821 room_for_ineq(base
, n_ineq
)) {
1822 isl_space_free(dim
);
1826 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1827 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1828 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1829 extra
+= base
->extra
;
1831 n_ineq
+= base
->n_ineq
;
1833 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1839 ext
->sample
= isl_vec_copy(base
->sample
);
1840 flags
= base
->flags
;
1841 ext
= add_constraints(ext
, base
, 0, 0);
1844 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1850 isl_space_free(dim
);
1851 isl_basic_map_free(base
);
1855 __isl_give isl_basic_set
*isl_basic_set_extend_space(
1856 __isl_take isl_basic_set
*base
,
1857 __isl_take isl_space
*dim
, unsigned extra
,
1858 unsigned n_eq
, unsigned n_ineq
)
1860 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1861 dim
, extra
, n_eq
, n_ineq
));
1864 struct isl_basic_map
*isl_basic_map_extend_constraints(
1865 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1869 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1873 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1874 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1875 unsigned n_eq
, unsigned n_ineq
)
1877 struct isl_basic_map
*bmap
;
1882 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1886 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1889 isl_basic_map_free(base
);
1893 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1894 unsigned nparam
, unsigned dim
, unsigned extra
,
1895 unsigned n_eq
, unsigned n_ineq
)
1897 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1898 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1901 struct isl_basic_set
*isl_basic_set_extend_constraints(
1902 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1904 isl_basic_map
*bmap
= bset_to_bmap(base
);
1905 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1906 return bset_from_bmap(bmap
);
1909 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1911 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1914 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1919 if (bmap
->ref
> 1) {
1921 bmap
= isl_basic_map_dup(bmap
);
1924 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1925 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1930 /* Clear all cached information in "map", either because it is about
1931 * to be modified or because it is being freed.
1932 * Always return the same pointer that is passed in.
1933 * This is needed for the use in isl_map_free.
1935 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1937 isl_basic_map_free(map
->cached_simple_hull
[0]);
1938 isl_basic_map_free(map
->cached_simple_hull
[1]);
1939 map
->cached_simple_hull
[0] = NULL
;
1940 map
->cached_simple_hull
[1] = NULL
;
1944 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1946 return isl_map_cow(set
);
1949 /* Return an isl_map that is equal to "map" and that has only
1950 * a single reference.
1952 * If the original input already has only one reference, then
1953 * simply return it, but clear all cached information, since
1954 * it may be rendered invalid by the operations that will be
1955 * performed on the result.
1957 * Otherwise, create a duplicate (without any cached information).
1959 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1965 return clear_caches(map
);
1967 return isl_map_dup(map
);
1970 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1971 unsigned a_len
, unsigned b_len
)
1973 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1974 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1975 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1978 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1979 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1987 isl_assert(bmap
->ctx
,
1988 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1990 if (n1
== 0 || n2
== 0)
1993 bmap
= isl_basic_map_cow(bmap
);
1997 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1998 if (isl_blk_is_error(blk
))
2001 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2003 bmap
->eq
[i
] + pos
, n1
, n2
);
2005 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2007 bmap
->ineq
[i
] + pos
, n1
, n2
);
2009 for (i
= 0; i
< bmap
->n_div
; ++i
)
2011 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2013 isl_blk_free(bmap
->ctx
, blk
);
2015 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
2016 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2017 return isl_basic_map_finalize(bmap
);
2019 isl_basic_map_free(bmap
);
2023 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2024 __isl_take isl_basic_map
*bmap
)
2030 total
= isl_basic_map_total_dim(bmap
);
2031 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2032 return isl_basic_map_free(bmap
);
2033 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2035 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2037 i
= isl_basic_map_alloc_equality(bmap
);
2041 isl_int_set_si(bmap
->eq
[i
][0], 1);
2042 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2043 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2044 isl_vec_free(bmap
->sample
);
2045 bmap
->sample
= NULL
;
2046 return isl_basic_map_finalize(bmap
);
2048 isl_basic_map_free(bmap
);
2052 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2053 __isl_take isl_basic_set
*bset
)
2055 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2058 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2059 __isl_take isl_basic_map
*bmap
)
2064 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2067 bmap
= isl_basic_map_cow(bmap
);
2071 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2073 return isl_basic_map_finalize(bmap
);
2076 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2077 __isl_take isl_basic_set
*bset
)
2079 return isl_basic_map_set_rational(bset
);
2082 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2083 __isl_take isl_basic_set
*bset
)
2088 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2091 bset
= isl_basic_set_cow(bset
);
2095 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2097 return isl_basic_set_finalize(bset
);
2100 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2104 map
= isl_map_cow(map
);
2107 for (i
= 0; i
< map
->n
; ++i
) {
2108 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2118 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2120 return isl_map_set_rational(set
);
2123 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2126 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2128 isl_int
*t
= bmap
->div
[a
];
2129 bmap
->div
[a
] = bmap
->div
[b
];
2133 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2134 * div definitions accordingly.
2136 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2139 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2141 swap_div(bmap
, a
, b
);
2143 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2144 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2146 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2147 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2149 for (i
= 0; i
< bmap
->n_div
; ++i
)
2150 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2151 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2154 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2155 * div definitions accordingly.
2157 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2159 isl_basic_map_swap_div(bset
, a
, b
);
2162 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2164 isl_seq_cpy(c
, c
+ n
, rem
);
2165 isl_seq_clr(c
+ rem
, n
);
2168 /* Drop n dimensions starting at first.
2170 * In principle, this frees up some extra variables as the number
2171 * of columns remains constant, but we would have to extend
2172 * the div array too as the number of rows in this array is assumed
2173 * to be equal to extra.
2175 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2176 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2178 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2181 /* Move "n" divs starting at "first" to the end of the list of divs.
2183 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2184 unsigned first
, unsigned n
)
2189 if (first
+ n
== bmap
->n_div
)
2192 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2195 for (i
= 0; i
< n
; ++i
)
2196 div
[i
] = bmap
->div
[first
+ i
];
2197 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2198 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2199 for (i
= 0; i
< n
; ++i
)
2200 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2204 isl_basic_map_free(bmap
);
2208 /* Check that there are "n" dimensions of type "type" starting at "first"
2211 static isl_stat
isl_map_check_range(__isl_keep isl_map
*map
,
2212 enum isl_dim_type type
, unsigned first
, unsigned n
)
2215 return isl_stat_error
;
2216 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2217 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2218 "position or range out of bounds",
2219 return isl_stat_error
);
2223 /* Drop "n" dimensions of type "type" starting at "first".
2225 * In principle, this frees up some extra variables as the number
2226 * of columns remains constant, but we would have to extend
2227 * the div array too as the number of rows in this array is assumed
2228 * to be equal to extra.
2230 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2231 enum isl_dim_type type
, unsigned first
, unsigned n
)
2241 dim
= isl_basic_map_dim(bmap
, type
);
2242 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2244 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2247 bmap
= isl_basic_map_cow(bmap
);
2251 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2252 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2253 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2254 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2256 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2257 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2259 for (i
= 0; i
< bmap
->n_div
; ++i
)
2260 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2262 if (type
== isl_dim_div
) {
2263 bmap
= move_divs_last(bmap
, first
, n
);
2266 if (isl_basic_map_free_div(bmap
, n
) < 0)
2267 return isl_basic_map_free(bmap
);
2269 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2273 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2274 bmap
= isl_basic_map_simplify(bmap
);
2275 return isl_basic_map_finalize(bmap
);
2277 isl_basic_map_free(bmap
);
2281 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2282 enum isl_dim_type type
, unsigned first
, unsigned n
)
2284 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2288 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2289 enum isl_dim_type type
, unsigned first
, unsigned n
)
2293 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2294 return isl_map_free(map
);
2296 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2298 map
= isl_map_cow(map
);
2301 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2305 for (i
= 0; i
< map
->n
; ++i
) {
2306 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2310 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2318 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2319 enum isl_dim_type type
, unsigned first
, unsigned n
)
2321 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2325 * We don't cow, as the div is assumed to be redundant.
2327 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2328 __isl_take isl_basic_map
*bmap
, unsigned div
)
2336 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2338 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2340 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2341 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2343 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2344 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2345 isl_basic_map_drop_inequality(bmap
, i
);
2349 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2352 for (i
= 0; i
< bmap
->n_div
; ++i
)
2353 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2355 if (div
!= bmap
->n_div
- 1) {
2357 isl_int
*t
= bmap
->div
[div
];
2359 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2360 bmap
->div
[j
] = bmap
->div
[j
+1];
2362 bmap
->div
[bmap
->n_div
- 1] = t
;
2364 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2365 if (isl_basic_map_free_div(bmap
, 1) < 0)
2366 return isl_basic_map_free(bmap
);
2370 isl_basic_map_free(bmap
);
2374 /* Eliminate the specified n dimensions starting at first from the
2375 * constraints, without removing the dimensions from the space.
2376 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2378 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2379 enum isl_dim_type type
, unsigned first
, unsigned n
)
2386 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2387 return isl_map_free(map
);
2389 map
= isl_map_cow(map
);
2393 for (i
= 0; i
< map
->n
; ++i
) {
2394 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2404 /* Eliminate the specified n dimensions starting at first from the
2405 * constraints, without removing the dimensions from the space.
2406 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2408 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2409 enum isl_dim_type type
, unsigned first
, unsigned n
)
2411 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2414 /* Eliminate the specified n dimensions starting at first from the
2415 * constraints, without removing the dimensions from the space.
2416 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2418 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2419 unsigned first
, unsigned n
)
2421 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2424 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2425 __isl_take isl_basic_map
*bmap
)
2429 bmap
= isl_basic_map_eliminate_vars(bmap
,
2430 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2434 return isl_basic_map_finalize(bmap
);
2437 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2438 __isl_take isl_basic_set
*bset
)
2440 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2443 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2452 map
= isl_map_cow(map
);
2456 for (i
= 0; i
< map
->n
; ++i
) {
2457 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2467 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2469 return isl_map_remove_divs(set
);
2472 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2473 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2474 unsigned first
, unsigned n
)
2476 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2477 return isl_basic_map_free(bmap
);
2478 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2480 bmap
= isl_basic_map_eliminate_vars(bmap
,
2481 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2484 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2486 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2490 /* Return true if the definition of the given div (recursively) involves
2491 * any of the given variables.
2493 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2494 unsigned first
, unsigned n
)
2497 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2499 if (isl_int_is_zero(bmap
->div
[div
][0]))
2500 return isl_bool_false
;
2501 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2502 return isl_bool_true
;
2504 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2507 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2509 involves
= div_involves_vars(bmap
, i
, first
, n
);
2510 if (involves
< 0 || involves
)
2514 return isl_bool_false
;
2517 /* Try and add a lower and/or upper bound on "div" to "bmap"
2518 * based on inequality "i".
2519 * "total" is the total number of variables (excluding the divs).
2520 * "v" is a temporary object that can be used during the calculations.
2521 * If "lb" is set, then a lower bound should be constructed.
2522 * If "ub" is set, then an upper bound should be constructed.
2524 * The calling function has already checked that the inequality does not
2525 * reference "div", but we still need to check that the inequality is
2526 * of the right form. We'll consider the case where we want to construct
2527 * a lower bound. The construction of upper bounds is similar.
2529 * Let "div" be of the form
2531 * q = floor((a + f(x))/d)
2533 * We essentially check if constraint "i" is of the form
2537 * so that we can use it to derive a lower bound on "div".
2538 * However, we allow a slightly more general form
2542 * with the condition that the coefficients of g(x) - f(x) are all
2544 * Rewriting this constraint as
2548 * adding a + f(x) to both sides and dividing by d, we obtain
2550 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2552 * Taking the floor on both sides, we obtain
2554 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2558 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2560 * In the case of an upper bound, we construct the constraint
2562 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2565 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2566 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2567 unsigned total
, isl_int v
, int lb
, int ub
)
2571 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2573 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2574 bmap
->div
[div
][1 + 1 + j
]);
2575 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2578 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2579 bmap
->div
[div
][1 + 1 + j
]);
2580 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2586 bmap
= isl_basic_map_cow(bmap
);
2587 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2589 int k
= isl_basic_map_alloc_inequality(bmap
);
2592 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2593 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2594 bmap
->div
[div
][1 + j
]);
2595 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2596 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2598 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2601 int k
= isl_basic_map_alloc_inequality(bmap
);
2604 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2605 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2606 bmap
->div
[div
][1 + j
]);
2607 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2608 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2610 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2613 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2616 isl_basic_map_free(bmap
);
2620 /* This function is called right before "div" is eliminated from "bmap"
2621 * using Fourier-Motzkin.
2622 * Look through the constraints of "bmap" for constraints on the argument
2623 * of the integer division and use them to construct constraints on the
2624 * integer division itself. These constraints can then be combined
2625 * during the Fourier-Motzkin elimination.
2626 * Note that it is only useful to introduce lower bounds on "div"
2627 * if "bmap" already contains upper bounds on "div" as the newly
2628 * introduce lower bounds can then be combined with the pre-existing
2629 * upper bounds. Similarly for upper bounds.
2630 * We therefore first check if "bmap" contains any lower and/or upper bounds
2633 * It is interesting to note that the introduction of these constraints
2634 * can indeed lead to more accurate results, even when compared to
2635 * deriving constraints on the argument of "div" from constraints on "div".
2636 * Consider, for example, the set
2638 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2640 * The second constraint can be rewritten as
2642 * 2 * [(-i-2j+3)/4] + k >= 0
2644 * from which we can derive
2646 * -i - 2j + 3 >= -2k
2652 * Combined with the first constraint, we obtain
2654 * -3 <= 3 + 2k or k >= -3
2656 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2657 * the first constraint, we obtain
2659 * [(i + 2j)/4] >= [-3/4] = -1
2661 * Combining this constraint with the second constraint, we obtain
2665 static __isl_give isl_basic_map
*insert_bounds_on_div(
2666 __isl_take isl_basic_map
*bmap
, int div
)
2669 int check_lb
, check_ub
;
2676 if (isl_int_is_zero(bmap
->div
[div
][0]))
2679 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2683 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2684 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2691 if (!check_lb
&& !check_ub
)
2696 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2697 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2700 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2701 check_lb
, check_ub
);
2709 /* Remove all divs (recursively) involving any of the given dimensions
2710 * in their definitions.
2712 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2713 __isl_take isl_basic_map
*bmap
,
2714 enum isl_dim_type type
, unsigned first
, unsigned n
)
2718 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2719 return isl_basic_map_free(bmap
);
2720 first
+= isl_basic_map_offset(bmap
, type
);
2722 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2725 involves
= div_involves_vars(bmap
, i
, first
, n
);
2727 return isl_basic_map_free(bmap
);
2730 bmap
= insert_bounds_on_div(bmap
, i
);
2731 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2740 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2741 __isl_take isl_basic_set
*bset
,
2742 enum isl_dim_type type
, unsigned first
, unsigned n
)
2744 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2747 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2748 enum isl_dim_type type
, unsigned first
, unsigned n
)
2757 map
= isl_map_cow(map
);
2761 for (i
= 0; i
< map
->n
; ++i
) {
2762 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2773 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2774 enum isl_dim_type type
, unsigned first
, unsigned n
)
2776 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2780 /* Does the description of "bmap" depend on the specified dimensions?
2781 * We also check whether the dimensions appear in any of the div definitions.
2782 * In principle there is no need for this check. If the dimensions appear
2783 * in a div definition, they also appear in the defining constraints of that
2786 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2787 enum isl_dim_type type
, unsigned first
, unsigned n
)
2791 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2792 return isl_bool_error
;
2794 first
+= isl_basic_map_offset(bmap
, type
);
2795 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2796 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2797 return isl_bool_true
;
2798 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2799 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2800 return isl_bool_true
;
2801 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2802 if (isl_int_is_zero(bmap
->div
[i
][0]))
2804 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2805 return isl_bool_true
;
2808 return isl_bool_false
;
2811 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2812 enum isl_dim_type type
, unsigned first
, unsigned n
)
2816 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2817 return isl_bool_error
;
2819 for (i
= 0; i
< map
->n
; ++i
) {
2820 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2822 if (involves
< 0 || involves
)
2826 return isl_bool_false
;
2829 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2830 enum isl_dim_type type
, unsigned first
, unsigned n
)
2832 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2835 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2836 enum isl_dim_type type
, unsigned first
, unsigned n
)
2838 return isl_map_involves_dims(set
, type
, first
, n
);
2841 /* Drop all constraints in bmap that involve any of the dimensions
2842 * first to first+n-1.
2844 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2845 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2852 bmap
= isl_basic_map_cow(bmap
);
2857 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2858 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2860 isl_basic_map_drop_equality(bmap
, i
);
2863 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2864 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2866 isl_basic_map_drop_inequality(bmap
, i
);
2869 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2873 /* Drop all constraints in bset that involve any of the dimensions
2874 * first to first+n-1.
2876 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2877 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2879 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2882 /* Drop all constraints in bmap that do not involve any of the dimensions
2883 * first to first + n - 1 of the given type.
2885 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2886 __isl_take isl_basic_map
*bmap
,
2887 enum isl_dim_type type
, unsigned first
, unsigned n
)
2892 isl_space
*space
= isl_basic_map_get_space(bmap
);
2893 isl_basic_map_free(bmap
);
2894 return isl_basic_map_universe(space
);
2896 bmap
= isl_basic_map_cow(bmap
);
2900 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2901 return isl_basic_map_free(bmap
);
2903 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2905 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2906 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2908 isl_basic_map_drop_equality(bmap
, i
);
2911 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2912 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2914 isl_basic_map_drop_inequality(bmap
, i
);
2917 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2921 /* Drop all constraints in bset that do not involve any of the dimensions
2922 * first to first + n - 1 of the given type.
2924 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2925 __isl_take isl_basic_set
*bset
,
2926 enum isl_dim_type type
, unsigned first
, unsigned n
)
2928 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2932 /* Drop all constraints in bmap that involve any of the dimensions
2933 * first to first + n - 1 of the given type.
2935 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2936 __isl_take isl_basic_map
*bmap
,
2937 enum isl_dim_type type
, unsigned first
, unsigned n
)
2944 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2945 return isl_basic_map_free(bmap
);
2947 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2948 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2949 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2952 /* Drop all constraints in bset that involve any of the dimensions
2953 * first to first + n - 1 of the given type.
2955 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2956 __isl_take isl_basic_set
*bset
,
2957 enum isl_dim_type type
, unsigned first
, unsigned n
)
2959 return isl_basic_map_drop_constraints_involving_dims(bset
,
2963 /* Drop constraints from "map" by applying "drop" to each basic map.
2965 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2966 enum isl_dim_type type
, unsigned first
, unsigned n
,
2967 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2968 enum isl_dim_type type
, unsigned first
, unsigned n
))
2972 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2973 return isl_map_free(map
);
2975 map
= isl_map_cow(map
);
2979 for (i
= 0; i
< map
->n
; ++i
) {
2980 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
2982 return isl_map_free(map
);
2986 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2991 /* Drop all constraints in map that involve any of the dimensions
2992 * first to first + n - 1 of the given type.
2994 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
2995 __isl_take isl_map
*map
,
2996 enum isl_dim_type type
, unsigned first
, unsigned n
)
3000 return drop_constraints(map
, type
, first
, n
,
3001 &isl_basic_map_drop_constraints_involving_dims
);
3004 /* Drop all constraints in "map" that do not involve any of the dimensions
3005 * first to first + n - 1 of the given type.
3007 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3008 __isl_take isl_map
*map
,
3009 enum isl_dim_type type
, unsigned first
, unsigned n
)
3012 isl_space
*space
= isl_map_get_space(map
);
3014 return isl_map_universe(space
);
3016 return drop_constraints(map
, type
, first
, n
,
3017 &isl_basic_map_drop_constraints_not_involving_dims
);
3020 /* Drop all constraints in set that involve any of the dimensions
3021 * first to first + n - 1 of the given type.
3023 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3024 __isl_take isl_set
*set
,
3025 enum isl_dim_type type
, unsigned first
, unsigned n
)
3027 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3030 /* Drop all constraints in "set" that do not involve any of the dimensions
3031 * first to first + n - 1 of the given type.
3033 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3034 __isl_take isl_set
*set
,
3035 enum isl_dim_type type
, unsigned first
, unsigned n
)
3037 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3040 /* Does local variable "div" of "bmap" have a complete explicit representation?
3041 * Having a complete explicit representation requires not only
3042 * an explicit representation, but also that all local variables
3043 * that appear in this explicit representation in turn have
3044 * a complete explicit representation.
3046 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3049 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3052 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3053 if (marked
< 0 || marked
)
3054 return isl_bool_not(marked
);
3056 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3059 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3061 known
= isl_basic_map_div_is_known(bmap
, i
);
3062 if (known
< 0 || !known
)
3066 return isl_bool_true
;
3069 /* Remove all divs that are unknown or defined in terms of unknown divs.
3071 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3072 __isl_take isl_basic_map
*bmap
)
3079 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3080 if (isl_basic_map_div_is_known(bmap
, i
))
3082 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3091 /* Remove all divs that are unknown or defined in terms of unknown divs.
3093 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3094 __isl_take isl_basic_set
*bset
)
3096 return isl_basic_map_remove_unknown_divs(bset
);
3099 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3108 map
= isl_map_cow(map
);
3112 for (i
= 0; i
< map
->n
; ++i
) {
3113 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3123 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3125 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3128 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3129 __isl_take isl_basic_set
*bset
,
3130 enum isl_dim_type type
, unsigned first
, unsigned n
)
3132 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3133 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3134 return bset_from_bmap(bmap
);
3137 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3138 enum isl_dim_type type
, unsigned first
, unsigned n
)
3145 map
= isl_map_cow(map
);
3146 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3147 return isl_map_free(map
);
3149 for (i
= 0; i
< map
->n
; ++i
) {
3150 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3151 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3155 map
= isl_map_drop(map
, type
, first
, n
);
3162 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3163 enum isl_dim_type type
, unsigned first
, unsigned n
)
3165 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3169 /* Project out n inputs starting at first using Fourier-Motzkin */
3170 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3171 unsigned first
, unsigned n
)
3173 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3176 static void dump_term(struct isl_basic_map
*bmap
,
3177 isl_int c
, int pos
, FILE *out
)
3180 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3181 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3182 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3184 isl_int_print(out
, c
, 0);
3186 if (!isl_int_is_one(c
))
3187 isl_int_print(out
, c
, 0);
3188 if (pos
< 1 + nparam
) {
3189 name
= isl_space_get_dim_name(bmap
->dim
,
3190 isl_dim_param
, pos
- 1);
3192 fprintf(out
, "%s", name
);
3194 fprintf(out
, "p%d", pos
- 1);
3195 } else if (pos
< 1 + nparam
+ in
)
3196 fprintf(out
, "i%d", pos
- 1 - nparam
);
3197 else if (pos
< 1 + nparam
+ dim
)
3198 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3200 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3204 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3205 int sign
, FILE *out
)
3209 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3213 for (i
= 0, first
= 1; i
< len
; ++i
) {
3214 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3217 fprintf(out
, " + ");
3219 isl_int_abs(v
, c
[i
]);
3220 dump_term(bmap
, v
, i
, out
);
3227 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3228 const char *op
, FILE *out
, int indent
)
3232 fprintf(out
, "%*s", indent
, "");
3234 dump_constraint_sign(bmap
, c
, 1, out
);
3235 fprintf(out
, " %s ", op
);
3236 dump_constraint_sign(bmap
, c
, -1, out
);
3240 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3241 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3243 fprintf(out
, "%*s", indent
, "");
3244 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3249 static void dump_constraints(struct isl_basic_map
*bmap
,
3250 isl_int
**c
, unsigned n
,
3251 const char *op
, FILE *out
, int indent
)
3255 for (i
= 0; i
< n
; ++i
)
3256 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3259 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3263 unsigned total
= isl_basic_map_total_dim(bmap
);
3265 for (j
= 0; j
< 1 + total
; ++j
) {
3266 if (isl_int_is_zero(exp
[j
]))
3268 if (!first
&& isl_int_is_pos(exp
[j
]))
3270 dump_term(bmap
, exp
[j
], j
, out
);
3275 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3279 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3280 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3282 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3283 fprintf(out
, "%*s", indent
, "");
3284 fprintf(out
, "e%d = [(", i
);
3285 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3287 isl_int_print(out
, bmap
->div
[i
][0], 0);
3288 fprintf(out
, "]\n");
3292 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3293 FILE *out
, int indent
)
3296 fprintf(out
, "null basic set\n");
3300 fprintf(out
, "%*s", indent
, "");
3301 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3302 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3303 bset
->extra
, bset
->flags
);
3304 dump(bset_to_bmap(bset
), out
, indent
);
3307 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3308 FILE *out
, int indent
)
3311 fprintf(out
, "null basic map\n");
3315 fprintf(out
, "%*s", indent
, "");
3316 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3317 "flags: %x, n_name: %d\n",
3319 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3320 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3321 dump(bmap
, out
, indent
);
3324 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3329 total
= isl_basic_map_total_dim(bmap
);
3330 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3331 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3332 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3333 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3337 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3342 if (isl_space_dim(space
, isl_dim_in
) != 0)
3343 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3344 "set cannot have input dimensions", goto error
);
3345 return isl_map_alloc_space(space
, n
, flags
);
3347 isl_space_free(space
);
3351 /* Make sure "map" has room for at least "n" more basic maps.
3353 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3356 struct isl_map
*grown
= NULL
;
3360 isl_assert(map
->ctx
, n
>= 0, goto error
);
3361 if (map
->n
+ n
<= map
->size
)
3363 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3366 for (i
= 0; i
< map
->n
; ++i
) {
3367 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3375 isl_map_free(grown
);
3380 /* Make sure "set" has room for at least "n" more basic sets.
3382 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3384 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3387 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3389 return isl_map_from_basic_map(bset
);
3392 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3394 struct isl_map
*map
;
3399 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3400 return isl_map_add_basic_map(map
, bmap
);
3403 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3404 __isl_take isl_basic_set
*bset
)
3406 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3407 bset_to_bmap(bset
)));
3410 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3412 return isl_map_free(set
);
3415 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3420 fprintf(out
, "null set\n");
3424 fprintf(out
, "%*s", indent
, "");
3425 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3426 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3428 for (i
= 0; i
< set
->n
; ++i
) {
3429 fprintf(out
, "%*s", indent
, "");
3430 fprintf(out
, "basic set %d:\n", i
);
3431 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3435 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3440 fprintf(out
, "null map\n");
3444 fprintf(out
, "%*s", indent
, "");
3445 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3446 "flags: %x, n_name: %d\n",
3447 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3448 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3449 for (i
= 0; i
< map
->n
; ++i
) {
3450 fprintf(out
, "%*s", indent
, "");
3451 fprintf(out
, "basic map %d:\n", i
);
3452 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3456 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3457 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3459 struct isl_basic_map
*bmap_domain
;
3461 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3464 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3465 isl_assert(bset
->ctx
,
3466 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3468 bmap
= isl_basic_map_cow(bmap
);
3471 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3472 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3473 bmap_domain
= isl_basic_map_from_domain(bset
);
3474 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3476 bmap
= isl_basic_map_simplify(bmap
);
3477 return isl_basic_map_finalize(bmap
);
3479 isl_basic_map_free(bmap
);
3480 isl_basic_set_free(bset
);
3484 /* Check that the space of "bset" is the same as that of the range of "bmap".
3486 static isl_stat
isl_basic_map_check_compatible_range(
3487 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3491 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3493 return isl_stat_error
;
3495 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3496 "incompatible spaces", return isl_stat_error
);
3501 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3502 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3504 struct isl_basic_map
*bmap_range
;
3506 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3509 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3510 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3513 if (isl_basic_set_plain_is_universe(bset
)) {
3514 isl_basic_set_free(bset
);
3518 bmap
= isl_basic_map_cow(bmap
);
3521 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3522 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3523 bmap_range
= bset_to_bmap(bset
);
3524 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3526 bmap
= isl_basic_map_simplify(bmap
);
3527 return isl_basic_map_finalize(bmap
);
3529 isl_basic_map_free(bmap
);
3530 isl_basic_set_free(bset
);
3534 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3535 __isl_keep isl_vec
*vec
)
3542 return isl_bool_error
;
3544 total
= 1 + isl_basic_map_total_dim(bmap
);
3545 if (total
!= vec
->size
)
3546 return isl_bool_false
;
3550 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3551 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3552 if (!isl_int_is_zero(s
)) {
3554 return isl_bool_false
;
3558 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3559 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3560 if (isl_int_is_neg(s
)) {
3562 return isl_bool_false
;
3568 return isl_bool_true
;
3571 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3572 __isl_keep isl_vec
*vec
)
3574 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3577 __isl_give isl_basic_map
*isl_basic_map_intersect(
3578 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3580 struct isl_vec
*sample
= NULL
;
3582 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3584 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3585 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3586 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3587 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3588 return isl_basic_map_intersect(bmap2
, bmap1
);
3590 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3591 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3592 isl_assert(bmap1
->ctx
,
3593 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3595 if (isl_basic_map_plain_is_empty(bmap1
)) {
3596 isl_basic_map_free(bmap2
);
3599 if (isl_basic_map_plain_is_empty(bmap2
)) {
3600 isl_basic_map_free(bmap1
);
3604 if (bmap1
->sample
&&
3605 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3606 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3607 sample
= isl_vec_copy(bmap1
->sample
);
3608 else if (bmap2
->sample
&&
3609 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3610 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3611 sample
= isl_vec_copy(bmap2
->sample
);
3613 bmap1
= isl_basic_map_cow(bmap1
);
3616 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3617 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3618 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3621 isl_vec_free(sample
);
3623 isl_vec_free(bmap1
->sample
);
3624 bmap1
->sample
= sample
;
3627 bmap1
= isl_basic_map_simplify(bmap1
);
3628 return isl_basic_map_finalize(bmap1
);
3631 isl_vec_free(sample
);
3632 isl_basic_map_free(bmap1
);
3633 isl_basic_map_free(bmap2
);
3637 struct isl_basic_set
*isl_basic_set_intersect(
3638 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3640 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3641 bset_to_bmap(bset2
)));
3644 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3645 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3647 return isl_basic_set_intersect(bset1
, bset2
);
3650 /* Special case of isl_map_intersect, where both map1 and map2
3651 * are convex, without any divs and such that either map1 or map2
3652 * contains a single constraint. This constraint is then simply
3653 * added to the other map.
3655 static __isl_give isl_map
*map_intersect_add_constraint(
3656 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3658 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3659 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3660 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3661 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3663 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3664 return isl_map_intersect(map2
, map1
);
3666 map1
= isl_map_cow(map1
);
3669 if (isl_map_plain_is_empty(map1
)) {
3673 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3674 if (map2
->p
[0]->n_eq
== 1)
3675 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3677 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3678 map2
->p
[0]->ineq
[0]);
3680 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3681 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3685 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3686 isl_basic_map_free(map1
->p
[0]);
3699 /* map2 may be either a parameter domain or a map living in the same
3702 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3703 __isl_take isl_map
*map2
)
3712 if ((isl_map_plain_is_empty(map1
) ||
3713 isl_map_plain_is_universe(map2
)) &&
3714 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3718 if ((isl_map_plain_is_empty(map2
) ||
3719 isl_map_plain_is_universe(map1
)) &&
3720 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3725 if (map1
->n
== 1 && map2
->n
== 1 &&
3726 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3727 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3728 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3729 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3730 return map_intersect_add_constraint(map1
, map2
);
3732 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3733 isl_space_dim(map2
->dim
, isl_dim_param
))
3734 isl_assert(map1
->ctx
,
3735 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3737 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3738 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3739 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3741 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3742 map1
->n
* map2
->n
, flags
);
3745 for (i
= 0; i
< map1
->n
; ++i
)
3746 for (j
= 0; j
< map2
->n
; ++j
) {
3747 struct isl_basic_map
*part
;
3748 part
= isl_basic_map_intersect(
3749 isl_basic_map_copy(map1
->p
[i
]),
3750 isl_basic_map_copy(map2
->p
[j
]));
3751 if (isl_basic_map_is_empty(part
) < 0)
3752 part
= isl_basic_map_free(part
);
3753 result
= isl_map_add_basic_map(result
, part
);
3766 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3767 __isl_take isl_map
*map2
)
3771 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3772 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3773 "spaces don't match", goto error
);
3774 return map_intersect_internal(map1
, map2
);
3781 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3782 __isl_take isl_map
*map2
)
3784 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3787 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3789 return set_from_map(isl_map_intersect(set_to_map(set1
),
3793 /* map_intersect_internal accepts intersections
3794 * with parameter domains, so we can just call that function.
3796 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3797 __isl_take isl_set
*params
)
3799 return map_intersect_internal(map
, params
);
3802 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3803 __isl_take isl_map
*map2
)
3805 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3808 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3809 __isl_take isl_set
*params
)
3811 return isl_map_intersect_params(set
, params
);
3814 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3817 unsigned pos
, n1
, n2
;
3821 bmap
= isl_basic_map_cow(bmap
);
3824 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3825 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3826 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3827 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3828 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3829 return isl_basic_map_reset_space(bmap
, space
);
3832 static __isl_give isl_basic_map
*basic_map_space_reset(
3833 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3839 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3842 space
= isl_basic_map_get_space(bmap
);
3843 space
= isl_space_reset(space
, type
);
3844 bmap
= isl_basic_map_reset_space(bmap
, space
);
3848 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3849 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3850 unsigned pos
, unsigned n
)
3854 struct isl_basic_map
*res
;
3855 struct isl_dim_map
*dim_map
;
3856 unsigned total
, off
;
3857 enum isl_dim_type t
;
3860 return basic_map_space_reset(bmap
, type
);
3865 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3867 total
= isl_basic_map_total_dim(bmap
) + n
;
3868 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3870 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3872 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3874 unsigned size
= isl_basic_map_dim(bmap
, t
);
3875 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3877 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3878 pos
, size
- pos
, off
+ pos
+ n
);
3880 off
+= isl_space_dim(res_dim
, t
);
3882 isl_dim_map_div(dim_map
, bmap
, off
);
3884 res
= isl_basic_map_alloc_space(res_dim
,
3885 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3886 rational
= isl_basic_map_is_rational(bmap
);
3888 res
= isl_basic_map_free(res
);
3890 res
= isl_basic_map_set_rational(res
);
3891 if (isl_basic_map_plain_is_empty(bmap
)) {
3892 isl_basic_map_free(bmap
);
3894 return isl_basic_map_set_to_empty(res
);
3896 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3897 return isl_basic_map_finalize(res
);
3900 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3901 __isl_take isl_basic_set
*bset
,
3902 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3904 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3907 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3908 enum isl_dim_type type
, unsigned n
)
3912 return isl_basic_map_insert_dims(bmap
, type
,
3913 isl_basic_map_dim(bmap
, type
), n
);
3916 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3917 enum isl_dim_type type
, unsigned n
)
3921 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3922 return isl_basic_map_add_dims(bset
, type
, n
);
3924 isl_basic_set_free(bset
);
3928 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3929 enum isl_dim_type type
)
3933 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3936 space
= isl_map_get_space(map
);
3937 space
= isl_space_reset(space
, type
);
3938 map
= isl_map_reset_space(map
, space
);
3942 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3943 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3948 return map_space_reset(map
, type
);
3950 map
= isl_map_cow(map
);
3954 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3958 for (i
= 0; i
< map
->n
; ++i
) {
3959 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3970 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3971 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3973 return isl_map_insert_dims(set
, type
, pos
, n
);
3976 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3977 enum isl_dim_type type
, unsigned n
)
3981 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3984 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3985 enum isl_dim_type type
, unsigned n
)
3989 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3990 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3996 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3997 __isl_take isl_basic_map
*bmap
,
3998 enum isl_dim_type dst_type
, unsigned dst_pos
,
3999 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4001 struct isl_dim_map
*dim_map
;
4002 struct isl_basic_map
*res
;
4003 enum isl_dim_type t
;
4004 unsigned total
, off
;
4009 bmap
= isl_basic_map_reset(bmap
, src_type
);
4010 bmap
= isl_basic_map_reset(bmap
, dst_type
);
4014 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
4015 return isl_basic_map_free(bmap
);
4017 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4020 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
4022 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
4023 pos(bmap
->dim
, src_type
) + src_pos
+
4024 ((src_type
< dst_type
) ? n
: 0)) {
4025 bmap
= isl_basic_map_cow(bmap
);
4029 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4030 src_type
, src_pos
, n
);
4034 bmap
= isl_basic_map_finalize(bmap
);
4039 total
= isl_basic_map_total_dim(bmap
);
4040 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4043 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4044 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4045 if (t
== dst_type
) {
4046 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4049 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4052 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4053 dst_pos
, size
- dst_pos
, off
);
4054 off
+= size
- dst_pos
;
4055 } else if (t
== src_type
) {
4056 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4059 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4060 src_pos
+ n
, size
- src_pos
- n
, off
);
4061 off
+= size
- src_pos
- n
;
4063 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4067 isl_dim_map_div(dim_map
, bmap
, off
);
4069 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4070 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4071 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4075 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4076 src_type
, src_pos
, n
);
4080 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4081 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4082 bmap
= isl_basic_map_finalize(bmap
);
4086 isl_basic_map_free(bmap
);
4090 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4091 enum isl_dim_type dst_type
, unsigned dst_pos
,
4092 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4094 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4095 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4096 src_type
, src_pos
, n
);
4097 return bset_from_bmap(bmap
);
4100 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4101 enum isl_dim_type dst_type
, unsigned dst_pos
,
4102 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4106 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4107 return set_from_map(isl_map_move_dims(set_to_map(set
),
4108 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4114 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4115 enum isl_dim_type dst_type
, unsigned dst_pos
,
4116 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4121 map
= isl_map_reset(map
, src_type
);
4122 map
= isl_map_reset(map
, dst_type
);
4126 if (isl_map_check_range(map
, src_type
, src_pos
, n
))
4127 return isl_map_free(map
);
4129 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4132 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4134 map
= isl_map_cow(map
);
4138 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4142 for (i
= 0; i
< map
->n
; ++i
) {
4143 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4145 src_type
, src_pos
, n
);
4156 /* Move the specified dimensions to the last columns right before
4157 * the divs. Don't change the dimension specification of bmap.
4158 * That's the responsibility of the caller.
4160 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4161 enum isl_dim_type type
, unsigned first
, unsigned n
)
4163 struct isl_dim_map
*dim_map
;
4164 struct isl_basic_map
*res
;
4165 enum isl_dim_type t
;
4166 unsigned total
, off
;
4170 if (pos(bmap
->dim
, type
) + first
+ n
==
4171 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4174 total
= isl_basic_map_total_dim(bmap
);
4175 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4178 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4179 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4181 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4184 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4185 first
, n
, total
- bmap
->n_div
- n
);
4186 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4187 first
+ n
, size
- (first
+ n
), off
);
4188 off
+= size
- (first
+ n
);
4190 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4194 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4196 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4197 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4198 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4202 /* Insert "n" rows in the divs of "bmap".
4204 * The number of columns is not changed, which means that the last
4205 * dimensions of "bmap" are being reintepreted as the new divs.
4206 * The space of "bmap" is not adjusted, however, which means
4207 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4208 * from the space of "bmap" is the responsibility of the caller.
4210 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4218 bmap
= isl_basic_map_cow(bmap
);
4222 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4223 old
= bmap
->block2
.data
;
4224 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4225 (bmap
->extra
+ n
) * (1 + row_size
));
4226 if (!bmap
->block2
.data
)
4227 return isl_basic_map_free(bmap
);
4228 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4230 return isl_basic_map_free(bmap
);
4231 for (i
= 0; i
< n
; ++i
) {
4232 new_div
[i
] = bmap
->block2
.data
+
4233 (bmap
->extra
+ i
) * (1 + row_size
);
4234 isl_seq_clr(new_div
[i
], 1 + row_size
);
4236 for (i
= 0; i
< bmap
->extra
; ++i
)
4237 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4239 bmap
->div
= new_div
;
4246 /* Drop constraints from "bmap" that only involve the variables
4247 * of "type" in the range [first, first + n] that are not related
4248 * to any of the variables outside that interval.
4249 * These constraints cannot influence the values for the variables
4250 * outside the interval, except in case they cause "bmap" to be empty.
4251 * Only drop the constraints if "bmap" is known to be non-empty.
4253 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4254 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4255 unsigned first
, unsigned n
)
4259 unsigned dim
, n_div
;
4262 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4264 return isl_basic_map_free(bmap
);
4268 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4269 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4270 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4272 return isl_basic_map_free(bmap
);
4273 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4274 for (i
= 0; i
< first
; ++i
)
4276 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4279 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4284 /* Turn the n dimensions of type type, starting at first
4285 * into existentially quantified variables.
4287 * If a subset of the projected out variables are unrelated
4288 * to any of the variables that remain, then the constraints
4289 * involving this subset are simply dropped first.
4291 __isl_give isl_basic_map
*isl_basic_map_project_out(
4292 __isl_take isl_basic_map
*bmap
,
4293 enum isl_dim_type type
, unsigned first
, unsigned n
)
4298 return basic_map_space_reset(bmap
, type
);
4299 if (type
== isl_dim_div
)
4300 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4301 "cannot project out existentially quantified variables",
4302 return isl_basic_map_free(bmap
));
4304 empty
= isl_basic_map_plain_is_empty(bmap
);
4306 return isl_basic_map_free(bmap
);
4308 bmap
= isl_basic_map_set_to_empty(bmap
);
4310 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4314 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4315 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4317 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4318 return isl_basic_map_free(bmap
);
4320 bmap
= move_last(bmap
, type
, first
, n
);
4321 bmap
= isl_basic_map_cow(bmap
);
4322 bmap
= insert_div_rows(bmap
, n
);
4326 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4329 bmap
= isl_basic_map_simplify(bmap
);
4330 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4331 return isl_basic_map_finalize(bmap
);
4333 isl_basic_map_free(bmap
);
4337 /* Turn the n dimensions of type type, starting at first
4338 * into existentially quantified variables.
4340 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4341 enum isl_dim_type type
, unsigned first
, unsigned n
)
4343 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4347 /* Turn the n dimensions of type type, starting at first
4348 * into existentially quantified variables.
4350 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4351 enum isl_dim_type type
, unsigned first
, unsigned n
)
4356 return map_space_reset(map
, type
);
4358 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4359 return isl_map_free(map
);
4361 map
= isl_map_cow(map
);
4365 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4369 for (i
= 0; i
< map
->n
; ++i
) {
4370 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4381 /* Turn all the dimensions of type "type", except the "n" starting at "first"
4382 * into existentially quantified variables.
4384 __isl_give isl_map
*isl_map_project_onto(__isl_take isl_map
*map
,
4385 enum isl_dim_type type
, unsigned first
, unsigned n
)
4389 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4390 return isl_map_free(map
);
4391 dim
= isl_map_dim(map
, type
);
4392 map
= isl_map_project_out(map
, type
, first
+ n
, dim
- (first
+ n
));
4393 map
= isl_map_project_out(map
, type
, 0, first
);
4397 /* Turn the n dimensions of type type, starting at first
4398 * into existentially quantified variables.
4400 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4401 enum isl_dim_type type
, unsigned first
, unsigned n
)
4403 return set_from_map(isl_map_project_out(set_to_map(set
),
4407 /* Return a map that projects the elements in "set" onto their
4408 * "n" set dimensions starting at "first".
4409 * "type" should be equal to isl_dim_set.
4411 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4412 enum isl_dim_type type
, unsigned first
, unsigned n
)
4420 if (type
!= isl_dim_set
)
4421 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4422 "only set dimensions can be projected out", goto error
);
4423 dim
= isl_set_dim(set
, isl_dim_set
);
4424 if (first
+ n
> dim
|| first
+ n
< first
)
4425 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4426 "index out of bounds", goto error
);
4428 map
= isl_map_from_domain(set
);
4429 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4430 for (i
= 0; i
< n
; ++i
)
4431 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4439 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
4443 for (i
= 0; i
< n
; ++i
) {
4444 j
= isl_basic_map_alloc_div(bmap
);
4447 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4451 isl_basic_map_free(bmap
);
4455 struct isl_basic_map
*isl_basic_map_apply_range(
4456 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4458 isl_space
*dim_result
= NULL
;
4459 struct isl_basic_map
*bmap
;
4460 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4461 struct isl_dim_map
*dim_map1
, *dim_map2
;
4463 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4465 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4466 bmap2
->dim
, isl_dim_in
))
4467 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4468 "spaces don't match", goto error
);
4470 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4471 isl_space_copy(bmap2
->dim
));
4473 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4474 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4475 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4476 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4478 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4479 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4480 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4481 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4482 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4483 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4484 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4485 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4486 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4487 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4488 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4490 bmap
= isl_basic_map_alloc_space(dim_result
,
4491 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4492 bmap1
->n_eq
+ bmap2
->n_eq
,
4493 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4494 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4495 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4496 bmap
= add_divs(bmap
, n
);
4497 bmap
= isl_basic_map_simplify(bmap
);
4498 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4499 return isl_basic_map_finalize(bmap
);
4501 isl_basic_map_free(bmap1
);
4502 isl_basic_map_free(bmap2
);
4506 struct isl_basic_set
*isl_basic_set_apply(
4507 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4512 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4515 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4518 isl_basic_set_free(bset
);
4519 isl_basic_map_free(bmap
);
4523 struct isl_basic_map
*isl_basic_map_apply_domain(
4524 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4526 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4528 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4529 bmap2
->dim
, isl_dim_in
))
4530 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4531 "spaces don't match", goto error
);
4533 bmap1
= isl_basic_map_reverse(bmap1
);
4534 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4535 return isl_basic_map_reverse(bmap1
);
4537 isl_basic_map_free(bmap1
);
4538 isl_basic_map_free(bmap2
);
4542 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4543 * A \cap B -> f(A) + f(B)
4545 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4546 __isl_take isl_basic_map
*bmap2
)
4548 unsigned n_in
, n_out
, nparam
, total
, pos
;
4549 struct isl_basic_map
*bmap
= NULL
;
4550 struct isl_dim_map
*dim_map1
, *dim_map2
;
4553 if (!bmap1
|| !bmap2
)
4556 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4559 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4560 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4561 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4563 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4564 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4565 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4566 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4567 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4568 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4569 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4570 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4571 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4572 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4573 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4575 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4576 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4577 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4578 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4579 for (i
= 0; i
< n_out
; ++i
) {
4580 int j
= isl_basic_map_alloc_equality(bmap
);
4583 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4584 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4585 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4586 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4588 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4589 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4590 bmap
= add_divs(bmap
, 2 * n_out
);
4592 bmap
= isl_basic_map_simplify(bmap
);
4593 return isl_basic_map_finalize(bmap
);
4595 isl_basic_map_free(bmap
);
4596 isl_basic_map_free(bmap1
);
4597 isl_basic_map_free(bmap2
);
4601 /* Given two maps A -> f(A) and B -> g(B), construct a map
4602 * A \cap B -> f(A) + f(B)
4604 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4605 __isl_take isl_map
*map2
)
4607 struct isl_map
*result
;
4613 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4615 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4616 map1
->n
* map2
->n
, 0);
4619 for (i
= 0; i
< map1
->n
; ++i
)
4620 for (j
= 0; j
< map2
->n
; ++j
) {
4621 struct isl_basic_map
*part
;
4622 part
= isl_basic_map_sum(
4623 isl_basic_map_copy(map1
->p
[i
]),
4624 isl_basic_map_copy(map2
->p
[j
]));
4625 if (isl_basic_map_is_empty(part
))
4626 isl_basic_map_free(part
);
4628 result
= isl_map_add_basic_map(result
, part
);
4641 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4642 __isl_take isl_set
*set2
)
4644 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4647 /* Given a basic map A -> f(A), construct A -> -f(A).
4649 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4654 bmap
= isl_basic_map_cow(bmap
);
4658 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4659 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4660 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4661 for (j
= 0; j
< n
; ++j
)
4662 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4663 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4664 for (j
= 0; j
< n
; ++j
)
4665 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4666 for (i
= 0; i
< bmap
->n_div
; ++i
)
4667 for (j
= 0; j
< n
; ++j
)
4668 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4669 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4670 return isl_basic_map_finalize(bmap
);
4673 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4675 return isl_basic_map_neg(bset
);
4678 /* Given a map A -> f(A), construct A -> -f(A).
4680 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4684 map
= isl_map_cow(map
);
4688 for (i
= 0; i
< map
->n
; ++i
) {
4689 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4700 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4702 return set_from_map(isl_map_neg(set_to_map(set
)));
4705 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4706 * A -> floor(f(A)/d).
4708 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4711 unsigned n_in
, n_out
, nparam
, total
, pos
;
4712 struct isl_basic_map
*result
= NULL
;
4713 struct isl_dim_map
*dim_map
;
4719 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4720 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4721 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4723 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4724 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4725 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4726 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4727 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4728 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4730 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4731 bmap
->n_div
+ n_out
,
4732 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4733 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4734 result
= add_divs(result
, n_out
);
4735 for (i
= 0; i
< n_out
; ++i
) {
4737 j
= isl_basic_map_alloc_inequality(result
);
4740 isl_seq_clr(result
->ineq
[j
], 1+total
);
4741 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4742 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4743 j
= isl_basic_map_alloc_inequality(result
);
4746 isl_seq_clr(result
->ineq
[j
], 1+total
);
4747 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4748 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4749 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4752 result
= isl_basic_map_simplify(result
);
4753 return isl_basic_map_finalize(result
);
4755 isl_basic_map_free(result
);
4759 /* Given a map A -> f(A) and an integer d, construct a map
4760 * A -> floor(f(A)/d).
4762 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
4766 map
= isl_map_cow(map
);
4770 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4771 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4772 for (i
= 0; i
< map
->n
; ++i
) {
4773 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4784 /* Given a map A -> f(A) and an integer d, construct a map
4785 * A -> floor(f(A)/d).
4787 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4788 __isl_take isl_val
*d
)
4792 if (!isl_val_is_int(d
))
4793 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4794 "expecting integer denominator", goto error
);
4795 map
= isl_map_floordiv(map
, d
->n
);
4804 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4811 i
= isl_basic_map_alloc_equality(bmap
);
4814 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4815 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4816 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4817 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4818 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4819 return isl_basic_map_finalize(bmap
);
4821 isl_basic_map_free(bmap
);
4825 /* Add a constraint to "bmap" expressing i_pos < o_pos
4827 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4834 i
= isl_basic_map_alloc_inequality(bmap
);
4837 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4838 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4839 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4840 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4841 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4842 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4843 return isl_basic_map_finalize(bmap
);
4845 isl_basic_map_free(bmap
);
4849 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4851 static __isl_give isl_basic_map
*var_less_or_equal(
4852 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4858 i
= isl_basic_map_alloc_inequality(bmap
);
4861 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4862 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4863 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4864 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4865 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4866 return isl_basic_map_finalize(bmap
);
4868 isl_basic_map_free(bmap
);
4872 /* Add a constraint to "bmap" expressing i_pos > o_pos
4874 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4881 i
= isl_basic_map_alloc_inequality(bmap
);
4884 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4885 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4886 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4887 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4888 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4889 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4890 return isl_basic_map_finalize(bmap
);
4892 isl_basic_map_free(bmap
);
4896 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4898 static __isl_give isl_basic_map
*var_more_or_equal(
4899 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4905 i
= isl_basic_map_alloc_inequality(bmap
);
4908 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4909 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4910 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4911 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4912 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4913 return isl_basic_map_finalize(bmap
);
4915 isl_basic_map_free(bmap
);
4919 __isl_give isl_basic_map
*isl_basic_map_equal(
4920 __isl_take isl_space
*dim
, unsigned n_equal
)
4923 struct isl_basic_map
*bmap
;
4924 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4927 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4928 bmap
= var_equal(bmap
, i
);
4929 return isl_basic_map_finalize(bmap
);
4932 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4934 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4938 struct isl_basic_map
*bmap
;
4939 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4942 for (i
= 0; i
< pos
&& bmap
; ++i
)
4943 bmap
= var_equal(bmap
, i
);
4945 bmap
= var_less(bmap
, pos
);
4946 return isl_basic_map_finalize(bmap
);
4949 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4951 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4952 __isl_take isl_space
*dim
, unsigned pos
)
4955 isl_basic_map
*bmap
;
4957 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4958 for (i
= 0; i
< pos
; ++i
)
4959 bmap
= var_equal(bmap
, i
);
4960 bmap
= var_less_or_equal(bmap
, pos
);
4961 return isl_basic_map_finalize(bmap
);
4964 /* Return a relation on "dim" expressing i_pos > o_pos
4966 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4970 struct isl_basic_map
*bmap
;
4971 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4974 for (i
= 0; i
< pos
&& bmap
; ++i
)
4975 bmap
= var_equal(bmap
, i
);
4977 bmap
= var_more(bmap
, pos
);
4978 return isl_basic_map_finalize(bmap
);
4981 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4983 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4984 __isl_take isl_space
*dim
, unsigned pos
)
4987 isl_basic_map
*bmap
;
4989 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4990 for (i
= 0; i
< pos
; ++i
)
4991 bmap
= var_equal(bmap
, i
);
4992 bmap
= var_more_or_equal(bmap
, pos
);
4993 return isl_basic_map_finalize(bmap
);
4996 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4997 unsigned n
, int equal
)
4999 struct isl_map
*map
;
5002 if (n
== 0 && equal
)
5003 return isl_map_universe(dims
);
5005 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5007 for (i
= 0; i
+ 1 < n
; ++i
)
5008 map
= isl_map_add_basic_map(map
,
5009 isl_basic_map_less_at(isl_space_copy(dims
), i
));
5012 map
= isl_map_add_basic_map(map
,
5013 isl_basic_map_less_or_equal_at(dims
, n
- 1));
5015 map
= isl_map_add_basic_map(map
,
5016 isl_basic_map_less_at(dims
, n
- 1));
5018 isl_space_free(dims
);
5023 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
5027 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
5030 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
5032 return map_lex_lte_first(dim
, n
, 0);
5035 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
5037 return map_lex_lte_first(dim
, n
, 1);
5040 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
5042 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
5045 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
5047 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5050 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
5051 unsigned n
, int equal
)
5053 struct isl_map
*map
;
5056 if (n
== 0 && equal
)
5057 return isl_map_universe(dims
);
5059 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5061 for (i
= 0; i
+ 1 < n
; ++i
)
5062 map
= isl_map_add_basic_map(map
,
5063 isl_basic_map_more_at(isl_space_copy(dims
), i
));
5066 map
= isl_map_add_basic_map(map
,
5067 isl_basic_map_more_or_equal_at(dims
, n
- 1));
5069 map
= isl_map_add_basic_map(map
,
5070 isl_basic_map_more_at(dims
, n
- 1));
5072 isl_space_free(dims
);
5077 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
5081 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
5084 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5086 return map_lex_gte_first(dim
, n
, 0);
5089 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5091 return map_lex_gte_first(dim
, n
, 1);
5094 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5096 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5099 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5101 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5104 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5105 __isl_take isl_set
*set2
)
5108 map
= isl_map_lex_le(isl_set_get_space(set1
));
5109 map
= isl_map_intersect_domain(map
, set1
);
5110 map
= isl_map_intersect_range(map
, set2
);
5114 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5115 __isl_take isl_set
*set2
)
5118 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5119 map
= isl_map_intersect_domain(map
, set1
);
5120 map
= isl_map_intersect_range(map
, set2
);
5124 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5125 __isl_take isl_set
*set2
)
5128 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5129 map
= isl_map_intersect_domain(map
, set1
);
5130 map
= isl_map_intersect_range(map
, set2
);
5134 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5135 __isl_take isl_set
*set2
)
5138 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5139 map
= isl_map_intersect_domain(map
, set1
);
5140 map
= isl_map_intersect_range(map
, set2
);
5144 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5145 __isl_take isl_map
*map2
)
5148 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5149 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5150 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5154 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5155 __isl_take isl_map
*map2
)
5158 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5159 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5160 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5164 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5165 __isl_take isl_map
*map2
)
5168 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5169 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5170 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5174 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5175 __isl_take isl_map
*map2
)
5178 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5179 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5180 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5184 /* For a div d = floor(f/m), add the constraint
5188 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5189 unsigned pos
, isl_int
*div
)
5192 unsigned total
= isl_basic_map_total_dim(bmap
);
5194 i
= isl_basic_map_alloc_inequality(bmap
);
5196 return isl_stat_error
;
5197 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5198 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5203 /* For a div d = floor(f/m), add the constraint
5205 * -(f-(m-1)) + m d >= 0
5207 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5208 unsigned pos
, isl_int
*div
)
5211 unsigned total
= isl_basic_map_total_dim(bmap
);
5213 i
= isl_basic_map_alloc_inequality(bmap
);
5215 return isl_stat_error
;
5216 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5217 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5218 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5219 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5224 /* For a div d = floor(f/m), add the constraints
5227 * -(f-(m-1)) + m d >= 0
5229 * Note that the second constraint is the negation of
5233 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5234 unsigned pos
, isl_int
*div
)
5236 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5238 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5243 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5244 unsigned pos
, isl_int
*div
)
5246 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5250 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
5252 unsigned total
= isl_basic_map_total_dim(bmap
);
5253 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5255 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5259 /* For each known div d = floor(f/m), add the constraints
5262 * -(f-(m-1)) + m d >= 0
5264 * Remove duplicate constraints in case of some these div constraints
5265 * already appear in "bmap".
5267 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5268 __isl_take isl_basic_map
*bmap
)
5274 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5278 bmap
= add_known_div_constraints(bmap
);
5279 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5280 bmap
= isl_basic_map_finalize(bmap
);
5284 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5286 * In particular, if this div is of the form d = floor(f/m),
5287 * then add the constraint
5291 * if sign < 0 or the constraint
5293 * -(f-(m-1)) + m d >= 0
5297 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5298 unsigned div
, int sign
)
5306 total
= isl_basic_map_total_dim(bmap
);
5307 div_pos
= total
- bmap
->n_div
+ div
;
5310 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5312 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5315 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5316 __isl_take isl_basic_map
*bmap
)
5320 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5322 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5323 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5324 return bset_from_bmap(bmap
);
5325 bmap
= isl_basic_map_cow(bmap
);
5328 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5331 bmap
->extra
-= bmap
->n_div
;
5333 bmap
= isl_basic_map_finalize(bmap
);
5334 return bset_from_bmap(bmap
);
5336 isl_basic_map_free(bmap
);
5340 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5341 __isl_take isl_basic_set
*bset
)
5343 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5346 /* Replace each element in "list" by the result of applying
5347 * isl_basic_map_underlying_set to the element.
5349 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5350 __isl_take isl_basic_map_list
*list
)
5357 n
= isl_basic_map_list_n_basic_map(list
);
5358 for (i
= 0; i
< n
; ++i
) {
5359 isl_basic_map
*bmap
;
5360 isl_basic_set
*bset
;
5362 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5363 bset
= isl_basic_set_underlying_set(bmap
);
5364 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5370 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5371 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5373 struct isl_basic_map
*bmap
;
5374 struct isl_ctx
*ctx
;
5381 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5382 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5383 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5385 if (like
->n_div
== 0) {
5386 isl_space
*space
= isl_basic_map_get_space(like
);
5387 isl_basic_map_free(like
);
5388 return isl_basic_map_reset_space(bset
, space
);
5390 bset
= isl_basic_set_cow(bset
);
5393 total
= bset
->dim
->n_out
+ bset
->extra
;
5394 bmap
= bset_to_bmap(bset
);
5395 isl_space_free(bmap
->dim
);
5396 bmap
->dim
= isl_space_copy(like
->dim
);
5399 bmap
->n_div
= like
->n_div
;
5400 bmap
->extra
+= like
->n_div
;
5404 ltotal
= total
- bmap
->extra
+ like
->extra
;
5407 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5408 bmap
->extra
* (1 + 1 + total
));
5409 if (isl_blk_is_error(bmap
->block2
))
5411 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5415 for (i
= 0; i
< bmap
->extra
; ++i
)
5416 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5417 for (i
= 0; i
< like
->n_div
; ++i
) {
5418 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5419 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5421 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5423 isl_basic_map_free(like
);
5424 bmap
= isl_basic_map_simplify(bmap
);
5425 bmap
= isl_basic_map_finalize(bmap
);
5428 isl_basic_map_free(like
);
5429 isl_basic_set_free(bset
);
5433 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5434 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5436 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5437 bset_to_bmap(like
)));
5440 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5444 map
= isl_map_cow(map
);
5447 map
->dim
= isl_space_cow(map
->dim
);
5451 for (i
= 1; i
< map
->n
; ++i
)
5452 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5454 for (i
= 0; i
< map
->n
; ++i
) {
5455 map
->p
[i
] = bset_to_bmap(
5456 isl_basic_map_underlying_set(map
->p
[i
]));
5461 map
->dim
= isl_space_underlying(map
->dim
, 0);
5463 isl_space_free(map
->dim
);
5464 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5468 return set_from_map(map
);
5474 /* Replace the space of "bmap" by "space".
5476 * If the space of "bmap" is identical to "space" (including the identifiers
5477 * of the input and output dimensions), then simply return the original input.
5479 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5480 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5483 isl_space
*bmap_space
;
5485 bmap_space
= isl_basic_map_peek_space(bmap
);
5486 equal
= isl_space_is_equal(bmap_space
, space
);
5487 if (equal
>= 0 && equal
)
5488 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5492 isl_space_free(space
);
5495 bmap
= isl_basic_map_cow(bmap
);
5496 if (!bmap
|| !space
)
5499 isl_space_free(bmap
->dim
);
5502 bmap
= isl_basic_map_finalize(bmap
);
5506 isl_basic_map_free(bmap
);
5507 isl_space_free(space
);
5511 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5512 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5514 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5518 /* Check that the total dimensions of "map" and "space" are the same.
5520 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5521 __isl_keep isl_space
*space
)
5523 unsigned dim1
, dim2
;
5526 return isl_stat_error
;
5527 dim1
= isl_map_dim(map
, isl_dim_all
);
5528 dim2
= isl_space_dim(space
, isl_dim_all
);
5531 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5532 "total dimensions do not match", return isl_stat_error
);
5535 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5536 __isl_take isl_space
*dim
)
5540 map
= isl_map_cow(map
);
5544 for (i
= 0; i
< map
->n
; ++i
) {
5545 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5546 isl_space_copy(dim
));
5550 isl_space_free(map
->dim
);
5556 isl_space_free(dim
);
5560 /* Replace the space of "map" by "space", without modifying
5561 * the dimension of "map".
5563 * If the space of "map" is identical to "space" (including the identifiers
5564 * of the input and output dimensions), then simply return the original input.
5566 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5567 __isl_take isl_space
*space
)
5570 isl_space
*map_space
;
5572 map_space
= isl_map_peek_space(map
);
5573 equal
= isl_space_is_equal(map_space
, space
);
5574 if (equal
>= 0 && equal
)
5575 equal
= isl_space_has_equal_ids(map_space
, space
);
5579 isl_space_free(space
);
5582 if (check_map_space_equal_total_dim(map
, space
) < 0)
5584 return isl_map_reset_space(map
, space
);
5587 isl_space_free(space
);
5591 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5592 __isl_take isl_space
*dim
)
5594 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5597 /* Compute the parameter domain of the given basic set.
5599 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5605 is_params
= isl_basic_set_is_params(bset
);
5607 return isl_basic_set_free(bset
);
5611 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5612 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5613 space
= isl_basic_set_get_space(bset
);
5614 space
= isl_space_params(space
);
5615 bset
= isl_basic_set_reset_space(bset
, space
);
5619 /* Construct a zero-dimensional basic set with the given parameter domain.
5621 __isl_give isl_basic_set
*isl_basic_set_from_params(
5622 __isl_take isl_basic_set
*bset
)
5625 space
= isl_basic_set_get_space(bset
);
5626 space
= isl_space_set_from_params(space
);
5627 bset
= isl_basic_set_reset_space(bset
, space
);
5631 /* Compute the parameter domain of the given set.
5633 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5638 if (isl_set_is_params(set
))
5641 n
= isl_set_dim(set
, isl_dim_set
);
5642 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5643 space
= isl_set_get_space(set
);
5644 space
= isl_space_params(space
);
5645 set
= isl_set_reset_space(set
, space
);
5649 /* Construct a zero-dimensional set with the given parameter domain.
5651 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5654 space
= isl_set_get_space(set
);
5655 space
= isl_space_set_from_params(space
);
5656 set
= isl_set_reset_space(set
, space
);
5660 /* Compute the parameter domain of the given map.
5662 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5667 n
= isl_map_dim(map
, isl_dim_in
);
5668 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5669 n
= isl_map_dim(map
, isl_dim_out
);
5670 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5671 space
= isl_map_get_space(map
);
5672 space
= isl_space_params(space
);
5673 map
= isl_map_reset_space(map
, space
);
5677 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5684 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5686 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5687 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5689 return isl_basic_map_reset_space(bmap
, space
);
5692 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5695 return isl_bool_error
;
5696 return isl_space_may_be_set(bmap
->dim
);
5699 /* Is this basic map actually a set?
5700 * Users should never call this function. Outside of isl,
5701 * the type should indicate whether something is a set or a map.
5703 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5706 return isl_bool_error
;
5707 return isl_space_is_set(bmap
->dim
);
5710 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5714 is_set
= isl_basic_map_is_set(bmap
);
5719 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5721 isl_basic_map_free(bmap
);
5725 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5726 __isl_take isl_basic_map
*bmap
)
5730 isl_basic_map
*domain
;
5731 int nparam
, n_in
, n_out
;
5733 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5734 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5735 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5737 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5738 domain
= isl_basic_map_universe(dim
);
5740 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5741 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5742 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5744 for (i
= 0; i
< n_in
; ++i
)
5745 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5748 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5749 return isl_basic_map_finalize(bmap
);
5752 __isl_give isl_basic_map
*isl_basic_map_range_map(
5753 __isl_take isl_basic_map
*bmap
)
5757 isl_basic_map
*range
;
5758 int nparam
, n_in
, n_out
;
5760 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5761 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5762 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5764 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5765 range
= isl_basic_map_universe(dim
);
5767 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5768 bmap
= isl_basic_map_apply_range(bmap
, range
);
5769 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5771 for (i
= 0; i
< n_out
; ++i
)
5772 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5775 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5776 return isl_basic_map_finalize(bmap
);
5779 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5783 return isl_space_may_be_set(map
->dim
);
5786 /* Is this map actually a set?
5787 * Users should never call this function. Outside of isl,
5788 * the type should indicate whether something is a set or a map.
5790 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5793 return isl_bool_error
;
5794 return isl_space_is_set(map
->dim
);
5797 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5801 struct isl_set
*set
;
5803 is_set
= isl_map_is_set(map
);
5807 return set_from_map(map
);
5809 map
= isl_map_cow(map
);
5813 set
= set_from_map(map
);
5814 set
->dim
= isl_space_range(set
->dim
);
5817 for (i
= 0; i
< map
->n
; ++i
) {
5818 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5822 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5823 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5830 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5834 map
= isl_map_cow(map
);
5838 map
->dim
= isl_space_domain_map(map
->dim
);
5841 for (i
= 0; i
< map
->n
; ++i
) {
5842 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5846 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5847 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5854 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5857 isl_space
*range_dim
;
5859 map
= isl_map_cow(map
);
5863 range_dim
= isl_space_range(isl_map_get_space(map
));
5864 range_dim
= isl_space_from_range(range_dim
);
5865 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5866 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5869 for (i
= 0; i
< map
->n
; ++i
) {
5870 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5874 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5875 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5882 /* Given a wrapped map of the form A[B -> C],
5883 * return the map A[B -> C] -> B.
5885 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5892 if (!isl_set_has_tuple_id(set
))
5893 return isl_map_domain_map(isl_set_unwrap(set
));
5895 id
= isl_set_get_tuple_id(set
);
5896 map
= isl_map_domain_map(isl_set_unwrap(set
));
5897 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5902 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5903 __isl_take isl_basic_set
*bset
)
5905 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5908 __isl_give isl_basic_map
*isl_basic_map_from_range(
5909 __isl_take isl_basic_set
*bset
)
5912 space
= isl_basic_set_get_space(bset
);
5913 space
= isl_space_from_range(space
);
5914 bset
= isl_basic_set_reset_space(bset
, space
);
5915 return bset_to_bmap(bset
);
5918 /* Create a relation with the given set as range.
5919 * The domain of the created relation is a zero-dimensional
5920 * flat anonymous space.
5922 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5925 space
= isl_set_get_space(set
);
5926 space
= isl_space_from_range(space
);
5927 set
= isl_set_reset_space(set
, space
);
5928 return set_to_map(set
);
5931 /* Create a relation with the given set as domain.
5932 * The range of the created relation is a zero-dimensional
5933 * flat anonymous space.
5935 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5937 return isl_map_reverse(isl_map_from_range(set
));
5940 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5941 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5943 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5946 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5947 __isl_take isl_set
*range
)
5949 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5952 /* Return a newly allocated isl_map with given space and flags and
5953 * room for "n" basic maps.
5954 * Make sure that all cached information is cleared.
5956 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5959 struct isl_map
*map
;
5964 isl_die(space
->ctx
, isl_error_internal
,
5965 "negative number of basic maps", goto error
);
5966 map
= isl_calloc(space
->ctx
, struct isl_map
,
5967 sizeof(struct isl_map
) +
5968 (n
- 1) * sizeof(struct isl_basic_map
*));
5972 map
->ctx
= space
->ctx
;
5973 isl_ctx_ref(map
->ctx
);
5981 isl_space_free(space
);
5985 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
5987 struct isl_basic_map
*bmap
;
5988 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
5989 bmap
= isl_basic_map_set_to_empty(bmap
);
5993 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
5995 struct isl_basic_set
*bset
;
5996 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
5997 bset
= isl_basic_set_set_to_empty(bset
);
6001 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
6003 struct isl_basic_map
*bmap
;
6004 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
6005 bmap
= isl_basic_map_finalize(bmap
);
6009 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
6011 struct isl_basic_set
*bset
;
6012 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
6013 bset
= isl_basic_set_finalize(bset
);
6017 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
6020 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
6021 isl_basic_map
*bmap
;
6023 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
6024 for (i
= 0; i
< total
; ++i
) {
6025 int k
= isl_basic_map_alloc_inequality(bmap
);
6028 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
6029 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
6033 isl_basic_map_free(bmap
);
6037 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
6039 return isl_basic_map_nat_universe(dim
);
6042 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
6044 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
6047 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
6049 return isl_map_nat_universe(dim
);
6052 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
6054 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6057 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
6059 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6062 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
6064 struct isl_map
*map
;
6067 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6068 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
6072 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
6074 struct isl_set
*set
;
6077 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6078 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6082 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6085 struct isl_map
*dup
;
6089 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6090 for (i
= 0; i
< map
->n
; ++i
)
6091 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6095 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6096 __isl_take isl_basic_map
*bmap
)
6100 if (isl_basic_map_plain_is_empty(bmap
)) {
6101 isl_basic_map_free(bmap
);
6104 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6105 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6106 map
->p
[map
->n
] = bmap
;
6108 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6114 isl_basic_map_free(bmap
);
6118 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6129 isl_ctx_deref(map
->ctx
);
6130 for (i
= 0; i
< map
->n
; ++i
)
6131 isl_basic_map_free(map
->p
[i
]);
6132 isl_space_free(map
->dim
);
6138 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
6139 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
6143 bmap
= isl_basic_map_cow(bmap
);
6144 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6145 j
= isl_basic_map_alloc_equality(bmap
);
6148 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6149 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6150 isl_int_set_si(bmap
->eq
[j
][0], value
);
6151 bmap
= isl_basic_map_simplify(bmap
);
6152 return isl_basic_map_finalize(bmap
);
6154 isl_basic_map_free(bmap
);
6158 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6159 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6163 bmap
= isl_basic_map_cow(bmap
);
6164 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6165 j
= isl_basic_map_alloc_equality(bmap
);
6168 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6169 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6170 isl_int_set(bmap
->eq
[j
][0], value
);
6171 bmap
= isl_basic_map_simplify(bmap
);
6172 return isl_basic_map_finalize(bmap
);
6174 isl_basic_map_free(bmap
);
6178 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6179 enum isl_dim_type type
, unsigned pos
, int value
)
6181 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6182 return isl_basic_map_free(bmap
);
6183 return isl_basic_map_fix_pos_si(bmap
,
6184 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6187 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6188 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6190 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6191 return isl_basic_map_free(bmap
);
6192 return isl_basic_map_fix_pos(bmap
,
6193 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6196 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6197 * to be equal to "v".
6199 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6200 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6204 if (!isl_val_is_int(v
))
6205 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6206 "expecting integer value", goto error
);
6207 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6209 pos
+= isl_basic_map_offset(bmap
, type
);
6210 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6214 isl_basic_map_free(bmap
);
6219 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6220 * to be equal to "v".
6222 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6223 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6225 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6228 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6229 enum isl_dim_type type
, unsigned pos
, int value
)
6231 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6235 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6236 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6238 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6242 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6243 unsigned input
, int value
)
6245 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6248 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6249 unsigned dim
, int value
)
6251 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6252 isl_dim_set
, dim
, value
));
6255 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
6257 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6264 isl_basic_map_free(map
->p
[i
]);
6265 if (i
!= map
->n
- 1) {
6266 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6267 map
->p
[i
] = map
->p
[map
->n
- 1];
6274 /* Perform "fn" on each basic map of "map", where we may not be holding
6275 * the only reference to "map".
6276 * In particular, "fn" should be a semantics preserving operation
6277 * that we want to apply to all copies of "map". We therefore need
6278 * to be careful not to modify "map" in a way that breaks "map"
6279 * in case anything goes wrong.
6281 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6282 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6284 struct isl_basic_map
*bmap
;
6290 for (i
= map
->n
- 1; i
>= 0; --i
) {
6291 bmap
= isl_basic_map_copy(map
->p
[i
]);
6295 isl_basic_map_free(map
->p
[i
]);
6297 if (remove_if_empty(map
, i
) < 0)
6307 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6308 enum isl_dim_type type
, unsigned pos
, int value
)
6312 map
= isl_map_cow(map
);
6316 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6317 for (i
= map
->n
- 1; i
>= 0; --i
) {
6318 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6319 if (remove_if_empty(map
, i
) < 0)
6322 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6329 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6330 enum isl_dim_type type
, unsigned pos
, int value
)
6332 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6335 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6336 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6340 map
= isl_map_cow(map
);
6344 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6345 for (i
= 0; i
< map
->n
; ++i
) {
6346 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6350 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6357 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6358 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6360 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6363 /* Fix the value of the variable at position "pos" of type "type" of "map"
6364 * to be equal to "v".
6366 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6367 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6371 map
= isl_map_cow(map
);
6375 if (!isl_val_is_int(v
))
6376 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6377 "expecting integer value", goto error
);
6378 if (pos
>= isl_map_dim(map
, type
))
6379 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6380 "index out of bounds", goto error
);
6381 for (i
= map
->n
- 1; i
>= 0; --i
) {
6382 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6384 if (remove_if_empty(map
, i
) < 0)
6387 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6396 /* Fix the value of the variable at position "pos" of type "type" of "set"
6397 * to be equal to "v".
6399 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6400 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6402 return isl_map_fix_val(set
, type
, pos
, v
);
6405 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6406 unsigned input
, int value
)
6408 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6411 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6413 return set_from_map(isl_map_fix_si(set_to_map(set
),
6414 isl_dim_set
, dim
, value
));
6417 static __isl_give isl_basic_map
*basic_map_bound_si(
6418 __isl_take isl_basic_map
*bmap
,
6419 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6423 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6424 return isl_basic_map_free(bmap
);
6425 pos
+= isl_basic_map_offset(bmap
, type
);
6426 bmap
= isl_basic_map_cow(bmap
);
6427 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6428 j
= isl_basic_map_alloc_inequality(bmap
);
6431 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6433 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6434 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6436 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6437 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6439 bmap
= isl_basic_map_simplify(bmap
);
6440 return isl_basic_map_finalize(bmap
);
6442 isl_basic_map_free(bmap
);
6446 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6447 __isl_take isl_basic_map
*bmap
,
6448 enum isl_dim_type type
, unsigned pos
, int value
)
6450 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6453 /* Constrain the values of the given dimension to be no greater than "value".
6455 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6456 __isl_take isl_basic_map
*bmap
,
6457 enum isl_dim_type type
, unsigned pos
, int value
)
6459 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6462 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6463 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6467 map
= isl_map_cow(map
);
6471 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6472 for (i
= 0; i
< map
->n
; ++i
) {
6473 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6474 type
, pos
, value
, upper
);
6478 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6485 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6486 enum isl_dim_type type
, unsigned pos
, int value
)
6488 return map_bound_si(map
, type
, pos
, value
, 0);
6491 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6492 enum isl_dim_type type
, unsigned pos
, int value
)
6494 return map_bound_si(map
, type
, pos
, value
, 1);
6497 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6498 enum isl_dim_type type
, unsigned pos
, int value
)
6500 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6504 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6505 enum isl_dim_type type
, unsigned pos
, int value
)
6507 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6510 /* Bound the given variable of "bmap" from below (or above is "upper"
6511 * is set) to "value".
6513 static __isl_give isl_basic_map
*basic_map_bound(
6514 __isl_take isl_basic_map
*bmap
,
6515 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6519 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6520 return isl_basic_map_free(bmap
);
6521 pos
+= isl_basic_map_offset(bmap
, type
);
6522 bmap
= isl_basic_map_cow(bmap
);
6523 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6524 j
= isl_basic_map_alloc_inequality(bmap
);
6527 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6529 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6530 isl_int_set(bmap
->ineq
[j
][0], value
);
6532 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6533 isl_int_neg(bmap
->ineq
[j
][0], value
);
6535 bmap
= isl_basic_map_simplify(bmap
);
6536 return isl_basic_map_finalize(bmap
);
6538 isl_basic_map_free(bmap
);
6542 /* Bound the given variable of "map" from below (or above is "upper"
6543 * is set) to "value".
6545 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6546 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6550 map
= isl_map_cow(map
);
6554 if (pos
>= isl_map_dim(map
, type
))
6555 isl_die(map
->ctx
, isl_error_invalid
,
6556 "index out of bounds", goto error
);
6557 for (i
= map
->n
- 1; i
>= 0; --i
) {
6558 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6559 if (remove_if_empty(map
, i
) < 0)
6562 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6569 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6570 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6572 return map_bound(map
, type
, pos
, value
, 0);
6575 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6576 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6578 return map_bound(map
, type
, pos
, value
, 1);
6581 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6582 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6584 return isl_map_lower_bound(set
, type
, pos
, value
);
6587 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6588 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6590 return isl_map_upper_bound(set
, type
, pos
, value
);
6593 /* Force the values of the variable at position "pos" of type "type" of "set"
6594 * to be no smaller than "value".
6596 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6597 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6601 if (!isl_val_is_int(value
))
6602 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6603 "expecting integer value", goto error
);
6604 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6605 isl_val_free(value
);
6608 isl_val_free(value
);
6613 /* Force the values of the variable at position "pos" of type "type" of "set"
6614 * to be no greater than "value".
6616 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6617 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6621 if (!isl_val_is_int(value
))
6622 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6623 "expecting integer value", goto error
);
6624 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6625 isl_val_free(value
);
6628 isl_val_free(value
);
6633 /* Bound the given variable of "bset" from below (or above is "upper"
6634 * is set) to "value".
6636 static __isl_give isl_basic_set
*isl_basic_set_bound(
6637 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6638 isl_int value
, int upper
)
6640 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6641 type
, pos
, value
, upper
));
6644 /* Bound the given variable of "bset" from below (or above is "upper"
6645 * is set) to "value".
6647 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6648 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6649 __isl_take isl_val
*value
, int upper
)
6653 if (!isl_val_is_int(value
))
6654 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6655 "expecting integer value", goto error
);
6656 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6657 isl_val_free(value
);
6660 isl_val_free(value
);
6661 isl_basic_set_free(bset
);
6665 /* Bound the given variable of "bset" from below to "value".
6667 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6668 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6669 __isl_take isl_val
*value
)
6671 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6674 /* Bound the given variable of "bset" from above to "value".
6676 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6677 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6678 __isl_take isl_val
*value
)
6680 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6683 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6687 map
= isl_map_cow(map
);
6691 map
->dim
= isl_space_reverse(map
->dim
);
6694 for (i
= 0; i
< map
->n
; ++i
) {
6695 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6699 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6707 #define TYPE isl_pw_multi_aff
6709 #define SUFFIX _pw_multi_aff
6711 #define EMPTY isl_pw_multi_aff_empty
6713 #define ADD isl_pw_multi_aff_union_add
6714 #include "isl_map_lexopt_templ.c"
6716 /* Given a map "map", compute the lexicographically minimal
6717 * (or maximal) image element for each domain element in dom,
6718 * in the form of an isl_pw_multi_aff.
6719 * If "empty" is not NULL, then set *empty to those elements in dom that
6720 * do not have an image element.
6721 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6722 * should be computed over the domain of "map". "empty" is also NULL
6725 * We first compute the lexicographically minimal or maximal element
6726 * in the first basic map. This results in a partial solution "res"
6727 * and a subset "todo" of dom that still need to be handled.
6728 * We then consider each of the remaining maps in "map" and successively
6729 * update both "res" and "todo".
6730 * If "empty" is NULL, then the todo sets are not needed and therefore
6731 * also not computed.
6733 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6734 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6735 __isl_give isl_set
**empty
, unsigned flags
)
6739 isl_pw_multi_aff
*res
;
6742 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6743 if (!map
|| (!full
&& !dom
))
6746 if (isl_map_plain_is_empty(map
)) {
6751 return isl_pw_multi_aff_from_map(map
);
6754 res
= basic_map_partial_lexopt_pw_multi_aff(
6755 isl_basic_map_copy(map
->p
[0]),
6756 isl_set_copy(dom
), empty
, flags
);
6760 for (i
= 1; i
< map
->n
; ++i
) {
6761 isl_pw_multi_aff
*res_i
;
6763 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6764 isl_basic_map_copy(map
->p
[i
]),
6765 isl_set_copy(dom
), empty
, flags
);
6767 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6768 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6770 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6773 todo
= isl_set_intersect(todo
, *empty
);
6792 #define TYPE isl_map
6796 #define EMPTY isl_map_empty
6798 #define ADD isl_map_union_disjoint
6799 #include "isl_map_lexopt_templ.c"
6801 /* Given a map "map", compute the lexicographically minimal
6802 * (or maximal) image element for each domain element in "dom",
6803 * in the form of an isl_map.
6804 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6805 * do not have an image element.
6806 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6807 * should be computed over the domain of "map". "empty" is also NULL
6810 * If the input consists of more than one disjunct, then first
6811 * compute the desired result in the form of an isl_pw_multi_aff and
6812 * then convert that into an isl_map.
6814 * This function used to have an explicit implementation in terms
6815 * of isl_maps, but it would continually intersect the domains of
6816 * partial results with the complement of the domain of the next
6817 * partial solution, potentially leading to an explosion in the number
6818 * of disjuncts if there are several disjuncts in the input.
6819 * An even earlier implementation of this function would look for
6820 * better results in the domain of the partial result and for extra
6821 * results in the complement of this domain, which would lead to
6822 * even more splintering.
6824 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6825 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6826 __isl_give isl_set
**empty
, unsigned flags
)
6829 struct isl_map
*res
;
6830 isl_pw_multi_aff
*pma
;
6832 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6833 if (!map
|| (!full
&& !dom
))
6836 if (isl_map_plain_is_empty(map
)) {
6845 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6851 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6853 return isl_map_from_pw_multi_aff(pma
);
6862 __isl_give isl_map
*isl_map_partial_lexmax(
6863 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6864 __isl_give isl_set
**empty
)
6866 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6869 __isl_give isl_map
*isl_map_partial_lexmin(
6870 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6871 __isl_give isl_set
**empty
)
6873 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6876 __isl_give isl_set
*isl_set_partial_lexmin(
6877 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6878 __isl_give isl_set
**empty
)
6880 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6884 __isl_give isl_set
*isl_set_partial_lexmax(
6885 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6886 __isl_give isl_set
**empty
)
6888 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6892 /* Compute the lexicographic minimum (or maximum if "flags" includes
6893 * ISL_OPT_MAX) of "bset" over its parametric domain.
6895 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6898 return isl_basic_map_lexopt(bset
, flags
);
6901 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6903 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6906 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6908 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6911 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6913 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6916 /* Compute the lexicographic minimum of "bset" over its parametric domain
6917 * for the purpose of quantifier elimination.
6918 * That is, find an explicit representation for all the existentially
6919 * quantified variables in "bset" by computing their lexicographic
6922 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6923 __isl_take isl_basic_set
*bset
)
6925 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6928 /* Given a basic map with one output dimension, compute the minimum or
6929 * maximum of that dimension as an isl_pw_aff.
6931 * Compute the optimum as a lexicographic optimum over the single
6932 * output dimension and extract the single isl_pw_aff from the result.
6934 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6937 isl_pw_multi_aff
*pma
;
6940 bmap
= isl_basic_map_copy(bmap
);
6941 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
6942 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
6943 isl_pw_multi_aff_free(pma
);
6948 /* Compute the minimum or maximum of the given output dimension
6949 * as a function of the parameters and the input dimensions,
6950 * but independently of the other output dimensions.
6952 * We first project out the other output dimension and then compute
6953 * the "lexicographic" maximum in each basic map, combining the results
6954 * using isl_pw_aff_union_max.
6956 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6963 n_out
= isl_map_dim(map
, isl_dim_out
);
6964 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6965 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6970 isl_space
*dim
= isl_map_get_space(map
);
6972 return isl_pw_aff_empty(dim
);
6975 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6976 for (i
= 1; i
< map
->n
; ++i
) {
6977 isl_pw_aff
*pwaff_i
;
6979 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6980 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6988 /* Compute the minimum of the given output dimension as a function of the
6989 * parameters and input dimensions, but independently of
6990 * the other output dimensions.
6992 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6994 return map_dim_opt(map
, pos
, 0);
6997 /* Compute the maximum of the given output dimension as a function of the
6998 * parameters and input dimensions, but independently of
6999 * the other output dimensions.
7001 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
7003 return map_dim_opt(map
, pos
, 1);
7006 /* Compute the minimum or maximum of the given set dimension
7007 * as a function of the parameters,
7008 * but independently of the other set dimensions.
7010 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
7013 return map_dim_opt(set
, pos
, max
);
7016 /* Compute the maximum of the given set dimension as a function of the
7017 * parameters, but independently of the other set dimensions.
7019 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
7021 return set_dim_opt(set
, pos
, 1);
7024 /* Compute the minimum of the given set dimension as a function of the
7025 * parameters, but independently of the other set dimensions.
7027 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7029 return set_dim_opt(set
, pos
, 0);
7032 /* Apply a preimage specified by "mat" on the parameters of "bset".
7033 * bset is assumed to have only parameters and divs.
7035 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7036 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7043 bset
->dim
= isl_space_cow(bset
->dim
);
7047 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7049 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7051 bset
->dim
->nparam
= 0;
7052 bset
->dim
->n_out
= nparam
;
7053 bset
= isl_basic_set_preimage(bset
, mat
);
7055 bset
->dim
->nparam
= bset
->dim
->n_out
;
7056 bset
->dim
->n_out
= 0;
7061 isl_basic_set_free(bset
);
7065 /* Apply a preimage specified by "mat" on the parameters of "set".
7066 * set is assumed to have only parameters and divs.
7068 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7069 __isl_take isl_mat
*mat
)
7077 nparam
= isl_set_dim(set
, isl_dim_param
);
7079 if (mat
->n_row
!= 1 + nparam
)
7080 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7081 "unexpected number of rows", goto error
);
7083 space
= isl_set_get_space(set
);
7084 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7085 isl_dim_param
, 0, nparam
);
7086 set
= isl_set_reset_space(set
, space
);
7087 set
= isl_set_preimage(set
, mat
);
7088 nparam
= isl_set_dim(set
, isl_dim_out
);
7089 space
= isl_set_get_space(set
);
7090 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7091 isl_dim_out
, 0, nparam
);
7092 set
= isl_set_reset_space(set
, space
);
7100 /* Intersect the basic set "bset" with the affine space specified by the
7101 * equalities in "eq".
7103 static __isl_give isl_basic_set
*basic_set_append_equalities(
7104 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7112 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7117 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7118 for (i
= 0; i
< eq
->n_row
; ++i
) {
7119 k
= isl_basic_set_alloc_equality(bset
);
7122 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7123 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7127 bset
= isl_basic_set_gauss(bset
, NULL
);
7128 bset
= isl_basic_set_finalize(bset
);
7133 isl_basic_set_free(bset
);
7137 /* Intersect the set "set" with the affine space specified by the
7138 * equalities in "eq".
7140 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7148 for (i
= 0; i
< set
->n
; ++i
) {
7149 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7162 /* Given a basic set "bset" that only involves parameters and existentially
7163 * quantified variables, return the index of the first equality
7164 * that only involves parameters. If there is no such equality then
7165 * return bset->n_eq.
7167 * This function assumes that isl_basic_set_gauss has been called on "bset".
7169 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7172 unsigned nparam
, n_div
;
7177 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7178 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7180 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7181 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7188 /* Compute an explicit representation for the existentially quantified
7189 * variables in "bset" by computing the "minimal value" of the set
7190 * variables. Since there are no set variables, the computation of
7191 * the minimal value essentially computes an explicit representation
7192 * of the non-empty part(s) of "bset".
7194 * The input only involves parameters and existentially quantified variables.
7195 * All equalities among parameters have been removed.
7197 * Since the existentially quantified variables in the result are in general
7198 * going to be different from those in the input, we first replace
7199 * them by the minimal number of variables based on their equalities.
7200 * This should simplify the parametric integer programming.
7202 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7204 isl_morph
*morph1
, *morph2
;
7210 if (bset
->n_eq
== 0)
7211 return isl_basic_set_lexmin_compute_divs(bset
);
7213 morph1
= isl_basic_set_parameter_compression(bset
);
7214 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7215 bset
= isl_basic_set_lift(bset
);
7216 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7217 bset
= isl_morph_basic_set(morph2
, bset
);
7218 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7219 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7221 set
= isl_basic_set_lexmin_compute_divs(bset
);
7223 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7228 /* Project the given basic set onto its parameter domain, possibly introducing
7229 * new, explicit, existential variables in the constraints.
7230 * The input has parameters and (possibly implicit) existential variables.
7231 * The output has the same parameters, but only
7232 * explicit existentially quantified variables.
7234 * The actual projection is performed by pip, but pip doesn't seem
7235 * to like equalities very much, so we first remove the equalities
7236 * among the parameters by performing a variable compression on
7237 * the parameters. Afterward, an inverse transformation is performed
7238 * and the equalities among the parameters are inserted back in.
7240 * The variable compression on the parameters may uncover additional
7241 * equalities that were only implicit before. We therefore check
7242 * if there are any new parameter equalities in the result and
7243 * if so recurse. The removal of parameter equalities is required
7244 * for the parameter compression performed by base_compute_divs.
7246 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7250 struct isl_mat
*T
, *T2
;
7251 struct isl_set
*set
;
7254 bset
= isl_basic_set_cow(bset
);
7258 if (bset
->n_eq
== 0)
7259 return base_compute_divs(bset
);
7261 bset
= isl_basic_set_gauss(bset
, NULL
);
7264 if (isl_basic_set_plain_is_empty(bset
))
7265 return isl_set_from_basic_set(bset
);
7267 i
= first_parameter_equality(bset
);
7268 if (i
== bset
->n_eq
)
7269 return base_compute_divs(bset
);
7271 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7272 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7274 eq
= isl_mat_cow(eq
);
7275 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7276 if (T
&& T
->n_col
== 0) {
7280 bset
= isl_basic_set_set_to_empty(bset
);
7281 return isl_set_from_basic_set(bset
);
7283 bset
= basic_set_parameter_preimage(bset
, T
);
7285 i
= first_parameter_equality(bset
);
7288 else if (i
== bset
->n_eq
)
7289 set
= base_compute_divs(bset
);
7291 set
= parameter_compute_divs(bset
);
7292 set
= set_parameter_preimage(set
, T2
);
7293 set
= set_append_equalities(set
, eq
);
7297 /* Insert the divs from "ls" before those of "bmap".
7299 * The number of columns is not changed, which means that the last
7300 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7301 * The caller is responsible for removing the same number of dimensions
7302 * from the space of "bmap".
7304 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7305 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7311 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7315 old_n_div
= bmap
->n_div
;
7316 bmap
= insert_div_rows(bmap
, n_div
);
7320 for (i
= 0; i
< n_div
; ++i
) {
7321 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7322 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7328 /* Replace the space of "bmap" by the space and divs of "ls".
7330 * If "ls" has any divs, then we simplify the result since we may
7331 * have discovered some additional equalities that could simplify
7332 * the div expressions.
7334 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7335 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7339 bmap
= isl_basic_map_cow(bmap
);
7343 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7344 bmap
= insert_divs_from_local_space(bmap
, ls
);
7348 isl_space_free(bmap
->dim
);
7349 bmap
->dim
= isl_local_space_get_space(ls
);
7353 isl_local_space_free(ls
);
7355 bmap
= isl_basic_map_simplify(bmap
);
7356 bmap
= isl_basic_map_finalize(bmap
);
7359 isl_basic_map_free(bmap
);
7360 isl_local_space_free(ls
);
7364 /* Replace the space of "map" by the space and divs of "ls".
7366 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7367 __isl_take isl_local_space
*ls
)
7371 map
= isl_map_cow(map
);
7375 for (i
= 0; i
< map
->n
; ++i
) {
7376 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7377 isl_local_space_copy(ls
));
7381 isl_space_free(map
->dim
);
7382 map
->dim
= isl_local_space_get_space(ls
);
7386 isl_local_space_free(ls
);
7389 isl_local_space_free(ls
);
7394 /* Compute an explicit representation for the existentially
7395 * quantified variables for which do not know any explicit representation yet.
7397 * We first sort the existentially quantified variables so that the
7398 * existentially quantified variables for which we already have an explicit
7399 * representation are placed before those for which we do not.
7400 * The input dimensions, the output dimensions and the existentially
7401 * quantified variables for which we already have an explicit
7402 * representation are then turned into parameters.
7403 * compute_divs returns a map with the same parameters and
7404 * no input or output dimensions and the dimension specification
7405 * is reset to that of the input, including the existentially quantified
7406 * variables for which we already had an explicit representation.
7408 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
7410 struct isl_basic_set
*bset
;
7411 struct isl_set
*set
;
7412 struct isl_map
*map
;
7414 isl_local_space
*ls
;
7421 bmap
= isl_basic_map_sort_divs(bmap
);
7422 bmap
= isl_basic_map_cow(bmap
);
7426 n_known
= isl_basic_map_first_unknown_div(bmap
);
7428 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7430 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7431 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7432 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7433 dim
= isl_space_set_alloc(bmap
->ctx
,
7434 nparam
+ n_in
+ n_out
+ n_known
, 0);
7438 ls
= isl_basic_map_get_local_space(bmap
);
7439 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7440 n_known
, bmap
->n_div
- n_known
);
7442 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7443 swap_div(bmap
, i
- n_known
, i
);
7444 bmap
->n_div
-= n_known
;
7445 bmap
->extra
-= n_known
;
7447 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7448 bset
= bset_from_bmap(bmap
);
7450 set
= parameter_compute_divs(bset
);
7451 map
= set_to_map(set
);
7452 map
= replace_space_by_local_space(map
, ls
);
7456 isl_basic_map_free(bmap
);
7460 /* Remove the explicit representation of local variable "div",
7463 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7464 __isl_take isl_basic_map
*bmap
, int div
)
7468 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7470 return isl_basic_map_free(bmap
);
7474 bmap
= isl_basic_map_cow(bmap
);
7477 isl_int_set_si(bmap
->div
[div
][0], 0);
7481 /* Is local variable "div" of "bmap" marked as not having an explicit
7483 * Note that even if "div" is not marked in this way and therefore
7484 * has an explicit representation, this representation may still
7485 * depend (indirectly) on other local variables that do not
7486 * have an explicit representation.
7488 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7491 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7492 return isl_bool_error
;
7493 return isl_int_is_zero(bmap
->div
[div
][0]);
7496 /* Return the position of the first local variable that does not
7497 * have an explicit representation.
7498 * Return the total number of local variables if they all have
7499 * an explicit representation.
7500 * Return -1 on error.
7502 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7509 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7510 if (!isl_basic_map_div_is_known(bmap
, i
))
7516 /* Return the position of the first local variable that does not
7517 * have an explicit representation.
7518 * Return the total number of local variables if they all have
7519 * an explicit representation.
7520 * Return -1 on error.
7522 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7524 return isl_basic_map_first_unknown_div(bset
);
7527 /* Does "bmap" have an explicit representation for all local variables?
7529 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7533 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7534 first
= isl_basic_map_first_unknown_div(bmap
);
7536 return isl_bool_error
;
7540 /* Do all basic maps in "map" have an explicit representation
7541 * for all local variables?
7543 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7548 return isl_bool_error
;
7550 for (i
= 0; i
< map
->n
; ++i
) {
7551 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7556 return isl_bool_true
;
7559 /* If bmap contains any unknown divs, then compute explicit
7560 * expressions for them. However, this computation may be
7561 * quite expensive, so first try to remove divs that aren't
7564 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7567 struct isl_map
*map
;
7569 known
= isl_basic_map_divs_known(bmap
);
7573 return isl_map_from_basic_map(bmap
);
7575 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7577 known
= isl_basic_map_divs_known(bmap
);
7581 return isl_map_from_basic_map(bmap
);
7583 map
= compute_divs(bmap
);
7586 isl_basic_map_free(bmap
);
7590 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7594 struct isl_map
*res
;
7601 known
= isl_map_divs_known(map
);
7609 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7610 for (i
= 1 ; i
< map
->n
; ++i
) {
7612 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7613 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7614 res
= isl_map_union_disjoint(res
, r2
);
7616 res
= isl_map_union(res
, r2
);
7623 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
7625 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7628 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7630 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7633 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7636 struct isl_set
*set
;
7641 map
= isl_map_cow(map
);
7645 set
= set_from_map(map
);
7646 set
->dim
= isl_space_domain(set
->dim
);
7649 for (i
= 0; i
< map
->n
; ++i
) {
7650 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7654 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7655 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7662 /* Return the union of "map1" and "map2", where we assume for now that
7663 * "map1" and "map2" are disjoint. Note that the basic maps inside
7664 * "map1" or "map2" may not be disjoint from each other.
7665 * Also note that this function is also called from isl_map_union,
7666 * which takes care of handling the situation where "map1" and "map2"
7667 * may not be disjoint.
7669 * If one of the inputs is empty, we can simply return the other input.
7670 * Similarly, if one of the inputs is universal, then it is equal to the union.
7672 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7673 __isl_take isl_map
*map2
)
7677 struct isl_map
*map
= NULL
;
7683 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7684 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7685 "spaces don't match", goto error
);
7696 is_universe
= isl_map_plain_is_universe(map1
);
7697 if (is_universe
< 0)
7704 is_universe
= isl_map_plain_is_universe(map2
);
7705 if (is_universe
< 0)
7712 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7713 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7714 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7716 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7717 map1
->n
+ map2
->n
, flags
);
7720 for (i
= 0; i
< map1
->n
; ++i
) {
7721 map
= isl_map_add_basic_map(map
,
7722 isl_basic_map_copy(map1
->p
[i
]));
7726 for (i
= 0; i
< map2
->n
; ++i
) {
7727 map
= isl_map_add_basic_map(map
,
7728 isl_basic_map_copy(map2
->p
[i
]));
7742 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7743 * guaranteed to be disjoint by the caller.
7745 * Note that this functions is called from within isl_map_make_disjoint,
7746 * so we have to be careful not to touch the constraints of the inputs
7749 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7750 __isl_take isl_map
*map2
)
7752 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7755 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7756 * not be disjoint. The parameters are assumed to have been aligned.
7758 * We currently simply call map_union_disjoint, the internal operation
7759 * of which does not really depend on the inputs being disjoint.
7760 * If the result contains more than one basic map, then we clear
7761 * the disjoint flag since the result may contain basic maps from
7762 * both inputs and these are not guaranteed to be disjoint.
7764 * As a special case, if "map1" and "map2" are obviously equal,
7765 * then we simply return "map1".
7767 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7768 __isl_take isl_map
*map2
)
7775 equal
= isl_map_plain_is_equal(map1
, map2
);
7783 map1
= map_union_disjoint(map1
, map2
);
7787 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7795 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7798 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7799 __isl_take isl_map
*map2
)
7801 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7804 __isl_give isl_set
*isl_set_union_disjoint(
7805 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
7807 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7811 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7813 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7816 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7819 * "map" and "set" are assumed to be compatible and non-NULL.
7821 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7822 __isl_take isl_set
*set
,
7823 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7824 __isl_take isl_basic_set
*bset
))
7827 struct isl_map
*result
;
7830 if (isl_set_plain_is_universe(set
)) {
7835 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7836 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7837 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7839 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7840 map
->n
* set
->n
, flags
);
7841 for (i
= 0; result
&& i
< map
->n
; ++i
)
7842 for (j
= 0; j
< set
->n
; ++j
) {
7843 result
= isl_map_add_basic_map(result
,
7844 fn(isl_basic_map_copy(map
->p
[i
]),
7845 isl_basic_set_copy(set
->p
[j
])));
7855 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7856 __isl_take isl_set
*set
)
7860 ok
= isl_map_compatible_range(map
, set
);
7864 isl_die(set
->ctx
, isl_error_invalid
,
7865 "incompatible spaces", goto error
);
7867 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7874 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7875 __isl_take isl_set
*set
)
7877 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7880 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7881 __isl_take isl_set
*set
)
7885 ok
= isl_map_compatible_domain(map
, set
);
7889 isl_die(set
->ctx
, isl_error_invalid
,
7890 "incompatible spaces", goto error
);
7892 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7899 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7900 __isl_take isl_set
*set
)
7902 return isl_map_align_params_map_map_and(map
, set
,
7903 &map_intersect_domain
);
7906 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7907 * in the space B -> C, return the intersection.
7908 * The parameters are assumed to have been aligned.
7910 * The map "factor" is first extended to a map living in the space
7911 * [A -> B] -> C and then a regular intersection is computed.
7913 static __isl_give isl_map
*map_intersect_domain_factor_range(
7914 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7917 isl_map
*ext_factor
;
7919 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7920 ext_factor
= isl_map_universe(space
);
7921 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7922 return map_intersect(map
, ext_factor
);
7925 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7926 * in the space B -> C, return the intersection.
7928 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7929 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7931 return isl_map_align_params_map_map_and(map
, factor
,
7932 &map_intersect_domain_factor_range
);
7935 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7936 * in the space A -> C, return the intersection.
7938 * The map "factor" is first extended to a map living in the space
7939 * A -> [B -> C] and then a regular intersection is computed.
7941 static __isl_give isl_map
*map_intersect_range_factor_range(
7942 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7945 isl_map
*ext_factor
;
7947 space
= isl_space_range_factor_domain(isl_map_get_space(map
));
7948 ext_factor
= isl_map_universe(space
);
7949 ext_factor
= isl_map_range_product(ext_factor
, factor
);
7950 return isl_map_intersect(map
, ext_factor
);
7953 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7954 * in the space A -> C, return the intersection.
7956 __isl_give isl_map
*isl_map_intersect_range_factor_range(
7957 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7959 return isl_map_align_params_map_map_and(map
, factor
,
7960 &map_intersect_range_factor_range
);
7963 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7964 __isl_take isl_map
*map2
)
7968 map1
= isl_map_reverse(map1
);
7969 map1
= isl_map_apply_range(map1
, map2
);
7970 return isl_map_reverse(map1
);
7977 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7978 __isl_take isl_map
*map2
)
7980 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7983 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7984 __isl_take isl_map
*map2
)
7986 isl_space
*dim_result
;
7987 struct isl_map
*result
;
7993 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7994 isl_space_copy(map2
->dim
));
7996 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7999 for (i
= 0; i
< map1
->n
; ++i
)
8000 for (j
= 0; j
< map2
->n
; ++j
) {
8001 result
= isl_map_add_basic_map(result
,
8002 isl_basic_map_apply_range(
8003 isl_basic_map_copy(map1
->p
[i
]),
8004 isl_basic_map_copy(map2
->p
[j
])));
8010 if (result
&& result
->n
<= 1)
8011 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
8019 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
8020 __isl_take isl_map
*map2
)
8022 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
8026 * returns range - domain
8028 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
8030 isl_space
*target_space
;
8031 struct isl_basic_set
*bset
;
8038 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8039 bmap
->dim
, isl_dim_out
),
8041 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
8042 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
8043 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8044 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
8045 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
8046 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
8047 for (i
= 0; i
< dim
; ++i
) {
8048 int j
= isl_basic_map_alloc_equality(bmap
);
8050 bmap
= isl_basic_map_free(bmap
);
8053 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8054 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8055 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8056 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8058 bset
= isl_basic_map_domain(bmap
);
8059 bset
= isl_basic_set_reset_space(bset
, target_space
);
8062 isl_basic_map_free(bmap
);
8067 * returns range - domain
8069 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8073 struct isl_set
*result
;
8078 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8079 map
->dim
, isl_dim_out
),
8081 dim
= isl_map_get_space(map
);
8082 dim
= isl_space_domain(dim
);
8083 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8086 for (i
= 0; i
< map
->n
; ++i
)
8087 result
= isl_set_add_basic_set(result
,
8088 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8097 * returns [domain -> range] -> range - domain
8099 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8100 __isl_take isl_basic_map
*bmap
)
8104 isl_basic_map
*domain
;
8108 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8109 bmap
->dim
, isl_dim_out
))
8110 isl_die(bmap
->ctx
, isl_error_invalid
,
8111 "domain and range don't match", goto error
);
8113 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8114 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8116 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
8117 domain
= isl_basic_map_universe(dim
);
8119 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8120 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8121 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8123 total
= isl_basic_map_total_dim(bmap
);
8125 for (i
= 0; i
< n
; ++i
) {
8126 k
= isl_basic_map_alloc_equality(bmap
);
8129 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8130 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8131 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8132 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8135 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8136 return isl_basic_map_finalize(bmap
);
8138 isl_basic_map_free(bmap
);
8143 * returns [domain -> range] -> range - domain
8145 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8148 isl_space
*domain_dim
;
8153 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8154 map
->dim
, isl_dim_out
))
8155 isl_die(map
->ctx
, isl_error_invalid
,
8156 "domain and range don't match", goto error
);
8158 map
= isl_map_cow(map
);
8162 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
8163 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8164 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8167 for (i
= 0; i
< map
->n
; ++i
) {
8168 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8172 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8179 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
8181 struct isl_basic_map
*bmap
;
8189 nparam
= dims
->nparam
;
8191 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
8195 for (i
= 0; i
< dim
; ++i
) {
8196 int j
= isl_basic_map_alloc_equality(bmap
);
8199 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8200 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8201 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8203 return isl_basic_map_finalize(bmap
);
8205 isl_basic_map_free(bmap
);
8209 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
8213 if (dim
->n_in
!= dim
->n_out
)
8214 isl_die(dim
->ctx
, isl_error_invalid
,
8215 "number of input and output dimensions needs to be "
8216 "the same", goto error
);
8217 return basic_map_identity(dim
);
8219 isl_space_free(dim
);
8223 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8225 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8228 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8230 isl_space
*dim
= isl_set_get_space(set
);
8232 id
= isl_map_identity(isl_space_map_from_set(dim
));
8233 return isl_map_intersect_range(id
, set
);
8236 /* Construct a basic set with all set dimensions having only non-negative
8239 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8240 __isl_take isl_space
*space
)
8245 struct isl_basic_set
*bset
;
8249 nparam
= space
->nparam
;
8251 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8254 for (i
= 0; i
< dim
; ++i
) {
8255 int k
= isl_basic_set_alloc_inequality(bset
);
8258 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8259 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8263 isl_basic_set_free(bset
);
8267 /* Construct the half-space x_pos >= 0.
8269 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
8273 isl_basic_set
*nonneg
;
8275 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8276 k
= isl_basic_set_alloc_inequality(nonneg
);
8279 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8280 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8282 return isl_basic_set_finalize(nonneg
);
8284 isl_basic_set_free(nonneg
);
8288 /* Construct the half-space x_pos <= -1.
8290 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
8295 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
8296 k
= isl_basic_set_alloc_inequality(neg
);
8299 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8300 isl_int_set_si(neg
->ineq
[k
][0], -1);
8301 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8303 return isl_basic_set_finalize(neg
);
8305 isl_basic_set_free(neg
);
8309 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8310 enum isl_dim_type type
, unsigned first
, unsigned n
)
8314 isl_basic_set
*nonneg
;
8322 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8324 offset
= pos(set
->dim
, type
);
8325 for (i
= 0; i
< n
; ++i
) {
8326 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8327 offset
+ first
+ i
);
8328 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8330 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8339 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8341 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8347 return isl_stat_error
;
8348 if (isl_set_plain_is_empty(set
)) {
8353 return fn(set
, signs
, user
);
8356 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8358 half
= isl_set_intersect(half
, isl_set_copy(set
));
8359 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8363 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8365 half
= isl_set_intersect(half
, set
);
8366 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8369 return isl_stat_error
;
8372 /* Call "fn" on the intersections of "set" with each of the orthants
8373 * (except for obviously empty intersections). The orthant is identified
8374 * by the signs array, with each entry having value 1 or -1 according
8375 * to the sign of the corresponding variable.
8377 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8378 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8387 return isl_stat_error
;
8388 if (isl_set_plain_is_empty(set
))
8391 nparam
= isl_set_dim(set
, isl_dim_param
);
8392 nvar
= isl_set_dim(set
, isl_dim_set
);
8394 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8396 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8404 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8406 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8409 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8410 __isl_keep isl_basic_map
*bmap2
)
8413 struct isl_map
*map1
;
8414 struct isl_map
*map2
;
8416 if (!bmap1
|| !bmap2
)
8417 return isl_bool_error
;
8419 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8420 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8422 is_subset
= isl_map_is_subset(map1
, map2
);
8430 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8431 __isl_keep isl_basic_set
*bset2
)
8433 return isl_basic_map_is_subset(bset1
, bset2
);
8436 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8437 __isl_keep isl_basic_map
*bmap2
)
8441 if (!bmap1
|| !bmap2
)
8442 return isl_bool_error
;
8443 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8444 if (is_subset
!= isl_bool_true
)
8446 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8450 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8451 __isl_keep isl_basic_set
*bset2
)
8453 return isl_basic_map_is_equal(
8454 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8457 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8463 return isl_bool_error
;
8464 for (i
= 0; i
< map
->n
; ++i
) {
8465 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8467 return isl_bool_error
;
8469 return isl_bool_false
;
8471 return isl_bool_true
;
8474 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8476 return map
? map
->n
== 0 : isl_bool_error
;
8479 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8481 return set
? set
->n
== 0 : isl_bool_error
;
8484 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8486 return isl_map_is_empty(set_to_map(set
));
8489 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8490 __isl_keep isl_map
*map2
)
8493 return isl_bool_error
;
8495 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8498 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8499 __isl_keep isl_set
*set2
)
8502 return isl_bool_error
;
8504 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8507 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8512 return isl_bool_error
;
8513 is_subset
= isl_map_is_subset(map1
, map2
);
8514 if (is_subset
!= isl_bool_true
)
8516 is_subset
= isl_map_is_subset(map2
, map1
);
8520 /* Is "map1" equal to "map2"?
8522 * First check if they are obviously equal.
8523 * If not, then perform a more detailed analysis.
8525 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8529 equal
= isl_map_plain_is_equal(map1
, map2
);
8530 if (equal
< 0 || equal
)
8532 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8535 isl_bool
isl_basic_map_is_strict_subset(
8536 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8540 if (!bmap1
|| !bmap2
)
8541 return isl_bool_error
;
8542 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8543 if (is_subset
!= isl_bool_true
)
8545 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8546 if (is_subset
== isl_bool_error
)
8551 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8552 __isl_keep isl_map
*map2
)
8557 return isl_bool_error
;
8558 is_subset
= isl_map_is_subset(map1
, map2
);
8559 if (is_subset
!= isl_bool_true
)
8561 is_subset
= isl_map_is_subset(map2
, map1
);
8562 if (is_subset
== isl_bool_error
)
8567 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8568 __isl_keep isl_set
*set2
)
8570 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8573 /* Is "bmap" obviously equal to the universe with the same space?
8575 * That is, does it not have any constraints?
8577 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8580 return isl_bool_error
;
8581 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8584 /* Is "bset" obviously equal to the universe with the same space?
8586 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8588 return isl_basic_map_plain_is_universe(bset
);
8591 /* If "c" does not involve any existentially quantified variables,
8592 * then set *univ to false and abort
8594 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8596 isl_bool
*univ
= user
;
8599 n
= isl_constraint_dim(c
, isl_dim_div
);
8600 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8601 isl_constraint_free(c
);
8602 if (*univ
< 0 || !*univ
)
8603 return isl_stat_error
;
8607 /* Is "bmap" equal to the universe with the same space?
8609 * First check if it is obviously equal to the universe.
8610 * If not and if there are any constraints not involving
8611 * existentially quantified variables, then it is certainly
8612 * not equal to the universe.
8613 * Otherwise, check if the universe is a subset of "bmap".
8615 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8618 isl_basic_map
*test
;
8620 univ
= isl_basic_map_plain_is_universe(bmap
);
8621 if (univ
< 0 || univ
)
8623 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8624 return isl_bool_false
;
8625 univ
= isl_bool_true
;
8626 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8628 return isl_bool_error
;
8629 if (univ
< 0 || !univ
)
8631 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8632 univ
= isl_basic_map_is_subset(test
, bmap
);
8633 isl_basic_map_free(test
);
8637 /* Is "bset" equal to the universe with the same space?
8639 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8641 return isl_basic_map_is_universe(bset
);
8644 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8649 return isl_bool_error
;
8651 for (i
= 0; i
< map
->n
; ++i
) {
8652 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8657 return isl_bool_false
;
8660 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8662 return isl_map_plain_is_universe(set_to_map(set
));
8665 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8667 struct isl_basic_set
*bset
= NULL
;
8668 struct isl_vec
*sample
= NULL
;
8669 isl_bool empty
, non_empty
;
8672 return isl_bool_error
;
8674 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8675 return isl_bool_true
;
8677 if (isl_basic_map_plain_is_universe(bmap
))
8678 return isl_bool_false
;
8680 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8681 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8682 copy
= isl_basic_map_remove_redundancies(copy
);
8683 empty
= isl_basic_map_plain_is_empty(copy
);
8684 isl_basic_map_free(copy
);
8688 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8690 return isl_bool_error
;
8692 return isl_bool_false
;
8693 isl_vec_free(bmap
->sample
);
8694 bmap
->sample
= NULL
;
8695 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8697 return isl_bool_error
;
8698 sample
= isl_basic_set_sample_vec(bset
);
8700 return isl_bool_error
;
8701 empty
= sample
->size
== 0;
8702 isl_vec_free(bmap
->sample
);
8703 bmap
->sample
= sample
;
8705 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8710 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8713 return isl_bool_error
;
8714 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8717 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8720 return isl_bool_error
;
8721 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8724 /* Is "bmap" known to be non-empty?
8726 * That is, is the cached sample still valid?
8728 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8733 return isl_bool_error
;
8735 return isl_bool_false
;
8736 total
= 1 + isl_basic_map_total_dim(bmap
);
8737 if (bmap
->sample
->size
!= total
)
8738 return isl_bool_false
;
8739 return isl_basic_map_contains(bmap
, bmap
->sample
);
8742 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8744 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8747 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8748 __isl_take isl_basic_map
*bmap2
)
8750 struct isl_map
*map
;
8751 if (!bmap1
|| !bmap2
)
8754 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8756 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8759 map
= isl_map_add_basic_map(map
, bmap1
);
8760 map
= isl_map_add_basic_map(map
, bmap2
);
8763 isl_basic_map_free(bmap1
);
8764 isl_basic_map_free(bmap2
);
8768 struct isl_set
*isl_basic_set_union(
8769 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8771 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8772 bset_to_bmap(bset2
)));
8775 /* Order divs such that any div only depends on previous divs */
8776 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8777 __isl_take isl_basic_map
*bmap
)
8785 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8787 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8789 if (isl_int_is_zero(bmap
->div
[i
][0]))
8791 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8796 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8797 "integer division depends on itself",
8798 return isl_basic_map_free(bmap
));
8799 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8805 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8807 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8810 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8817 for (i
= 0; i
< map
->n
; ++i
) {
8818 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8829 /* Sort the local variables of "bset".
8831 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8832 __isl_take isl_basic_set
*bset
)
8834 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8837 /* Apply the expansion computed by isl_merge_divs.
8838 * The expansion itself is given by "exp" while the resulting
8839 * list of divs is given by "div".
8841 * Move the integer divisions of "bmap" into the right position
8842 * according to "exp" and then introduce the additional integer
8843 * divisions, adding div constraints.
8844 * The moving should be done first to avoid moving coefficients
8845 * in the definitions of the extra integer divisions.
8847 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8848 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8853 bmap
= isl_basic_map_cow(bmap
);
8857 if (div
->n_row
< bmap
->n_div
)
8858 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8859 "not an expansion", goto error
);
8861 n_div
= bmap
->n_div
;
8862 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8863 div
->n_row
- n_div
, 0,
8864 2 * (div
->n_row
- n_div
));
8866 for (i
= n_div
; i
< div
->n_row
; ++i
)
8867 if (isl_basic_map_alloc_div(bmap
) < 0)
8870 for (j
= n_div
- 1; j
>= 0; --j
) {
8873 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8876 for (i
= 0; i
< div
->n_row
; ++i
) {
8877 if (j
< n_div
&& exp
[j
] == i
) {
8880 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8881 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8883 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8891 isl_basic_map_free(bmap
);
8896 /* Apply the expansion computed by isl_merge_divs.
8897 * The expansion itself is given by "exp" while the resulting
8898 * list of divs is given by "div".
8900 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8901 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8903 return isl_basic_map_expand_divs(bset
, div
, exp
);
8906 /* Look for a div in dst that corresponds to the div "div" in src.
8907 * The divs before "div" in src and dst are assumed to be the same.
8909 * Returns -1 if no corresponding div was found and the position
8910 * of the corresponding div in dst otherwise.
8912 static int find_div(__isl_keep isl_basic_map
*dst
,
8913 __isl_keep isl_basic_map
*src
, unsigned div
)
8917 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8919 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8920 for (i
= div
; i
< dst
->n_div
; ++i
)
8921 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8922 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8923 dst
->n_div
- div
) == -1)
8928 /* Align the divs of "dst" to those of "src", adding divs from "src"
8929 * if needed. That is, make sure that the first src->n_div divs
8930 * of the result are equal to those of src.
8932 * The result is not finalized as by design it will have redundant
8933 * divs if any divs from "src" were copied.
8935 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8936 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8939 int known
, extended
;
8943 return isl_basic_map_free(dst
);
8945 if (src
->n_div
== 0)
8948 known
= isl_basic_map_divs_known(src
);
8950 return isl_basic_map_free(dst
);
8952 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8953 "some src divs are unknown",
8954 return isl_basic_map_free(dst
));
8956 src
= isl_basic_map_order_divs(src
);
8959 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8960 for (i
= 0; i
< src
->n_div
; ++i
) {
8961 int j
= find_div(dst
, src
, i
);
8964 int extra
= src
->n_div
- i
;
8965 dst
= isl_basic_map_cow(dst
);
8968 dst
= isl_basic_map_extend_space(dst
,
8969 isl_space_copy(dst
->dim
),
8970 extra
, 0, 2 * extra
);
8973 j
= isl_basic_map_alloc_div(dst
);
8975 return isl_basic_map_free(dst
);
8976 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8977 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8978 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8979 return isl_basic_map_free(dst
);
8982 isl_basic_map_swap_div(dst
, i
, j
);
8987 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
8995 map
= isl_map_compute_divs(map
);
8996 map
= isl_map_cow(map
);
9000 for (i
= 1; i
< map
->n
; ++i
)
9001 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
9002 for (i
= 1; i
< map
->n
; ++i
) {
9003 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
9005 return isl_map_free(map
);
9008 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
9012 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
9014 return isl_map_align_divs_internal(map
);
9017 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
9019 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
9022 /* Align the divs of the basic maps in "map" to those
9023 * of the basic maps in "list", as well as to the other basic maps in "map".
9024 * The elements in "list" are assumed to have known divs.
9026 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
9027 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
9031 map
= isl_map_compute_divs(map
);
9032 map
= isl_map_cow(map
);
9034 return isl_map_free(map
);
9038 n
= isl_basic_map_list_n_basic_map(list
);
9039 for (i
= 0; i
< n
; ++i
) {
9040 isl_basic_map
*bmap
;
9042 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
9043 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
9044 isl_basic_map_free(bmap
);
9047 return isl_map_free(map
);
9049 return isl_map_align_divs_internal(map
);
9052 /* Align the divs of each element of "list" to those of "bmap".
9053 * Both "bmap" and the elements of "list" are assumed to have known divs.
9055 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9056 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9061 return isl_basic_map_list_free(list
);
9063 n
= isl_basic_map_list_n_basic_map(list
);
9064 for (i
= 0; i
< n
; ++i
) {
9065 isl_basic_map
*bmap_i
;
9067 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9068 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9069 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9075 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9076 __isl_take isl_map
*map
)
9080 ok
= isl_map_compatible_domain(map
, set
);
9084 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9085 "incompatible spaces", goto error
);
9086 map
= isl_map_intersect_domain(map
, set
);
9087 set
= isl_map_range(map
);
9095 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9096 __isl_take isl_map
*map
)
9098 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9101 /* There is no need to cow as removing empty parts doesn't change
9102 * the meaning of the set.
9104 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9111 for (i
= map
->n
- 1; i
>= 0; --i
)
9112 remove_if_empty(map
, i
);
9117 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9119 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9122 /* Create a binary relation that maps the shared initial "pos" dimensions
9123 * of "bset1" and "bset2" to the remaining dimensions of "bset1" and "bset2".
9125 static __isl_give isl_basic_map
*join_initial(__isl_keep isl_basic_set
*bset1
,
9126 __isl_keep isl_basic_set
*bset2
, int pos
)
9128 isl_basic_map
*bmap1
;
9129 isl_basic_map
*bmap2
;
9131 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9132 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9133 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9134 isl_dim_out
, 0, pos
);
9135 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9136 isl_dim_out
, 0, pos
);
9137 return isl_basic_map_range_product(bmap1
, bmap2
);
9140 /* Given two basic sets bset1 and bset2, compute the maximal difference
9141 * between the values of dimension pos in bset1 and those in bset2
9142 * for any common value of the parameters and dimensions preceding pos.
9144 static enum isl_lp_result
basic_set_maximal_difference_at(
9145 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9146 int pos
, isl_int
*opt
)
9148 isl_basic_map
*bmap1
;
9149 struct isl_ctx
*ctx
;
9150 struct isl_vec
*obj
;
9154 enum isl_lp_result res
;
9156 if (!bset1
|| !bset2
)
9157 return isl_lp_error
;
9159 nparam
= isl_basic_set_n_param(bset1
);
9160 dim1
= isl_basic_set_n_dim(bset1
);
9162 bmap1
= join_initial(bset1
, bset2
, pos
);
9164 return isl_lp_error
;
9166 total
= isl_basic_map_total_dim(bmap1
);
9168 obj
= isl_vec_alloc(ctx
, 1 + total
);
9171 isl_seq_clr(obj
->block
.data
, 1 + total
);
9172 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9173 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9174 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9176 isl_basic_map_free(bmap1
);
9180 isl_basic_map_free(bmap1
);
9181 return isl_lp_error
;
9184 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9185 * for any common value of the parameters and dimensions preceding pos
9186 * in both basic sets, the values of dimension pos in bset1 are
9187 * smaller or larger than those in bset2.
9190 * 1 if bset1 follows bset2
9191 * -1 if bset1 precedes bset2
9192 * 0 if bset1 and bset2 are incomparable
9193 * -2 if some error occurred.
9195 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
9196 struct isl_basic_set
*bset2
, int pos
)
9199 enum isl_lp_result res
;
9204 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9206 if (res
== isl_lp_empty
)
9208 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9209 res
== isl_lp_unbounded
)
9211 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9220 /* Given two basic sets bset1 and bset2, check whether
9221 * for any common value of the parameters and dimensions preceding pos
9222 * there is a value of dimension pos in bset1 that is larger
9223 * than a value of the same dimension in bset2.
9226 * 1 if there exists such a pair
9227 * 0 if there is no such pair, but there is a pair of equal values
9229 * -2 if some error occurred.
9231 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9232 __isl_keep isl_basic_set
*bset2
, int pos
)
9235 isl_basic_map
*bmap
;
9238 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
9239 bmap
= join_initial(bset1
, bset2
, pos
);
9240 bmap
= isl_basic_map_order_ge(bmap
, isl_dim_out
, 0,
9241 isl_dim_out
, dim1
- pos
);
9242 empty
= isl_basic_map_is_empty(bmap
);
9246 isl_basic_map_free(bmap
);
9249 bmap
= isl_basic_map_order_gt(bmap
, isl_dim_out
, 0,
9250 isl_dim_out
, dim1
- pos
);
9251 empty
= isl_basic_map_is_empty(bmap
);
9254 isl_basic_map_free(bmap
);
9259 isl_basic_map_free(bmap
);
9263 /* Given two sets set1 and set2, check whether
9264 * for any common value of the parameters and dimensions preceding pos
9265 * there is a value of dimension pos in set1 that is larger
9266 * than a value of the same dimension in set2.
9269 * 1 if there exists such a pair
9270 * 0 if there is no such pair, but there is a pair of equal values
9272 * -2 if some error occurred.
9274 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9275 __isl_keep isl_set
*set2
, int pos
)
9283 for (i
= 0; i
< set1
->n
; ++i
)
9284 for (j
= 0; j
< set2
->n
; ++j
) {
9286 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9287 if (f
== 1 || f
== -2)
9296 static isl_bool
isl_basic_map_plain_has_fixed_var(
9297 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9304 return isl_bool_error
;
9305 total
= isl_basic_map_total_dim(bmap
);
9306 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9307 for (; d
+1 > pos
; --d
)
9308 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9312 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9313 return isl_bool_false
;
9314 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9315 return isl_bool_false
;
9316 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9317 return isl_bool_false
;
9319 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9320 return isl_bool_true
;
9322 return isl_bool_false
;
9325 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9326 unsigned pos
, isl_int
*val
)
9334 return isl_bool_error
;
9336 return isl_bool_false
;
9338 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9341 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9342 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9343 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9344 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9345 fixed
= isl_bool_false
;
9348 isl_int_set(*val
, v
);
9354 static isl_bool
isl_basic_set_plain_has_fixed_var(
9355 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9357 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9361 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9362 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9364 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9365 return isl_bool_error
;
9366 return isl_basic_map_plain_has_fixed_var(bmap
,
9367 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9370 /* If "bmap" obviously lies on a hyperplane where the given dimension
9371 * has a fixed value, then return that value.
9372 * Otherwise return NaN.
9374 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9375 __isl_keep isl_basic_map
*bmap
,
9376 enum isl_dim_type type
, unsigned pos
)
9384 ctx
= isl_basic_map_get_ctx(bmap
);
9385 v
= isl_val_alloc(ctx
);
9388 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9390 return isl_val_free(v
);
9392 isl_int_set_si(v
->d
, 1);
9396 return isl_val_nan(ctx
);
9399 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9400 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9402 if (pos
>= isl_map_dim(map
, type
))
9403 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9404 "position out of bounds", return isl_bool_error
);
9405 return isl_map_plain_has_fixed_var(map
,
9406 map_offset(map
, type
) - 1 + pos
, val
);
9409 /* If "map" obviously lies on a hyperplane where the given dimension
9410 * has a fixed value, then return that value.
9411 * Otherwise return NaN.
9413 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9414 enum isl_dim_type type
, unsigned pos
)
9422 ctx
= isl_map_get_ctx(map
);
9423 v
= isl_val_alloc(ctx
);
9426 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9428 return isl_val_free(v
);
9430 isl_int_set_si(v
->d
, 1);
9434 return isl_val_nan(ctx
);
9437 /* If "set" obviously lies on a hyperplane where the given dimension
9438 * has a fixed value, then return that value.
9439 * Otherwise return NaN.
9441 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9442 enum isl_dim_type type
, unsigned pos
)
9444 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9447 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9448 * then return this fixed value in *val.
9450 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9451 unsigned dim
, isl_int
*val
)
9453 return isl_basic_set_plain_has_fixed_var(bset
,
9454 isl_basic_set_n_param(bset
) + dim
, val
);
9457 /* Return -1 if the constraint "c1" should be sorted before "c2"
9458 * and 1 if it should be sorted after "c2".
9459 * Return 0 if the two constraints are the same (up to the constant term).
9461 * In particular, if a constraint involves later variables than another
9462 * then it is sorted after this other constraint.
9463 * uset_gist depends on constraints without existentially quantified
9464 * variables sorting first.
9466 * For constraints that have the same latest variable, those
9467 * with the same coefficient for this latest variable (first in absolute value
9468 * and then in actual value) are grouped together.
9469 * This is useful for detecting pairs of constraints that can
9470 * be chained in their printed representation.
9472 * Finally, within a group, constraints are sorted according to
9473 * their coefficients (excluding the constant term).
9475 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9477 isl_int
**c1
= (isl_int
**) p1
;
9478 isl_int
**c2
= (isl_int
**) p2
;
9480 unsigned size
= *(unsigned *) arg
;
9483 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9484 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9489 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9492 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9496 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9499 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9500 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9501 * and 0 if the two constraints are the same (up to the constant term).
9503 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9504 isl_int
*c1
, isl_int
*c2
)
9510 total
= isl_basic_map_total_dim(bmap
);
9511 return sort_constraint_cmp(&c1
, &c2
, &total
);
9514 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9515 __isl_take isl_basic_map
*bmap
)
9521 if (bmap
->n_ineq
== 0)
9523 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9525 total
= isl_basic_map_total_dim(bmap
);
9526 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9527 &sort_constraint_cmp
, &total
) < 0)
9528 return isl_basic_map_free(bmap
);
9532 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9533 __isl_take isl_basic_set
*bset
)
9535 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9536 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9539 __isl_give isl_basic_map
*isl_basic_map_normalize(
9540 __isl_take isl_basic_map
*bmap
)
9544 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9546 bmap
= isl_basic_map_remove_redundancies(bmap
);
9547 bmap
= isl_basic_map_sort_constraints(bmap
);
9549 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9552 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9553 __isl_keep isl_basic_map
*bmap2
)
9557 isl_space
*space1
, *space2
;
9559 if (!bmap1
|| !bmap2
)
9564 space1
= isl_basic_map_peek_space(bmap1
);
9565 space2
= isl_basic_map_peek_space(bmap2
);
9566 cmp
= isl_space_cmp(space1
, space2
);
9569 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9570 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9571 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9572 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9573 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9575 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9577 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9579 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9580 return bmap1
->n_eq
- bmap2
->n_eq
;
9581 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9582 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9583 if (bmap1
->n_div
!= bmap2
->n_div
)
9584 return bmap1
->n_div
- bmap2
->n_div
;
9585 total
= isl_basic_map_total_dim(bmap1
);
9586 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9587 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9591 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9592 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9596 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9597 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9604 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9605 __isl_keep isl_basic_set
*bset2
)
9607 return isl_basic_map_plain_cmp(bset1
, bset2
);
9610 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9616 if (set1
->n
!= set2
->n
)
9617 return set1
->n
- set2
->n
;
9619 for (i
= 0; i
< set1
->n
; ++i
) {
9620 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9628 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9629 __isl_keep isl_basic_map
*bmap2
)
9631 if (!bmap1
|| !bmap2
)
9632 return isl_bool_error
;
9633 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9636 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9637 __isl_keep isl_basic_set
*bset2
)
9639 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9640 bset_to_bmap(bset2
));
9643 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9645 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9646 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9648 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9651 /* Sort the basic maps of "map" and remove duplicate basic maps.
9653 * While removing basic maps, we make sure that the basic maps remain
9654 * sorted because isl_map_normalize expects the basic maps of the result
9657 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9661 map
= isl_map_remove_empty_parts(map
);
9664 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9665 for (i
= map
->n
- 1; i
>= 1; --i
) {
9666 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9668 isl_basic_map_free(map
->p
[i
-1]);
9669 for (j
= i
; j
< map
->n
; ++j
)
9670 map
->p
[j
- 1] = map
->p
[j
];
9677 /* Remove obvious duplicates among the basic maps of "map".
9679 * Unlike isl_map_normalize, this function does not remove redundant
9680 * constraints and only removes duplicates that have exactly the same
9681 * constraints in the input. It does sort the constraints and
9682 * the basic maps to ease the detection of duplicates.
9684 * If "map" has already been normalized or if the basic maps are
9685 * disjoint, then there can be no duplicates.
9687 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9690 isl_basic_map
*bmap
;
9696 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9698 for (i
= 0; i
< map
->n
; ++i
) {
9699 bmap
= isl_basic_map_copy(map
->p
[i
]);
9700 bmap
= isl_basic_map_sort_constraints(bmap
);
9702 return isl_map_free(map
);
9703 isl_basic_map_free(map
->p
[i
]);
9707 map
= sort_and_remove_duplicates(map
);
9711 /* We normalize in place, but if anything goes wrong we need
9712 * to return NULL, so we need to make sure we don't change the
9713 * meaning of any possible other copies of map.
9715 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9718 struct isl_basic_map
*bmap
;
9722 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9724 for (i
= 0; i
< map
->n
; ++i
) {
9725 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9728 isl_basic_map_free(map
->p
[i
]);
9732 map
= sort_and_remove_duplicates(map
);
9734 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9741 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9743 return set_from_map(isl_map_normalize(set_to_map(set
)));
9746 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9747 __isl_keep isl_map
*map2
)
9753 return isl_bool_error
;
9756 return isl_bool_true
;
9757 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9758 return isl_bool_false
;
9760 map1
= isl_map_copy(map1
);
9761 map2
= isl_map_copy(map2
);
9762 map1
= isl_map_normalize(map1
);
9763 map2
= isl_map_normalize(map2
);
9766 equal
= map1
->n
== map2
->n
;
9767 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9768 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9778 return isl_bool_error
;
9781 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9782 __isl_keep isl_set
*set2
)
9784 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9787 /* Return the basic maps in "map" as a list.
9789 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9790 __isl_keep isl_map
*map
)
9794 isl_basic_map_list
*list
;
9798 ctx
= isl_map_get_ctx(map
);
9799 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9801 for (i
= 0; i
< map
->n
; ++i
) {
9802 isl_basic_map
*bmap
;
9804 bmap
= isl_basic_map_copy(map
->p
[i
]);
9805 list
= isl_basic_map_list_add(list
, bmap
);
9811 /* Return the intersection of the elements in the non-empty list "list".
9812 * All elements are assumed to live in the same space.
9814 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9815 __isl_take isl_basic_map_list
*list
)
9818 isl_basic_map
*bmap
;
9822 n
= isl_basic_map_list_n_basic_map(list
);
9824 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9825 "expecting non-empty list", goto error
);
9827 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9828 for (i
= 1; i
< n
; ++i
) {
9829 isl_basic_map
*bmap_i
;
9831 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9832 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9835 isl_basic_map_list_free(list
);
9838 isl_basic_map_list_free(list
);
9842 /* Return the intersection of the elements in the non-empty list "list".
9843 * All elements are assumed to live in the same space.
9845 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9846 __isl_take isl_basic_set_list
*list
)
9848 return isl_basic_map_list_intersect(list
);
9851 /* Return the union of the elements of "list".
9852 * The list is required to have at least one element.
9854 __isl_give isl_set
*isl_basic_set_list_union(
9855 __isl_take isl_basic_set_list
*list
)
9859 isl_basic_set
*bset
;
9864 n
= isl_basic_set_list_n_basic_set(list
);
9866 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9867 "expecting non-empty list", goto error
);
9869 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9870 space
= isl_basic_set_get_space(bset
);
9871 isl_basic_set_free(bset
);
9873 set
= isl_set_alloc_space(space
, n
, 0);
9874 for (i
= 0; i
< n
; ++i
) {
9875 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9876 set
= isl_set_add_basic_set(set
, bset
);
9879 isl_basic_set_list_free(list
);
9882 isl_basic_set_list_free(list
);
9886 /* Return the union of the elements in the non-empty list "list".
9887 * All elements are assumed to live in the same space.
9889 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9896 n
= isl_set_list_n_set(list
);
9898 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9899 "expecting non-empty list", goto error
);
9901 set
= isl_set_list_get_set(list
, 0);
9902 for (i
= 1; i
< n
; ++i
) {
9905 set_i
= isl_set_list_get_set(list
, i
);
9906 set
= isl_set_union(set
, set_i
);
9909 isl_set_list_free(list
);
9912 isl_set_list_free(list
);
9916 __isl_give isl_basic_map
*isl_basic_map_product(
9917 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9919 isl_space
*dim_result
= NULL
;
9920 struct isl_basic_map
*bmap
;
9921 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9922 struct isl_dim_map
*dim_map1
, *dim_map2
;
9924 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9926 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9927 isl_space_copy(bmap2
->dim
));
9929 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9930 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9931 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9932 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9933 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9935 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9936 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9937 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9938 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9939 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9940 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9941 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9942 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9943 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9944 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9945 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9947 bmap
= isl_basic_map_alloc_space(dim_result
,
9948 bmap1
->n_div
+ bmap2
->n_div
,
9949 bmap1
->n_eq
+ bmap2
->n_eq
,
9950 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9951 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9952 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9953 bmap
= isl_basic_map_simplify(bmap
);
9954 return isl_basic_map_finalize(bmap
);
9956 isl_basic_map_free(bmap1
);
9957 isl_basic_map_free(bmap2
);
9961 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9962 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9964 isl_basic_map
*prod
;
9966 prod
= isl_basic_map_product(bmap1
, bmap2
);
9967 prod
= isl_basic_map_flatten(prod
);
9971 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9972 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9974 return isl_basic_map_flat_range_product(bset1
, bset2
);
9977 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9978 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9980 isl_space
*space_result
= NULL
;
9981 isl_basic_map
*bmap
;
9982 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9983 struct isl_dim_map
*dim_map1
, *dim_map2
;
9985 if (!bmap1
|| !bmap2
)
9988 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9989 isl_space_copy(bmap2
->dim
));
9991 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9992 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9993 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9994 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9996 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9997 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9998 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9999 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10000 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10001 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10002 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
10003 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
10004 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
10005 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
10006 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10008 bmap
= isl_basic_map_alloc_space(space_result
,
10009 bmap1
->n_div
+ bmap2
->n_div
,
10010 bmap1
->n_eq
+ bmap2
->n_eq
,
10011 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10012 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10013 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10014 bmap
= isl_basic_map_simplify(bmap
);
10015 return isl_basic_map_finalize(bmap
);
10017 isl_basic_map_free(bmap1
);
10018 isl_basic_map_free(bmap2
);
10022 __isl_give isl_basic_map
*isl_basic_map_range_product(
10023 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10026 isl_space
*dim_result
= NULL
;
10027 isl_basic_map
*bmap
;
10028 unsigned in
, out1
, out2
, nparam
, total
, pos
;
10029 struct isl_dim_map
*dim_map1
, *dim_map2
;
10031 rational
= isl_basic_map_is_rational(bmap1
);
10032 if (rational
>= 0 && rational
)
10033 rational
= isl_basic_map_is_rational(bmap2
);
10034 if (!bmap1
|| !bmap2
|| rational
< 0)
10037 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10040 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
10041 isl_space_copy(bmap2
->dim
));
10043 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10044 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10045 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10046 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10048 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10049 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10050 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10051 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10052 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10053 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10054 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
10055 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
10056 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10057 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10058 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10060 bmap
= isl_basic_map_alloc_space(dim_result
,
10061 bmap1
->n_div
+ bmap2
->n_div
,
10062 bmap1
->n_eq
+ bmap2
->n_eq
,
10063 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10064 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10065 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10067 bmap
= isl_basic_map_set_rational(bmap
);
10068 bmap
= isl_basic_map_simplify(bmap
);
10069 return isl_basic_map_finalize(bmap
);
10071 isl_basic_map_free(bmap1
);
10072 isl_basic_map_free(bmap2
);
10076 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10077 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10079 isl_basic_map
*prod
;
10081 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10082 prod
= isl_basic_map_flatten_range(prod
);
10086 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10087 * and collect the results.
10088 * The result live in the space obtained by calling "space_product"
10089 * on the spaces of "map1" and "map2".
10090 * If "remove_duplicates" is set then the result may contain duplicates
10091 * (even if the inputs do not) and so we try and remove the obvious
10094 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10095 __isl_take isl_map
*map2
,
10096 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10097 __isl_take isl_space
*right
),
10098 __isl_give isl_basic_map
*(*basic_map_product
)(
10099 __isl_take isl_basic_map
*left
,
10100 __isl_take isl_basic_map
*right
),
10101 int remove_duplicates
)
10103 unsigned flags
= 0;
10104 struct isl_map
*result
;
10108 m
= isl_map_has_equal_params(map1
, map2
);
10112 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10113 "parameters don't match", goto error
);
10115 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10116 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10117 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10119 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10120 isl_space_copy(map2
->dim
)),
10121 map1
->n
* map2
->n
, flags
);
10124 for (i
= 0; i
< map1
->n
; ++i
)
10125 for (j
= 0; j
< map2
->n
; ++j
) {
10126 struct isl_basic_map
*part
;
10127 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10128 isl_basic_map_copy(map2
->p
[j
]));
10129 if (isl_basic_map_is_empty(part
))
10130 isl_basic_map_free(part
);
10132 result
= isl_map_add_basic_map(result
, part
);
10136 if (remove_duplicates
)
10137 result
= isl_map_remove_obvious_duplicates(result
);
10138 isl_map_free(map1
);
10139 isl_map_free(map2
);
10142 isl_map_free(map1
);
10143 isl_map_free(map2
);
10147 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10149 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10150 __isl_take isl_map
*map2
)
10152 return map_product(map1
, map2
, &isl_space_product
,
10153 &isl_basic_map_product
, 0);
10156 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10157 __isl_take isl_map
*map2
)
10159 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10162 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10164 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10165 __isl_take isl_map
*map2
)
10169 prod
= isl_map_product(map1
, map2
);
10170 prod
= isl_map_flatten(prod
);
10174 /* Given two set A and B, construct its Cartesian product A x B.
10176 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10178 return isl_map_range_product(set1
, set2
);
10181 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10182 __isl_take isl_set
*set2
)
10184 return isl_map_flat_range_product(set1
, set2
);
10187 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10189 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10190 __isl_take isl_map
*map2
)
10192 return map_product(map1
, map2
, &isl_space_domain_product
,
10193 &isl_basic_map_domain_product
, 1);
10196 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10198 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10199 __isl_take isl_map
*map2
)
10201 return map_product(map1
, map2
, &isl_space_range_product
,
10202 &isl_basic_map_range_product
, 1);
10205 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10206 __isl_take isl_map
*map2
)
10208 return isl_map_align_params_map_map_and(map1
, map2
,
10209 &map_domain_product_aligned
);
10212 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10213 __isl_take isl_map
*map2
)
10215 return isl_map_align_params_map_map_and(map1
, map2
,
10216 &map_range_product_aligned
);
10219 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10221 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10224 int total1
, keep1
, total2
, keep2
;
10228 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10229 !isl_space_range_is_wrapping(map
->dim
))
10230 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10231 "not a product", return isl_map_free(map
));
10233 space
= isl_map_get_space(map
);
10234 total1
= isl_space_dim(space
, isl_dim_in
);
10235 total2
= isl_space_dim(space
, isl_dim_out
);
10236 space
= isl_space_factor_domain(space
);
10237 keep1
= isl_space_dim(space
, isl_dim_in
);
10238 keep2
= isl_space_dim(space
, isl_dim_out
);
10239 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10240 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10241 map
= isl_map_reset_space(map
, space
);
10246 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10248 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10251 int total1
, keep1
, total2
, keep2
;
10255 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10256 !isl_space_range_is_wrapping(map
->dim
))
10257 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10258 "not a product", return isl_map_free(map
));
10260 space
= isl_map_get_space(map
);
10261 total1
= isl_space_dim(space
, isl_dim_in
);
10262 total2
= isl_space_dim(space
, isl_dim_out
);
10263 space
= isl_space_factor_range(space
);
10264 keep1
= isl_space_dim(space
, isl_dim_in
);
10265 keep2
= isl_space_dim(space
, isl_dim_out
);
10266 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10267 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10268 map
= isl_map_reset_space(map
, space
);
10273 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10275 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10282 if (!isl_space_domain_is_wrapping(map
->dim
))
10283 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10284 "domain is not a product", return isl_map_free(map
));
10286 space
= isl_map_get_space(map
);
10287 total
= isl_space_dim(space
, isl_dim_in
);
10288 space
= isl_space_domain_factor_domain(space
);
10289 keep
= isl_space_dim(space
, isl_dim_in
);
10290 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10291 map
= isl_map_reset_space(map
, space
);
10296 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10298 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10305 if (!isl_space_domain_is_wrapping(map
->dim
))
10306 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10307 "domain is not a product", return isl_map_free(map
));
10309 space
= isl_map_get_space(map
);
10310 total
= isl_space_dim(space
, isl_dim_in
);
10311 space
= isl_space_domain_factor_range(space
);
10312 keep
= isl_space_dim(space
, isl_dim_in
);
10313 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10314 map
= isl_map_reset_space(map
, space
);
10319 /* Given a map A -> [B -> C], extract the map A -> B.
10321 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10328 if (!isl_space_range_is_wrapping(map
->dim
))
10329 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10330 "range is not a product", return isl_map_free(map
));
10332 space
= isl_map_get_space(map
);
10333 total
= isl_space_dim(space
, isl_dim_out
);
10334 space
= isl_space_range_factor_domain(space
);
10335 keep
= isl_space_dim(space
, isl_dim_out
);
10336 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10337 map
= isl_map_reset_space(map
, space
);
10342 /* Given a map A -> [B -> C], extract the map A -> C.
10344 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10351 if (!isl_space_range_is_wrapping(map
->dim
))
10352 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10353 "range is not a product", return isl_map_free(map
));
10355 space
= isl_map_get_space(map
);
10356 total
= isl_space_dim(space
, isl_dim_out
);
10357 space
= isl_space_range_factor_range(space
);
10358 keep
= isl_space_dim(space
, isl_dim_out
);
10359 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10360 map
= isl_map_reset_space(map
, space
);
10365 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10367 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10368 __isl_take isl_map
*map2
)
10372 prod
= isl_map_domain_product(map1
, map2
);
10373 prod
= isl_map_flatten_domain(prod
);
10377 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10379 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10380 __isl_take isl_map
*map2
)
10384 prod
= isl_map_range_product(map1
, map2
);
10385 prod
= isl_map_flatten_range(prod
);
10389 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10392 uint32_t hash
= isl_hash_init();
10397 bmap
= isl_basic_map_copy(bmap
);
10398 bmap
= isl_basic_map_normalize(bmap
);
10401 total
= isl_basic_map_total_dim(bmap
);
10402 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10403 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10405 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10406 isl_hash_hash(hash
, c_hash
);
10408 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10409 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10411 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10412 isl_hash_hash(hash
, c_hash
);
10414 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10415 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10417 if (isl_int_is_zero(bmap
->div
[i
][0]))
10419 isl_hash_byte(hash
, i
& 0xFF);
10420 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10421 isl_hash_hash(hash
, c_hash
);
10423 isl_basic_map_free(bmap
);
10427 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10429 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10432 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10439 map
= isl_map_copy(map
);
10440 map
= isl_map_normalize(map
);
10444 hash
= isl_hash_init();
10445 for (i
= 0; i
< map
->n
; ++i
) {
10446 uint32_t bmap_hash
;
10447 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10448 isl_hash_hash(hash
, bmap_hash
);
10456 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10458 return isl_map_get_hash(set_to_map(set
));
10461 /* Return the number of basic maps in the (current) representation of "map".
10463 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10465 return map
? map
->n
: 0;
10468 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10470 return set
? set
->n
: 0;
10473 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10474 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10479 return isl_stat_error
;
10481 for (i
= 0; i
< map
->n
; ++i
)
10482 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10483 return isl_stat_error
;
10485 return isl_stat_ok
;
10488 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10489 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10494 return isl_stat_error
;
10496 for (i
= 0; i
< set
->n
; ++i
)
10497 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10498 return isl_stat_error
;
10500 return isl_stat_ok
;
10503 /* Return a list of basic sets, the union of which is equal to "set".
10505 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10506 __isl_keep isl_set
*set
)
10509 isl_basic_set_list
*list
;
10514 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10515 for (i
= 0; i
< set
->n
; ++i
) {
10516 isl_basic_set
*bset
;
10518 bset
= isl_basic_set_copy(set
->p
[i
]);
10519 list
= isl_basic_set_list_add(list
, bset
);
10525 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10532 bset
= isl_basic_set_cow(bset
);
10536 dim
= isl_basic_set_get_space(bset
);
10537 dim
= isl_space_lift(dim
, bset
->n_div
);
10540 isl_space_free(bset
->dim
);
10542 bset
->extra
-= bset
->n_div
;
10545 bset
= isl_basic_set_finalize(bset
);
10549 isl_basic_set_free(bset
);
10553 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10559 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10564 set
= isl_set_cow(set
);
10568 n_div
= set
->p
[0]->n_div
;
10569 dim
= isl_set_get_space(set
);
10570 dim
= isl_space_lift(dim
, n_div
);
10573 isl_space_free(set
->dim
);
10576 for (i
= 0; i
< set
->n
; ++i
) {
10577 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10588 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10596 dim
= isl_basic_set_total_dim(bset
);
10597 size
+= bset
->n_eq
* (1 + dim
);
10598 size
+= bset
->n_ineq
* (1 + dim
);
10599 size
+= bset
->n_div
* (2 + dim
);
10604 int isl_set_size(__isl_keep isl_set
*set
)
10612 for (i
= 0; i
< set
->n
; ++i
)
10613 size
+= isl_basic_set_size(set
->p
[i
]);
10618 /* Check if there is any lower bound (if lower == 0) and/or upper
10619 * bound (if upper == 0) on the specified dim.
10621 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10622 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10626 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10627 return isl_bool_error
;
10629 pos
+= isl_basic_map_offset(bmap
, type
);
10631 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10632 if (isl_int_is_zero(bmap
->div
[i
][0]))
10634 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10635 return isl_bool_true
;
10638 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10639 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10640 return isl_bool_true
;
10642 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10643 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10650 return lower
&& upper
;
10653 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10654 enum isl_dim_type type
, unsigned pos
)
10656 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10659 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10660 enum isl_dim_type type
, unsigned pos
)
10662 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10665 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10666 enum isl_dim_type type
, unsigned pos
)
10668 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10671 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10672 enum isl_dim_type type
, unsigned pos
)
10677 return isl_bool_error
;
10679 for (i
= 0; i
< map
->n
; ++i
) {
10681 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10682 if (bounded
< 0 || !bounded
)
10686 return isl_bool_true
;
10689 /* Return true if the specified dim is involved in both an upper bound
10690 * and a lower bound.
10692 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10693 enum isl_dim_type type
, unsigned pos
)
10695 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10698 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10700 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10701 enum isl_dim_type type
, unsigned pos
,
10702 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10703 enum isl_dim_type type
, unsigned pos
))
10708 return isl_bool_error
;
10710 for (i
= 0; i
< map
->n
; ++i
) {
10712 bounded
= fn(map
->p
[i
], type
, pos
);
10713 if (bounded
< 0 || bounded
)
10717 return isl_bool_false
;
10720 /* Return 1 if the specified dim is involved in any lower bound.
10722 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10723 enum isl_dim_type type
, unsigned pos
)
10725 return has_any_bound(set
, type
, pos
,
10726 &isl_basic_map_dim_has_lower_bound
);
10729 /* Return 1 if the specified dim is involved in any upper bound.
10731 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10732 enum isl_dim_type type
, unsigned pos
)
10734 return has_any_bound(set
, type
, pos
,
10735 &isl_basic_map_dim_has_upper_bound
);
10738 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10740 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10741 enum isl_dim_type type
, unsigned pos
,
10742 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10743 enum isl_dim_type type
, unsigned pos
))
10748 return isl_bool_error
;
10750 for (i
= 0; i
< map
->n
; ++i
) {
10752 bounded
= fn(map
->p
[i
], type
, pos
);
10753 if (bounded
< 0 || !bounded
)
10757 return isl_bool_true
;
10760 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10762 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10763 enum isl_dim_type type
, unsigned pos
)
10765 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10768 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10770 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10771 enum isl_dim_type type
, unsigned pos
)
10773 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10776 /* For each of the "n" variables starting at "first", determine
10777 * the sign of the variable and put the results in the first "n"
10778 * elements of the array "signs".
10780 * 1 means that the variable is non-negative
10781 * -1 means that the variable is non-positive
10782 * 0 means the variable attains both positive and negative values.
10784 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10785 unsigned first
, unsigned n
, int *signs
)
10787 isl_vec
*bound
= NULL
;
10788 struct isl_tab
*tab
= NULL
;
10789 struct isl_tab_undo
*snap
;
10792 if (!bset
|| !signs
)
10793 return isl_stat_error
;
10795 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10796 tab
= isl_tab_from_basic_set(bset
, 0);
10797 if (!bound
|| !tab
)
10800 isl_seq_clr(bound
->el
, bound
->size
);
10801 isl_int_set_si(bound
->el
[0], -1);
10803 snap
= isl_tab_snap(tab
);
10804 for (i
= 0; i
< n
; ++i
) {
10807 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10808 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10810 empty
= tab
->empty
;
10811 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10812 if (isl_tab_rollback(tab
, snap
) < 0)
10820 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10821 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10823 empty
= tab
->empty
;
10824 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10825 if (isl_tab_rollback(tab
, snap
) < 0)
10828 signs
[i
] = empty
? -1 : 0;
10832 isl_vec_free(bound
);
10833 return isl_stat_ok
;
10836 isl_vec_free(bound
);
10837 return isl_stat_error
;
10840 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10841 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10843 if (!bset
|| !signs
)
10844 return isl_stat_error
;
10845 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10846 return isl_stat_error
);
10848 first
+= pos(bset
->dim
, type
) - 1;
10849 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10852 /* Is it possible for the integer division "div" to depend (possibly
10853 * indirectly) on any output dimensions?
10855 * If the div is undefined, then we conservatively assume that it
10856 * may depend on them.
10857 * Otherwise, we check if it actually depends on them or on any integer
10858 * divisions that may depend on them.
10860 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10863 unsigned n_out
, o_out
;
10864 unsigned n_div
, o_div
;
10866 if (isl_int_is_zero(bmap
->div
[div
][0]))
10867 return isl_bool_true
;
10869 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10870 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10872 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10873 return isl_bool_true
;
10875 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10876 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10878 for (i
= 0; i
< n_div
; ++i
) {
10879 isl_bool may_involve
;
10881 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10883 may_involve
= div_may_involve_output(bmap
, i
);
10884 if (may_involve
< 0 || may_involve
)
10885 return may_involve
;
10888 return isl_bool_false
;
10891 /* Return the first integer division of "bmap" in the range
10892 * [first, first + n[ that may depend on any output dimensions and
10893 * that has a non-zero coefficient in "c" (where the first coefficient
10894 * in "c" corresponds to integer division "first").
10896 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10897 isl_int
*c
, int first
, int n
)
10904 for (k
= first
; k
< first
+ n
; ++k
) {
10905 isl_bool may_involve
;
10907 if (isl_int_is_zero(c
[k
]))
10909 may_involve
= div_may_involve_output(bmap
, k
);
10910 if (may_involve
< 0)
10919 /* Look for a pair of inequality constraints in "bmap" of the form
10921 * -l + i >= 0 or i >= l
10923 * n + l - i >= 0 or i <= l + n
10925 * with n < "m" and i the output dimension at position "pos".
10926 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10927 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10928 * and earlier output dimensions, as well as integer divisions that do
10929 * not involve any of the output dimensions.
10931 * Return the index of the first inequality constraint or bmap->n_ineq
10932 * if no such pair can be found.
10934 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10935 int pos
, isl_int m
)
10940 unsigned n_div
, o_div
;
10941 unsigned n_out
, o_out
;
10947 ctx
= isl_basic_map_get_ctx(bmap
);
10948 total
= isl_basic_map_total_dim(bmap
);
10949 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10950 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10951 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10952 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10953 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10954 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10956 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10957 n_out
- (pos
+ 1)) != -1)
10959 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10962 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10963 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10966 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10967 bmap
->ineq
[j
] + 1, total
))
10971 if (j
>= bmap
->n_ineq
)
10973 isl_int_add(bmap
->ineq
[i
][0],
10974 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10975 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10976 isl_int_sub(bmap
->ineq
[i
][0],
10977 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10980 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10986 return bmap
->n_ineq
;
10989 /* Return the index of the equality of "bmap" that defines
10990 * the output dimension "pos" in terms of earlier dimensions.
10991 * The equality may also involve integer divisions, as long
10992 * as those integer divisions are defined in terms of
10993 * parameters or input dimensions.
10994 * In this case, *div is set to the number of integer divisions and
10995 * *ineq is set to the number of inequality constraints (provided
10996 * div and ineq are not NULL).
10998 * The equality may also involve a single integer division involving
10999 * the output dimensions (typically only output dimension "pos") as
11000 * long as the coefficient of output dimension "pos" is 1 or -1 and
11001 * there is a pair of constraints i >= l and i <= l + n, with i referring
11002 * to output dimension "pos", l an expression involving only earlier
11003 * dimensions and n smaller than the coefficient of the integer division
11004 * in the equality. In this case, the output dimension can be defined
11005 * in terms of a modulo expression that does not involve the integer division.
11006 * *div is then set to this single integer division and
11007 * *ineq is set to the index of constraint i >= l.
11009 * Return bmap->n_eq if there is no such equality.
11010 * Return -1 on error.
11012 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
11013 int pos
, int *div
, int *ineq
)
11016 unsigned n_out
, o_out
;
11017 unsigned n_div
, o_div
;
11022 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11023 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11024 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11025 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11028 *ineq
= bmap
->n_ineq
;
11031 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
11032 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
11034 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
11035 n_out
- (pos
+ 1)) != -1)
11037 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11041 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
11042 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
11044 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11045 k
+ 1, n_div
- (k
+1)) < n_div
)
11047 l
= find_modulo_constraint_pair(bmap
, pos
,
11048 bmap
->eq
[j
][o_div
+ k
]);
11051 if (l
>= bmap
->n_ineq
)
11063 /* Check if the given basic map is obviously single-valued.
11064 * In particular, for each output dimension, check that there is
11065 * an equality that defines the output dimension in terms of
11066 * earlier dimensions.
11068 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11074 return isl_bool_error
;
11076 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11078 for (i
= 0; i
< n_out
; ++i
) {
11081 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11084 return isl_bool_error
;
11085 if (eq
>= bmap
->n_eq
)
11086 return isl_bool_false
;
11089 return isl_bool_true
;
11092 /* Check if the given basic map is single-valued.
11093 * We simply compute
11097 * and check if the result is a subset of the identity mapping.
11099 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11102 isl_basic_map
*test
;
11106 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11110 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11111 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11113 space
= isl_basic_map_get_space(bmap
);
11114 space
= isl_space_map_from_set(isl_space_range(space
));
11115 id
= isl_basic_map_identity(space
);
11117 sv
= isl_basic_map_is_subset(test
, id
);
11119 isl_basic_map_free(test
);
11120 isl_basic_map_free(id
);
11125 /* Check if the given map is obviously single-valued.
11127 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11130 return isl_bool_error
;
11132 return isl_bool_true
;
11134 return isl_bool_false
;
11136 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11139 /* Check if the given map is single-valued.
11140 * We simply compute
11144 * and check if the result is a subset of the identity mapping.
11146 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11153 sv
= isl_map_plain_is_single_valued(map
);
11157 test
= isl_map_reverse(isl_map_copy(map
));
11158 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11160 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11161 id
= isl_map_identity(dim
);
11163 sv
= isl_map_is_subset(test
, id
);
11165 isl_map_free(test
);
11171 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11175 map
= isl_map_copy(map
);
11176 map
= isl_map_reverse(map
);
11177 in
= isl_map_is_single_valued(map
);
11183 /* Check if the given map is obviously injective.
11185 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11189 map
= isl_map_copy(map
);
11190 map
= isl_map_reverse(map
);
11191 in
= isl_map_plain_is_single_valued(map
);
11197 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11201 sv
= isl_map_is_single_valued(map
);
11205 return isl_map_is_injective(map
);
11208 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11210 return isl_map_is_single_valued(set_to_map(set
));
11213 /* Does "map" only map elements to themselves?
11215 * If the domain and range spaces are different, then "map"
11216 * is considered not to be an identity relation, even if it is empty.
11217 * Otherwise, construct the maximal identity relation and
11218 * check whether "map" is a subset of this relation.
11220 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11224 isl_bool equal
, is_identity
;
11226 space
= isl_map_get_space(map
);
11227 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11228 isl_space_free(space
);
11229 if (equal
< 0 || !equal
)
11232 id
= isl_map_identity(isl_map_get_space(map
));
11233 is_identity
= isl_map_is_subset(map
, id
);
11236 return is_identity
;
11239 int isl_map_is_translation(__isl_keep isl_map
*map
)
11244 delta
= isl_map_deltas(isl_map_copy(map
));
11245 ok
= isl_set_is_singleton(delta
);
11246 isl_set_free(delta
);
11251 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11253 if (isl_seq_first_non_zero(p
, pos
) != -1)
11255 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11260 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11267 return isl_bool_error
;
11269 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11270 return isl_bool_false
;
11272 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11273 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11274 for (j
= 0; j
< nvar
; ++j
) {
11275 int lower
= 0, upper
= 0;
11276 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11277 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11279 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11280 return isl_bool_false
;
11283 if (i
< bset
->n_eq
)
11285 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11286 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11288 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11289 return isl_bool_false
;
11290 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11295 if (!lower
|| !upper
)
11296 return isl_bool_false
;
11299 return isl_bool_true
;
11302 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11305 return isl_bool_error
;
11307 return isl_bool_false
;
11309 return isl_basic_set_is_box(set
->p
[0]);
11312 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11315 return isl_bool_error
;
11317 return isl_space_is_wrapping(bset
->dim
);
11320 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11323 return isl_bool_error
;
11325 return isl_space_is_wrapping(set
->dim
);
11328 /* Modify the space of "map" through a call to "change".
11329 * If "can_change" is set (not NULL), then first call it to check
11330 * if the modification is allowed, printing the error message "cannot_change"
11333 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11334 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11335 const char *cannot_change
,
11336 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11344 ok
= can_change
? can_change(map
) : isl_bool_true
;
11346 return isl_map_free(map
);
11348 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11349 return isl_map_free(map
));
11351 space
= change(isl_map_get_space(map
));
11352 map
= isl_map_reset_space(map
, space
);
11357 /* Is the domain of "map" a wrapped relation?
11359 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11362 return isl_bool_error
;
11364 return isl_space_domain_is_wrapping(map
->dim
);
11367 /* Does "map" have a wrapped relation in both domain and range?
11369 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11371 return isl_space_is_product(isl_map_peek_space(map
));
11374 /* Is the range of "map" a wrapped relation?
11376 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11379 return isl_bool_error
;
11381 return isl_space_range_is_wrapping(map
->dim
);
11384 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11386 bmap
= isl_basic_map_cow(bmap
);
11390 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11394 bmap
= isl_basic_map_finalize(bmap
);
11396 return bset_from_bmap(bmap
);
11398 isl_basic_map_free(bmap
);
11402 /* Given a map A -> B, return the set (A -> B).
11404 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11406 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11409 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11411 bset
= isl_basic_set_cow(bset
);
11415 bset
->dim
= isl_space_unwrap(bset
->dim
);
11419 bset
= isl_basic_set_finalize(bset
);
11421 return bset_to_bmap(bset
);
11423 isl_basic_set_free(bset
);
11427 /* Given a set (A -> B), return the map A -> B.
11428 * Error out if "set" is not of the form (A -> B).
11430 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11432 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11433 "not a wrapping set", &isl_space_unwrap
);
11436 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11437 enum isl_dim_type type
)
11442 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11445 bmap
= isl_basic_map_cow(bmap
);
11449 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11453 bmap
= isl_basic_map_finalize(bmap
);
11457 isl_basic_map_free(bmap
);
11461 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11462 enum isl_dim_type type
)
11469 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11472 map
= isl_map_cow(map
);
11476 for (i
= 0; i
< map
->n
; ++i
) {
11477 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11481 map
->dim
= isl_space_reset(map
->dim
, type
);
11491 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11496 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11499 bmap
= isl_basic_map_cow(bmap
);
11503 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11507 bmap
= isl_basic_map_finalize(bmap
);
11511 isl_basic_map_free(bmap
);
11515 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11517 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11520 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11521 __isl_take isl_basic_map
*bmap
)
11526 if (!bmap
->dim
->nested
[0])
11529 bmap
= isl_basic_map_cow(bmap
);
11533 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11537 bmap
= isl_basic_map_finalize(bmap
);
11541 isl_basic_map_free(bmap
);
11545 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11546 __isl_take isl_basic_map
*bmap
)
11551 if (!bmap
->dim
->nested
[1])
11554 bmap
= isl_basic_map_cow(bmap
);
11558 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11562 bmap
= isl_basic_map_finalize(bmap
);
11566 isl_basic_map_free(bmap
);
11570 /* Remove any internal structure from the spaces of domain and range of "map".
11572 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11577 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11580 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11583 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11585 return set_from_map(isl_map_flatten(set_to_map(set
)));
11588 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11590 isl_space
*dim
, *flat_dim
;
11593 dim
= isl_set_get_space(set
);
11594 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11595 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11596 map
= isl_map_intersect_domain(map
, set
);
11601 /* Remove any internal structure from the space of the domain of "map".
11603 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11608 if (!map
->dim
->nested
[0])
11611 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11614 /* Remove any internal structure from the space of the range of "map".
11616 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11621 if (!map
->dim
->nested
[1])
11624 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11627 /* Reorder the dimensions of "bmap" according to the given dim_map
11628 * and set the dimension specification to "dim" and
11629 * perform Gaussian elimination on the result.
11631 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11632 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11634 isl_basic_map
*res
;
11637 bmap
= isl_basic_map_cow(bmap
);
11638 if (!bmap
|| !dim
|| !dim_map
)
11641 flags
= bmap
->flags
;
11642 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11643 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11644 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11645 res
= isl_basic_map_alloc_space(dim
,
11646 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11647 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11649 res
->flags
= flags
;
11650 res
= isl_basic_map_gauss(res
, NULL
);
11651 res
= isl_basic_map_finalize(res
);
11655 isl_basic_map_free(bmap
);
11656 isl_space_free(dim
);
11660 /* Reorder the dimensions of "map" according to given reordering.
11662 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11663 __isl_take isl_reordering
*r
)
11666 struct isl_dim_map
*dim_map
;
11668 map
= isl_map_cow(map
);
11669 dim_map
= isl_dim_map_from_reordering(r
);
11670 if (!map
|| !r
|| !dim_map
)
11673 for (i
= 0; i
< map
->n
; ++i
) {
11674 struct isl_dim_map
*dim_map_i
;
11676 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11678 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11679 isl_space_copy(r
->dim
), dim_map_i
);
11685 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11687 isl_reordering_free(r
);
11693 isl_reordering_free(r
);
11697 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11698 __isl_take isl_reordering
*r
)
11700 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11703 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11704 __isl_take isl_space
*model
)
11709 if (!map
|| !model
)
11712 ctx
= isl_space_get_ctx(model
);
11713 if (!isl_space_has_named_params(model
))
11714 isl_die(ctx
, isl_error_invalid
,
11715 "model has unnamed parameters", goto error
);
11716 if (isl_map_check_named_params(map
) < 0)
11718 aligned
= isl_map_space_has_equal_params(map
, model
);
11722 isl_reordering
*exp
;
11724 model
= isl_space_drop_dims(model
, isl_dim_in
,
11725 0, isl_space_dim(model
, isl_dim_in
));
11726 model
= isl_space_drop_dims(model
, isl_dim_out
,
11727 0, isl_space_dim(model
, isl_dim_out
));
11728 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11729 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11730 map
= isl_map_realign(map
, exp
);
11733 isl_space_free(model
);
11736 isl_space_free(model
);
11741 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11742 __isl_take isl_space
*model
)
11744 return isl_map_align_params(set
, model
);
11747 /* Align the parameters of "bmap" to those of "model", introducing
11748 * additional parameters if needed.
11750 __isl_give isl_basic_map
*isl_basic_map_align_params(
11751 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11754 isl_bool equal_params
;
11756 if (!bmap
|| !model
)
11759 ctx
= isl_space_get_ctx(model
);
11760 if (!isl_space_has_named_params(model
))
11761 isl_die(ctx
, isl_error_invalid
,
11762 "model has unnamed parameters", goto error
);
11763 if (!isl_space_has_named_params(bmap
->dim
))
11764 isl_die(ctx
, isl_error_invalid
,
11765 "relation has unnamed parameters", goto error
);
11766 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11767 if (equal_params
< 0)
11769 if (!equal_params
) {
11770 isl_reordering
*exp
;
11771 struct isl_dim_map
*dim_map
;
11773 model
= isl_space_drop_dims(model
, isl_dim_in
,
11774 0, isl_space_dim(model
, isl_dim_in
));
11775 model
= isl_space_drop_dims(model
, isl_dim_out
,
11776 0, isl_space_dim(model
, isl_dim_out
));
11777 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11778 exp
= isl_reordering_extend_space(exp
,
11779 isl_basic_map_get_space(bmap
));
11780 dim_map
= isl_dim_map_from_reordering(exp
);
11781 bmap
= isl_basic_map_realign(bmap
,
11782 exp
? isl_space_copy(exp
->dim
) : NULL
,
11783 isl_dim_map_extend(dim_map
, bmap
));
11784 isl_reordering_free(exp
);
11788 isl_space_free(model
);
11791 isl_space_free(model
);
11792 isl_basic_map_free(bmap
);
11796 /* Do "bset" and "space" have the same parameters?
11798 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11799 __isl_keep isl_space
*space
)
11801 isl_space
*bset_space
;
11803 bset_space
= isl_basic_set_peek_space(bset
);
11804 return isl_space_has_equal_params(bset_space
, space
);
11807 /* Do "map" and "space" have the same parameters?
11809 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11810 __isl_keep isl_space
*space
)
11812 isl_space
*map_space
;
11814 map_space
= isl_map_peek_space(map
);
11815 return isl_space_has_equal_params(map_space
, space
);
11818 /* Do "set" and "space" have the same parameters?
11820 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11821 __isl_keep isl_space
*space
)
11823 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11826 /* Align the parameters of "bset" to those of "model", introducing
11827 * additional parameters if needed.
11829 __isl_give isl_basic_set
*isl_basic_set_align_params(
11830 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11832 return isl_basic_map_align_params(bset
, model
);
11835 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11836 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11837 enum isl_dim_type c2
, enum isl_dim_type c3
,
11838 enum isl_dim_type c4
, enum isl_dim_type c5
)
11840 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11841 struct isl_mat
*mat
;
11847 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11848 isl_basic_map_total_dim(bmap
) + 1);
11851 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11852 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11853 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11854 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11855 isl_int_set(mat
->row
[i
][pos
],
11856 bmap
->eq
[i
][off
+ k
]);
11864 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11865 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11866 enum isl_dim_type c2
, enum isl_dim_type c3
,
11867 enum isl_dim_type c4
, enum isl_dim_type c5
)
11869 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11870 struct isl_mat
*mat
;
11876 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11877 isl_basic_map_total_dim(bmap
) + 1);
11880 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11881 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11882 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11883 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11884 isl_int_set(mat
->row
[i
][pos
],
11885 bmap
->ineq
[i
][off
+ k
]);
11893 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11894 __isl_take isl_space
*dim
,
11895 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11896 enum isl_dim_type c2
, enum isl_dim_type c3
,
11897 enum isl_dim_type c4
, enum isl_dim_type c5
)
11899 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11900 isl_basic_map
*bmap
;
11906 if (!dim
|| !eq
|| !ineq
)
11909 if (eq
->n_col
!= ineq
->n_col
)
11910 isl_die(dim
->ctx
, isl_error_invalid
,
11911 "equalities and inequalities matrices should have "
11912 "same number of columns", goto error
);
11914 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11916 if (eq
->n_col
< total
)
11917 isl_die(dim
->ctx
, isl_error_invalid
,
11918 "number of columns too small", goto error
);
11920 extra
= eq
->n_col
- total
;
11922 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11923 eq
->n_row
, ineq
->n_row
);
11926 for (i
= 0; i
< extra
; ++i
) {
11927 k
= isl_basic_map_alloc_div(bmap
);
11930 isl_int_set_si(bmap
->div
[k
][0], 0);
11932 for (i
= 0; i
< eq
->n_row
; ++i
) {
11933 l
= isl_basic_map_alloc_equality(bmap
);
11936 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11937 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11938 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11939 isl_int_set(bmap
->eq
[l
][off
+ k
],
11945 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11946 l
= isl_basic_map_alloc_inequality(bmap
);
11949 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11950 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11951 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11952 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11953 ineq
->row
[i
][pos
]);
11959 isl_space_free(dim
);
11961 isl_mat_free(ineq
);
11963 bmap
= isl_basic_map_simplify(bmap
);
11964 return isl_basic_map_finalize(bmap
);
11966 isl_space_free(dim
);
11968 isl_mat_free(ineq
);
11972 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11973 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11974 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11976 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11977 c1
, c2
, c3
, c4
, isl_dim_in
);
11980 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11981 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11982 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11984 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11985 c1
, c2
, c3
, c4
, isl_dim_in
);
11988 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11989 __isl_take isl_space
*dim
,
11990 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11991 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11993 isl_basic_map
*bmap
;
11994 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11995 c1
, c2
, c3
, c4
, isl_dim_in
);
11996 return bset_from_bmap(bmap
);
11999 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
12002 return isl_bool_error
;
12004 return isl_space_can_zip(bmap
->dim
);
12007 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
12010 return isl_bool_error
;
12012 return isl_space_can_zip(map
->dim
);
12015 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
12016 * (A -> C) -> (B -> D).
12018 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
12027 if (!isl_basic_map_can_zip(bmap
))
12028 isl_die(bmap
->ctx
, isl_error_invalid
,
12029 "basic map cannot be zipped", goto error
);
12030 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
12031 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
12032 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
12033 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
12034 bmap
= isl_basic_map_cow(bmap
);
12035 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
12038 bmap
->dim
= isl_space_zip(bmap
->dim
);
12041 bmap
= isl_basic_map_mark_final(bmap
);
12044 isl_basic_map_free(bmap
);
12048 /* Given a map (A -> B) -> (C -> D), return the corresponding map
12049 * (A -> C) -> (B -> D).
12051 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
12058 if (!isl_map_can_zip(map
))
12059 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12062 map
= isl_map_cow(map
);
12066 for (i
= 0; i
< map
->n
; ++i
) {
12067 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12072 map
->dim
= isl_space_zip(map
->dim
);
12082 /* Can we apply isl_basic_map_curry to "bmap"?
12083 * That is, does it have a nested relation in its domain?
12085 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12088 return isl_bool_error
;
12090 return isl_space_can_curry(bmap
->dim
);
12093 /* Can we apply isl_map_curry to "map"?
12094 * That is, does it have a nested relation in its domain?
12096 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12099 return isl_bool_error
;
12101 return isl_space_can_curry(map
->dim
);
12104 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12107 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12113 if (!isl_basic_map_can_curry(bmap
))
12114 isl_die(bmap
->ctx
, isl_error_invalid
,
12115 "basic map cannot be curried", goto error
);
12116 bmap
= isl_basic_map_cow(bmap
);
12119 bmap
->dim
= isl_space_curry(bmap
->dim
);
12122 bmap
= isl_basic_map_mark_final(bmap
);
12125 isl_basic_map_free(bmap
);
12129 /* Given a map (A -> B) -> C, return the corresponding map
12132 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12134 return isl_map_change_space(map
, &isl_map_can_curry
,
12135 "map cannot be curried", &isl_space_curry
);
12138 /* Can isl_map_range_curry be applied to "map"?
12139 * That is, does it have a nested relation in its range,
12140 * the domain of which is itself a nested relation?
12142 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12145 return isl_bool_error
;
12147 return isl_space_can_range_curry(map
->dim
);
12150 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12151 * A -> (B -> (C -> D)).
12153 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12155 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12156 "map range cannot be curried",
12157 &isl_space_range_curry
);
12160 /* Can we apply isl_basic_map_uncurry to "bmap"?
12161 * That is, does it have a nested relation in its domain?
12163 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12166 return isl_bool_error
;
12168 return isl_space_can_uncurry(bmap
->dim
);
12171 /* Can we apply isl_map_uncurry to "map"?
12172 * That is, does it have a nested relation in its domain?
12174 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12177 return isl_bool_error
;
12179 return isl_space_can_uncurry(map
->dim
);
12182 /* Given a basic map A -> (B -> C), return the corresponding basic map
12185 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12191 if (!isl_basic_map_can_uncurry(bmap
))
12192 isl_die(bmap
->ctx
, isl_error_invalid
,
12193 "basic map cannot be uncurried",
12194 return isl_basic_map_free(bmap
));
12195 bmap
= isl_basic_map_cow(bmap
);
12198 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12200 return isl_basic_map_free(bmap
);
12201 bmap
= isl_basic_map_mark_final(bmap
);
12205 /* Given a map A -> (B -> C), return the corresponding map
12208 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12210 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12211 "map cannot be uncurried", &isl_space_uncurry
);
12214 /* Construct a basic map mapping the domain of the affine expression
12215 * to a one-dimensional range prescribed by the affine expression.
12216 * If "rational" is set, then construct a rational basic map.
12218 * A NaN affine expression cannot be converted to a basic map.
12220 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
12221 __isl_take isl_aff
*aff
, int rational
)
12226 isl_local_space
*ls
;
12227 isl_basic_map
*bmap
= NULL
;
12231 is_nan
= isl_aff_is_nan(aff
);
12235 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
12236 "cannot convert NaN", goto error
);
12238 ls
= isl_aff_get_local_space(aff
);
12239 bmap
= isl_basic_map_from_local_space(ls
);
12240 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
12241 k
= isl_basic_map_alloc_equality(bmap
);
12245 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
12246 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
12247 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
12248 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
12249 aff
->v
->size
- (pos
+ 1));
12253 bmap
= isl_basic_map_set_rational(bmap
);
12254 bmap
= isl_basic_map_gauss(bmap
, NULL
);
12255 bmap
= isl_basic_map_finalize(bmap
);
12259 isl_basic_map_free(bmap
);
12263 /* Construct a basic map mapping the domain of the affine expression
12264 * to a one-dimensional range prescribed by the affine expression.
12266 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
12268 return isl_basic_map_from_aff2(aff
, 0);
12271 /* Construct a map mapping the domain of the affine expression
12272 * to a one-dimensional range prescribed by the affine expression.
12274 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
12276 isl_basic_map
*bmap
;
12278 bmap
= isl_basic_map_from_aff(aff
);
12279 return isl_map_from_basic_map(bmap
);
12282 /* Construct a basic map mapping the domain the multi-affine expression
12283 * to its range, with each dimension in the range equated to the
12284 * corresponding affine expression.
12285 * If "rational" is set, then construct a rational basic map.
12287 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12288 __isl_take isl_multi_aff
*maff
, int rational
)
12292 isl_basic_map
*bmap
;
12297 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12298 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12299 "invalid space", goto error
);
12301 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12302 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12304 bmap
= isl_basic_map_set_rational(bmap
);
12306 for (i
= 0; i
< maff
->n
; ++i
) {
12308 isl_basic_map
*bmap_i
;
12310 aff
= isl_aff_copy(maff
->u
.p
[i
]);
12311 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12313 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12316 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12318 isl_multi_aff_free(maff
);
12321 isl_multi_aff_free(maff
);
12325 /* Construct a basic map mapping the domain the multi-affine expression
12326 * to its range, with each dimension in the range equated to the
12327 * corresponding affine expression.
12329 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12330 __isl_take isl_multi_aff
*ma
)
12332 return isl_basic_map_from_multi_aff2(ma
, 0);
12335 /* Construct a map mapping the domain the multi-affine expression
12336 * to its range, with each dimension in the range equated to the
12337 * corresponding affine expression.
12339 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12341 isl_basic_map
*bmap
;
12343 bmap
= isl_basic_map_from_multi_aff(maff
);
12344 return isl_map_from_basic_map(bmap
);
12347 /* Construct a basic map mapping a domain in the given space to
12348 * to an n-dimensional range, with n the number of elements in the list,
12349 * where each coordinate in the range is prescribed by the
12350 * corresponding affine expression.
12351 * The domains of all affine expressions in the list are assumed to match
12354 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12355 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12359 isl_basic_map
*bmap
;
12364 dim
= isl_space_from_domain(domain_dim
);
12365 bmap
= isl_basic_map_universe(dim
);
12367 for (i
= 0; i
< list
->n
; ++i
) {
12369 isl_basic_map
*bmap_i
;
12371 aff
= isl_aff_copy(list
->p
[i
]);
12372 bmap_i
= isl_basic_map_from_aff(aff
);
12374 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12377 isl_aff_list_free(list
);
12381 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12382 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12384 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12387 /* Construct a basic map where the given dimensions are equal to each other.
12389 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12390 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12392 isl_basic_map
*bmap
= NULL
;
12398 if (pos1
>= isl_space_dim(space
, type1
))
12399 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12400 "index out of bounds", goto error
);
12401 if (pos2
>= isl_space_dim(space
, type2
))
12402 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12403 "index out of bounds", goto error
);
12405 if (type1
== type2
&& pos1
== pos2
)
12406 return isl_basic_map_universe(space
);
12408 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12409 i
= isl_basic_map_alloc_equality(bmap
);
12412 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12413 pos1
+= isl_basic_map_offset(bmap
, type1
);
12414 pos2
+= isl_basic_map_offset(bmap
, type2
);
12415 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12416 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12417 bmap
= isl_basic_map_finalize(bmap
);
12418 isl_space_free(space
);
12421 isl_space_free(space
);
12422 isl_basic_map_free(bmap
);
12426 /* Add a constraint imposing that the given two dimensions are equal.
12428 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12429 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12433 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12435 bmap
= isl_basic_map_intersect(bmap
, eq
);
12440 /* Add a constraint imposing that the given two dimensions are equal.
12442 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12443 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12445 isl_basic_map
*bmap
;
12447 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12449 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12454 /* Add a constraint imposing that the given two dimensions have opposite values.
12456 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12457 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12459 isl_basic_map
*bmap
= NULL
;
12465 if (pos1
>= isl_map_dim(map
, type1
))
12466 isl_die(map
->ctx
, isl_error_invalid
,
12467 "index out of bounds", goto error
);
12468 if (pos2
>= isl_map_dim(map
, type2
))
12469 isl_die(map
->ctx
, isl_error_invalid
,
12470 "index out of bounds", goto error
);
12472 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12473 i
= isl_basic_map_alloc_equality(bmap
);
12476 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12477 pos1
+= isl_basic_map_offset(bmap
, type1
);
12478 pos2
+= isl_basic_map_offset(bmap
, type2
);
12479 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12480 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12481 bmap
= isl_basic_map_finalize(bmap
);
12483 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12487 isl_basic_map_free(bmap
);
12492 /* Construct a constraint imposing that the value of the first dimension is
12493 * greater than or equal to that of the second.
12495 static __isl_give isl_constraint
*constraint_order_ge(
12496 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12497 enum isl_dim_type type2
, int pos2
)
12504 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12506 if (pos1
>= isl_constraint_dim(c
, type1
))
12507 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12508 "index out of bounds", return isl_constraint_free(c
));
12509 if (pos2
>= isl_constraint_dim(c
, type2
))
12510 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12511 "index out of bounds", return isl_constraint_free(c
));
12513 if (type1
== type2
&& pos1
== pos2
)
12516 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12517 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12522 /* Add a constraint imposing that the value of the first dimension is
12523 * greater than or equal to that of the second.
12525 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12526 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12531 if (type1
== type2
&& pos1
== pos2
)
12533 space
= isl_basic_map_get_space(bmap
);
12534 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12535 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12540 /* Add a constraint imposing that the value of the first dimension is
12541 * greater than or equal to that of the second.
12543 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12544 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12549 if (type1
== type2
&& pos1
== pos2
)
12551 space
= isl_map_get_space(map
);
12552 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12553 map
= isl_map_add_constraint(map
, c
);
12558 /* Add a constraint imposing that the value of the first dimension is
12559 * less than or equal to that of the second.
12561 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12562 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12564 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12567 /* Construct a basic map where the value of the first dimension is
12568 * greater than that of the second.
12570 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12571 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12573 isl_basic_map
*bmap
= NULL
;
12579 if (pos1
>= isl_space_dim(space
, type1
))
12580 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12581 "index out of bounds", goto error
);
12582 if (pos2
>= isl_space_dim(space
, type2
))
12583 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12584 "index out of bounds", goto error
);
12586 if (type1
== type2
&& pos1
== pos2
)
12587 return isl_basic_map_empty(space
);
12589 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12590 i
= isl_basic_map_alloc_inequality(bmap
);
12592 return isl_basic_map_free(bmap
);
12593 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12594 pos1
+= isl_basic_map_offset(bmap
, type1
);
12595 pos2
+= isl_basic_map_offset(bmap
, type2
);
12596 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12597 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12598 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12599 bmap
= isl_basic_map_finalize(bmap
);
12603 isl_space_free(space
);
12604 isl_basic_map_free(bmap
);
12608 /* Add a constraint imposing that the value of the first dimension is
12609 * greater than that of the second.
12611 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12612 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12616 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12618 bmap
= isl_basic_map_intersect(bmap
, gt
);
12623 /* Add a constraint imposing that the value of the first dimension is
12624 * greater than that of the second.
12626 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12627 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12629 isl_basic_map
*bmap
;
12631 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12633 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12638 /* Add a constraint imposing that the value of the first dimension is
12639 * smaller than that of the second.
12641 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12642 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12644 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12647 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12651 isl_local_space
*ls
;
12656 if (!isl_basic_map_divs_known(bmap
))
12657 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12658 "some divs are unknown", return NULL
);
12660 ls
= isl_basic_map_get_local_space(bmap
);
12661 div
= isl_local_space_get_div(ls
, pos
);
12662 isl_local_space_free(ls
);
12667 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12670 return isl_basic_map_get_div(bset
, pos
);
12673 /* Plug in "subs" for dimension "type", "pos" of "bset".
12675 * Let i be the dimension to replace and let "subs" be of the form
12679 * Any integer division with a non-zero coefficient for i,
12681 * floor((a i + g)/m)
12685 * floor((a f + d g)/(m d))
12687 * Constraints of the form
12695 * We currently require that "subs" is an integral expression.
12696 * Handling rational expressions may require us to add stride constraints
12697 * as we do in isl_basic_set_preimage_multi_aff.
12699 __isl_give isl_basic_set
*isl_basic_set_substitute(
12700 __isl_take isl_basic_set
*bset
,
12701 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12707 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12710 bset
= isl_basic_set_cow(bset
);
12711 if (!bset
|| !subs
)
12714 ctx
= isl_basic_set_get_ctx(bset
);
12715 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12716 isl_die(ctx
, isl_error_invalid
,
12717 "spaces don't match", goto error
);
12718 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12719 isl_die(ctx
, isl_error_unsupported
,
12720 "cannot handle divs yet", goto error
);
12721 if (!isl_int_is_one(subs
->v
->el
[0]))
12722 isl_die(ctx
, isl_error_invalid
,
12723 "can only substitute integer expressions", goto error
);
12725 pos
+= isl_basic_set_offset(bset
, type
);
12729 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12730 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12732 isl_int_set(v
, bset
->eq
[i
][pos
]);
12733 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12734 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12735 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12738 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12739 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12741 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12742 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12743 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12744 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12747 for (i
= 0; i
< bset
->n_div
; ++i
) {
12748 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12750 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12751 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12752 isl_seq_combine(bset
->div
[i
] + 1,
12753 subs
->v
->el
[0], bset
->div
[i
] + 1,
12754 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12755 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12760 bset
= isl_basic_set_simplify(bset
);
12761 return isl_basic_set_finalize(bset
);
12763 isl_basic_set_free(bset
);
12767 /* Plug in "subs" for dimension "type", "pos" of "set".
12769 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12770 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12774 if (set
&& isl_set_plain_is_empty(set
))
12777 set
= isl_set_cow(set
);
12781 for (i
= set
->n
- 1; i
>= 0; --i
) {
12782 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12783 if (remove_if_empty(set
, i
) < 0)
12793 /* Check if the range of "ma" is compatible with the domain or range
12794 * (depending on "type") of "bmap".
12796 static isl_stat
check_basic_map_compatible_range_multi_aff(
12797 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12798 __isl_keep isl_multi_aff
*ma
)
12801 isl_space
*ma_space
;
12803 ma_space
= isl_multi_aff_get_space(ma
);
12805 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12809 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12810 "parameters don't match", goto error
);
12811 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12815 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12816 "spaces don't match", goto error
);
12818 isl_space_free(ma_space
);
12819 return isl_stat_ok
;
12821 isl_space_free(ma_space
);
12822 return isl_stat_error
;
12825 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12826 * coefficients before the transformed range of dimensions,
12827 * the "n_after" coefficients after the transformed range of dimensions
12828 * and the coefficients of the other divs in "bmap".
12830 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12831 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12836 isl_local_space
*ls
;
12841 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
12845 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12846 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12847 for (i
= 0; i
< n_div
; ++i
) {
12848 int o_bmap
= 0, o_ls
= 0;
12850 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12851 o_bmap
+= 1 + 1 + n_param
;
12852 o_ls
+= 1 + 1 + n_param
;
12853 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12854 o_bmap
+= n_before
;
12855 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12856 ls
->div
->row
[i
] + o_ls
, n_set
);
12859 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12861 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12862 ls
->div
->row
[i
] + o_ls
, n_div
);
12865 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12866 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12870 isl_local_space_free(ls
);
12873 isl_local_space_free(ls
);
12877 /* How many stride constraints does "ma" enforce?
12878 * That is, how many of the affine expressions have a denominator
12879 * different from one?
12881 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12886 for (i
= 0; i
< ma
->n
; ++i
)
12887 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12893 /* For each affine expression in ma of the form
12895 * x_i = (f_i y + h_i)/m_i
12897 * with m_i different from one, add a constraint to "bmap"
12900 * f_i y + h_i = m_i alpha_i
12902 * with alpha_i an additional existentially quantified variable.
12904 * The input variables of "ma" correspond to a subset of the variables
12905 * of "bmap". There are "n_before" variables in "bmap" before this
12906 * subset and "n_after" variables after this subset.
12907 * The integer divisions of the affine expressions in "ma" are assumed
12908 * to have been aligned. There are "n_div_ma" of them and
12909 * they appear first in "bmap", straight after the "n_after" variables.
12911 static __isl_give isl_basic_map
*add_ma_strides(
12912 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12913 int n_before
, int n_after
, int n_div_ma
)
12921 total
= isl_basic_map_total_dim(bmap
);
12922 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12923 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12924 for (i
= 0; i
< ma
->n
; ++i
) {
12925 int o_bmap
= 0, o_ma
= 1;
12927 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12929 div
= isl_basic_map_alloc_div(bmap
);
12930 k
= isl_basic_map_alloc_equality(bmap
);
12931 if (div
< 0 || k
< 0)
12933 isl_int_set_si(bmap
->div
[div
][0], 0);
12934 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12935 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12936 o_bmap
+= 1 + n_param
;
12937 o_ma
+= 1 + n_param
;
12938 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12939 o_bmap
+= n_before
;
12940 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12941 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
12944 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12946 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12947 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12948 o_bmap
+= n_div_ma
;
12950 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12951 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
12957 isl_basic_map_free(bmap
);
12961 /* Replace the domain or range space (depending on "type) of "space" by "set".
12963 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12964 enum isl_dim_type type
, __isl_take isl_space
*set
)
12966 if (type
== isl_dim_in
) {
12967 space
= isl_space_range(space
);
12968 space
= isl_space_map_from_domain_and_range(set
, space
);
12970 space
= isl_space_domain(space
);
12971 space
= isl_space_map_from_domain_and_range(space
, set
);
12977 /* Compute the preimage of the domain or range (depending on "type")
12978 * of "bmap" under the function represented by "ma".
12979 * In other words, plug in "ma" in the domain or range of "bmap".
12980 * The result is a basic map that lives in the same space as "bmap"
12981 * except that the domain or range has been replaced by
12982 * the domain space of "ma".
12984 * If bmap is represented by
12986 * A(p) + S u + B x + T v + C(divs) >= 0,
12988 * where u and x are input and output dimensions if type == isl_dim_out
12989 * while x and v are input and output dimensions if type == isl_dim_in,
12990 * and ma is represented by
12992 * x = D(p) + F(y) + G(divs')
12994 * then the result is
12996 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12998 * The divs in the input set are similarly adjusted.
13001 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
13005 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
13006 * B_i G(divs') + c_i(divs))/n_i)
13008 * If bmap is not a rational map and if F(y) involves any denominators
13010 * x_i = (f_i y + h_i)/m_i
13012 * then additional constraints are added to ensure that we only
13013 * map back integer points. That is we enforce
13015 * f_i y + h_i = m_i alpha_i
13017 * with alpha_i an additional existentially quantified variable.
13019 * We first copy over the divs from "ma".
13020 * Then we add the modified constraints and divs from "bmap".
13021 * Finally, we add the stride constraints, if needed.
13023 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
13024 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
13025 __isl_take isl_multi_aff
*ma
)
13029 isl_basic_map
*res
= NULL
;
13030 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
13031 isl_int f
, c1
, c2
, g
;
13040 ma
= isl_multi_aff_align_divs(ma
);
13043 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
13046 if (type
== isl_dim_in
) {
13048 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
13050 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
13053 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
13054 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
13056 space
= isl_multi_aff_get_domain_space(ma
);
13057 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
13058 rational
= isl_basic_map_is_rational(bmap
);
13059 strides
= rational
? 0 : multi_aff_strides(ma
);
13060 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
13061 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
13063 res
= isl_basic_map_set_rational(res
);
13065 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
13066 if (isl_basic_map_alloc_div(res
) < 0)
13069 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
13072 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
13073 k
= isl_basic_map_alloc_equality(res
);
13076 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
13077 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13080 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
13081 k
= isl_basic_map_alloc_inequality(res
);
13084 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13085 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13088 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13089 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13090 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13093 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13094 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13099 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13105 isl_basic_map_free(bmap
);
13106 isl_multi_aff_free(ma
);
13107 res
= isl_basic_map_simplify(res
);
13108 return isl_basic_map_finalize(res
);
13114 isl_basic_map_free(bmap
);
13115 isl_multi_aff_free(ma
);
13116 isl_basic_map_free(res
);
13120 /* Compute the preimage of "bset" under the function represented by "ma".
13121 * In other words, plug in "ma" in "bset". The result is a basic set
13122 * that lives in the domain space of "ma".
13124 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13125 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13127 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13130 /* Compute the preimage of the domain of "bmap" under the function
13131 * represented by "ma".
13132 * In other words, plug in "ma" in the domain of "bmap".
13133 * The result is a basic map that lives in the same space as "bmap"
13134 * except that the domain has been replaced by the domain space of "ma".
13136 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13137 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13139 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13142 /* Compute the preimage of the range of "bmap" under the function
13143 * represented by "ma".
13144 * In other words, plug in "ma" in the range of "bmap".
13145 * The result is a basic map that lives in the same space as "bmap"
13146 * except that the range has been replaced by the domain space of "ma".
13148 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13149 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13151 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13154 /* Check if the range of "ma" is compatible with the domain or range
13155 * (depending on "type") of "map".
13156 * Return isl_stat_error if anything is wrong.
13158 static isl_stat
check_map_compatible_range_multi_aff(
13159 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13160 __isl_keep isl_multi_aff
*ma
)
13163 isl_space
*ma_space
;
13165 ma_space
= isl_multi_aff_get_space(ma
);
13166 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
13167 isl_space_free(ma_space
);
13169 return isl_stat_error
;
13171 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13172 "spaces don't match", return isl_stat_error
);
13173 return isl_stat_ok
;
13176 /* Compute the preimage of the domain or range (depending on "type")
13177 * of "map" under the function represented by "ma".
13178 * In other words, plug in "ma" in the domain or range of "map".
13179 * The result is a map that lives in the same space as "map"
13180 * except that the domain or range has been replaced by
13181 * the domain space of "ma".
13183 * The parameters are assumed to have been aligned.
13185 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13186 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13191 map
= isl_map_cow(map
);
13192 ma
= isl_multi_aff_align_divs(ma
);
13195 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13198 for (i
= 0; i
< map
->n
; ++i
) {
13199 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13200 isl_multi_aff_copy(ma
));
13205 space
= isl_multi_aff_get_domain_space(ma
);
13206 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13208 isl_space_free(map
->dim
);
13213 isl_multi_aff_free(ma
);
13215 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13216 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13219 isl_multi_aff_free(ma
);
13224 /* Compute the preimage of the domain or range (depending on "type")
13225 * of "map" under the function represented by "ma".
13226 * In other words, plug in "ma" in the domain or range of "map".
13227 * The result is a map that lives in the same space as "map"
13228 * except that the domain or range has been replaced by
13229 * the domain space of "ma".
13231 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13232 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13239 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13243 return map_preimage_multi_aff(map
, type
, ma
);
13245 if (isl_map_check_named_params(map
) < 0)
13247 if (!isl_space_has_named_params(ma
->space
))
13248 isl_die(map
->ctx
, isl_error_invalid
,
13249 "unaligned unnamed parameters", goto error
);
13250 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13251 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13253 return map_preimage_multi_aff(map
, type
, ma
);
13255 isl_multi_aff_free(ma
);
13256 return isl_map_free(map
);
13259 /* Compute the preimage of "set" under the function represented by "ma".
13260 * In other words, plug in "ma" in "set". The result is a set
13261 * that lives in the domain space of "ma".
13263 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13264 __isl_take isl_multi_aff
*ma
)
13266 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13269 /* Compute the preimage of the domain of "map" under the function
13270 * represented by "ma".
13271 * In other words, plug in "ma" in the domain of "map".
13272 * The result is a map that lives in the same space as "map"
13273 * except that the domain has been replaced by the domain space of "ma".
13275 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13276 __isl_take isl_multi_aff
*ma
)
13278 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13281 /* Compute the preimage of the range of "map" under the function
13282 * represented by "ma".
13283 * In other words, plug in "ma" in the range of "map".
13284 * The result is a map that lives in the same space as "map"
13285 * except that the range has been replaced by the domain space of "ma".
13287 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13288 __isl_take isl_multi_aff
*ma
)
13290 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13293 /* Compute the preimage of "map" under the function represented by "pma".
13294 * In other words, plug in "pma" in the domain or range of "map".
13295 * The result is a map that lives in the same space as "map",
13296 * except that the space of type "type" has been replaced by
13297 * the domain space of "pma".
13299 * The parameters of "map" and "pma" are assumed to have been aligned.
13301 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13302 __isl_take isl_map
*map
, enum isl_dim_type type
,
13303 __isl_take isl_pw_multi_aff
*pma
)
13312 isl_pw_multi_aff_free(pma
);
13313 res
= isl_map_empty(isl_map_get_space(map
));
13318 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13319 isl_multi_aff_copy(pma
->p
[0].maff
));
13320 if (type
== isl_dim_in
)
13321 res
= isl_map_intersect_domain(res
,
13322 isl_map_copy(pma
->p
[0].set
));
13324 res
= isl_map_intersect_range(res
,
13325 isl_map_copy(pma
->p
[0].set
));
13327 for (i
= 1; i
< pma
->n
; ++i
) {
13330 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13331 isl_multi_aff_copy(pma
->p
[i
].maff
));
13332 if (type
== isl_dim_in
)
13333 res_i
= isl_map_intersect_domain(res_i
,
13334 isl_map_copy(pma
->p
[i
].set
));
13336 res_i
= isl_map_intersect_range(res_i
,
13337 isl_map_copy(pma
->p
[i
].set
));
13338 res
= isl_map_union(res
, res_i
);
13341 isl_pw_multi_aff_free(pma
);
13345 isl_pw_multi_aff_free(pma
);
13350 /* Compute the preimage of "map" under the function represented by "pma".
13351 * In other words, plug in "pma" in the domain or range of "map".
13352 * The result is a map that lives in the same space as "map",
13353 * except that the space of type "type" has been replaced by
13354 * the domain space of "pma".
13356 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13357 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13364 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13368 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13370 if (isl_map_check_named_params(map
) < 0)
13372 if (!isl_space_has_named_params(pma
->dim
))
13373 isl_die(map
->ctx
, isl_error_invalid
,
13374 "unaligned unnamed parameters", goto error
);
13375 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13376 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13378 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13380 isl_pw_multi_aff_free(pma
);
13381 return isl_map_free(map
);
13384 /* Compute the preimage of "set" under the function represented by "pma".
13385 * In other words, plug in "pma" in "set". The result is a set
13386 * that lives in the domain space of "pma".
13388 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13389 __isl_take isl_pw_multi_aff
*pma
)
13391 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13394 /* Compute the preimage of the domain of "map" under the function
13395 * represented by "pma".
13396 * In other words, plug in "pma" in the domain of "map".
13397 * The result is a map that lives in the same space as "map",
13398 * except that domain space has been replaced by the domain space of "pma".
13400 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13401 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13403 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13406 /* Compute the preimage of the range of "map" under the function
13407 * represented by "pma".
13408 * In other words, plug in "pma" in the range of "map".
13409 * The result is a map that lives in the same space as "map",
13410 * except that range space has been replaced by the domain space of "pma".
13412 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13413 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13415 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13418 /* Compute the preimage of "map" under the function represented by "mpa".
13419 * In other words, plug in "mpa" in the domain or range of "map".
13420 * The result is a map that lives in the same space as "map",
13421 * except that the space of type "type" has been replaced by
13422 * the domain space of "mpa".
13424 * If the map does not involve any constraints that refer to the
13425 * dimensions of the substituted space, then the only possible
13426 * effect of "mpa" on the map is to map the space to a different space.
13427 * We create a separate isl_multi_aff to effectuate this change
13428 * in order to avoid spurious splitting of the map along the pieces
13430 * If "mpa" has a non-trivial explicit domain, however,
13431 * then the full substitution should be performed.
13433 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13434 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13438 isl_pw_multi_aff
*pma
;
13443 n
= isl_map_dim(map
, type
);
13444 full
= isl_map_involves_dims(map
, type
, 0, n
);
13445 if (full
>= 0 && !full
)
13446 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
13453 space
= isl_multi_pw_aff_get_space(mpa
);
13454 isl_multi_pw_aff_free(mpa
);
13455 ma
= isl_multi_aff_zero(space
);
13456 return isl_map_preimage_multi_aff(map
, type
, ma
);
13459 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13460 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13463 isl_multi_pw_aff_free(mpa
);
13467 /* Compute the preimage of "map" under the function represented by "mpa".
13468 * In other words, plug in "mpa" in the domain "map".
13469 * The result is a map that lives in the same space as "map",
13470 * except that domain space has been replaced by the domain space of "mpa".
13472 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13473 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13475 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13478 /* Compute the preimage of "set" by the function represented by "mpa".
13479 * In other words, plug in "mpa" in "set".
13481 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13482 __isl_take isl_multi_pw_aff
*mpa
)
13484 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13487 /* Return a copy of the equality constraints of "bset" as a matrix.
13489 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13490 __isl_keep isl_basic_set
*bset
)
13498 ctx
= isl_basic_set_get_ctx(bset
);
13499 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13500 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13503 /* Are the "n" "coefficients" starting at "first" of the integer division
13504 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13506 * The "coefficient" at position 0 is the denominator.
13507 * The "coefficient" at position 1 is the constant term.
13509 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13510 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13511 unsigned first
, unsigned n
)
13513 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13514 return isl_bool_error
;
13515 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13516 return isl_bool_error
;
13517 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13518 bmap2
->div
[pos2
] + first
, n
);
13521 /* Are the integer division expressions at position "pos1" in "bmap1" and
13522 * "pos2" in "bmap2" equal to each other, except that the constant terms
13525 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13526 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13527 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13532 if (!bmap1
|| !bmap2
)
13533 return isl_bool_error
;
13534 total
= isl_basic_map_total_dim(bmap1
);
13535 if (total
!= isl_basic_map_total_dim(bmap2
))
13536 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13537 "incomparable div expressions", return isl_bool_error
);
13538 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13540 if (equal
< 0 || !equal
)
13542 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13544 if (equal
< 0 || equal
)
13545 return isl_bool_not(equal
);
13546 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13550 /* Replace the numerator of the constant term of the integer division
13551 * expression at position "div" in "bmap" by "value".
13552 * The caller guarantees that this does not change the meaning
13555 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13556 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13558 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13559 return isl_basic_map_free(bmap
);
13561 isl_int_set_si(bmap
->div
[div
][1], value
);
13566 /* Is the point "inner" internal to inequality constraint "ineq"
13568 * The point is considered to be internal to the inequality constraint,
13569 * if it strictly lies on the positive side of the inequality constraint,
13570 * or if it lies on the constraint and the constraint is lexico-positive.
13572 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13573 __isl_keep isl_basic_set
*bset
, int ineq
)
13579 if (!inner
|| !bset
)
13580 return isl_bool_error
;
13582 ctx
= isl_basic_set_get_ctx(bset
);
13583 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13584 &ctx
->normalize_gcd
);
13585 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13586 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13588 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13589 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13590 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13593 /* Tighten the inequality constraints of "bset" that are outward with respect
13594 * to the point "vec".
13595 * That is, tighten the constraints that are not satisfied by "vec".
13597 * "vec" is a point internal to some superset S of "bset" that is used
13598 * to make the subsets of S disjoint, by tightening one half of the constraints
13599 * that separate two subsets. In particular, the constraints of S
13600 * are all satisfied by "vec" and should not be tightened.
13601 * Of the internal constraints, those that have "vec" on the outside
13602 * are tightened. The shared facet is included in the adjacent subset
13603 * with the opposite constraint.
13604 * For constraints that saturate "vec", this criterion cannot be used
13605 * to determine which of the two sides should be tightened.
13606 * Instead, the sign of the first non-zero coefficient is used
13607 * to make this choice. Note that this second criterion is never used
13608 * on the constraints of S since "vec" is interior to "S".
13610 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13611 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13615 bset
= isl_basic_set_cow(bset
);
13618 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13621 internal
= is_internal(vec
, bset
, j
);
13623 return isl_basic_set_free(bset
);
13626 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13632 /* Replace the variables x of type "type" starting at "first" in "bmap"
13633 * by x' with x = M x' with M the matrix trans.
13634 * That is, replace the corresponding coefficients c by c M.
13636 * The transformation matrix should be a square matrix.
13638 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13639 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13640 __isl_take isl_mat
*trans
)
13644 bmap
= isl_basic_map_cow(bmap
);
13645 if (!bmap
|| !trans
)
13648 if (trans
->n_row
!= trans
->n_col
)
13649 isl_die(trans
->ctx
, isl_error_invalid
,
13650 "expecting square transformation matrix", goto error
);
13651 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13652 isl_die(trans
->ctx
, isl_error_invalid
,
13653 "oversized transformation matrix", goto error
);
13655 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13657 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13658 isl_mat_copy(trans
)) < 0)
13660 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13661 isl_mat_copy(trans
)) < 0)
13663 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13664 isl_mat_copy(trans
)) < 0)
13667 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
13668 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13670 isl_mat_free(trans
);
13673 isl_mat_free(trans
);
13674 isl_basic_map_free(bmap
);
13678 /* Replace the variables x of type "type" starting at "first" in "bset"
13679 * by x' with x = M x' with M the matrix trans.
13680 * That is, replace the corresponding coefficients c by c M.
13682 * The transformation matrix should be a square matrix.
13684 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13685 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13686 __isl_take isl_mat
*trans
)
13688 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);