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(__isl_keep 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 __isl_give isl_basic_map
*basic_map_init(isl_ctx
*ctx
,
1108 __isl_take 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 __isl_give 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 __isl_give isl_basic_map
*dup_constraints(__isl_take isl_basic_map
*dst
,
1223 __isl_keep isl_basic_map
*src
)
1226 unsigned total
= isl_basic_map_total_dim(src
);
1231 for (i
= 0; i
< src
->n_eq
; ++i
) {
1232 int j
= isl_basic_map_alloc_equality(dst
);
1234 return isl_basic_map_free(dst
);
1235 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1238 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1239 int j
= isl_basic_map_alloc_inequality(dst
);
1241 return isl_basic_map_free(dst
);
1242 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1245 for (i
= 0; i
< src
->n_div
; ++i
) {
1246 int j
= isl_basic_map_alloc_div(dst
);
1248 return isl_basic_map_free(dst
);
1249 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1251 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1255 __isl_give isl_basic_map
*isl_basic_map_dup(__isl_keep isl_basic_map
*bmap
)
1257 struct isl_basic_map
*dup
;
1261 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1262 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1263 dup
= dup_constraints(dup
, bmap
);
1266 dup
->flags
= bmap
->flags
;
1267 dup
->sample
= isl_vec_copy(bmap
->sample
);
1271 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1273 struct isl_basic_map
*dup
;
1275 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1276 return bset_from_bmap(dup
);
1279 __isl_give isl_basic_set
*isl_basic_set_copy(__isl_keep isl_basic_set
*bset
)
1284 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1288 return isl_basic_set_dup(bset
);
1291 __isl_give isl_set
*isl_set_copy(__isl_keep isl_set
*set
)
1300 __isl_give isl_basic_map
*isl_basic_map_copy(__isl_keep isl_basic_map
*bmap
)
1305 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1309 bmap
= isl_basic_map_dup(bmap
);
1311 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1315 __isl_give isl_map
*isl_map_copy(__isl_keep isl_map
*map
)
1324 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1329 if (--bmap
->ref
> 0)
1332 isl_ctx_deref(bmap
->ctx
);
1334 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1336 isl_blk_free(bmap
->ctx
, bmap
->block
);
1337 isl_vec_free(bmap
->sample
);
1338 isl_space_free(bmap
->dim
);
1344 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1346 return isl_basic_map_free(bset_to_bmap(bset
));
1349 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1351 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1354 /* Check that "map" has only named parameters, reporting an error
1357 isl_stat
isl_map_check_named_params(__isl_keep isl_map
*map
)
1359 return isl_space_check_named_params(isl_map_peek_space(map
));
1362 /* Check that "bmap" has only named parameters, reporting an error
1365 static isl_stat
isl_basic_map_check_named_params(__isl_keep isl_basic_map
*bmap
)
1367 return isl_space_check_named_params(isl_basic_map_peek_space(bmap
));
1370 /* Check that "bmap1" and "bmap2" have the same parameters,
1371 * reporting an error if they do not.
1373 static isl_stat
isl_basic_map_check_equal_params(
1374 __isl_keep isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
1378 match
= isl_basic_map_has_equal_params(bmap1
, bmap2
);
1380 return isl_stat_error
;
1382 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
1383 "parameters don't match", return isl_stat_error
);
1387 __isl_give isl_map
*isl_map_align_params_map_map_and(
1388 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1389 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1390 __isl_take isl_map
*map2
))
1394 if (isl_map_has_equal_params(map1
, map2
))
1395 return fn(map1
, map2
);
1396 if (isl_map_check_named_params(map1
) < 0)
1398 if (isl_map_check_named_params(map2
) < 0)
1400 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1401 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1402 return fn(map1
, map2
);
1409 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1410 __isl_keep isl_map
*map2
,
1411 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1416 return isl_bool_error
;
1417 if (isl_map_has_equal_params(map1
, map2
))
1418 return fn(map1
, map2
);
1419 if (isl_map_check_named_params(map1
) < 0)
1420 return isl_bool_error
;
1421 if (isl_map_check_named_params(map2
) < 0)
1422 return isl_bool_error
;
1423 map1
= isl_map_copy(map1
);
1424 map2
= isl_map_copy(map2
);
1425 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1426 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1433 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1435 struct isl_ctx
*ctx
;
1439 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1440 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1442 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1443 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1444 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1445 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1446 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1448 int j
= isl_basic_map_alloc_inequality(bmap
);
1452 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1453 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1460 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1461 bmap
->extra
- bmap
->n_div
);
1462 return bmap
->n_eq
++;
1465 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1467 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1470 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1474 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1479 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1481 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1484 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1489 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1491 if (pos
!= bmap
->n_eq
- 1) {
1493 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1494 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1500 /* Turn inequality "pos" of "bmap" into an equality.
1502 * In particular, we move the inequality in front of the equalities
1503 * and move the last inequality in the position of the moved inequality.
1504 * Note that isl_tab_make_equalities_explicit depends on this particular
1505 * change in the ordering of the constraints.
1507 void isl_basic_map_inequality_to_equality(
1508 struct isl_basic_map
*bmap
, unsigned pos
)
1512 t
= bmap
->ineq
[pos
];
1513 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1514 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1519 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1520 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1521 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1522 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1525 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1527 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1530 int isl_basic_map_alloc_inequality(__isl_keep isl_basic_map
*bmap
)
1532 struct isl_ctx
*ctx
;
1536 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1537 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1538 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1539 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1540 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1541 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1542 1 + isl_basic_map_total_dim(bmap
),
1543 bmap
->extra
- bmap
->n_div
);
1544 return bmap
->n_ineq
++;
1547 int isl_basic_set_alloc_inequality(__isl_keep isl_basic_set
*bset
)
1549 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1552 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1556 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1561 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1563 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1566 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1571 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1573 if (pos
!= bmap
->n_ineq
- 1) {
1574 t
= bmap
->ineq
[pos
];
1575 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1576 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1577 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
1583 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1585 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1588 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1593 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1596 k
= isl_basic_map_alloc_equality(bmap
);
1599 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1602 isl_basic_map_free(bmap
);
1606 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1609 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1612 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1617 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1620 k
= isl_basic_map_alloc_inequality(bmap
);
1623 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1626 isl_basic_map_free(bmap
);
1630 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1633 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1636 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1640 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1641 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1642 1 + 1 + isl_basic_map_total_dim(bmap
),
1643 bmap
->extra
- bmap
->n_div
);
1644 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1645 return bmap
->n_div
++;
1648 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1650 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1653 /* Check that there are "n" dimensions of type "type" starting at "first"
1656 static isl_stat
isl_basic_map_check_range(__isl_keep isl_basic_map
*bmap
,
1657 enum isl_dim_type type
, unsigned first
, unsigned n
)
1662 return isl_stat_error
;
1663 dim
= isl_basic_map_dim(bmap
, type
);
1664 if (first
+ n
> dim
|| first
+ n
< first
)
1665 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1666 "position or range out of bounds",
1667 return isl_stat_error
);
1671 /* Insert an extra integer division, prescribed by "div", to "bmap"
1672 * at (integer division) position "pos".
1674 * The integer division is first added at the end and then moved
1675 * into the right position.
1677 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1678 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1682 bmap
= isl_basic_map_cow(bmap
);
1684 return isl_basic_map_free(bmap
);
1686 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1687 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1688 "unexpected size", return isl_basic_map_free(bmap
));
1689 if (isl_basic_map_check_range(bmap
, isl_dim_div
, pos
, 0) < 0)
1690 return isl_basic_map_free(bmap
);
1692 bmap
= isl_basic_map_extend_space(bmap
,
1693 isl_basic_map_get_space(bmap
), 1, 0, 2);
1694 k
= isl_basic_map_alloc_div(bmap
);
1696 return isl_basic_map_free(bmap
);
1697 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1698 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1700 for (i
= k
; i
> pos
; --i
)
1701 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1706 isl_stat
isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1709 return isl_stat_error
;
1710 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return isl_stat_error
);
1715 /* Copy constraint from src to dst, putting the vars of src at offset
1716 * dim_off in dst and the divs of src at offset div_off in dst.
1717 * If both sets are actually map, then dim_off applies to the input
1720 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1721 struct isl_basic_map
*src_map
, isl_int
*src
,
1722 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1724 unsigned src_nparam
= isl_basic_map_dim(src_map
, isl_dim_param
);
1725 unsigned dst_nparam
= isl_basic_map_dim(dst_map
, isl_dim_param
);
1726 unsigned src_in
= isl_basic_map_dim(src_map
, isl_dim_in
);
1727 unsigned dst_in
= isl_basic_map_dim(dst_map
, isl_dim_in
);
1728 unsigned src_out
= isl_basic_map_dim(src_map
, isl_dim_out
);
1729 unsigned dst_out
= isl_basic_map_dim(dst_map
, isl_dim_out
);
1730 isl_int_set(dst
[0], src
[0]);
1731 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1732 if (dst_nparam
> src_nparam
)
1733 isl_seq_clr(dst
+1+src_nparam
,
1734 dst_nparam
- src_nparam
);
1735 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1736 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1738 isl_min(dst_in
-in_off
, src_in
));
1739 if (dst_in
-in_off
> src_in
)
1740 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1741 dst_in
- in_off
- src_in
);
1742 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1743 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1744 src
+1+src_nparam
+src_in
,
1745 isl_min(dst_out
-out_off
, src_out
));
1746 if (dst_out
-out_off
> src_out
)
1747 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1748 dst_out
- out_off
- src_out
);
1749 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1750 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1751 src
+1+src_nparam
+src_in
+src_out
,
1752 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1753 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1754 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1755 div_off
+src_map
->n_div
,
1756 dst_map
->n_div
- div_off
- src_map
->n_div
);
1759 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1760 struct isl_basic_map
*src_map
, isl_int
*src
,
1761 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1763 isl_int_set(dst
[0], src
[0]);
1764 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1767 static __isl_give isl_basic_map
*add_constraints(
1768 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
,
1769 unsigned i_pos
, unsigned o_pos
)
1774 if (!bmap1
|| !bmap2
)
1777 div_off
= bmap1
->n_div
;
1779 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1780 int i1
= isl_basic_map_alloc_equality(bmap1
);
1783 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1784 i_pos
, o_pos
, div_off
);
1787 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1788 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1791 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1792 i_pos
, o_pos
, div_off
);
1795 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1796 int i1
= isl_basic_map_alloc_div(bmap1
);
1799 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1800 i_pos
, o_pos
, div_off
);
1803 isl_basic_map_free(bmap2
);
1808 isl_basic_map_free(bmap1
);
1809 isl_basic_map_free(bmap2
);
1813 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1814 struct isl_basic_set
*bset2
, unsigned pos
)
1816 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1817 bset_to_bmap(bset2
), 0, pos
));
1820 __isl_give isl_basic_map
*isl_basic_map_extend_space(
1821 __isl_take isl_basic_map
*base
, __isl_take isl_space
*dim
,
1822 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1824 struct isl_basic_map
*ext
;
1834 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1835 base
->extra
>= base
->n_div
+ extra
;
1837 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1838 room_for_ineq(base
, n_ineq
)) {
1839 isl_space_free(dim
);
1843 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1844 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1845 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1846 extra
+= base
->extra
;
1848 n_ineq
+= base
->n_ineq
;
1850 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1856 ext
->sample
= isl_vec_copy(base
->sample
);
1857 flags
= base
->flags
;
1858 ext
= add_constraints(ext
, base
, 0, 0);
1861 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1867 isl_space_free(dim
);
1868 isl_basic_map_free(base
);
1872 __isl_give isl_basic_set
*isl_basic_set_extend_space(
1873 __isl_take isl_basic_set
*base
,
1874 __isl_take isl_space
*dim
, unsigned extra
,
1875 unsigned n_eq
, unsigned n_ineq
)
1877 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1878 dim
, extra
, n_eq
, n_ineq
));
1881 struct isl_basic_map
*isl_basic_map_extend_constraints(
1882 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1886 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1890 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1891 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1892 unsigned n_eq
, unsigned n_ineq
)
1894 struct isl_basic_map
*bmap
;
1899 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1903 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1906 isl_basic_map_free(base
);
1910 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1911 unsigned nparam
, unsigned dim
, unsigned extra
,
1912 unsigned n_eq
, unsigned n_ineq
)
1914 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1915 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1918 struct isl_basic_set
*isl_basic_set_extend_constraints(
1919 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1921 isl_basic_map
*bmap
= bset_to_bmap(base
);
1922 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1923 return bset_from_bmap(bmap
);
1926 __isl_give isl_basic_set
*isl_basic_set_cow(__isl_take isl_basic_set
*bset
)
1928 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1931 __isl_give isl_basic_map
*isl_basic_map_cow(__isl_take isl_basic_map
*bmap
)
1936 if (bmap
->ref
> 1) {
1938 bmap
= isl_basic_map_dup(bmap
);
1941 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1942 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1947 /* Clear all cached information in "map", either because it is about
1948 * to be modified or because it is being freed.
1949 * Always return the same pointer that is passed in.
1950 * This is needed for the use in isl_map_free.
1952 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1954 isl_basic_map_free(map
->cached_simple_hull
[0]);
1955 isl_basic_map_free(map
->cached_simple_hull
[1]);
1956 map
->cached_simple_hull
[0] = NULL
;
1957 map
->cached_simple_hull
[1] = NULL
;
1961 __isl_give isl_set
*isl_set_cow(__isl_take isl_set
*set
)
1963 return isl_map_cow(set
);
1966 /* Return an isl_map that is equal to "map" and that has only
1967 * a single reference.
1969 * If the original input already has only one reference, then
1970 * simply return it, but clear all cached information, since
1971 * it may be rendered invalid by the operations that will be
1972 * performed on the result.
1974 * Otherwise, create a duplicate (without any cached information).
1976 __isl_give isl_map
*isl_map_cow(__isl_take isl_map
*map
)
1982 return clear_caches(map
);
1984 return isl_map_dup(map
);
1987 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1988 unsigned a_len
, unsigned b_len
)
1990 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1991 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1992 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1995 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1996 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
2004 isl_assert(bmap
->ctx
,
2005 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
2007 if (n1
== 0 || n2
== 0)
2010 bmap
= isl_basic_map_cow(bmap
);
2014 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
2015 if (isl_blk_is_error(blk
))
2018 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2020 bmap
->eq
[i
] + pos
, n1
, n2
);
2022 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2024 bmap
->ineq
[i
] + pos
, n1
, n2
);
2026 for (i
= 0; i
< bmap
->n_div
; ++i
)
2028 bmap
->div
[i
]+1 + pos
, n1
, n2
);
2030 isl_blk_free(bmap
->ctx
, blk
);
2032 ISL_F_CLR(bmap
, ISL_BASIC_SET_SORTED
);
2033 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2034 return isl_basic_map_finalize(bmap
);
2036 isl_basic_map_free(bmap
);
2040 __isl_give isl_basic_map
*isl_basic_map_set_to_empty(
2041 __isl_take isl_basic_map
*bmap
)
2047 total
= isl_basic_map_total_dim(bmap
);
2048 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
2049 return isl_basic_map_free(bmap
);
2050 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
2052 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
2054 i
= isl_basic_map_alloc_equality(bmap
);
2058 isl_int_set_si(bmap
->eq
[i
][0], 1);
2059 isl_seq_clr(bmap
->eq
[i
]+1, total
);
2060 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
2061 isl_vec_free(bmap
->sample
);
2062 bmap
->sample
= NULL
;
2063 return isl_basic_map_finalize(bmap
);
2065 isl_basic_map_free(bmap
);
2069 __isl_give isl_basic_set
*isl_basic_set_set_to_empty(
2070 __isl_take isl_basic_set
*bset
)
2072 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
2075 __isl_give isl_basic_map
*isl_basic_map_set_rational(
2076 __isl_take isl_basic_map
*bmap
)
2081 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2084 bmap
= isl_basic_map_cow(bmap
);
2088 ISL_F_SET(bmap
, ISL_BASIC_MAP_RATIONAL
);
2090 return isl_basic_map_finalize(bmap
);
2093 __isl_give isl_basic_set
*isl_basic_set_set_rational(
2094 __isl_take isl_basic_set
*bset
)
2096 return isl_basic_map_set_rational(bset
);
2099 __isl_give isl_basic_set
*isl_basic_set_set_integral(
2100 __isl_take isl_basic_set
*bset
)
2105 if (!ISL_F_ISSET(bset
, ISL_BASIC_MAP_RATIONAL
))
2108 bset
= isl_basic_set_cow(bset
);
2112 ISL_F_CLR(bset
, ISL_BASIC_MAP_RATIONAL
);
2114 return isl_basic_set_finalize(bset
);
2117 __isl_give isl_map
*isl_map_set_rational(__isl_take isl_map
*map
)
2121 map
= isl_map_cow(map
);
2124 for (i
= 0; i
< map
->n
; ++i
) {
2125 map
->p
[i
] = isl_basic_map_set_rational(map
->p
[i
]);
2135 __isl_give isl_set
*isl_set_set_rational(__isl_take isl_set
*set
)
2137 return isl_map_set_rational(set
);
2140 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
2143 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
2145 isl_int
*t
= bmap
->div
[a
];
2146 bmap
->div
[a
] = bmap
->div
[b
];
2150 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
2151 * div definitions accordingly.
2153 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
2156 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2158 swap_div(bmap
, a
, b
);
2160 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2161 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
2163 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2164 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
2166 for (i
= 0; i
< bmap
->n_div
; ++i
)
2167 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
2168 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2171 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
2172 * div definitions accordingly.
2174 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
2176 isl_basic_map_swap_div(bset
, a
, b
);
2179 static void constraint_drop_vars(isl_int
*c
, unsigned n
, unsigned rem
)
2181 isl_seq_cpy(c
, c
+ n
, rem
);
2182 isl_seq_clr(c
+ rem
, n
);
2185 /* Drop n dimensions starting at first.
2187 * In principle, this frees up some extra variables as the number
2188 * of columns remains constant, but we would have to extend
2189 * the div array too as the number of rows in this array is assumed
2190 * to be equal to extra.
2192 __isl_give isl_basic_set
*isl_basic_set_drop_dims(
2193 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2195 return isl_basic_map_drop(bset_to_bmap(bset
), isl_dim_set
, first
, n
);
2198 /* Move "n" divs starting at "first" to the end of the list of divs.
2200 static struct isl_basic_map
*move_divs_last(struct isl_basic_map
*bmap
,
2201 unsigned first
, unsigned n
)
2206 if (first
+ n
== bmap
->n_div
)
2209 div
= isl_alloc_array(bmap
->ctx
, isl_int
*, n
);
2212 for (i
= 0; i
< n
; ++i
)
2213 div
[i
] = bmap
->div
[first
+ i
];
2214 for (i
= 0; i
< bmap
->n_div
- first
- n
; ++i
)
2215 bmap
->div
[first
+ i
] = bmap
->div
[first
+ n
+ i
];
2216 for (i
= 0; i
< n
; ++i
)
2217 bmap
->div
[bmap
->n_div
- n
+ i
] = div
[i
];
2221 isl_basic_map_free(bmap
);
2225 /* Check that there are "n" dimensions of type "type" starting at "first"
2228 static isl_stat
isl_map_check_range(__isl_keep isl_map
*map
,
2229 enum isl_dim_type type
, unsigned first
, unsigned n
)
2232 return isl_stat_error
;
2233 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
2234 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
2235 "position or range out of bounds",
2236 return isl_stat_error
);
2240 /* Drop "n" dimensions of type "type" starting at "first".
2242 * In principle, this frees up some extra variables as the number
2243 * of columns remains constant, but we would have to extend
2244 * the div array too as the number of rows in this array is assumed
2245 * to be equal to extra.
2247 __isl_give isl_basic_map
*isl_basic_map_drop(__isl_take isl_basic_map
*bmap
,
2248 enum isl_dim_type type
, unsigned first
, unsigned n
)
2258 dim
= isl_basic_map_dim(bmap
, type
);
2259 isl_assert(bmap
->ctx
, first
+ n
<= dim
, goto error
);
2261 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2264 bmap
= isl_basic_map_cow(bmap
);
2268 offset
= isl_basic_map_offset(bmap
, type
) + first
;
2269 left
= isl_basic_map_total_dim(bmap
) - (offset
- 1) - n
;
2270 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2271 constraint_drop_vars(bmap
->eq
[i
]+offset
, n
, left
);
2273 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2274 constraint_drop_vars(bmap
->ineq
[i
]+offset
, n
, left
);
2276 for (i
= 0; i
< bmap
->n_div
; ++i
)
2277 constraint_drop_vars(bmap
->div
[i
]+1+offset
, n
, left
);
2279 if (type
== isl_dim_div
) {
2280 bmap
= move_divs_last(bmap
, first
, n
);
2283 if (isl_basic_map_free_div(bmap
, n
) < 0)
2284 return isl_basic_map_free(bmap
);
2286 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
2290 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
2291 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2292 bmap
= isl_basic_map_simplify(bmap
);
2293 return isl_basic_map_finalize(bmap
);
2295 isl_basic_map_free(bmap
);
2299 __isl_give isl_basic_set
*isl_basic_set_drop(__isl_take isl_basic_set
*bset
,
2300 enum isl_dim_type type
, unsigned first
, unsigned n
)
2302 return bset_from_bmap(isl_basic_map_drop(bset_to_bmap(bset
),
2306 /* No longer consider "map" to be normalized.
2308 static __isl_give isl_map
*isl_map_unmark_normalized(__isl_take isl_map
*map
)
2312 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2316 __isl_give isl_map
*isl_map_drop(__isl_take isl_map
*map
,
2317 enum isl_dim_type type
, unsigned first
, unsigned n
)
2321 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2322 return isl_map_free(map
);
2324 if (n
== 0 && !isl_space_is_named_or_nested(map
->dim
, type
))
2326 map
= isl_map_cow(map
);
2329 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
2333 for (i
= 0; i
< map
->n
; ++i
) {
2334 map
->p
[i
] = isl_basic_map_drop(map
->p
[i
], type
, first
, n
);
2338 map
= isl_map_unmark_normalized(map
);
2346 __isl_give isl_set
*isl_set_drop(__isl_take isl_set
*set
,
2347 enum isl_dim_type type
, unsigned first
, unsigned n
)
2349 return set_from_map(isl_map_drop(set_to_map(set
), type
, first
, n
));
2353 * We don't cow, as the div is assumed to be redundant.
2355 __isl_give isl_basic_map
*isl_basic_map_drop_div(
2356 __isl_take isl_basic_map
*bmap
, unsigned div
)
2364 pos
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + div
;
2366 isl_assert(bmap
->ctx
, div
< bmap
->n_div
, goto error
);
2368 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2369 constraint_drop_vars(bmap
->eq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2371 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2372 if (!isl_int_is_zero(bmap
->ineq
[i
][pos
])) {
2373 isl_basic_map_drop_inequality(bmap
, i
);
2377 constraint_drop_vars(bmap
->ineq
[i
]+pos
, 1, bmap
->extra
-div
-1);
2380 for (i
= 0; i
< bmap
->n_div
; ++i
)
2381 constraint_drop_vars(bmap
->div
[i
]+1+pos
, 1, bmap
->extra
-div
-1);
2383 if (div
!= bmap
->n_div
- 1) {
2385 isl_int
*t
= bmap
->div
[div
];
2387 for (j
= div
; j
< bmap
->n_div
- 1; ++j
)
2388 bmap
->div
[j
] = bmap
->div
[j
+1];
2390 bmap
->div
[bmap
->n_div
- 1] = t
;
2392 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
2393 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
2394 if (isl_basic_map_free_div(bmap
, 1) < 0)
2395 return isl_basic_map_free(bmap
);
2399 isl_basic_map_free(bmap
);
2403 /* Eliminate the specified n dimensions starting at first from the
2404 * constraints, without removing the dimensions from the space.
2405 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2407 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
2408 enum isl_dim_type type
, unsigned first
, unsigned n
)
2415 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2416 return isl_map_free(map
);
2418 map
= isl_map_cow(map
);
2422 for (i
= 0; i
< map
->n
; ++i
) {
2423 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
2433 /* Eliminate the specified n dimensions starting at first from the
2434 * constraints, without removing the dimensions from the space.
2435 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2437 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
2438 enum isl_dim_type type
, unsigned first
, unsigned n
)
2440 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
2443 /* Eliminate the specified n dimensions starting at first from the
2444 * constraints, without removing the dimensions from the space.
2445 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
2447 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
2448 unsigned first
, unsigned n
)
2450 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
2453 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
2454 __isl_take isl_basic_map
*bmap
)
2458 bmap
= isl_basic_map_eliminate_vars(bmap
,
2459 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
2463 return isl_basic_map_finalize(bmap
);
2466 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
2467 __isl_take isl_basic_set
*bset
)
2469 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2472 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2481 map
= isl_map_cow(map
);
2485 for (i
= 0; i
< map
->n
; ++i
) {
2486 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2496 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2498 return isl_map_remove_divs(set
);
2501 __isl_give isl_basic_map
*isl_basic_map_remove_dims(
2502 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
2503 unsigned first
, unsigned n
)
2505 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2506 return isl_basic_map_free(bmap
);
2507 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2509 bmap
= isl_basic_map_eliminate_vars(bmap
,
2510 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2513 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2515 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2519 /* Return true if the definition of the given div (recursively) involves
2520 * any of the given variables.
2522 static isl_bool
div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2523 unsigned first
, unsigned n
)
2526 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2528 if (isl_int_is_zero(bmap
->div
[div
][0]))
2529 return isl_bool_false
;
2530 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2531 return isl_bool_true
;
2533 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2536 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2538 involves
= div_involves_vars(bmap
, i
, first
, n
);
2539 if (involves
< 0 || involves
)
2543 return isl_bool_false
;
2546 /* Try and add a lower and/or upper bound on "div" to "bmap"
2547 * based on inequality "i".
2548 * "total" is the total number of variables (excluding the divs).
2549 * "v" is a temporary object that can be used during the calculations.
2550 * If "lb" is set, then a lower bound should be constructed.
2551 * If "ub" is set, then an upper bound should be constructed.
2553 * The calling function has already checked that the inequality does not
2554 * reference "div", but we still need to check that the inequality is
2555 * of the right form. We'll consider the case where we want to construct
2556 * a lower bound. The construction of upper bounds is similar.
2558 * Let "div" be of the form
2560 * q = floor((a + f(x))/d)
2562 * We essentially check if constraint "i" is of the form
2566 * so that we can use it to derive a lower bound on "div".
2567 * However, we allow a slightly more general form
2571 * with the condition that the coefficients of g(x) - f(x) are all
2573 * Rewriting this constraint as
2577 * adding a + f(x) to both sides and dividing by d, we obtain
2579 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2581 * Taking the floor on both sides, we obtain
2583 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2587 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2589 * In the case of an upper bound, we construct the constraint
2591 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2594 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2595 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2596 unsigned total
, isl_int v
, int lb
, int ub
)
2600 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2602 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2603 bmap
->div
[div
][1 + 1 + j
]);
2604 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2607 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2608 bmap
->div
[div
][1 + 1 + j
]);
2609 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2615 bmap
= isl_basic_map_cow(bmap
);
2616 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2618 int k
= isl_basic_map_alloc_inequality(bmap
);
2621 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2622 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2623 bmap
->div
[div
][1 + j
]);
2624 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2625 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2627 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2630 int k
= isl_basic_map_alloc_inequality(bmap
);
2633 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2634 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2635 bmap
->div
[div
][1 + j
]);
2636 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2637 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2639 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2644 isl_basic_map_free(bmap
);
2648 /* This function is called right before "div" is eliminated from "bmap"
2649 * using Fourier-Motzkin.
2650 * Look through the constraints of "bmap" for constraints on the argument
2651 * of the integer division and use them to construct constraints on the
2652 * integer division itself. These constraints can then be combined
2653 * during the Fourier-Motzkin elimination.
2654 * Note that it is only useful to introduce lower bounds on "div"
2655 * if "bmap" already contains upper bounds on "div" as the newly
2656 * introduce lower bounds can then be combined with the pre-existing
2657 * upper bounds. Similarly for upper bounds.
2658 * We therefore first check if "bmap" contains any lower and/or upper bounds
2661 * It is interesting to note that the introduction of these constraints
2662 * can indeed lead to more accurate results, even when compared to
2663 * deriving constraints on the argument of "div" from constraints on "div".
2664 * Consider, for example, the set
2666 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2668 * The second constraint can be rewritten as
2670 * 2 * [(-i-2j+3)/4] + k >= 0
2672 * from which we can derive
2674 * -i - 2j + 3 >= -2k
2680 * Combined with the first constraint, we obtain
2682 * -3 <= 3 + 2k or k >= -3
2684 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2685 * the first constraint, we obtain
2687 * [(i + 2j)/4] >= [-3/4] = -1
2689 * Combining this constraint with the second constraint, we obtain
2693 static __isl_give isl_basic_map
*insert_bounds_on_div(
2694 __isl_take isl_basic_map
*bmap
, int div
)
2697 int check_lb
, check_ub
;
2704 if (isl_int_is_zero(bmap
->div
[div
][0]))
2707 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2711 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2712 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2719 if (!check_lb
&& !check_ub
)
2724 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2725 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2728 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2729 check_lb
, check_ub
);
2737 /* Remove all divs (recursively) involving any of the given dimensions
2738 * in their definitions.
2740 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2741 __isl_take isl_basic_map
*bmap
,
2742 enum isl_dim_type type
, unsigned first
, unsigned n
)
2746 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2747 return isl_basic_map_free(bmap
);
2748 first
+= isl_basic_map_offset(bmap
, type
);
2750 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2753 involves
= div_involves_vars(bmap
, i
, first
, n
);
2755 return isl_basic_map_free(bmap
);
2758 bmap
= insert_bounds_on_div(bmap
, i
);
2759 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2768 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2769 __isl_take isl_basic_set
*bset
,
2770 enum isl_dim_type type
, unsigned first
, unsigned n
)
2772 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2775 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2776 enum isl_dim_type type
, unsigned first
, unsigned n
)
2785 map
= isl_map_cow(map
);
2789 for (i
= 0; i
< map
->n
; ++i
) {
2790 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2801 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2802 enum isl_dim_type type
, unsigned first
, unsigned n
)
2804 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2808 /* Does the description of "bmap" depend on the specified dimensions?
2809 * We also check whether the dimensions appear in any of the div definitions.
2810 * In principle there is no need for this check. If the dimensions appear
2811 * in a div definition, they also appear in the defining constraints of that
2814 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2815 enum isl_dim_type type
, unsigned first
, unsigned n
)
2819 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2820 return isl_bool_error
;
2822 first
+= isl_basic_map_offset(bmap
, type
);
2823 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2824 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2825 return isl_bool_true
;
2826 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2827 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2828 return isl_bool_true
;
2829 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2830 if (isl_int_is_zero(bmap
->div
[i
][0]))
2832 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2833 return isl_bool_true
;
2836 return isl_bool_false
;
2839 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2840 enum isl_dim_type type
, unsigned first
, unsigned n
)
2844 if (isl_map_check_range(map
, type
, first
, n
) < 0)
2845 return isl_bool_error
;
2847 for (i
= 0; i
< map
->n
; ++i
) {
2848 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2850 if (involves
< 0 || involves
)
2854 return isl_bool_false
;
2857 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2858 enum isl_dim_type type
, unsigned first
, unsigned n
)
2860 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2863 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2864 enum isl_dim_type type
, unsigned first
, unsigned n
)
2866 return isl_map_involves_dims(set
, type
, first
, n
);
2869 /* Drop all constraints in bmap that involve any of the dimensions
2870 * first to first+n-1.
2872 static __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving(
2873 __isl_take isl_basic_map
*bmap
, unsigned first
, unsigned n
)
2880 bmap
= isl_basic_map_cow(bmap
);
2885 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2886 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) == -1)
2888 isl_basic_map_drop_equality(bmap
, i
);
2891 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2892 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) == -1)
2894 isl_basic_map_drop_inequality(bmap
, i
);
2897 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2901 /* Drop all constraints in bset that involve any of the dimensions
2902 * first to first+n-1.
2904 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving(
2905 __isl_take isl_basic_set
*bset
, unsigned first
, unsigned n
)
2907 return isl_basic_map_drop_constraints_involving(bset
, first
, n
);
2910 /* Drop all constraints in bmap that do not involve any of the dimensions
2911 * first to first + n - 1 of the given type.
2913 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_not_involving_dims(
2914 __isl_take isl_basic_map
*bmap
,
2915 enum isl_dim_type type
, unsigned first
, unsigned n
)
2920 isl_space
*space
= isl_basic_map_get_space(bmap
);
2921 isl_basic_map_free(bmap
);
2922 return isl_basic_map_universe(space
);
2924 bmap
= isl_basic_map_cow(bmap
);
2928 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2929 return isl_basic_map_free(bmap
);
2931 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2933 for (i
= bmap
->n_eq
- 1; i
>= 0; --i
) {
2934 if (isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + first
, n
) != -1)
2936 isl_basic_map_drop_equality(bmap
, i
);
2939 for (i
= bmap
->n_ineq
- 1; i
>= 0; --i
) {
2940 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + 1 + first
, n
) != -1)
2942 isl_basic_map_drop_inequality(bmap
, i
);
2945 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
2949 /* Drop all constraints in bset that do not involve any of the dimensions
2950 * first to first + n - 1 of the given type.
2952 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_not_involving_dims(
2953 __isl_take isl_basic_set
*bset
,
2954 enum isl_dim_type type
, unsigned first
, unsigned n
)
2956 return isl_basic_map_drop_constraints_not_involving_dims(bset
,
2960 /* Drop all constraints in bmap that involve any of the dimensions
2961 * first to first + n - 1 of the given type.
2963 __isl_give isl_basic_map
*isl_basic_map_drop_constraints_involving_dims(
2964 __isl_take isl_basic_map
*bmap
,
2965 enum isl_dim_type type
, unsigned first
, unsigned n
)
2972 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
2973 return isl_basic_map_free(bmap
);
2975 bmap
= isl_basic_map_remove_divs_involving_dims(bmap
, type
, first
, n
);
2976 first
+= isl_basic_map_offset(bmap
, type
) - 1;
2977 return isl_basic_map_drop_constraints_involving(bmap
, first
, n
);
2980 /* Drop all constraints in bset that involve any of the dimensions
2981 * first to first + n - 1 of the given type.
2983 __isl_give isl_basic_set
*isl_basic_set_drop_constraints_involving_dims(
2984 __isl_take isl_basic_set
*bset
,
2985 enum isl_dim_type type
, unsigned first
, unsigned n
)
2987 return isl_basic_map_drop_constraints_involving_dims(bset
,
2991 /* Drop constraints from "map" by applying "drop" to each basic map.
2993 static __isl_give isl_map
*drop_constraints(__isl_take isl_map
*map
,
2994 enum isl_dim_type type
, unsigned first
, unsigned n
,
2995 __isl_give isl_basic_map
*(*drop
)(__isl_take isl_basic_map
*bmap
,
2996 enum isl_dim_type type
, unsigned first
, unsigned n
))
3000 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3001 return isl_map_free(map
);
3003 map
= isl_map_cow(map
);
3007 for (i
= 0; i
< map
->n
; ++i
) {
3008 map
->p
[i
] = drop(map
->p
[i
], type
, first
, n
);
3010 return isl_map_free(map
);
3014 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3019 /* Drop all constraints in map that involve any of the dimensions
3020 * first to first + n - 1 of the given type.
3022 __isl_give isl_map
*isl_map_drop_constraints_involving_dims(
3023 __isl_take isl_map
*map
,
3024 enum isl_dim_type type
, unsigned first
, unsigned n
)
3028 return drop_constraints(map
, type
, first
, n
,
3029 &isl_basic_map_drop_constraints_involving_dims
);
3032 /* Drop all constraints in "map" that do not involve any of the dimensions
3033 * first to first + n - 1 of the given type.
3035 __isl_give isl_map
*isl_map_drop_constraints_not_involving_dims(
3036 __isl_take isl_map
*map
,
3037 enum isl_dim_type type
, unsigned first
, unsigned n
)
3040 isl_space
*space
= isl_map_get_space(map
);
3042 return isl_map_universe(space
);
3044 return drop_constraints(map
, type
, first
, n
,
3045 &isl_basic_map_drop_constraints_not_involving_dims
);
3048 /* Drop all constraints in set that involve any of the dimensions
3049 * first to first + n - 1 of the given type.
3051 __isl_give isl_set
*isl_set_drop_constraints_involving_dims(
3052 __isl_take isl_set
*set
,
3053 enum isl_dim_type type
, unsigned first
, unsigned n
)
3055 return isl_map_drop_constraints_involving_dims(set
, type
, first
, n
);
3058 /* Drop all constraints in "set" that do not involve any of the dimensions
3059 * first to first + n - 1 of the given type.
3061 __isl_give isl_set
*isl_set_drop_constraints_not_involving_dims(
3062 __isl_take isl_set
*set
,
3063 enum isl_dim_type type
, unsigned first
, unsigned n
)
3065 return isl_map_drop_constraints_not_involving_dims(set
, type
, first
, n
);
3068 /* Does local variable "div" of "bmap" have a complete explicit representation?
3069 * Having a complete explicit representation requires not only
3070 * an explicit representation, but also that all local variables
3071 * that appear in this explicit representation in turn have
3072 * a complete explicit representation.
3074 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
3077 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
3080 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
3081 if (marked
< 0 || marked
)
3082 return isl_bool_not(marked
);
3084 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3087 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
3089 known
= isl_basic_map_div_is_known(bmap
, i
);
3090 if (known
< 0 || !known
)
3094 return isl_bool_true
;
3097 /* Remove all divs that are unknown or defined in terms of unknown divs.
3099 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
3100 __isl_take isl_basic_map
*bmap
)
3107 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
3108 if (isl_basic_map_div_is_known(bmap
, i
))
3110 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
3119 /* Remove all divs that are unknown or defined in terms of unknown divs.
3121 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
3122 __isl_take isl_basic_set
*bset
)
3124 return isl_basic_map_remove_unknown_divs(bset
);
3127 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
3136 map
= isl_map_cow(map
);
3140 for (i
= 0; i
< map
->n
; ++i
) {
3141 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
3151 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
3153 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
3156 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
3157 __isl_take isl_basic_set
*bset
,
3158 enum isl_dim_type type
, unsigned first
, unsigned n
)
3160 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3161 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3162 return bset_from_bmap(bmap
);
3165 __isl_give isl_map
*isl_map_remove_dims(__isl_take isl_map
*map
,
3166 enum isl_dim_type type
, unsigned first
, unsigned n
)
3173 map
= isl_map_cow(map
);
3174 if (isl_map_check_range(map
, type
, first
, n
) < 0)
3175 return isl_map_free(map
);
3177 for (i
= 0; i
< map
->n
; ++i
) {
3178 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
3179 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
3183 map
= isl_map_drop(map
, type
, first
, n
);
3190 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
3191 enum isl_dim_type type
, unsigned first
, unsigned n
)
3193 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
3197 /* Project out n inputs starting at first using Fourier-Motzkin */
3198 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
3199 unsigned first
, unsigned n
)
3201 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
3204 static void dump_term(struct isl_basic_map
*bmap
,
3205 isl_int c
, int pos
, FILE *out
)
3208 unsigned in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3209 unsigned dim
= in
+ isl_basic_map_dim(bmap
, isl_dim_out
);
3210 unsigned nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3212 isl_int_print(out
, c
, 0);
3214 if (!isl_int_is_one(c
))
3215 isl_int_print(out
, c
, 0);
3216 if (pos
< 1 + nparam
) {
3217 name
= isl_space_get_dim_name(bmap
->dim
,
3218 isl_dim_param
, pos
- 1);
3220 fprintf(out
, "%s", name
);
3222 fprintf(out
, "p%d", pos
- 1);
3223 } else if (pos
< 1 + nparam
+ in
)
3224 fprintf(out
, "i%d", pos
- 1 - nparam
);
3225 else if (pos
< 1 + nparam
+ dim
)
3226 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
3228 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
3232 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
3233 int sign
, FILE *out
)
3237 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
3241 for (i
= 0, first
= 1; i
< len
; ++i
) {
3242 if (isl_int_sgn(c
[i
]) * sign
<= 0)
3245 fprintf(out
, " + ");
3247 isl_int_abs(v
, c
[i
]);
3248 dump_term(bmap
, v
, i
, out
);
3255 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
3256 const char *op
, FILE *out
, int indent
)
3260 fprintf(out
, "%*s", indent
, "");
3262 dump_constraint_sign(bmap
, c
, 1, out
);
3263 fprintf(out
, " %s ", op
);
3264 dump_constraint_sign(bmap
, c
, -1, out
);
3268 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
3269 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
3271 fprintf(out
, "%*s", indent
, "");
3272 fprintf(out
, "ERROR: unused div coefficient not zero\n");
3277 static void dump_constraints(struct isl_basic_map
*bmap
,
3278 isl_int
**c
, unsigned n
,
3279 const char *op
, FILE *out
, int indent
)
3283 for (i
= 0; i
< n
; ++i
)
3284 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
3287 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
3291 unsigned total
= isl_basic_map_total_dim(bmap
);
3293 for (j
= 0; j
< 1 + total
; ++j
) {
3294 if (isl_int_is_zero(exp
[j
]))
3296 if (!first
&& isl_int_is_pos(exp
[j
]))
3298 dump_term(bmap
, exp
[j
], j
, out
);
3303 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
3307 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
3308 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
3310 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3311 fprintf(out
, "%*s", indent
, "");
3312 fprintf(out
, "e%d = [(", i
);
3313 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
3315 isl_int_print(out
, bmap
->div
[i
][0], 0);
3316 fprintf(out
, "]\n");
3320 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
3321 FILE *out
, int indent
)
3324 fprintf(out
, "null basic set\n");
3328 fprintf(out
, "%*s", indent
, "");
3329 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
3330 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
3331 bset
->extra
, bset
->flags
);
3332 dump(bset_to_bmap(bset
), out
, indent
);
3335 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
3336 FILE *out
, int indent
)
3339 fprintf(out
, "null basic map\n");
3343 fprintf(out
, "%*s", indent
, "");
3344 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
3345 "flags: %x, n_name: %d\n",
3347 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
3348 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
3349 dump(bmap
, out
, indent
);
3352 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
3357 total
= isl_basic_map_total_dim(bmap
);
3358 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
3359 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
3360 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
3361 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
3362 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
3366 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
3371 if (isl_space_dim(space
, isl_dim_in
) != 0)
3372 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
3373 "set cannot have input dimensions", goto error
);
3374 return isl_map_alloc_space(space
, n
, flags
);
3376 isl_space_free(space
);
3380 /* Make sure "map" has room for at least "n" more basic maps.
3382 __isl_give isl_map
*isl_map_grow(__isl_take isl_map
*map
, int n
)
3385 struct isl_map
*grown
= NULL
;
3389 isl_assert(map
->ctx
, n
>= 0, goto error
);
3390 if (map
->n
+ n
<= map
->size
)
3392 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
3395 for (i
= 0; i
< map
->n
; ++i
) {
3396 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
3404 isl_map_free(grown
);
3409 /* Make sure "set" has room for at least "n" more basic sets.
3411 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
3413 return set_from_map(isl_map_grow(set_to_map(set
), n
));
3416 __isl_give isl_set
*isl_set_from_basic_set(__isl_take isl_basic_set
*bset
)
3418 return isl_map_from_basic_map(bset
);
3421 __isl_give isl_map
*isl_map_from_basic_map(__isl_take isl_basic_map
*bmap
)
3423 struct isl_map
*map
;
3428 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
3429 return isl_map_add_basic_map(map
, bmap
);
3432 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
3433 __isl_take isl_basic_set
*bset
)
3435 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
3436 bset_to_bmap(bset
)));
3439 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
3441 return isl_map_free(set
);
3444 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
3449 fprintf(out
, "null set\n");
3453 fprintf(out
, "%*s", indent
, "");
3454 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
3455 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
3457 for (i
= 0; i
< set
->n
; ++i
) {
3458 fprintf(out
, "%*s", indent
, "");
3459 fprintf(out
, "basic set %d:\n", i
);
3460 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
3464 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
3469 fprintf(out
, "null map\n");
3473 fprintf(out
, "%*s", indent
, "");
3474 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
3475 "flags: %x, n_name: %d\n",
3476 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
3477 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
3478 for (i
= 0; i
< map
->n
; ++i
) {
3479 fprintf(out
, "%*s", indent
, "");
3480 fprintf(out
, "basic map %d:\n", i
);
3481 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
3485 __isl_give isl_basic_map
*isl_basic_map_intersect_domain(
3486 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3488 struct isl_basic_map
*bmap_domain
;
3490 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3493 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
3494 isl_assert(bset
->ctx
,
3495 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
3497 bmap
= isl_basic_map_cow(bmap
);
3500 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3501 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3502 bmap_domain
= isl_basic_map_from_domain(bset
);
3503 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
3505 bmap
= isl_basic_map_simplify(bmap
);
3506 return isl_basic_map_finalize(bmap
);
3508 isl_basic_map_free(bmap
);
3509 isl_basic_set_free(bset
);
3513 /* Check that the space of "bset" is the same as that of the range of "bmap".
3515 static isl_stat
isl_basic_map_check_compatible_range(
3516 __isl_keep isl_basic_map
*bmap
, __isl_keep isl_basic_set
*bset
)
3520 ok
= isl_basic_map_compatible_range(bmap
, bset
);
3522 return isl_stat_error
;
3524 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
3525 "incompatible spaces", return isl_stat_error
);
3530 __isl_give isl_basic_map
*isl_basic_map_intersect_range(
3531 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*bset
)
3533 struct isl_basic_map
*bmap_range
;
3535 if (isl_basic_map_check_equal_params(bmap
, bset_to_bmap(bset
)) < 0)
3538 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0 &&
3539 isl_basic_map_check_compatible_range(bmap
, bset
) < 0)
3542 if (isl_basic_set_plain_is_universe(bset
)) {
3543 isl_basic_set_free(bset
);
3547 bmap
= isl_basic_map_cow(bmap
);
3550 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
3551 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
3552 bmap_range
= bset_to_bmap(bset
);
3553 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
3555 bmap
= isl_basic_map_simplify(bmap
);
3556 return isl_basic_map_finalize(bmap
);
3558 isl_basic_map_free(bmap
);
3559 isl_basic_set_free(bset
);
3563 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
3564 __isl_keep isl_vec
*vec
)
3571 return isl_bool_error
;
3573 total
= 1 + isl_basic_map_total_dim(bmap
);
3574 if (total
!= vec
->size
)
3575 return isl_bool_false
;
3579 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3580 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
3581 if (!isl_int_is_zero(s
)) {
3583 return isl_bool_false
;
3587 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3588 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
3589 if (isl_int_is_neg(s
)) {
3591 return isl_bool_false
;
3597 return isl_bool_true
;
3600 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
3601 __isl_keep isl_vec
*vec
)
3603 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
3606 __isl_give isl_basic_map
*isl_basic_map_intersect(
3607 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
3609 struct isl_vec
*sample
= NULL
;
3611 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
3613 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
3614 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
3615 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3616 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3617 return isl_basic_map_intersect(bmap2
, bmap1
);
3619 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
3620 isl_space_dim(bmap2
->dim
, isl_dim_param
))
3621 isl_assert(bmap1
->ctx
,
3622 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3624 if (isl_basic_map_plain_is_empty(bmap1
)) {
3625 isl_basic_map_free(bmap2
);
3628 if (isl_basic_map_plain_is_empty(bmap2
)) {
3629 isl_basic_map_free(bmap1
);
3633 if (bmap1
->sample
&&
3634 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3635 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3636 sample
= isl_vec_copy(bmap1
->sample
);
3637 else if (bmap2
->sample
&&
3638 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3639 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3640 sample
= isl_vec_copy(bmap2
->sample
);
3642 bmap1
= isl_basic_map_cow(bmap1
);
3645 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3646 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3647 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3650 isl_vec_free(sample
);
3652 isl_vec_free(bmap1
->sample
);
3653 bmap1
->sample
= sample
;
3656 bmap1
= isl_basic_map_simplify(bmap1
);
3657 return isl_basic_map_finalize(bmap1
);
3660 isl_vec_free(sample
);
3661 isl_basic_map_free(bmap1
);
3662 isl_basic_map_free(bmap2
);
3666 struct isl_basic_set
*isl_basic_set_intersect(
3667 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3669 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3670 bset_to_bmap(bset2
)));
3673 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3674 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3676 return isl_basic_set_intersect(bset1
, bset2
);
3679 /* Special case of isl_map_intersect, where both map1 and map2
3680 * are convex, without any divs and such that either map1 or map2
3681 * contains a single constraint. This constraint is then simply
3682 * added to the other map.
3684 static __isl_give isl_map
*map_intersect_add_constraint(
3685 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3687 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3688 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3689 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3690 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3692 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3693 return isl_map_intersect(map2
, map1
);
3695 map1
= isl_map_cow(map1
);
3698 if (isl_map_plain_is_empty(map1
)) {
3702 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3703 if (map2
->p
[0]->n_eq
== 1)
3704 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3706 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3707 map2
->p
[0]->ineq
[0]);
3709 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3710 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3714 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3715 isl_basic_map_free(map1
->p
[0]);
3721 map1
= isl_map_unmark_normalized(map1
);
3729 /* map2 may be either a parameter domain or a map living in the same
3732 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3733 __isl_take isl_map
*map2
)
3743 if ((isl_map_plain_is_empty(map1
) ||
3744 isl_map_plain_is_universe(map2
)) &&
3745 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3749 if ((isl_map_plain_is_empty(map2
) ||
3750 isl_map_plain_is_universe(map1
)) &&
3751 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3756 if (map1
->n
== 1 && map2
->n
== 1 &&
3757 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3758 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3759 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3760 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3761 return map_intersect_add_constraint(map1
, map2
);
3763 equal
= isl_map_plain_is_equal(map1
, map2
);
3771 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3772 isl_space_dim(map2
->dim
, isl_dim_param
))
3773 isl_assert(map1
->ctx
,
3774 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3776 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3777 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3778 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3780 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3781 map1
->n
* map2
->n
, flags
);
3784 for (i
= 0; i
< map1
->n
; ++i
)
3785 for (j
= 0; j
< map2
->n
; ++j
) {
3786 struct isl_basic_map
*part
;
3787 part
= isl_basic_map_intersect(
3788 isl_basic_map_copy(map1
->p
[i
]),
3789 isl_basic_map_copy(map2
->p
[j
]));
3790 if (isl_basic_map_is_empty(part
) < 0)
3791 part
= isl_basic_map_free(part
);
3792 result
= isl_map_add_basic_map(result
, part
);
3805 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3806 __isl_take isl_map
*map2
)
3810 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3811 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3812 "spaces don't match", goto error
);
3813 return map_intersect_internal(map1
, map2
);
3820 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3821 __isl_take isl_map
*map2
)
3823 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3826 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3828 return set_from_map(isl_map_intersect(set_to_map(set1
),
3832 /* map_intersect_internal accepts intersections
3833 * with parameter domains, so we can just call that function.
3835 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3836 __isl_take isl_set
*params
)
3838 return map_intersect_internal(map
, params
);
3841 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3842 __isl_take isl_map
*map2
)
3844 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3847 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3848 __isl_take isl_set
*params
)
3850 return isl_map_intersect_params(set
, params
);
3853 __isl_give isl_basic_map
*isl_basic_map_reverse(__isl_take isl_basic_map
*bmap
)
3856 unsigned pos
, n1
, n2
;
3860 bmap
= isl_basic_map_cow(bmap
);
3863 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3864 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3865 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3866 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3867 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3868 return isl_basic_map_reset_space(bmap
, space
);
3871 static __isl_give isl_basic_map
*basic_map_space_reset(
3872 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3878 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3881 space
= isl_basic_map_get_space(bmap
);
3882 space
= isl_space_reset(space
, type
);
3883 bmap
= isl_basic_map_reset_space(bmap
, space
);
3887 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3888 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3889 unsigned pos
, unsigned n
)
3892 isl_space
*res_space
;
3893 struct isl_basic_map
*res
;
3894 struct isl_dim_map
*dim_map
;
3895 unsigned total
, off
;
3896 enum isl_dim_type t
;
3899 return basic_map_space_reset(bmap
, type
);
3901 res_space
= isl_space_insert_dims(isl_basic_map_get_space(bmap
),
3904 return isl_basic_map_free(bmap
);
3906 total
= isl_basic_map_total_dim(bmap
) + n
;
3907 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3909 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3911 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3913 unsigned size
= isl_basic_map_dim(bmap
, t
);
3914 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3916 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3917 pos
, size
- pos
, off
+ pos
+ n
);
3919 off
+= isl_space_dim(res_space
, t
);
3921 isl_dim_map_div(dim_map
, bmap
, off
);
3923 res
= isl_basic_map_alloc_space(res_space
,
3924 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3925 rational
= isl_basic_map_is_rational(bmap
);
3927 res
= isl_basic_map_free(res
);
3929 res
= isl_basic_map_set_rational(res
);
3930 if (isl_basic_map_plain_is_empty(bmap
)) {
3931 isl_basic_map_free(bmap
);
3933 return isl_basic_map_set_to_empty(res
);
3935 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3936 return isl_basic_map_finalize(res
);
3939 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3940 __isl_take isl_basic_set
*bset
,
3941 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3943 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3946 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3947 enum isl_dim_type type
, unsigned n
)
3951 return isl_basic_map_insert_dims(bmap
, type
,
3952 isl_basic_map_dim(bmap
, type
), n
);
3955 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3956 enum isl_dim_type type
, unsigned n
)
3960 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3961 return isl_basic_map_add_dims(bset
, type
, n
);
3963 isl_basic_set_free(bset
);
3967 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3968 enum isl_dim_type type
)
3972 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3975 space
= isl_map_get_space(map
);
3976 space
= isl_space_reset(space
, type
);
3977 map
= isl_map_reset_space(map
, space
);
3981 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3982 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3987 return map_space_reset(map
, type
);
3989 map
= isl_map_cow(map
);
3993 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3997 for (i
= 0; i
< map
->n
; ++i
) {
3998 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
4009 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
4010 enum isl_dim_type type
, unsigned pos
, unsigned n
)
4012 return isl_map_insert_dims(set
, type
, pos
, n
);
4015 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
4016 enum isl_dim_type type
, unsigned n
)
4020 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
4023 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
4024 enum isl_dim_type type
, unsigned n
)
4028 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
4029 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
4035 __isl_give isl_basic_map
*isl_basic_map_move_dims(
4036 __isl_take isl_basic_map
*bmap
,
4037 enum isl_dim_type dst_type
, unsigned dst_pos
,
4038 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4040 struct isl_dim_map
*dim_map
;
4041 struct isl_basic_map
*res
;
4042 enum isl_dim_type t
;
4043 unsigned total
, off
;
4048 bmap
= isl_basic_map_reset(bmap
, src_type
);
4049 bmap
= isl_basic_map_reset(bmap
, dst_type
);
4053 if (isl_basic_map_check_range(bmap
, src_type
, src_pos
, n
) < 0)
4054 return isl_basic_map_free(bmap
);
4056 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4059 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
4061 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
4062 pos(bmap
->dim
, src_type
) + src_pos
+
4063 ((src_type
< dst_type
) ? n
: 0)) {
4064 bmap
= isl_basic_map_cow(bmap
);
4068 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4069 src_type
, src_pos
, n
);
4073 bmap
= isl_basic_map_finalize(bmap
);
4078 total
= isl_basic_map_total_dim(bmap
);
4079 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4082 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4083 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4084 if (t
== dst_type
) {
4085 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4088 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
4091 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4092 dst_pos
, size
- dst_pos
, off
);
4093 off
+= size
- dst_pos
;
4094 } else if (t
== src_type
) {
4095 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4098 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4099 src_pos
+ n
, size
- src_pos
- n
, off
);
4100 off
+= size
- src_pos
- n
;
4102 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4106 isl_dim_map_div(dim_map
, bmap
, off
);
4108 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4109 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4110 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4114 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
4115 src_type
, src_pos
, n
);
4119 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
4120 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4121 bmap
= isl_basic_map_finalize(bmap
);
4125 isl_basic_map_free(bmap
);
4129 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
4130 enum isl_dim_type dst_type
, unsigned dst_pos
,
4131 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4133 isl_basic_map
*bmap
= bset_to_bmap(bset
);
4134 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
4135 src_type
, src_pos
, n
);
4136 return bset_from_bmap(bmap
);
4139 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
4140 enum isl_dim_type dst_type
, unsigned dst_pos
,
4141 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4145 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
4146 return set_from_map(isl_map_move_dims(set_to_map(set
),
4147 dst_type
, dst_pos
, src_type
, src_pos
, n
));
4153 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
4154 enum isl_dim_type dst_type
, unsigned dst_pos
,
4155 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
4160 map
= isl_map_reset(map
, src_type
);
4161 map
= isl_map_reset(map
, dst_type
);
4165 if (isl_map_check_range(map
, src_type
, src_pos
, n
))
4166 return isl_map_free(map
);
4168 if (dst_type
== src_type
&& dst_pos
== src_pos
)
4171 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
4173 map
= isl_map_cow(map
);
4177 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
4181 for (i
= 0; i
< map
->n
; ++i
) {
4182 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
4184 src_type
, src_pos
, n
);
4195 /* Move the specified dimensions to the last columns right before
4196 * the divs. Don't change the dimension specification of bmap.
4197 * That's the responsibility of the caller.
4199 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
4200 enum isl_dim_type type
, unsigned first
, unsigned n
)
4202 struct isl_dim_map
*dim_map
;
4203 struct isl_basic_map
*res
;
4204 enum isl_dim_type t
;
4205 unsigned total
, off
;
4209 if (pos(bmap
->dim
, type
) + first
+ n
==
4210 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
4213 total
= isl_basic_map_total_dim(bmap
);
4214 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4217 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
4218 unsigned size
= isl_space_dim(bmap
->dim
, t
);
4220 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4223 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4224 first
, n
, total
- bmap
->n_div
- n
);
4225 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
4226 first
+ n
, size
- (first
+ n
), off
);
4227 off
+= size
- (first
+ n
);
4229 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
4233 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
4235 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
4236 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
4237 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
4241 /* Insert "n" rows in the divs of "bmap".
4243 * The number of columns is not changed, which means that the last
4244 * dimensions of "bmap" are being reintepreted as the new divs.
4245 * The space of "bmap" is not adjusted, however, which means
4246 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
4247 * from the space of "bmap" is the responsibility of the caller.
4249 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
4257 bmap
= isl_basic_map_cow(bmap
);
4261 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
4262 old
= bmap
->block2
.data
;
4263 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
4264 (bmap
->extra
+ n
) * (1 + row_size
));
4265 if (!bmap
->block2
.data
)
4266 return isl_basic_map_free(bmap
);
4267 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
4269 return isl_basic_map_free(bmap
);
4270 for (i
= 0; i
< n
; ++i
) {
4271 new_div
[i
] = bmap
->block2
.data
+
4272 (bmap
->extra
+ i
) * (1 + row_size
);
4273 isl_seq_clr(new_div
[i
], 1 + row_size
);
4275 for (i
= 0; i
< bmap
->extra
; ++i
)
4276 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
4278 bmap
->div
= new_div
;
4285 /* Drop constraints from "bmap" that only involve the variables
4286 * of "type" in the range [first, first + n] that are not related
4287 * to any of the variables outside that interval.
4288 * These constraints cannot influence the values for the variables
4289 * outside the interval, except in case they cause "bmap" to be empty.
4290 * Only drop the constraints if "bmap" is known to be non-empty.
4292 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
4293 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
4294 unsigned first
, unsigned n
)
4298 unsigned dim
, n_div
;
4301 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
4303 return isl_basic_map_free(bmap
);
4307 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
4308 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4309 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
4311 return isl_basic_map_free(bmap
);
4312 first
+= isl_basic_map_offset(bmap
, type
) - 1;
4313 for (i
= 0; i
< first
; ++i
)
4315 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
4318 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
4323 /* Turn the n dimensions of type type, starting at first
4324 * into existentially quantified variables.
4326 * If a subset of the projected out variables are unrelated
4327 * to any of the variables that remain, then the constraints
4328 * involving this subset are simply dropped first.
4330 __isl_give isl_basic_map
*isl_basic_map_project_out(
4331 __isl_take isl_basic_map
*bmap
,
4332 enum isl_dim_type type
, unsigned first
, unsigned n
)
4337 return basic_map_space_reset(bmap
, type
);
4338 if (type
== isl_dim_div
)
4339 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
4340 "cannot project out existentially quantified variables",
4341 return isl_basic_map_free(bmap
));
4343 empty
= isl_basic_map_plain_is_empty(bmap
);
4345 return isl_basic_map_free(bmap
);
4347 bmap
= isl_basic_map_set_to_empty(bmap
);
4349 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
4353 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
4354 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
4356 if (isl_basic_map_check_range(bmap
, type
, first
, n
) < 0)
4357 return isl_basic_map_free(bmap
);
4359 bmap
= move_last(bmap
, type
, first
, n
);
4360 bmap
= isl_basic_map_cow(bmap
);
4361 bmap
= insert_div_rows(bmap
, n
);
4365 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
4368 bmap
= isl_basic_map_simplify(bmap
);
4369 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4370 return isl_basic_map_finalize(bmap
);
4372 isl_basic_map_free(bmap
);
4376 /* Turn the n dimensions of type type, starting at first
4377 * into existentially quantified variables.
4379 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
4380 enum isl_dim_type type
, unsigned first
, unsigned n
)
4382 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
4386 /* Turn the n dimensions of type type, starting at first
4387 * into existentially quantified variables.
4389 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
4390 enum isl_dim_type type
, unsigned first
, unsigned n
)
4395 return map_space_reset(map
, type
);
4397 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4398 return isl_map_free(map
);
4400 map
= isl_map_cow(map
);
4404 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
4408 for (i
= 0; i
< map
->n
; ++i
) {
4409 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
4420 /* Turn all the dimensions of type "type", except the "n" starting at "first"
4421 * into existentially quantified variables.
4423 __isl_give isl_map
*isl_map_project_onto(__isl_take isl_map
*map
,
4424 enum isl_dim_type type
, unsigned first
, unsigned n
)
4428 if (isl_map_check_range(map
, type
, first
, n
) < 0)
4429 return isl_map_free(map
);
4430 dim
= isl_map_dim(map
, type
);
4431 map
= isl_map_project_out(map
, type
, first
+ n
, dim
- (first
+ n
));
4432 map
= isl_map_project_out(map
, type
, 0, first
);
4436 /* Turn the n dimensions of type type, starting at first
4437 * into existentially quantified variables.
4439 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
4440 enum isl_dim_type type
, unsigned first
, unsigned n
)
4442 return set_from_map(isl_map_project_out(set_to_map(set
),
4446 /* Return a map that projects the elements in "set" onto their
4447 * "n" set dimensions starting at "first".
4448 * "type" should be equal to isl_dim_set.
4450 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
4451 enum isl_dim_type type
, unsigned first
, unsigned n
)
4459 if (type
!= isl_dim_set
)
4460 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4461 "only set dimensions can be projected out", goto error
);
4462 dim
= isl_set_dim(set
, isl_dim_set
);
4463 if (first
+ n
> dim
|| first
+ n
< first
)
4464 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
4465 "index out of bounds", goto error
);
4467 map
= isl_map_from_domain(set
);
4468 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
4469 for (i
= 0; i
< n
; ++i
)
4470 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
4478 static __isl_give isl_basic_map
*add_divs(__isl_take isl_basic_map
*bmap
,
4483 for (i
= 0; i
< n
; ++i
) {
4484 j
= isl_basic_map_alloc_div(bmap
);
4487 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
4491 isl_basic_map_free(bmap
);
4495 struct isl_basic_map
*isl_basic_map_apply_range(
4496 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4498 isl_space
*dim_result
= NULL
;
4499 struct isl_basic_map
*bmap
;
4500 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
4501 struct isl_dim_map
*dim_map1
, *dim_map2
;
4503 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4505 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
4506 bmap2
->dim
, isl_dim_in
))
4507 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4508 "spaces don't match", goto error
);
4510 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
4511 isl_space_copy(bmap2
->dim
));
4513 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4514 n_out
= isl_basic_map_dim(bmap2
, isl_dim_out
);
4515 n
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4516 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4518 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
4519 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4520 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4521 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4522 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4523 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4524 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
4525 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
4526 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4527 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4528 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4530 bmap
= isl_basic_map_alloc_space(dim_result
,
4531 bmap1
->n_div
+ bmap2
->n_div
+ n
,
4532 bmap1
->n_eq
+ bmap2
->n_eq
,
4533 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4534 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4535 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4536 bmap
= add_divs(bmap
, n
);
4537 bmap
= isl_basic_map_simplify(bmap
);
4538 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4539 return isl_basic_map_finalize(bmap
);
4541 isl_basic_map_free(bmap1
);
4542 isl_basic_map_free(bmap2
);
4546 struct isl_basic_set
*isl_basic_set_apply(
4547 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
4552 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
4555 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
4558 isl_basic_set_free(bset
);
4559 isl_basic_map_free(bmap
);
4563 struct isl_basic_map
*isl_basic_map_apply_domain(
4564 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4566 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
4568 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
4569 bmap2
->dim
, isl_dim_in
))
4570 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
4571 "spaces don't match", goto error
);
4573 bmap1
= isl_basic_map_reverse(bmap1
);
4574 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
4575 return isl_basic_map_reverse(bmap1
);
4577 isl_basic_map_free(bmap1
);
4578 isl_basic_map_free(bmap2
);
4582 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
4583 * A \cap B -> f(A) + f(B)
4585 __isl_give isl_basic_map
*isl_basic_map_sum(__isl_take isl_basic_map
*bmap1
,
4586 __isl_take isl_basic_map
*bmap2
)
4588 unsigned n_in
, n_out
, nparam
, total
, pos
;
4589 struct isl_basic_map
*bmap
= NULL
;
4590 struct isl_dim_map
*dim_map1
, *dim_map2
;
4593 if (!bmap1
|| !bmap2
)
4596 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
4599 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
4600 n_in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
4601 n_out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
4603 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
4604 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4605 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
4606 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4607 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
4608 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4609 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
4610 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
4611 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4612 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
4613 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
4615 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
4616 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
4617 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
4618 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4619 for (i
= 0; i
< n_out
; ++i
) {
4620 int j
= isl_basic_map_alloc_equality(bmap
);
4623 isl_seq_clr(bmap
->eq
[j
], 1+total
);
4624 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
4625 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
4626 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
4628 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4629 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4630 bmap
= add_divs(bmap
, 2 * n_out
);
4632 bmap
= isl_basic_map_simplify(bmap
);
4633 return isl_basic_map_finalize(bmap
);
4635 isl_basic_map_free(bmap
);
4636 isl_basic_map_free(bmap1
);
4637 isl_basic_map_free(bmap2
);
4641 /* Given two maps A -> f(A) and B -> g(B), construct a map
4642 * A \cap B -> f(A) + f(B)
4644 __isl_give isl_map
*isl_map_sum(__isl_take isl_map
*map1
,
4645 __isl_take isl_map
*map2
)
4647 struct isl_map
*result
;
4653 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
4655 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
4656 map1
->n
* map2
->n
, 0);
4659 for (i
= 0; i
< map1
->n
; ++i
)
4660 for (j
= 0; j
< map2
->n
; ++j
) {
4661 struct isl_basic_map
*part
;
4662 part
= isl_basic_map_sum(
4663 isl_basic_map_copy(map1
->p
[i
]),
4664 isl_basic_map_copy(map2
->p
[j
]));
4665 if (isl_basic_map_is_empty(part
))
4666 isl_basic_map_free(part
);
4668 result
= isl_map_add_basic_map(result
, part
);
4681 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4682 __isl_take isl_set
*set2
)
4684 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4687 /* Given a basic map A -> f(A), construct A -> -f(A).
4689 __isl_give isl_basic_map
*isl_basic_map_neg(__isl_take isl_basic_map
*bmap
)
4694 bmap
= isl_basic_map_cow(bmap
);
4698 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4699 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4700 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4701 for (j
= 0; j
< n
; ++j
)
4702 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4703 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4704 for (j
= 0; j
< n
; ++j
)
4705 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4706 for (i
= 0; i
< bmap
->n_div
; ++i
)
4707 for (j
= 0; j
< n
; ++j
)
4708 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4709 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4710 return isl_basic_map_finalize(bmap
);
4713 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4715 return isl_basic_map_neg(bset
);
4718 /* Given a map A -> f(A), construct A -> -f(A).
4720 __isl_give isl_map
*isl_map_neg(__isl_take isl_map
*map
)
4724 map
= isl_map_cow(map
);
4728 for (i
= 0; i
< map
->n
; ++i
) {
4729 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4740 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4742 return set_from_map(isl_map_neg(set_to_map(set
)));
4745 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4746 * A -> floor(f(A)/d).
4748 __isl_give isl_basic_map
*isl_basic_map_floordiv(__isl_take isl_basic_map
*bmap
,
4751 unsigned n_in
, n_out
, nparam
, total
, pos
;
4752 struct isl_basic_map
*result
= NULL
;
4753 struct isl_dim_map
*dim_map
;
4759 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4760 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4761 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4763 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4764 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4765 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4766 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4767 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4768 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4770 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4771 bmap
->n_div
+ n_out
,
4772 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4773 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4774 result
= add_divs(result
, n_out
);
4775 for (i
= 0; i
< n_out
; ++i
) {
4777 j
= isl_basic_map_alloc_inequality(result
);
4780 isl_seq_clr(result
->ineq
[j
], 1+total
);
4781 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4782 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4783 j
= isl_basic_map_alloc_inequality(result
);
4786 isl_seq_clr(result
->ineq
[j
], 1+total
);
4787 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4788 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4789 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4792 result
= isl_basic_map_simplify(result
);
4793 return isl_basic_map_finalize(result
);
4795 isl_basic_map_free(result
);
4799 /* Given a map A -> f(A) and an integer d, construct a map
4800 * A -> floor(f(A)/d).
4802 __isl_give isl_map
*isl_map_floordiv(__isl_take isl_map
*map
, isl_int d
)
4806 map
= isl_map_cow(map
);
4810 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4811 for (i
= 0; i
< map
->n
; ++i
) {
4812 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4816 map
= isl_map_unmark_normalized(map
);
4824 /* Given a map A -> f(A) and an integer d, construct a map
4825 * A -> floor(f(A)/d).
4827 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4828 __isl_take isl_val
*d
)
4832 if (!isl_val_is_int(d
))
4833 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4834 "expecting integer denominator", goto error
);
4835 map
= isl_map_floordiv(map
, d
->n
);
4844 static __isl_give isl_basic_map
*var_equal(__isl_take isl_basic_map
*bmap
,
4851 i
= isl_basic_map_alloc_equality(bmap
);
4854 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4855 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4856 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4857 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4858 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4859 return isl_basic_map_finalize(bmap
);
4861 isl_basic_map_free(bmap
);
4865 /* Add a constraint to "bmap" expressing i_pos < o_pos
4867 static __isl_give isl_basic_map
*var_less(__isl_take isl_basic_map
*bmap
,
4874 i
= isl_basic_map_alloc_inequality(bmap
);
4877 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4878 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4879 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4880 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4881 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4882 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4883 return isl_basic_map_finalize(bmap
);
4885 isl_basic_map_free(bmap
);
4889 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4891 static __isl_give isl_basic_map
*var_less_or_equal(
4892 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4898 i
= isl_basic_map_alloc_inequality(bmap
);
4901 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4902 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4903 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4904 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4905 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4906 return isl_basic_map_finalize(bmap
);
4908 isl_basic_map_free(bmap
);
4912 /* Add a constraint to "bmap" expressing i_pos > o_pos
4914 static __isl_give isl_basic_map
*var_more(__isl_take isl_basic_map
*bmap
,
4921 i
= isl_basic_map_alloc_inequality(bmap
);
4924 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4925 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4926 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4927 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4928 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4929 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4930 return isl_basic_map_finalize(bmap
);
4932 isl_basic_map_free(bmap
);
4936 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4938 static __isl_give isl_basic_map
*var_more_or_equal(
4939 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4945 i
= isl_basic_map_alloc_inequality(bmap
);
4948 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4949 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4950 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4951 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4952 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4953 return isl_basic_map_finalize(bmap
);
4955 isl_basic_map_free(bmap
);
4959 __isl_give isl_basic_map
*isl_basic_map_equal(
4960 __isl_take isl_space
*dim
, unsigned n_equal
)
4963 struct isl_basic_map
*bmap
;
4964 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4967 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4968 bmap
= var_equal(bmap
, i
);
4969 return isl_basic_map_finalize(bmap
);
4972 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4974 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4978 struct isl_basic_map
*bmap
;
4979 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4982 for (i
= 0; i
< pos
&& bmap
; ++i
)
4983 bmap
= var_equal(bmap
, i
);
4985 bmap
= var_less(bmap
, pos
);
4986 return isl_basic_map_finalize(bmap
);
4989 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4991 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4992 __isl_take isl_space
*dim
, unsigned pos
)
4995 isl_basic_map
*bmap
;
4997 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4998 for (i
= 0; i
< pos
; ++i
)
4999 bmap
= var_equal(bmap
, i
);
5000 bmap
= var_less_or_equal(bmap
, pos
);
5001 return isl_basic_map_finalize(bmap
);
5004 /* Return a relation on "dim" expressing i_pos > o_pos
5006 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
5010 struct isl_basic_map
*bmap
;
5011 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
5014 for (i
= 0; i
< pos
&& bmap
; ++i
)
5015 bmap
= var_equal(bmap
, i
);
5017 bmap
= var_more(bmap
, pos
);
5018 return isl_basic_map_finalize(bmap
);
5021 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
5023 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
5024 __isl_take isl_space
*dim
, unsigned pos
)
5027 isl_basic_map
*bmap
;
5029 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
5030 for (i
= 0; i
< pos
; ++i
)
5031 bmap
= var_equal(bmap
, i
);
5032 bmap
= var_more_or_equal(bmap
, pos
);
5033 return isl_basic_map_finalize(bmap
);
5036 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
5037 unsigned n
, int equal
)
5039 struct isl_map
*map
;
5042 if (n
== 0 && equal
)
5043 return isl_map_universe(dims
);
5045 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5047 for (i
= 0; i
+ 1 < n
; ++i
)
5048 map
= isl_map_add_basic_map(map
,
5049 isl_basic_map_less_at(isl_space_copy(dims
), i
));
5052 map
= isl_map_add_basic_map(map
,
5053 isl_basic_map_less_or_equal_at(dims
, n
- 1));
5055 map
= isl_map_add_basic_map(map
,
5056 isl_basic_map_less_at(dims
, n
- 1));
5058 isl_space_free(dims
);
5063 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
5067 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
5070 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
5072 return map_lex_lte_first(dim
, n
, 0);
5075 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
5077 return map_lex_lte_first(dim
, n
, 1);
5080 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
5082 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
5085 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
5087 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
5090 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
5091 unsigned n
, int equal
)
5093 struct isl_map
*map
;
5096 if (n
== 0 && equal
)
5097 return isl_map_universe(dims
);
5099 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
5101 for (i
= 0; i
+ 1 < n
; ++i
)
5102 map
= isl_map_add_basic_map(map
,
5103 isl_basic_map_more_at(isl_space_copy(dims
), i
));
5106 map
= isl_map_add_basic_map(map
,
5107 isl_basic_map_more_or_equal_at(dims
, n
- 1));
5109 map
= isl_map_add_basic_map(map
,
5110 isl_basic_map_more_at(dims
, n
- 1));
5112 isl_space_free(dims
);
5117 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
5121 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
5124 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
5126 return map_lex_gte_first(dim
, n
, 0);
5129 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
5131 return map_lex_gte_first(dim
, n
, 1);
5134 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
5136 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
5139 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
5141 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
5144 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
5145 __isl_take isl_set
*set2
)
5148 map
= isl_map_lex_le(isl_set_get_space(set1
));
5149 map
= isl_map_intersect_domain(map
, set1
);
5150 map
= isl_map_intersect_range(map
, set2
);
5154 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
5155 __isl_take isl_set
*set2
)
5158 map
= isl_map_lex_lt(isl_set_get_space(set1
));
5159 map
= isl_map_intersect_domain(map
, set1
);
5160 map
= isl_map_intersect_range(map
, set2
);
5164 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
5165 __isl_take isl_set
*set2
)
5168 map
= isl_map_lex_ge(isl_set_get_space(set1
));
5169 map
= isl_map_intersect_domain(map
, set1
);
5170 map
= isl_map_intersect_range(map
, set2
);
5174 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
5175 __isl_take isl_set
*set2
)
5178 map
= isl_map_lex_gt(isl_set_get_space(set1
));
5179 map
= isl_map_intersect_domain(map
, set1
);
5180 map
= isl_map_intersect_range(map
, set2
);
5184 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
5185 __isl_take isl_map
*map2
)
5188 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
5189 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5190 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5194 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
5195 __isl_take isl_map
*map2
)
5198 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
5199 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5200 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5204 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
5205 __isl_take isl_map
*map2
)
5208 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
5209 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5210 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5214 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
5215 __isl_take isl_map
*map2
)
5218 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
5219 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
5220 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
5224 /* For a div d = floor(f/m), add the constraint
5228 static isl_stat
add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
5229 unsigned pos
, isl_int
*div
)
5232 unsigned total
= isl_basic_map_total_dim(bmap
);
5234 i
= isl_basic_map_alloc_inequality(bmap
);
5236 return isl_stat_error
;
5237 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5238 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
5243 /* For a div d = floor(f/m), add the constraint
5245 * -(f-(m-1)) + m d >= 0
5247 static isl_stat
add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
5248 unsigned pos
, isl_int
*div
)
5251 unsigned total
= isl_basic_map_total_dim(bmap
);
5253 i
= isl_basic_map_alloc_inequality(bmap
);
5255 return isl_stat_error
;
5256 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
5257 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
5258 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
5259 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
5264 /* For a div d = floor(f/m), add the constraints
5267 * -(f-(m-1)) + m d >= 0
5269 * Note that the second constraint is the negation of
5273 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
5274 unsigned pos
, isl_int
*div
)
5276 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
5278 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
5283 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
5284 unsigned pos
, isl_int
*div
)
5286 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
5290 int isl_basic_map_add_div_constraints(__isl_keep isl_basic_map
*bmap
,
5293 unsigned total
= isl_basic_map_total_dim(bmap
);
5294 unsigned div_pos
= total
- bmap
->n_div
+ div
;
5296 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
5300 /* For each known div d = floor(f/m), add the constraints
5303 * -(f-(m-1)) + m d >= 0
5305 * Remove duplicate constraints in case of some these div constraints
5306 * already appear in "bmap".
5308 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
5309 __isl_take isl_basic_map
*bmap
)
5315 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
5319 bmap
= add_known_div_constraints(bmap
);
5320 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
5321 bmap
= isl_basic_map_finalize(bmap
);
5325 /* Add the div constraint of sign "sign" for div "div" of "bmap".
5327 * In particular, if this div is of the form d = floor(f/m),
5328 * then add the constraint
5332 * if sign < 0 or the constraint
5334 * -(f-(m-1)) + m d >= 0
5338 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
5339 unsigned div
, int sign
)
5347 total
= isl_basic_map_total_dim(bmap
);
5348 div_pos
= total
- bmap
->n_div
+ div
;
5351 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5353 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
5356 __isl_give isl_basic_set
*isl_basic_map_underlying_set(
5357 __isl_take isl_basic_map
*bmap
)
5361 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
5363 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
5364 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
5365 return bset_from_bmap(bmap
);
5366 bmap
= isl_basic_map_cow(bmap
);
5369 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
5372 bmap
->extra
-= bmap
->n_div
;
5374 bmap
= isl_basic_map_finalize(bmap
);
5375 return bset_from_bmap(bmap
);
5377 isl_basic_map_free(bmap
);
5381 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
5382 __isl_take isl_basic_set
*bset
)
5384 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
5387 /* Replace each element in "list" by the result of applying
5388 * isl_basic_map_underlying_set to the element.
5390 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
5391 __isl_take isl_basic_map_list
*list
)
5398 n
= isl_basic_map_list_n_basic_map(list
);
5399 for (i
= 0; i
< n
; ++i
) {
5400 isl_basic_map
*bmap
;
5401 isl_basic_set
*bset
;
5403 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
5404 bset
= isl_basic_set_underlying_set(bmap
);
5405 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
5411 __isl_give isl_basic_map
*isl_basic_map_overlying_set(
5412 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_map
*like
)
5414 struct isl_basic_map
*bmap
;
5415 struct isl_ctx
*ctx
;
5422 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
5423 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
5424 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
5426 if (like
->n_div
== 0) {
5427 isl_space
*space
= isl_basic_map_get_space(like
);
5428 isl_basic_map_free(like
);
5429 return isl_basic_map_reset_space(bset
, space
);
5431 bset
= isl_basic_set_cow(bset
);
5434 total
= bset
->dim
->n_out
+ bset
->extra
;
5435 bmap
= bset_to_bmap(bset
);
5436 isl_space_free(bmap
->dim
);
5437 bmap
->dim
= isl_space_copy(like
->dim
);
5440 bmap
->n_div
= like
->n_div
;
5441 bmap
->extra
+= like
->n_div
;
5445 ltotal
= total
- bmap
->extra
+ like
->extra
;
5448 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
5449 bmap
->extra
* (1 + 1 + total
));
5450 if (isl_blk_is_error(bmap
->block2
))
5452 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
5456 for (i
= 0; i
< bmap
->extra
; ++i
)
5457 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
5458 for (i
= 0; i
< like
->n_div
; ++i
) {
5459 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
5460 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
5462 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
5464 isl_basic_map_free(like
);
5465 bmap
= isl_basic_map_simplify(bmap
);
5466 bmap
= isl_basic_map_finalize(bmap
);
5469 isl_basic_map_free(like
);
5470 isl_basic_set_free(bset
);
5474 struct isl_basic_set
*isl_basic_set_from_underlying_set(
5475 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
5477 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
5478 bset_to_bmap(like
)));
5481 __isl_give isl_set
*isl_map_underlying_set(__isl_take isl_map
*map
)
5485 map
= isl_map_cow(map
);
5488 map
->dim
= isl_space_cow(map
->dim
);
5492 for (i
= 1; i
< map
->n
; ++i
)
5493 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
5495 for (i
= 0; i
< map
->n
; ++i
) {
5496 map
->p
[i
] = bset_to_bmap(
5497 isl_basic_map_underlying_set(map
->p
[i
]));
5502 map
->dim
= isl_space_underlying(map
->dim
, 0);
5504 isl_space_free(map
->dim
);
5505 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
5509 return set_from_map(map
);
5515 /* Replace the space of "bmap" by "space".
5517 * If the space of "bmap" is identical to "space" (including the identifiers
5518 * of the input and output dimensions), then simply return the original input.
5520 __isl_give isl_basic_map
*isl_basic_map_reset_space(
5521 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
5524 isl_space
*bmap_space
;
5526 bmap_space
= isl_basic_map_peek_space(bmap
);
5527 equal
= isl_space_is_equal(bmap_space
, space
);
5528 if (equal
>= 0 && equal
)
5529 equal
= isl_space_has_equal_ids(bmap_space
, space
);
5533 isl_space_free(space
);
5536 bmap
= isl_basic_map_cow(bmap
);
5537 if (!bmap
|| !space
)
5540 isl_space_free(bmap
->dim
);
5543 bmap
= isl_basic_map_finalize(bmap
);
5547 isl_basic_map_free(bmap
);
5548 isl_space_free(space
);
5552 __isl_give isl_basic_set
*isl_basic_set_reset_space(
5553 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
5555 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
5559 /* Check that the total dimensions of "map" and "space" are the same.
5561 static isl_stat
check_map_space_equal_total_dim(__isl_keep isl_map
*map
,
5562 __isl_keep isl_space
*space
)
5564 unsigned dim1
, dim2
;
5567 return isl_stat_error
;
5568 dim1
= isl_map_dim(map
, isl_dim_all
);
5569 dim2
= isl_space_dim(space
, isl_dim_all
);
5572 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5573 "total dimensions do not match", return isl_stat_error
);
5576 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
5577 __isl_take isl_space
*dim
)
5581 map
= isl_map_cow(map
);
5585 for (i
= 0; i
< map
->n
; ++i
) {
5586 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
5587 isl_space_copy(dim
));
5591 isl_space_free(map
->dim
);
5597 isl_space_free(dim
);
5601 /* Replace the space of "map" by "space", without modifying
5602 * the dimension of "map".
5604 * If the space of "map" is identical to "space" (including the identifiers
5605 * of the input and output dimensions), then simply return the original input.
5607 __isl_give isl_map
*isl_map_reset_equal_dim_space(__isl_take isl_map
*map
,
5608 __isl_take isl_space
*space
)
5611 isl_space
*map_space
;
5613 map_space
= isl_map_peek_space(map
);
5614 equal
= isl_space_is_equal(map_space
, space
);
5615 if (equal
>= 0 && equal
)
5616 equal
= isl_space_has_equal_ids(map_space
, space
);
5620 isl_space_free(space
);
5623 if (check_map_space_equal_total_dim(map
, space
) < 0)
5625 return isl_map_reset_space(map
, space
);
5628 isl_space_free(space
);
5632 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
5633 __isl_take isl_space
*dim
)
5635 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5638 /* Compute the parameter domain of the given basic set.
5640 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5646 is_params
= isl_basic_set_is_params(bset
);
5648 return isl_basic_set_free(bset
);
5652 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5653 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5654 space
= isl_basic_set_get_space(bset
);
5655 space
= isl_space_params(space
);
5656 bset
= isl_basic_set_reset_space(bset
, space
);
5660 /* Construct a zero-dimensional basic set with the given parameter domain.
5662 __isl_give isl_basic_set
*isl_basic_set_from_params(
5663 __isl_take isl_basic_set
*bset
)
5666 space
= isl_basic_set_get_space(bset
);
5667 space
= isl_space_set_from_params(space
);
5668 bset
= isl_basic_set_reset_space(bset
, space
);
5672 /* Compute the parameter domain of the given set.
5674 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5679 if (isl_set_is_params(set
))
5682 n
= isl_set_dim(set
, isl_dim_set
);
5683 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5684 space
= isl_set_get_space(set
);
5685 space
= isl_space_params(space
);
5686 set
= isl_set_reset_space(set
, space
);
5690 /* Construct a zero-dimensional set with the given parameter domain.
5692 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5695 space
= isl_set_get_space(set
);
5696 space
= isl_space_set_from_params(space
);
5697 set
= isl_set_reset_space(set
, space
);
5701 /* Compute the parameter domain of the given map.
5703 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5708 n
= isl_map_dim(map
, isl_dim_in
);
5709 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5710 n
= isl_map_dim(map
, isl_dim_out
);
5711 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5712 space
= isl_map_get_space(map
);
5713 space
= isl_space_params(space
);
5714 map
= isl_map_reset_space(map
, space
);
5718 __isl_give isl_basic_set
*isl_basic_map_domain(__isl_take isl_basic_map
*bmap
)
5725 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5727 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5728 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5730 return isl_basic_map_reset_space(bmap
, space
);
5733 isl_bool
isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5736 return isl_bool_error
;
5737 return isl_space_may_be_set(bmap
->dim
);
5740 /* Is this basic map actually a set?
5741 * Users should never call this function. Outside of isl,
5742 * the type should indicate whether something is a set or a map.
5744 isl_bool
isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5747 return isl_bool_error
;
5748 return isl_space_is_set(bmap
->dim
);
5751 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5755 is_set
= isl_basic_map_is_set(bmap
);
5760 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5762 isl_basic_map_free(bmap
);
5766 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5767 __isl_take isl_basic_map
*bmap
)
5771 isl_basic_map
*domain
;
5772 int nparam
, n_in
, n_out
;
5774 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5775 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5776 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5778 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5779 domain
= isl_basic_map_universe(dim
);
5781 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5782 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5783 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5785 for (i
= 0; i
< n_in
; ++i
)
5786 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, i
,
5789 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5790 return isl_basic_map_finalize(bmap
);
5793 __isl_give isl_basic_map
*isl_basic_map_range_map(
5794 __isl_take isl_basic_map
*bmap
)
5798 isl_basic_map
*range
;
5799 int nparam
, n_in
, n_out
;
5801 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5802 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5803 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5805 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5806 range
= isl_basic_map_universe(dim
);
5808 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5809 bmap
= isl_basic_map_apply_range(bmap
, range
);
5810 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5812 for (i
= 0; i
< n_out
; ++i
)
5813 bmap
= isl_basic_map_equate(bmap
, isl_dim_in
, n_in
+ i
,
5816 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5817 return isl_basic_map_finalize(bmap
);
5820 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5824 return isl_space_may_be_set(map
->dim
);
5827 /* Is this map actually a set?
5828 * Users should never call this function. Outside of isl,
5829 * the type should indicate whether something is a set or a map.
5831 isl_bool
isl_map_is_set(__isl_keep isl_map
*map
)
5834 return isl_bool_error
;
5835 return isl_space_is_set(map
->dim
);
5838 __isl_give isl_set
*isl_map_range(__isl_take isl_map
*map
)
5842 struct isl_set
*set
;
5844 is_set
= isl_map_is_set(map
);
5848 return set_from_map(map
);
5850 map
= isl_map_cow(map
);
5854 set
= set_from_map(map
);
5855 set
->dim
= isl_space_range(set
->dim
);
5858 for (i
= 0; i
< map
->n
; ++i
) {
5859 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5863 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5864 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5871 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5875 map
= isl_map_cow(map
);
5879 map
->dim
= isl_space_domain_map(map
->dim
);
5882 for (i
= 0; i
< map
->n
; ++i
) {
5883 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5887 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5888 map
= isl_map_unmark_normalized(map
);
5895 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5898 isl_space
*range_dim
;
5900 map
= isl_map_cow(map
);
5904 range_dim
= isl_space_range(isl_map_get_space(map
));
5905 range_dim
= isl_space_from_range(range_dim
);
5906 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5907 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5910 for (i
= 0; i
< map
->n
; ++i
) {
5911 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5915 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5916 map
= isl_map_unmark_normalized(map
);
5923 /* Given a wrapped map of the form A[B -> C],
5924 * return the map A[B -> C] -> B.
5926 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5933 if (!isl_set_has_tuple_id(set
))
5934 return isl_map_domain_map(isl_set_unwrap(set
));
5936 id
= isl_set_get_tuple_id(set
);
5937 map
= isl_map_domain_map(isl_set_unwrap(set
));
5938 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5943 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5944 __isl_take isl_basic_set
*bset
)
5946 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5949 __isl_give isl_basic_map
*isl_basic_map_from_range(
5950 __isl_take isl_basic_set
*bset
)
5953 space
= isl_basic_set_get_space(bset
);
5954 space
= isl_space_from_range(space
);
5955 bset
= isl_basic_set_reset_space(bset
, space
);
5956 return bset_to_bmap(bset
);
5959 /* Create a relation with the given set as range.
5960 * The domain of the created relation is a zero-dimensional
5961 * flat anonymous space.
5963 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5966 space
= isl_set_get_space(set
);
5967 space
= isl_space_from_range(space
);
5968 set
= isl_set_reset_space(set
, space
);
5969 return set_to_map(set
);
5972 /* Create a relation with the given set as domain.
5973 * The range of the created relation is a zero-dimensional
5974 * flat anonymous space.
5976 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5978 return isl_map_reverse(isl_map_from_range(set
));
5981 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5982 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5984 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5987 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5988 __isl_take isl_set
*range
)
5990 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5993 /* Return a newly allocated isl_map with given space and flags and
5994 * room for "n" basic maps.
5995 * Make sure that all cached information is cleared.
5997 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
6000 struct isl_map
*map
;
6005 isl_die(space
->ctx
, isl_error_internal
,
6006 "negative number of basic maps", goto error
);
6007 map
= isl_calloc(space
->ctx
, struct isl_map
,
6008 sizeof(struct isl_map
) +
6009 (n
- 1) * sizeof(struct isl_basic_map
*));
6013 map
->ctx
= space
->ctx
;
6014 isl_ctx_ref(map
->ctx
);
6022 isl_space_free(space
);
6026 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*space
)
6028 struct isl_basic_map
*bmap
;
6029 bmap
= isl_basic_map_alloc_space(space
, 0, 1, 0);
6030 bmap
= isl_basic_map_set_to_empty(bmap
);
6034 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*space
)
6036 struct isl_basic_set
*bset
;
6037 bset
= isl_basic_set_alloc_space(space
, 0, 1, 0);
6038 bset
= isl_basic_set_set_to_empty(bset
);
6042 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*space
)
6044 struct isl_basic_map
*bmap
;
6045 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 0);
6046 bmap
= isl_basic_map_finalize(bmap
);
6050 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*space
)
6052 struct isl_basic_set
*bset
;
6053 bset
= isl_basic_set_alloc_space(space
, 0, 0, 0);
6054 bset
= isl_basic_set_finalize(bset
);
6058 __isl_give isl_basic_map
*isl_basic_map_nat_universe(
6059 __isl_take isl_space
*space
)
6062 unsigned total
= isl_space_dim(space
, isl_dim_all
);
6063 isl_basic_map
*bmap
;
6065 bmap
= isl_basic_map_alloc_space(space
, 0, 0, total
);
6066 for (i
= 0; i
< total
; ++i
) {
6067 int k
= isl_basic_map_alloc_inequality(bmap
);
6070 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
6071 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
6075 isl_basic_map_free(bmap
);
6079 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
6081 return isl_basic_map_nat_universe(dim
);
6084 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
6086 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
6089 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
6091 return isl_map_nat_universe(dim
);
6094 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*space
)
6096 return isl_map_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6099 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*space
)
6101 return isl_set_alloc_space(space
, 0, ISL_MAP_DISJOINT
);
6104 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*space
)
6106 struct isl_map
*map
;
6109 map
= isl_map_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6110 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(space
));
6114 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*space
)
6116 struct isl_set
*set
;
6119 set
= isl_set_alloc_space(isl_space_copy(space
), 1, ISL_MAP_DISJOINT
);
6120 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(space
));
6124 struct isl_map
*isl_map_dup(struct isl_map
*map
)
6127 struct isl_map
*dup
;
6131 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
6132 for (i
= 0; i
< map
->n
; ++i
)
6133 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
6137 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
6138 __isl_take isl_basic_map
*bmap
)
6142 if (isl_basic_map_plain_is_empty(bmap
)) {
6143 isl_basic_map_free(bmap
);
6146 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
6147 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
6148 map
->p
[map
->n
] = bmap
;
6150 map
= isl_map_unmark_normalized(map
);
6156 isl_basic_map_free(bmap
);
6160 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
6171 isl_ctx_deref(map
->ctx
);
6172 for (i
= 0; i
< map
->n
; ++i
)
6173 isl_basic_map_free(map
->p
[i
]);
6174 isl_space_free(map
->dim
);
6180 static __isl_give isl_basic_map
*isl_basic_map_fix_pos_si(
6181 __isl_take isl_basic_map
*bmap
, unsigned pos
, int value
)
6185 bmap
= isl_basic_map_cow(bmap
);
6186 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6187 j
= isl_basic_map_alloc_equality(bmap
);
6190 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6191 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6192 isl_int_set_si(bmap
->eq
[j
][0], value
);
6193 bmap
= isl_basic_map_simplify(bmap
);
6194 return isl_basic_map_finalize(bmap
);
6196 isl_basic_map_free(bmap
);
6200 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
6201 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
6205 bmap
= isl_basic_map_cow(bmap
);
6206 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
6207 j
= isl_basic_map_alloc_equality(bmap
);
6210 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
6211 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
6212 isl_int_set(bmap
->eq
[j
][0], value
);
6213 bmap
= isl_basic_map_simplify(bmap
);
6214 return isl_basic_map_finalize(bmap
);
6216 isl_basic_map_free(bmap
);
6220 __isl_give isl_basic_map
*isl_basic_map_fix_si(__isl_take isl_basic_map
*bmap
,
6221 enum isl_dim_type type
, unsigned pos
, int value
)
6223 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6224 return isl_basic_map_free(bmap
);
6225 return isl_basic_map_fix_pos_si(bmap
,
6226 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6229 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
6230 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6232 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6233 return isl_basic_map_free(bmap
);
6234 return isl_basic_map_fix_pos(bmap
,
6235 isl_basic_map_offset(bmap
, type
) + pos
, value
);
6238 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
6239 * to be equal to "v".
6241 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
6242 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6246 if (!isl_val_is_int(v
))
6247 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6248 "expecting integer value", goto error
);
6249 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6251 pos
+= isl_basic_map_offset(bmap
, type
);
6252 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
6256 isl_basic_map_free(bmap
);
6261 /* Fix the value of the variable at position "pos" of type "type" of "bset"
6262 * to be equal to "v".
6264 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
6265 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6267 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
6270 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
6271 enum isl_dim_type type
, unsigned pos
, int value
)
6273 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6277 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
6278 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6280 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
6284 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
6285 unsigned input
, int value
)
6287 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
6290 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
6291 unsigned dim
, int value
)
6293 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
6294 isl_dim_set
, dim
, value
));
6297 /* Remove the basic map at position "i" from "map" if this basic map
6298 * is (obviously) empty.
6300 static __isl_give isl_map
*remove_if_empty(__isl_take isl_map
*map
, int i
)
6307 empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
6309 return isl_map_free(map
);
6313 isl_basic_map_free(map
->p
[i
]);
6316 map
->p
[i
] = map
->p
[map
->n
];
6317 map
= isl_map_unmark_normalized(map
);
6324 /* Perform "fn" on each basic map of "map", where we may not be holding
6325 * the only reference to "map".
6326 * In particular, "fn" should be a semantics preserving operation
6327 * that we want to apply to all copies of "map". We therefore need
6328 * to be careful not to modify "map" in a way that breaks "map"
6329 * in case anything goes wrong.
6331 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
6332 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
6334 struct isl_basic_map
*bmap
;
6340 for (i
= map
->n
- 1; i
>= 0; --i
) {
6341 bmap
= isl_basic_map_copy(map
->p
[i
]);
6345 isl_basic_map_free(map
->p
[i
]);
6347 map
= remove_if_empty(map
, i
);
6358 __isl_give isl_map
*isl_map_fix_si(__isl_take isl_map
*map
,
6359 enum isl_dim_type type
, unsigned pos
, int value
)
6363 map
= isl_map_cow(map
);
6367 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6368 for (i
= map
->n
- 1; i
>= 0; --i
) {
6369 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
6370 map
= remove_if_empty(map
, i
);
6374 map
= isl_map_unmark_normalized(map
);
6381 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
6382 enum isl_dim_type type
, unsigned pos
, int value
)
6384 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
6387 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
6388 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6392 map
= isl_map_cow(map
);
6396 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6397 for (i
= 0; i
< map
->n
; ++i
) {
6398 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
6402 map
= isl_map_unmark_normalized(map
);
6409 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
6410 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6412 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
6415 /* Fix the value of the variable at position "pos" of type "type" of "map"
6416 * to be equal to "v".
6418 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
6419 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6423 map
= isl_map_cow(map
);
6427 if (!isl_val_is_int(v
))
6428 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6429 "expecting integer value", goto error
);
6430 if (pos
>= isl_map_dim(map
, type
))
6431 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
6432 "index out of bounds", goto error
);
6433 for (i
= map
->n
- 1; i
>= 0; --i
) {
6434 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
6436 map
= remove_if_empty(map
, i
);
6440 map
= isl_map_unmark_normalized(map
);
6449 /* Fix the value of the variable at position "pos" of type "type" of "set"
6450 * to be equal to "v".
6452 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
6453 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
6455 return isl_map_fix_val(set
, type
, pos
, v
);
6458 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
6459 unsigned input
, int value
)
6461 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
6464 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
6466 return set_from_map(isl_map_fix_si(set_to_map(set
),
6467 isl_dim_set
, dim
, value
));
6470 static __isl_give isl_basic_map
*basic_map_bound_si(
6471 __isl_take isl_basic_map
*bmap
,
6472 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6476 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6477 return isl_basic_map_free(bmap
);
6478 pos
+= isl_basic_map_offset(bmap
, type
);
6479 bmap
= isl_basic_map_cow(bmap
);
6480 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6481 j
= isl_basic_map_alloc_inequality(bmap
);
6484 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6486 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6487 isl_int_set_si(bmap
->ineq
[j
][0], value
);
6489 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6490 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
6492 bmap
= isl_basic_map_simplify(bmap
);
6493 return isl_basic_map_finalize(bmap
);
6495 isl_basic_map_free(bmap
);
6499 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
6500 __isl_take isl_basic_map
*bmap
,
6501 enum isl_dim_type type
, unsigned pos
, int value
)
6503 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
6506 /* Constrain the values of the given dimension to be no greater than "value".
6508 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
6509 __isl_take isl_basic_map
*bmap
,
6510 enum isl_dim_type type
, unsigned pos
, int value
)
6512 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
6515 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
6516 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
6520 map
= isl_map_cow(map
);
6524 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
6525 for (i
= 0; i
< map
->n
; ++i
) {
6526 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
6527 type
, pos
, value
, upper
);
6531 map
= isl_map_unmark_normalized(map
);
6538 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
6539 enum isl_dim_type type
, unsigned pos
, int value
)
6541 return map_bound_si(map
, type
, pos
, value
, 0);
6544 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
6545 enum isl_dim_type type
, unsigned pos
, int value
)
6547 return map_bound_si(map
, type
, pos
, value
, 1);
6550 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
6551 enum isl_dim_type type
, unsigned pos
, int value
)
6553 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
6557 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
6558 enum isl_dim_type type
, unsigned pos
, int value
)
6560 return isl_map_upper_bound_si(set
, type
, pos
, value
);
6563 /* Bound the given variable of "bmap" from below (or above is "upper"
6564 * is set) to "value".
6566 static __isl_give isl_basic_map
*basic_map_bound(
6567 __isl_take isl_basic_map
*bmap
,
6568 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6572 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
6573 return isl_basic_map_free(bmap
);
6574 pos
+= isl_basic_map_offset(bmap
, type
);
6575 bmap
= isl_basic_map_cow(bmap
);
6576 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6577 j
= isl_basic_map_alloc_inequality(bmap
);
6580 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6582 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6583 isl_int_set(bmap
->ineq
[j
][0], value
);
6585 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6586 isl_int_neg(bmap
->ineq
[j
][0], value
);
6588 bmap
= isl_basic_map_simplify(bmap
);
6589 return isl_basic_map_finalize(bmap
);
6591 isl_basic_map_free(bmap
);
6595 /* Bound the given variable of "map" from below (or above is "upper"
6596 * is set) to "value".
6598 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6599 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6603 map
= isl_map_cow(map
);
6607 if (pos
>= isl_map_dim(map
, type
))
6608 isl_die(map
->ctx
, isl_error_invalid
,
6609 "index out of bounds", goto error
);
6610 for (i
= map
->n
- 1; i
>= 0; --i
) {
6611 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6612 map
= remove_if_empty(map
, i
);
6616 map
= isl_map_unmark_normalized(map
);
6623 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6624 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6626 return map_bound(map
, type
, pos
, value
, 0);
6629 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6630 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6632 return map_bound(map
, type
, pos
, value
, 1);
6635 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6636 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6638 return isl_map_lower_bound(set
, type
, pos
, value
);
6641 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6642 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6644 return isl_map_upper_bound(set
, type
, pos
, value
);
6647 /* Force the values of the variable at position "pos" of type "type" of "set"
6648 * to be no smaller than "value".
6650 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6651 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6655 if (!isl_val_is_int(value
))
6656 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6657 "expecting integer value", goto error
);
6658 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6659 isl_val_free(value
);
6662 isl_val_free(value
);
6667 /* Force the values of the variable at position "pos" of type "type" of "set"
6668 * to be no greater than "value".
6670 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6671 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6675 if (!isl_val_is_int(value
))
6676 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6677 "expecting integer value", goto error
);
6678 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6679 isl_val_free(value
);
6682 isl_val_free(value
);
6687 /* Bound the given variable of "bset" from below (or above is "upper"
6688 * is set) to "value".
6690 static __isl_give isl_basic_set
*isl_basic_set_bound(
6691 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6692 isl_int value
, int upper
)
6694 return bset_from_bmap(basic_map_bound(bset_to_bmap(bset
),
6695 type
, pos
, value
, upper
));
6698 /* Bound the given variable of "bset" from below (or above is "upper"
6699 * is set) to "value".
6701 static __isl_give isl_basic_set
*isl_basic_set_bound_val(
6702 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6703 __isl_take isl_val
*value
, int upper
)
6707 if (!isl_val_is_int(value
))
6708 isl_die(isl_basic_set_get_ctx(bset
), isl_error_invalid
,
6709 "expecting integer value", goto error
);
6710 bset
= isl_basic_set_bound(bset
, type
, pos
, value
->n
, upper
);
6711 isl_val_free(value
);
6714 isl_val_free(value
);
6715 isl_basic_set_free(bset
);
6719 /* Bound the given variable of "bset" from below to "value".
6721 __isl_give isl_basic_set
*isl_basic_set_lower_bound_val(
6722 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6723 __isl_take isl_val
*value
)
6725 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 0);
6728 /* Bound the given variable of "bset" from above to "value".
6730 __isl_give isl_basic_set
*isl_basic_set_upper_bound_val(
6731 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned pos
,
6732 __isl_take isl_val
*value
)
6734 return isl_basic_set_bound_val(bset
, type
, pos
, value
, 1);
6737 __isl_give isl_map
*isl_map_reverse(__isl_take isl_map
*map
)
6741 map
= isl_map_cow(map
);
6745 map
->dim
= isl_space_reverse(map
->dim
);
6748 for (i
= 0; i
< map
->n
; ++i
) {
6749 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6753 map
= isl_map_unmark_normalized(map
);
6761 #define TYPE isl_pw_multi_aff
6763 #define SUFFIX _pw_multi_aff
6765 #define EMPTY isl_pw_multi_aff_empty
6767 #define ADD isl_pw_multi_aff_union_add
6768 #include "isl_map_lexopt_templ.c"
6770 /* Given a map "map", compute the lexicographically minimal
6771 * (or maximal) image element for each domain element in dom,
6772 * in the form of an isl_pw_multi_aff.
6773 * If "empty" is not NULL, then set *empty to those elements in dom that
6774 * do not have an image element.
6775 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6776 * should be computed over the domain of "map". "empty" is also NULL
6779 * We first compute the lexicographically minimal or maximal element
6780 * in the first basic map. This results in a partial solution "res"
6781 * and a subset "todo" of dom that still need to be handled.
6782 * We then consider each of the remaining maps in "map" and successively
6783 * update both "res" and "todo".
6784 * If "empty" is NULL, then the todo sets are not needed and therefore
6785 * also not computed.
6787 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6788 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6789 __isl_give isl_set
**empty
, unsigned flags
)
6793 isl_pw_multi_aff
*res
;
6796 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6797 if (!map
|| (!full
&& !dom
))
6800 if (isl_map_plain_is_empty(map
)) {
6805 return isl_pw_multi_aff_from_map(map
);
6808 res
= basic_map_partial_lexopt_pw_multi_aff(
6809 isl_basic_map_copy(map
->p
[0]),
6810 isl_set_copy(dom
), empty
, flags
);
6814 for (i
= 1; i
< map
->n
; ++i
) {
6815 isl_pw_multi_aff
*res_i
;
6817 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6818 isl_basic_map_copy(map
->p
[i
]),
6819 isl_set_copy(dom
), empty
, flags
);
6821 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6822 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6824 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6827 todo
= isl_set_intersect(todo
, *empty
);
6846 #define TYPE isl_map
6850 #define EMPTY isl_map_empty
6852 #define ADD isl_map_union_disjoint
6853 #include "isl_map_lexopt_templ.c"
6855 /* Given a map "map", compute the lexicographically minimal
6856 * (or maximal) image element for each domain element in "dom",
6857 * in the form of an isl_map.
6858 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6859 * do not have an image element.
6860 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6861 * should be computed over the domain of "map". "empty" is also NULL
6864 * If the input consists of more than one disjunct, then first
6865 * compute the desired result in the form of an isl_pw_multi_aff and
6866 * then convert that into an isl_map.
6868 * This function used to have an explicit implementation in terms
6869 * of isl_maps, but it would continually intersect the domains of
6870 * partial results with the complement of the domain of the next
6871 * partial solution, potentially leading to an explosion in the number
6872 * of disjuncts if there are several disjuncts in the input.
6873 * An even earlier implementation of this function would look for
6874 * better results in the domain of the partial result and for extra
6875 * results in the complement of this domain, which would lead to
6876 * even more splintering.
6878 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6879 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6880 __isl_give isl_set
**empty
, unsigned flags
)
6883 struct isl_map
*res
;
6884 isl_pw_multi_aff
*pma
;
6886 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6887 if (!map
|| (!full
&& !dom
))
6890 if (isl_map_plain_is_empty(map
)) {
6899 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6905 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6907 return isl_map_from_pw_multi_aff(pma
);
6916 __isl_give isl_map
*isl_map_partial_lexmax(
6917 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6918 __isl_give isl_set
**empty
)
6920 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6923 __isl_give isl_map
*isl_map_partial_lexmin(
6924 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6925 __isl_give isl_set
**empty
)
6927 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6930 __isl_give isl_set
*isl_set_partial_lexmin(
6931 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6932 __isl_give isl_set
**empty
)
6934 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6938 __isl_give isl_set
*isl_set_partial_lexmax(
6939 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6940 __isl_give isl_set
**empty
)
6942 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6946 /* Compute the lexicographic minimum (or maximum if "flags" includes
6947 * ISL_OPT_MAX) of "bset" over its parametric domain.
6949 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6952 return isl_basic_map_lexopt(bset
, flags
);
6955 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6957 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6960 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6962 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6965 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6967 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6970 /* Compute the lexicographic minimum of "bset" over its parametric domain
6971 * for the purpose of quantifier elimination.
6972 * That is, find an explicit representation for all the existentially
6973 * quantified variables in "bset" by computing their lexicographic
6976 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6977 __isl_take isl_basic_set
*bset
)
6979 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6982 /* Given a basic map with one output dimension, compute the minimum or
6983 * maximum of that dimension as an isl_pw_aff.
6985 * Compute the optimum as a lexicographic optimum over the single
6986 * output dimension and extract the single isl_pw_aff from the result.
6988 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6991 isl_pw_multi_aff
*pma
;
6994 bmap
= isl_basic_map_copy(bmap
);
6995 pma
= isl_basic_map_lexopt_pw_multi_aff(bmap
, max
? ISL_OPT_MAX
: 0);
6996 pwaff
= isl_pw_multi_aff_get_pw_aff(pma
, 0);
6997 isl_pw_multi_aff_free(pma
);
7002 /* Compute the minimum or maximum of the given output dimension
7003 * as a function of the parameters and the input dimensions,
7004 * but independently of the other output dimensions.
7006 * We first project out the other output dimension and then compute
7007 * the "lexicographic" maximum in each basic map, combining the results
7008 * using isl_pw_aff_union_max.
7010 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
7017 n_out
= isl_map_dim(map
, isl_dim_out
);
7018 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
7019 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
7024 isl_space
*dim
= isl_map_get_space(map
);
7026 return isl_pw_aff_empty(dim
);
7029 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
7030 for (i
= 1; i
< map
->n
; ++i
) {
7031 isl_pw_aff
*pwaff_i
;
7033 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
7034 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
7042 /* Compute the minimum of the given output dimension as a function of the
7043 * parameters and input dimensions, but independently of
7044 * the other output dimensions.
7046 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
7048 return map_dim_opt(map
, pos
, 0);
7051 /* Compute the maximum of the given output dimension as a function of the
7052 * parameters and input dimensions, but independently of
7053 * the other output dimensions.
7055 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
7057 return map_dim_opt(map
, pos
, 1);
7060 /* Compute the minimum or maximum of the given set dimension
7061 * as a function of the parameters,
7062 * but independently of the other set dimensions.
7064 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
7067 return map_dim_opt(set
, pos
, max
);
7070 /* Compute the maximum of the given set dimension as a function of the
7071 * parameters, but independently of the other set dimensions.
7073 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
7075 return set_dim_opt(set
, pos
, 1);
7078 /* Compute the minimum of the given set dimension as a function of the
7079 * parameters, but independently of the other set dimensions.
7081 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
7083 return set_dim_opt(set
, pos
, 0);
7086 /* Apply a preimage specified by "mat" on the parameters of "bset".
7087 * bset is assumed to have only parameters and divs.
7089 static __isl_give isl_basic_set
*basic_set_parameter_preimage(
7090 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*mat
)
7097 bset
->dim
= isl_space_cow(bset
->dim
);
7101 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7103 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
7105 bset
->dim
->nparam
= 0;
7106 bset
->dim
->n_out
= nparam
;
7107 bset
= isl_basic_set_preimage(bset
, mat
);
7109 bset
->dim
->nparam
= bset
->dim
->n_out
;
7110 bset
->dim
->n_out
= 0;
7115 isl_basic_set_free(bset
);
7119 /* Apply a preimage specified by "mat" on the parameters of "set".
7120 * set is assumed to have only parameters and divs.
7122 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
7123 __isl_take isl_mat
*mat
)
7131 nparam
= isl_set_dim(set
, isl_dim_param
);
7133 if (mat
->n_row
!= 1 + nparam
)
7134 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
7135 "unexpected number of rows", goto error
);
7137 space
= isl_set_get_space(set
);
7138 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
7139 isl_dim_param
, 0, nparam
);
7140 set
= isl_set_reset_space(set
, space
);
7141 set
= isl_set_preimage(set
, mat
);
7142 nparam
= isl_set_dim(set
, isl_dim_out
);
7143 space
= isl_set_get_space(set
);
7144 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
7145 isl_dim_out
, 0, nparam
);
7146 set
= isl_set_reset_space(set
, space
);
7154 /* Intersect the basic set "bset" with the affine space specified by the
7155 * equalities in "eq".
7157 static __isl_give isl_basic_set
*basic_set_append_equalities(
7158 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*eq
)
7166 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
7171 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
7172 for (i
= 0; i
< eq
->n_row
; ++i
) {
7173 k
= isl_basic_set_alloc_equality(bset
);
7176 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
7177 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
7181 bset
= isl_basic_set_gauss(bset
, NULL
);
7182 bset
= isl_basic_set_finalize(bset
);
7187 isl_basic_set_free(bset
);
7191 /* Intersect the set "set" with the affine space specified by the
7192 * equalities in "eq".
7194 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
7202 for (i
= 0; i
< set
->n
; ++i
) {
7203 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
7216 /* Given a basic set "bset" that only involves parameters and existentially
7217 * quantified variables, return the index of the first equality
7218 * that only involves parameters. If there is no such equality then
7219 * return bset->n_eq.
7221 * This function assumes that isl_basic_set_gauss has been called on "bset".
7223 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
7226 unsigned nparam
, n_div
;
7231 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7232 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
7234 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
7235 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
7242 /* Compute an explicit representation for the existentially quantified
7243 * variables in "bset" by computing the "minimal value" of the set
7244 * variables. Since there are no set variables, the computation of
7245 * the minimal value essentially computes an explicit representation
7246 * of the non-empty part(s) of "bset".
7248 * The input only involves parameters and existentially quantified variables.
7249 * All equalities among parameters have been removed.
7251 * Since the existentially quantified variables in the result are in general
7252 * going to be different from those in the input, we first replace
7253 * them by the minimal number of variables based on their equalities.
7254 * This should simplify the parametric integer programming.
7256 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
7258 isl_morph
*morph1
, *morph2
;
7264 if (bset
->n_eq
== 0)
7265 return isl_basic_set_lexmin_compute_divs(bset
);
7267 morph1
= isl_basic_set_parameter_compression(bset
);
7268 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
7269 bset
= isl_basic_set_lift(bset
);
7270 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
7271 bset
= isl_morph_basic_set(morph2
, bset
);
7272 n
= isl_basic_set_dim(bset
, isl_dim_set
);
7273 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
7275 set
= isl_basic_set_lexmin_compute_divs(bset
);
7277 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
7282 /* Project the given basic set onto its parameter domain, possibly introducing
7283 * new, explicit, existential variables in the constraints.
7284 * The input has parameters and (possibly implicit) existential variables.
7285 * The output has the same parameters, but only
7286 * explicit existentially quantified variables.
7288 * The actual projection is performed by pip, but pip doesn't seem
7289 * to like equalities very much, so we first remove the equalities
7290 * among the parameters by performing a variable compression on
7291 * the parameters. Afterward, an inverse transformation is performed
7292 * and the equalities among the parameters are inserted back in.
7294 * The variable compression on the parameters may uncover additional
7295 * equalities that were only implicit before. We therefore check
7296 * if there are any new parameter equalities in the result and
7297 * if so recurse. The removal of parameter equalities is required
7298 * for the parameter compression performed by base_compute_divs.
7300 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
7304 struct isl_mat
*T
, *T2
;
7305 struct isl_set
*set
;
7308 bset
= isl_basic_set_cow(bset
);
7312 if (bset
->n_eq
== 0)
7313 return base_compute_divs(bset
);
7315 bset
= isl_basic_set_gauss(bset
, NULL
);
7318 if (isl_basic_set_plain_is_empty(bset
))
7319 return isl_set_from_basic_set(bset
);
7321 i
= first_parameter_equality(bset
);
7322 if (i
== bset
->n_eq
)
7323 return base_compute_divs(bset
);
7325 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
7326 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
7328 eq
= isl_mat_cow(eq
);
7329 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
7330 if (T
&& T
->n_col
== 0) {
7334 bset
= isl_basic_set_set_to_empty(bset
);
7335 return isl_set_from_basic_set(bset
);
7337 bset
= basic_set_parameter_preimage(bset
, T
);
7339 i
= first_parameter_equality(bset
);
7342 else if (i
== bset
->n_eq
)
7343 set
= base_compute_divs(bset
);
7345 set
= parameter_compute_divs(bset
);
7346 set
= set_parameter_preimage(set
, T2
);
7347 set
= set_append_equalities(set
, eq
);
7351 /* Insert the divs from "ls" before those of "bmap".
7353 * The number of columns is not changed, which means that the last
7354 * dimensions of "bmap" are being reintepreted as the divs from "ls".
7355 * The caller is responsible for removing the same number of dimensions
7356 * from the space of "bmap".
7358 static __isl_give isl_basic_map
*insert_divs_from_local_space(
7359 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
7365 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7369 old_n_div
= bmap
->n_div
;
7370 bmap
= insert_div_rows(bmap
, n_div
);
7374 for (i
= 0; i
< n_div
; ++i
) {
7375 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
7376 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
7382 /* Replace the space of "bmap" by the space and divs of "ls".
7384 * If "ls" has any divs, then we simplify the result since we may
7385 * have discovered some additional equalities that could simplify
7386 * the div expressions.
7388 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
7389 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
7393 bmap
= isl_basic_map_cow(bmap
);
7397 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
7398 bmap
= insert_divs_from_local_space(bmap
, ls
);
7402 isl_space_free(bmap
->dim
);
7403 bmap
->dim
= isl_local_space_get_space(ls
);
7407 isl_local_space_free(ls
);
7409 bmap
= isl_basic_map_simplify(bmap
);
7410 bmap
= isl_basic_map_finalize(bmap
);
7413 isl_basic_map_free(bmap
);
7414 isl_local_space_free(ls
);
7418 /* Replace the space of "map" by the space and divs of "ls".
7420 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
7421 __isl_take isl_local_space
*ls
)
7425 map
= isl_map_cow(map
);
7429 for (i
= 0; i
< map
->n
; ++i
) {
7430 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
7431 isl_local_space_copy(ls
));
7435 isl_space_free(map
->dim
);
7436 map
->dim
= isl_local_space_get_space(ls
);
7440 isl_local_space_free(ls
);
7443 isl_local_space_free(ls
);
7448 /* Compute an explicit representation for the existentially
7449 * quantified variables for which do not know any explicit representation yet.
7451 * We first sort the existentially quantified variables so that the
7452 * existentially quantified variables for which we already have an explicit
7453 * representation are placed before those for which we do not.
7454 * The input dimensions, the output dimensions and the existentially
7455 * quantified variables for which we already have an explicit
7456 * representation are then turned into parameters.
7457 * compute_divs returns a map with the same parameters and
7458 * no input or output dimensions and the dimension specification
7459 * is reset to that of the input, including the existentially quantified
7460 * variables for which we already had an explicit representation.
7462 static __isl_give isl_map
*compute_divs(__isl_take isl_basic_map
*bmap
)
7464 struct isl_basic_set
*bset
;
7465 struct isl_set
*set
;
7466 struct isl_map
*map
;
7468 isl_local_space
*ls
;
7475 bmap
= isl_basic_map_sort_divs(bmap
);
7476 bmap
= isl_basic_map_cow(bmap
);
7480 n_known
= isl_basic_map_first_unknown_div(bmap
);
7482 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
7484 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7485 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
7486 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
7487 dim
= isl_space_set_alloc(bmap
->ctx
,
7488 nparam
+ n_in
+ n_out
+ n_known
, 0);
7492 ls
= isl_basic_map_get_local_space(bmap
);
7493 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
7494 n_known
, bmap
->n_div
- n_known
);
7496 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
7497 swap_div(bmap
, i
- n_known
, i
);
7498 bmap
->n_div
-= n_known
;
7499 bmap
->extra
-= n_known
;
7501 bmap
= isl_basic_map_reset_space(bmap
, dim
);
7502 bset
= bset_from_bmap(bmap
);
7504 set
= parameter_compute_divs(bset
);
7505 map
= set_to_map(set
);
7506 map
= replace_space_by_local_space(map
, ls
);
7510 isl_basic_map_free(bmap
);
7514 /* Remove the explicit representation of local variable "div",
7517 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
7518 __isl_take isl_basic_map
*bmap
, int div
)
7522 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
7524 return isl_basic_map_free(bmap
);
7528 bmap
= isl_basic_map_cow(bmap
);
7531 isl_int_set_si(bmap
->div
[div
][0], 0);
7535 /* Is local variable "div" of "bmap" marked as not having an explicit
7537 * Note that even if "div" is not marked in this way and therefore
7538 * has an explicit representation, this representation may still
7539 * depend (indirectly) on other local variables that do not
7540 * have an explicit representation.
7542 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
7545 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
7546 return isl_bool_error
;
7547 return isl_int_is_zero(bmap
->div
[div
][0]);
7550 /* Return the position of the first local variable that does not
7551 * have an explicit representation.
7552 * Return the total number of local variables if they all have
7553 * an explicit representation.
7554 * Return -1 on error.
7556 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7563 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7564 if (!isl_basic_map_div_is_known(bmap
, i
))
7570 /* Return the position of the first local variable that does not
7571 * have an explicit representation.
7572 * Return the total number of local variables if they all have
7573 * an explicit representation.
7574 * Return -1 on error.
7576 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7578 return isl_basic_map_first_unknown_div(bset
);
7581 /* Does "bmap" have an explicit representation for all local variables?
7583 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7587 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7588 first
= isl_basic_map_first_unknown_div(bmap
);
7590 return isl_bool_error
;
7594 /* Do all basic maps in "map" have an explicit representation
7595 * for all local variables?
7597 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7602 return isl_bool_error
;
7604 for (i
= 0; i
< map
->n
; ++i
) {
7605 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7610 return isl_bool_true
;
7613 /* If bmap contains any unknown divs, then compute explicit
7614 * expressions for them. However, this computation may be
7615 * quite expensive, so first try to remove divs that aren't
7618 __isl_give isl_map
*isl_basic_map_compute_divs(__isl_take isl_basic_map
*bmap
)
7621 struct isl_map
*map
;
7623 known
= isl_basic_map_divs_known(bmap
);
7627 return isl_map_from_basic_map(bmap
);
7629 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7631 known
= isl_basic_map_divs_known(bmap
);
7635 return isl_map_from_basic_map(bmap
);
7637 map
= compute_divs(bmap
);
7640 isl_basic_map_free(bmap
);
7644 __isl_give isl_map
*isl_map_compute_divs(__isl_take isl_map
*map
)
7648 struct isl_map
*res
;
7655 known
= isl_map_divs_known(map
);
7663 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7664 for (i
= 1 ; i
< map
->n
; ++i
) {
7666 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7667 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7668 res
= isl_map_union_disjoint(res
, r2
);
7670 res
= isl_map_union(res
, r2
);
7677 __isl_give isl_set
*isl_basic_set_compute_divs(__isl_take isl_basic_set
*bset
)
7679 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7682 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7684 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7687 __isl_give isl_set
*isl_map_domain(__isl_take isl_map
*map
)
7690 struct isl_set
*set
;
7695 map
= isl_map_cow(map
);
7699 set
= set_from_map(map
);
7700 set
->dim
= isl_space_domain(set
->dim
);
7703 for (i
= 0; i
< map
->n
; ++i
) {
7704 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7708 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7709 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7716 /* Return the union of "map1" and "map2", where we assume for now that
7717 * "map1" and "map2" are disjoint. Note that the basic maps inside
7718 * "map1" or "map2" may not be disjoint from each other.
7719 * Also note that this function is also called from isl_map_union,
7720 * which takes care of handling the situation where "map1" and "map2"
7721 * may not be disjoint.
7723 * If one of the inputs is empty, we can simply return the other input.
7724 * Similarly, if one of the inputs is universal, then it is equal to the union.
7726 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7727 __isl_take isl_map
*map2
)
7731 struct isl_map
*map
= NULL
;
7737 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7738 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7739 "spaces don't match", goto error
);
7750 is_universe
= isl_map_plain_is_universe(map1
);
7751 if (is_universe
< 0)
7758 is_universe
= isl_map_plain_is_universe(map2
);
7759 if (is_universe
< 0)
7766 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7767 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7768 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7770 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7771 map1
->n
+ map2
->n
, flags
);
7774 for (i
= 0; i
< map1
->n
; ++i
) {
7775 map
= isl_map_add_basic_map(map
,
7776 isl_basic_map_copy(map1
->p
[i
]));
7780 for (i
= 0; i
< map2
->n
; ++i
) {
7781 map
= isl_map_add_basic_map(map
,
7782 isl_basic_map_copy(map2
->p
[i
]));
7796 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7797 * guaranteed to be disjoint by the caller.
7799 * Note that this functions is called from within isl_map_make_disjoint,
7800 * so we have to be careful not to touch the constraints of the inputs
7803 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7804 __isl_take isl_map
*map2
)
7806 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7809 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7810 * not be disjoint. The parameters are assumed to have been aligned.
7812 * We currently simply call map_union_disjoint, the internal operation
7813 * of which does not really depend on the inputs being disjoint.
7814 * If the result contains more than one basic map, then we clear
7815 * the disjoint flag since the result may contain basic maps from
7816 * both inputs and these are not guaranteed to be disjoint.
7818 * As a special case, if "map1" and "map2" are obviously equal,
7819 * then we simply return "map1".
7821 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7822 __isl_take isl_map
*map2
)
7829 equal
= isl_map_plain_is_equal(map1
, map2
);
7837 map1
= map_union_disjoint(map1
, map2
);
7841 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7849 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7852 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7853 __isl_take isl_map
*map2
)
7855 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7858 __isl_give isl_set
*isl_set_union_disjoint(
7859 __isl_take isl_set
*set1
, __isl_take isl_set
*set2
)
7861 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7865 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7867 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7870 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7873 * "map" and "set" are assumed to be compatible and non-NULL.
7875 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7876 __isl_take isl_set
*set
,
7877 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7878 __isl_take isl_basic_set
*bset
))
7881 struct isl_map
*result
;
7884 if (isl_set_plain_is_universe(set
)) {
7889 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7890 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7891 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7893 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7894 map
->n
* set
->n
, flags
);
7895 for (i
= 0; result
&& i
< map
->n
; ++i
)
7896 for (j
= 0; j
< set
->n
; ++j
) {
7897 result
= isl_map_add_basic_map(result
,
7898 fn(isl_basic_map_copy(map
->p
[i
]),
7899 isl_basic_set_copy(set
->p
[j
])));
7909 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7910 __isl_take isl_set
*set
)
7914 ok
= isl_map_compatible_range(map
, set
);
7918 isl_die(set
->ctx
, isl_error_invalid
,
7919 "incompatible spaces", goto error
);
7921 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7928 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7929 __isl_take isl_set
*set
)
7931 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7934 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7935 __isl_take isl_set
*set
)
7939 ok
= isl_map_compatible_domain(map
, set
);
7943 isl_die(set
->ctx
, isl_error_invalid
,
7944 "incompatible spaces", goto error
);
7946 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7953 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7954 __isl_take isl_set
*set
)
7956 return isl_map_align_params_map_map_and(map
, set
,
7957 &map_intersect_domain
);
7960 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7961 * in the space B -> C, return the intersection.
7962 * The parameters are assumed to have been aligned.
7964 * The map "factor" is first extended to a map living in the space
7965 * [A -> B] -> C and then a regular intersection is computed.
7967 static __isl_give isl_map
*map_intersect_domain_factor_range(
7968 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7971 isl_map
*ext_factor
;
7973 space
= isl_space_domain_factor_domain(isl_map_get_space(map
));
7974 ext_factor
= isl_map_universe(space
);
7975 ext_factor
= isl_map_domain_product(ext_factor
, factor
);
7976 return map_intersect(map
, ext_factor
);
7979 /* Given a map "map" in a space [A -> B] -> C and a map "factor"
7980 * in the space B -> C, return the intersection.
7982 __isl_give isl_map
*isl_map_intersect_domain_factor_range(
7983 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7985 return isl_map_align_params_map_map_and(map
, factor
,
7986 &map_intersect_domain_factor_range
);
7989 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
7990 * in the space A -> C, return the intersection.
7992 * The map "factor" is first extended to a map living in the space
7993 * A -> [B -> C] and then a regular intersection is computed.
7995 static __isl_give isl_map
*map_intersect_range_factor_range(
7996 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
7999 isl_map
*ext_factor
;
8001 space
= isl_space_range_factor_domain(isl_map_get_space(map
));
8002 ext_factor
= isl_map_universe(space
);
8003 ext_factor
= isl_map_range_product(ext_factor
, factor
);
8004 return isl_map_intersect(map
, ext_factor
);
8007 /* Given a map "map" in a space A -> [B -> C] and a map "factor"
8008 * in the space A -> C, return the intersection.
8010 __isl_give isl_map
*isl_map_intersect_range_factor_range(
8011 __isl_take isl_map
*map
, __isl_take isl_map
*factor
)
8013 return isl_map_align_params_map_map_and(map
, factor
,
8014 &map_intersect_range_factor_range
);
8017 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
8018 __isl_take isl_map
*map2
)
8022 map1
= isl_map_reverse(map1
);
8023 map1
= isl_map_apply_range(map1
, map2
);
8024 return isl_map_reverse(map1
);
8031 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
8032 __isl_take isl_map
*map2
)
8034 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
8037 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
8038 __isl_take isl_map
*map2
)
8040 isl_space
*dim_result
;
8041 struct isl_map
*result
;
8047 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
8048 isl_space_copy(map2
->dim
));
8050 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
8053 for (i
= 0; i
< map1
->n
; ++i
)
8054 for (j
= 0; j
< map2
->n
; ++j
) {
8055 result
= isl_map_add_basic_map(result
,
8056 isl_basic_map_apply_range(
8057 isl_basic_map_copy(map1
->p
[i
]),
8058 isl_basic_map_copy(map2
->p
[j
])));
8064 if (result
&& result
->n
<= 1)
8065 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
8073 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
8074 __isl_take isl_map
*map2
)
8076 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
8080 * returns range - domain
8082 __isl_give isl_basic_set
*isl_basic_map_deltas(__isl_take isl_basic_map
*bmap
)
8084 isl_space
*target_space
;
8085 struct isl_basic_set
*bset
;
8092 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8093 bmap
->dim
, isl_dim_out
),
8095 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
8096 dim
= isl_basic_map_dim(bmap
, isl_dim_in
);
8097 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8098 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
8099 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
8100 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
8101 for (i
= 0; i
< dim
; ++i
) {
8102 int j
= isl_basic_map_alloc_equality(bmap
);
8104 bmap
= isl_basic_map_free(bmap
);
8107 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8108 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8109 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
8110 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
8112 bset
= isl_basic_map_domain(bmap
);
8113 bset
= isl_basic_set_reset_space(bset
, target_space
);
8116 isl_basic_map_free(bmap
);
8121 * returns range - domain
8123 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
8127 struct isl_set
*result
;
8132 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8133 map
->dim
, isl_dim_out
),
8135 dim
= isl_map_get_space(map
);
8136 dim
= isl_space_domain(dim
);
8137 result
= isl_set_alloc_space(dim
, map
->n
, 0);
8140 for (i
= 0; i
< map
->n
; ++i
)
8141 result
= isl_set_add_basic_set(result
,
8142 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
8151 * returns [domain -> range] -> range - domain
8153 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
8154 __isl_take isl_basic_map
*bmap
)
8158 isl_basic_map
*domain
;
8162 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
8163 bmap
->dim
, isl_dim_out
))
8164 isl_die(bmap
->ctx
, isl_error_invalid
,
8165 "domain and range don't match", goto error
);
8167 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
8168 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
8170 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
8171 domain
= isl_basic_map_universe(dim
);
8173 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
8174 bmap
= isl_basic_map_apply_range(bmap
, domain
);
8175 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
8177 total
= isl_basic_map_total_dim(bmap
);
8179 for (i
= 0; i
< n
; ++i
) {
8180 k
= isl_basic_map_alloc_equality(bmap
);
8183 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
8184 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
8185 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
8186 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
8189 bmap
= isl_basic_map_gauss(bmap
, NULL
);
8190 return isl_basic_map_finalize(bmap
);
8192 isl_basic_map_free(bmap
);
8197 * returns [domain -> range] -> range - domain
8199 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
8202 isl_space
*domain_dim
;
8207 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
8208 map
->dim
, isl_dim_out
))
8209 isl_die(map
->ctx
, isl_error_invalid
,
8210 "domain and range don't match", goto error
);
8212 map
= isl_map_cow(map
);
8216 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
8217 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
8218 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
8221 for (i
= 0; i
< map
->n
; ++i
) {
8222 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
8226 map
= isl_map_unmark_normalized(map
);
8233 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*space
)
8235 struct isl_basic_map
*bmap
;
8243 nparam
= space
->nparam
;
8245 bmap
= isl_basic_map_alloc_space(space
, 0, dim
, 0);
8249 for (i
= 0; i
< dim
; ++i
) {
8250 int j
= isl_basic_map_alloc_equality(bmap
);
8253 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
8254 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
8255 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
8257 return isl_basic_map_finalize(bmap
);
8259 isl_basic_map_free(bmap
);
8263 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*space
)
8267 if (space
->n_in
!= space
->n_out
)
8268 isl_die(space
->ctx
, isl_error_invalid
,
8269 "number of input and output dimensions needs to be "
8270 "the same", goto error
);
8271 return basic_map_identity(space
);
8273 isl_space_free(space
);
8277 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
8279 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
8282 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
8284 isl_space
*dim
= isl_set_get_space(set
);
8286 id
= isl_map_identity(isl_space_map_from_set(dim
));
8287 return isl_map_intersect_range(id
, set
);
8290 /* Construct a basic set with all set dimensions having only non-negative
8293 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
8294 __isl_take isl_space
*space
)
8299 struct isl_basic_set
*bset
;
8303 nparam
= space
->nparam
;
8305 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
8308 for (i
= 0; i
< dim
; ++i
) {
8309 int k
= isl_basic_set_alloc_inequality(bset
);
8312 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
8313 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
8317 isl_basic_set_free(bset
);
8321 /* Construct the half-space x_pos >= 0.
8323 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*space
,
8327 isl_basic_set
*nonneg
;
8329 nonneg
= isl_basic_set_alloc_space(space
, 0, 0, 1);
8330 k
= isl_basic_set_alloc_inequality(nonneg
);
8333 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
8334 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
8336 return isl_basic_set_finalize(nonneg
);
8338 isl_basic_set_free(nonneg
);
8342 /* Construct the half-space x_pos <= -1.
8344 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*space
,
8350 neg
= isl_basic_set_alloc_space(space
, 0, 0, 1);
8351 k
= isl_basic_set_alloc_inequality(neg
);
8354 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
8355 isl_int_set_si(neg
->ineq
[k
][0], -1);
8356 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
8358 return isl_basic_set_finalize(neg
);
8360 isl_basic_set_free(neg
);
8364 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
8365 enum isl_dim_type type
, unsigned first
, unsigned n
)
8369 isl_basic_set
*nonneg
;
8377 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
8379 offset
= pos(set
->dim
, type
);
8380 for (i
= 0; i
< n
; ++i
) {
8381 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
8382 offset
+ first
+ i
);
8383 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
8385 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
8394 static isl_stat
foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
8396 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8402 return isl_stat_error
;
8403 if (isl_set_plain_is_empty(set
)) {
8408 return fn(set
, signs
, user
);
8411 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
8413 half
= isl_set_intersect(half
, isl_set_copy(set
));
8414 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
8418 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
8420 half
= isl_set_intersect(half
, set
);
8421 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
8424 return isl_stat_error
;
8427 /* Call "fn" on the intersections of "set" with each of the orthants
8428 * (except for obviously empty intersections). The orthant is identified
8429 * by the signs array, with each entry having value 1 or -1 according
8430 * to the sign of the corresponding variable.
8432 isl_stat
isl_set_foreach_orthant(__isl_keep isl_set
*set
,
8433 isl_stat (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
8442 return isl_stat_error
;
8443 if (isl_set_plain_is_empty(set
))
8446 nparam
= isl_set_dim(set
, isl_dim_param
);
8447 nvar
= isl_set_dim(set
, isl_dim_set
);
8449 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
8451 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
8459 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8461 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
8464 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
8465 __isl_keep isl_basic_map
*bmap2
)
8468 struct isl_map
*map1
;
8469 struct isl_map
*map2
;
8471 if (!bmap1
|| !bmap2
)
8472 return isl_bool_error
;
8474 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
8475 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
8477 is_subset
= isl_map_is_subset(map1
, map2
);
8485 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
8486 __isl_keep isl_basic_set
*bset2
)
8488 return isl_basic_map_is_subset(bset1
, bset2
);
8491 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
8492 __isl_keep isl_basic_map
*bmap2
)
8496 if (!bmap1
|| !bmap2
)
8497 return isl_bool_error
;
8498 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8499 if (is_subset
!= isl_bool_true
)
8501 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8505 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
8506 __isl_keep isl_basic_set
*bset2
)
8508 return isl_basic_map_is_equal(
8509 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
8512 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
8518 return isl_bool_error
;
8519 for (i
= 0; i
< map
->n
; ++i
) {
8520 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
8522 return isl_bool_error
;
8524 return isl_bool_false
;
8526 return isl_bool_true
;
8529 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
8531 return map
? map
->n
== 0 : isl_bool_error
;
8534 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
8536 return set
? set
->n
== 0 : isl_bool_error
;
8539 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
8541 return isl_map_is_empty(set_to_map(set
));
8544 isl_bool
isl_map_has_equal_space(__isl_keep isl_map
*map1
,
8545 __isl_keep isl_map
*map2
)
8548 return isl_bool_error
;
8550 return isl_space_is_equal(map1
->dim
, map2
->dim
);
8553 isl_bool
isl_set_has_equal_space(__isl_keep isl_set
*set1
,
8554 __isl_keep isl_set
*set2
)
8557 return isl_bool_error
;
8559 return isl_space_is_equal(set1
->dim
, set2
->dim
);
8562 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8567 return isl_bool_error
;
8568 is_subset
= isl_map_is_subset(map1
, map2
);
8569 if (is_subset
!= isl_bool_true
)
8571 is_subset
= isl_map_is_subset(map2
, map1
);
8575 /* Is "map1" equal to "map2"?
8577 * First check if they are obviously equal.
8578 * If not, then perform a more detailed analysis.
8580 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8584 equal
= isl_map_plain_is_equal(map1
, map2
);
8585 if (equal
< 0 || equal
)
8587 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
8590 isl_bool
isl_basic_map_is_strict_subset(
8591 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8595 if (!bmap1
|| !bmap2
)
8596 return isl_bool_error
;
8597 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
8598 if (is_subset
!= isl_bool_true
)
8600 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
8601 if (is_subset
== isl_bool_error
)
8606 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
8607 __isl_keep isl_map
*map2
)
8612 return isl_bool_error
;
8613 is_subset
= isl_map_is_subset(map1
, map2
);
8614 if (is_subset
!= isl_bool_true
)
8616 is_subset
= isl_map_is_subset(map2
, map1
);
8617 if (is_subset
== isl_bool_error
)
8622 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8623 __isl_keep isl_set
*set2
)
8625 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8628 /* Is "bmap" obviously equal to the universe with the same space?
8630 * That is, does it not have any constraints?
8632 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8635 return isl_bool_error
;
8636 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8639 /* Is "bset" obviously equal to the universe with the same space?
8641 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8643 return isl_basic_map_plain_is_universe(bset
);
8646 /* If "c" does not involve any existentially quantified variables,
8647 * then set *univ to false and abort
8649 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8651 isl_bool
*univ
= user
;
8654 n
= isl_constraint_dim(c
, isl_dim_div
);
8655 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8656 isl_constraint_free(c
);
8657 if (*univ
< 0 || !*univ
)
8658 return isl_stat_error
;
8662 /* Is "bmap" equal to the universe with the same space?
8664 * First check if it is obviously equal to the universe.
8665 * If not and if there are any constraints not involving
8666 * existentially quantified variables, then it is certainly
8667 * not equal to the universe.
8668 * Otherwise, check if the universe is a subset of "bmap".
8670 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8673 isl_basic_map
*test
;
8675 univ
= isl_basic_map_plain_is_universe(bmap
);
8676 if (univ
< 0 || univ
)
8678 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8679 return isl_bool_false
;
8680 univ
= isl_bool_true
;
8681 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8683 return isl_bool_error
;
8684 if (univ
< 0 || !univ
)
8686 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8687 univ
= isl_basic_map_is_subset(test
, bmap
);
8688 isl_basic_map_free(test
);
8692 /* Is "bset" equal to the universe with the same space?
8694 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8696 return isl_basic_map_is_universe(bset
);
8699 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8704 return isl_bool_error
;
8706 for (i
= 0; i
< map
->n
; ++i
) {
8707 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8712 return isl_bool_false
;
8715 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8717 return isl_map_plain_is_universe(set_to_map(set
));
8720 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8722 struct isl_basic_set
*bset
= NULL
;
8723 struct isl_vec
*sample
= NULL
;
8724 isl_bool empty
, non_empty
;
8727 return isl_bool_error
;
8729 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8730 return isl_bool_true
;
8732 if (isl_basic_map_plain_is_universe(bmap
))
8733 return isl_bool_false
;
8735 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8736 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8737 copy
= isl_basic_map_remove_redundancies(copy
);
8738 empty
= isl_basic_map_plain_is_empty(copy
);
8739 isl_basic_map_free(copy
);
8743 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8745 return isl_bool_error
;
8747 return isl_bool_false
;
8748 isl_vec_free(bmap
->sample
);
8749 bmap
->sample
= NULL
;
8750 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8752 return isl_bool_error
;
8753 sample
= isl_basic_set_sample_vec(bset
);
8755 return isl_bool_error
;
8756 empty
= sample
->size
== 0;
8757 isl_vec_free(bmap
->sample
);
8758 bmap
->sample
= sample
;
8760 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8765 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8768 return isl_bool_error
;
8769 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8772 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8775 return isl_bool_error
;
8776 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8779 /* Is "bmap" known to be non-empty?
8781 * That is, is the cached sample still valid?
8783 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8788 return isl_bool_error
;
8790 return isl_bool_false
;
8791 total
= 1 + isl_basic_map_total_dim(bmap
);
8792 if (bmap
->sample
->size
!= total
)
8793 return isl_bool_false
;
8794 return isl_basic_map_contains(bmap
, bmap
->sample
);
8797 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8799 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8802 __isl_give isl_map
*isl_basic_map_union(__isl_take isl_basic_map
*bmap1
,
8803 __isl_take isl_basic_map
*bmap2
)
8805 struct isl_map
*map
;
8806 if (!bmap1
|| !bmap2
)
8809 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8811 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8814 map
= isl_map_add_basic_map(map
, bmap1
);
8815 map
= isl_map_add_basic_map(map
, bmap2
);
8818 isl_basic_map_free(bmap1
);
8819 isl_basic_map_free(bmap2
);
8823 struct isl_set
*isl_basic_set_union(
8824 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8826 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8827 bset_to_bmap(bset2
)));
8830 /* Order divs such that any div only depends on previous divs */
8831 __isl_give isl_basic_map
*isl_basic_map_order_divs(
8832 __isl_take isl_basic_map
*bmap
)
8840 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8842 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8844 if (isl_int_is_zero(bmap
->div
[i
][0]))
8846 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8851 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8852 "integer division depends on itself",
8853 return isl_basic_map_free(bmap
));
8854 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8860 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8862 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8865 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8872 for (i
= 0; i
< map
->n
; ++i
) {
8873 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8884 /* Sort the local variables of "bset".
8886 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8887 __isl_take isl_basic_set
*bset
)
8889 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8892 /* Apply the expansion computed by isl_merge_divs.
8893 * The expansion itself is given by "exp" while the resulting
8894 * list of divs is given by "div".
8896 * Move the integer divisions of "bmap" into the right position
8897 * according to "exp" and then introduce the additional integer
8898 * divisions, adding div constraints.
8899 * The moving should be done first to avoid moving coefficients
8900 * in the definitions of the extra integer divisions.
8902 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8903 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8908 bmap
= isl_basic_map_cow(bmap
);
8912 if (div
->n_row
< bmap
->n_div
)
8913 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8914 "not an expansion", goto error
);
8916 n_div
= bmap
->n_div
;
8917 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8918 div
->n_row
- n_div
, 0,
8919 2 * (div
->n_row
- n_div
));
8921 for (i
= n_div
; i
< div
->n_row
; ++i
)
8922 if (isl_basic_map_alloc_div(bmap
) < 0)
8925 for (j
= n_div
- 1; j
>= 0; --j
) {
8928 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8931 for (i
= 0; i
< div
->n_row
; ++i
) {
8932 if (j
< n_div
&& exp
[j
] == i
) {
8935 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8936 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8938 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8946 isl_basic_map_free(bmap
);
8951 /* Apply the expansion computed by isl_merge_divs.
8952 * The expansion itself is given by "exp" while the resulting
8953 * list of divs is given by "div".
8955 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8956 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8958 return isl_basic_map_expand_divs(bset
, div
, exp
);
8961 /* Look for a div in dst that corresponds to the div "div" in src.
8962 * The divs before "div" in src and dst are assumed to be the same.
8964 * Returns -1 if no corresponding div was found and the position
8965 * of the corresponding div in dst otherwise.
8967 static int find_div(__isl_keep isl_basic_map
*dst
,
8968 __isl_keep isl_basic_map
*src
, unsigned div
)
8972 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8974 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8975 for (i
= div
; i
< dst
->n_div
; ++i
)
8976 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8977 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8978 dst
->n_div
- div
) == -1)
8983 /* Align the divs of "dst" to those of "src", adding divs from "src"
8984 * if needed. That is, make sure that the first src->n_div divs
8985 * of the result are equal to those of src.
8987 * The result is not finalized as by design it will have redundant
8988 * divs if any divs from "src" were copied.
8990 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8991 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8994 int known
, extended
;
8998 return isl_basic_map_free(dst
);
9000 if (src
->n_div
== 0)
9003 known
= isl_basic_map_divs_known(src
);
9005 return isl_basic_map_free(dst
);
9007 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
9008 "some src divs are unknown",
9009 return isl_basic_map_free(dst
));
9011 src
= isl_basic_map_order_divs(isl_basic_map_copy(src
));
9013 return isl_basic_map_free(dst
);
9016 total
= isl_space_dim(src
->dim
, isl_dim_all
);
9017 for (i
= 0; i
< src
->n_div
; ++i
) {
9018 int j
= find_div(dst
, src
, i
);
9021 int extra
= src
->n_div
- i
;
9022 dst
= isl_basic_map_cow(dst
);
9025 dst
= isl_basic_map_extend_space(dst
,
9026 isl_space_copy(dst
->dim
),
9027 extra
, 0, 2 * extra
);
9030 j
= isl_basic_map_alloc_div(dst
);
9033 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
9034 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
9035 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
9039 isl_basic_map_swap_div(dst
, i
, j
);
9041 isl_basic_map_free(src
);
9044 isl_basic_map_free(src
);
9045 isl_basic_map_free(dst
);
9049 __isl_give isl_map
*isl_map_align_divs_internal(__isl_take isl_map
*map
)
9057 map
= isl_map_compute_divs(map
);
9058 map
= isl_map_cow(map
);
9062 for (i
= 1; i
< map
->n
; ++i
)
9063 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
9064 for (i
= 1; i
< map
->n
; ++i
) {
9065 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
9067 return isl_map_free(map
);
9070 map
= isl_map_unmark_normalized(map
);
9074 __isl_give isl_map
*isl_map_align_divs(__isl_take isl_map
*map
)
9076 return isl_map_align_divs_internal(map
);
9079 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
9081 return set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
9084 /* Align the divs of the basic maps in "map" to those
9085 * of the basic maps in "list", as well as to the other basic maps in "map".
9086 * The elements in "list" are assumed to have known divs.
9088 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
9089 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
9093 map
= isl_map_compute_divs(map
);
9094 map
= isl_map_cow(map
);
9096 return isl_map_free(map
);
9100 n
= isl_basic_map_list_n_basic_map(list
);
9101 for (i
= 0; i
< n
; ++i
) {
9102 isl_basic_map
*bmap
;
9104 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
9105 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
9106 isl_basic_map_free(bmap
);
9109 return isl_map_free(map
);
9111 return isl_map_align_divs_internal(map
);
9114 /* Align the divs of each element of "list" to those of "bmap".
9115 * Both "bmap" and the elements of "list" are assumed to have known divs.
9117 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
9118 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
9123 return isl_basic_map_list_free(list
);
9125 n
= isl_basic_map_list_n_basic_map(list
);
9126 for (i
= 0; i
< n
; ++i
) {
9127 isl_basic_map
*bmap_i
;
9129 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9130 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
9131 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
9137 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
9138 __isl_take isl_map
*map
)
9142 ok
= isl_map_compatible_domain(map
, set
);
9146 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
9147 "incompatible spaces", goto error
);
9148 map
= isl_map_intersect_domain(map
, set
);
9149 set
= isl_map_range(map
);
9157 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
9158 __isl_take isl_map
*map
)
9160 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
9163 /* There is no need to cow as removing empty parts doesn't change
9164 * the meaning of the set.
9166 __isl_give isl_map
*isl_map_remove_empty_parts(__isl_take isl_map
*map
)
9173 for (i
= map
->n
- 1; i
>= 0; --i
)
9174 map
= remove_if_empty(map
, i
);
9179 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
9181 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
9184 /* Create a binary relation that maps the shared initial "pos" dimensions
9185 * of "bset1" and "bset2" to the remaining dimensions of "bset1" and "bset2".
9187 static __isl_give isl_basic_map
*join_initial(__isl_keep isl_basic_set
*bset1
,
9188 __isl_keep isl_basic_set
*bset2
, int pos
)
9190 isl_basic_map
*bmap1
;
9191 isl_basic_map
*bmap2
;
9193 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
9194 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
9195 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
9196 isl_dim_out
, 0, pos
);
9197 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
9198 isl_dim_out
, 0, pos
);
9199 return isl_basic_map_range_product(bmap1
, bmap2
);
9202 /* Given two basic sets bset1 and bset2, compute the maximal difference
9203 * between the values of dimension pos in bset1 and those in bset2
9204 * for any common value of the parameters and dimensions preceding pos.
9206 static enum isl_lp_result
basic_set_maximal_difference_at(
9207 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
9208 int pos
, isl_int
*opt
)
9210 isl_basic_map
*bmap1
;
9211 struct isl_ctx
*ctx
;
9212 struct isl_vec
*obj
;
9216 enum isl_lp_result res
;
9218 if (!bset1
|| !bset2
)
9219 return isl_lp_error
;
9221 nparam
= isl_basic_set_n_param(bset1
);
9222 dim1
= isl_basic_set_n_dim(bset1
);
9224 bmap1
= join_initial(bset1
, bset2
, pos
);
9226 return isl_lp_error
;
9228 total
= isl_basic_map_total_dim(bmap1
);
9230 obj
= isl_vec_alloc(ctx
, 1 + total
);
9233 isl_seq_clr(obj
->block
.data
, 1 + total
);
9234 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
9235 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
9236 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
9238 isl_basic_map_free(bmap1
);
9242 isl_basic_map_free(bmap1
);
9243 return isl_lp_error
;
9246 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
9247 * for any common value of the parameters and dimensions preceding pos
9248 * in both basic sets, the values of dimension pos in bset1 are
9249 * smaller or larger than those in bset2.
9252 * 1 if bset1 follows bset2
9253 * -1 if bset1 precedes bset2
9254 * 0 if bset1 and bset2 are incomparable
9255 * -2 if some error occurred.
9257 int isl_basic_set_compare_at(__isl_keep isl_basic_set
*bset1
,
9258 __isl_keep isl_basic_set
*bset2
, int pos
)
9261 enum isl_lp_result res
;
9266 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
9268 if (res
== isl_lp_empty
)
9270 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
9271 res
== isl_lp_unbounded
)
9273 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
9282 /* Given two basic sets bset1 and bset2, check whether
9283 * for any common value of the parameters and dimensions preceding pos
9284 * there is a value of dimension pos in bset1 that is larger
9285 * than a value of the same dimension in bset2.
9288 * 1 if there exists such a pair
9289 * 0 if there is no such pair, but there is a pair of equal values
9291 * -2 if some error occurred.
9293 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
9294 __isl_keep isl_basic_set
*bset2
, int pos
)
9297 isl_basic_map
*bmap
;
9300 dim1
= isl_basic_set_dim(bset1
, isl_dim_set
);
9301 bmap
= join_initial(bset1
, bset2
, pos
);
9302 bmap
= isl_basic_map_order_ge(bmap
, isl_dim_out
, 0,
9303 isl_dim_out
, dim1
- pos
);
9304 empty
= isl_basic_map_is_empty(bmap
);
9308 isl_basic_map_free(bmap
);
9311 bmap
= isl_basic_map_order_gt(bmap
, isl_dim_out
, 0,
9312 isl_dim_out
, dim1
- pos
);
9313 empty
= isl_basic_map_is_empty(bmap
);
9316 isl_basic_map_free(bmap
);
9321 isl_basic_map_free(bmap
);
9325 /* Given two sets set1 and set2, check whether
9326 * for any common value of the parameters and dimensions preceding pos
9327 * there is a value of dimension pos in set1 that is larger
9328 * than a value of the same dimension in set2.
9331 * 1 if there exists such a pair
9332 * 0 if there is no such pair, but there is a pair of equal values
9334 * -2 if some error occurred.
9336 int isl_set_follows_at(__isl_keep isl_set
*set1
,
9337 __isl_keep isl_set
*set2
, int pos
)
9345 for (i
= 0; i
< set1
->n
; ++i
)
9346 for (j
= 0; j
< set2
->n
; ++j
) {
9348 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
9349 if (f
== 1 || f
== -2)
9358 static isl_bool
isl_basic_map_plain_has_fixed_var(
9359 __isl_keep isl_basic_map
*bmap
, unsigned pos
, isl_int
*val
)
9366 return isl_bool_error
;
9367 total
= isl_basic_map_total_dim(bmap
);
9368 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
9369 for (; d
+1 > pos
; --d
)
9370 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
9374 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
9375 return isl_bool_false
;
9376 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
9377 return isl_bool_false
;
9378 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
9379 return isl_bool_false
;
9381 isl_int_neg(*val
, bmap
->eq
[i
][0]);
9382 return isl_bool_true
;
9384 return isl_bool_false
;
9387 static isl_bool
isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
9388 unsigned pos
, isl_int
*val
)
9396 return isl_bool_error
;
9398 return isl_bool_false
;
9400 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
9403 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
9404 for (i
= 1; fixed
== isl_bool_true
&& i
< map
->n
; ++i
) {
9405 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
9406 if (fixed
== isl_bool_true
&& isl_int_ne(tmp
, v
))
9407 fixed
= isl_bool_false
;
9410 isl_int_set(*val
, v
);
9416 static isl_bool
isl_basic_set_plain_has_fixed_var(
9417 __isl_keep isl_basic_set
*bset
, unsigned pos
, isl_int
*val
)
9419 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
9423 isl_bool
isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
9424 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9426 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
9427 return isl_bool_error
;
9428 return isl_basic_map_plain_has_fixed_var(bmap
,
9429 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
9432 /* If "bmap" obviously lies on a hyperplane where the given dimension
9433 * has a fixed value, then return that value.
9434 * Otherwise return NaN.
9436 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
9437 __isl_keep isl_basic_map
*bmap
,
9438 enum isl_dim_type type
, unsigned pos
)
9446 ctx
= isl_basic_map_get_ctx(bmap
);
9447 v
= isl_val_alloc(ctx
);
9450 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
9452 return isl_val_free(v
);
9454 isl_int_set_si(v
->d
, 1);
9458 return isl_val_nan(ctx
);
9461 isl_bool
isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
9462 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
9464 if (pos
>= isl_map_dim(map
, type
))
9465 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9466 "position out of bounds", return isl_bool_error
);
9467 return isl_map_plain_has_fixed_var(map
,
9468 map_offset(map
, type
) - 1 + pos
, val
);
9471 /* If "map" obviously lies on a hyperplane where the given dimension
9472 * has a fixed value, then return that value.
9473 * Otherwise return NaN.
9475 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
9476 enum isl_dim_type type
, unsigned pos
)
9484 ctx
= isl_map_get_ctx(map
);
9485 v
= isl_val_alloc(ctx
);
9488 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
9490 return isl_val_free(v
);
9492 isl_int_set_si(v
->d
, 1);
9496 return isl_val_nan(ctx
);
9499 /* If "set" obviously lies on a hyperplane where the given dimension
9500 * has a fixed value, then return that value.
9501 * Otherwise return NaN.
9503 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
9504 enum isl_dim_type type
, unsigned pos
)
9506 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
9509 /* Check if dimension dim has fixed value and if so and if val is not NULL,
9510 * then return this fixed value in *val.
9512 isl_bool
isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
9513 unsigned dim
, isl_int
*val
)
9515 return isl_basic_set_plain_has_fixed_var(bset
,
9516 isl_basic_set_n_param(bset
) + dim
, val
);
9519 /* Return -1 if the constraint "c1" should be sorted before "c2"
9520 * and 1 if it should be sorted after "c2".
9521 * Return 0 if the two constraints are the same (up to the constant term).
9523 * In particular, if a constraint involves later variables than another
9524 * then it is sorted after this other constraint.
9525 * uset_gist depends on constraints without existentially quantified
9526 * variables sorting first.
9528 * For constraints that have the same latest variable, those
9529 * with the same coefficient for this latest variable (first in absolute value
9530 * and then in actual value) are grouped together.
9531 * This is useful for detecting pairs of constraints that can
9532 * be chained in their printed representation.
9534 * Finally, within a group, constraints are sorted according to
9535 * their coefficients (excluding the constant term).
9537 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9539 isl_int
**c1
= (isl_int
**) p1
;
9540 isl_int
**c2
= (isl_int
**) p2
;
9542 unsigned size
= *(unsigned *) arg
;
9545 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9546 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9551 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9554 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9558 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9561 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9562 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9563 * and 0 if the two constraints are the same (up to the constant term).
9565 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9566 isl_int
*c1
, isl_int
*c2
)
9572 total
= isl_basic_map_total_dim(bmap
);
9573 return sort_constraint_cmp(&c1
, &c2
, &total
);
9576 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9577 __isl_take isl_basic_map
*bmap
)
9583 if (bmap
->n_ineq
== 0)
9585 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_SORTED
))
9587 total
= isl_basic_map_total_dim(bmap
);
9588 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9589 &sort_constraint_cmp
, &total
) < 0)
9590 return isl_basic_map_free(bmap
);
9591 ISL_F_SET(bmap
, ISL_BASIC_MAP_SORTED
);
9595 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9596 __isl_take isl_basic_set
*bset
)
9598 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9599 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9602 __isl_give isl_basic_map
*isl_basic_map_normalize(
9603 __isl_take isl_basic_map
*bmap
)
9605 bmap
= isl_basic_map_remove_redundancies(bmap
);
9606 bmap
= isl_basic_map_sort_constraints(bmap
);
9609 int isl_basic_map_plain_cmp(__isl_keep isl_basic_map
*bmap1
,
9610 __isl_keep isl_basic_map
*bmap2
)
9614 isl_space
*space1
, *space2
;
9616 if (!bmap1
|| !bmap2
)
9621 space1
= isl_basic_map_peek_space(bmap1
);
9622 space2
= isl_basic_map_peek_space(bmap2
);
9623 cmp
= isl_space_cmp(space1
, space2
);
9626 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9627 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9628 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9629 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9630 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9632 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9634 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9636 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9637 return bmap1
->n_eq
- bmap2
->n_eq
;
9638 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9639 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9640 if (bmap1
->n_div
!= bmap2
->n_div
)
9641 return bmap1
->n_div
- bmap2
->n_div
;
9642 total
= isl_basic_map_total_dim(bmap1
);
9643 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9644 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9648 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9649 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9653 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9654 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9661 int isl_basic_set_plain_cmp(__isl_keep isl_basic_set
*bset1
,
9662 __isl_keep isl_basic_set
*bset2
)
9664 return isl_basic_map_plain_cmp(bset1
, bset2
);
9667 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9673 if (set1
->n
!= set2
->n
)
9674 return set1
->n
- set2
->n
;
9676 for (i
= 0; i
< set1
->n
; ++i
) {
9677 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9685 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9686 __isl_keep isl_basic_map
*bmap2
)
9688 if (!bmap1
|| !bmap2
)
9689 return isl_bool_error
;
9690 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9693 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9694 __isl_keep isl_basic_set
*bset2
)
9696 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9697 bset_to_bmap(bset2
));
9700 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9702 isl_basic_map
*bmap1
= *(isl_basic_map
**) p1
;
9703 isl_basic_map
*bmap2
= *(isl_basic_map
**) p2
;
9705 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9708 /* Sort the basic maps of "map" and remove duplicate basic maps.
9710 * While removing basic maps, we make sure that the basic maps remain
9711 * sorted because isl_map_normalize expects the basic maps of the result
9714 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9718 map
= isl_map_remove_empty_parts(map
);
9721 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9722 for (i
= map
->n
- 1; i
>= 1; --i
) {
9723 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9725 isl_basic_map_free(map
->p
[i
-1]);
9726 for (j
= i
; j
< map
->n
; ++j
)
9727 map
->p
[j
- 1] = map
->p
[j
];
9734 /* Remove obvious duplicates among the basic maps of "map".
9736 * Unlike isl_map_normalize, this function does not remove redundant
9737 * constraints and only removes duplicates that have exactly the same
9738 * constraints in the input. It does sort the constraints and
9739 * the basic maps to ease the detection of duplicates.
9741 * If "map" has already been normalized or if the basic maps are
9742 * disjoint, then there can be no duplicates.
9744 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9747 isl_basic_map
*bmap
;
9753 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9755 for (i
= 0; i
< map
->n
; ++i
) {
9756 bmap
= isl_basic_map_copy(map
->p
[i
]);
9757 bmap
= isl_basic_map_sort_constraints(bmap
);
9759 return isl_map_free(map
);
9760 isl_basic_map_free(map
->p
[i
]);
9764 map
= sort_and_remove_duplicates(map
);
9768 /* We normalize in place, but if anything goes wrong we need
9769 * to return NULL, so we need to make sure we don't change the
9770 * meaning of any possible other copies of map.
9772 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9775 struct isl_basic_map
*bmap
;
9779 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9781 for (i
= 0; i
< map
->n
; ++i
) {
9782 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9785 isl_basic_map_free(map
->p
[i
]);
9789 map
= sort_and_remove_duplicates(map
);
9791 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9798 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9800 return set_from_map(isl_map_normalize(set_to_map(set
)));
9803 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9804 __isl_keep isl_map
*map2
)
9810 return isl_bool_error
;
9813 return isl_bool_true
;
9814 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9815 return isl_bool_false
;
9817 map1
= isl_map_copy(map1
);
9818 map2
= isl_map_copy(map2
);
9819 map1
= isl_map_normalize(map1
);
9820 map2
= isl_map_normalize(map2
);
9823 equal
= map1
->n
== map2
->n
;
9824 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9825 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9835 return isl_bool_error
;
9838 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9839 __isl_keep isl_set
*set2
)
9841 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9844 /* Return the basic maps in "map" as a list.
9846 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9847 __isl_keep isl_map
*map
)
9851 isl_basic_map_list
*list
;
9855 ctx
= isl_map_get_ctx(map
);
9856 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9858 for (i
= 0; i
< map
->n
; ++i
) {
9859 isl_basic_map
*bmap
;
9861 bmap
= isl_basic_map_copy(map
->p
[i
]);
9862 list
= isl_basic_map_list_add(list
, bmap
);
9868 /* Return the intersection of the elements in the non-empty list "list".
9869 * All elements are assumed to live in the same space.
9871 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9872 __isl_take isl_basic_map_list
*list
)
9875 isl_basic_map
*bmap
;
9879 n
= isl_basic_map_list_n_basic_map(list
);
9881 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9882 "expecting non-empty list", goto error
);
9884 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9885 for (i
= 1; i
< n
; ++i
) {
9886 isl_basic_map
*bmap_i
;
9888 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9889 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9892 isl_basic_map_list_free(list
);
9895 isl_basic_map_list_free(list
);
9899 /* Return the intersection of the elements in the non-empty list "list".
9900 * All elements are assumed to live in the same space.
9902 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9903 __isl_take isl_basic_set_list
*list
)
9905 return isl_basic_map_list_intersect(list
);
9908 /* Return the union of the elements of "list".
9909 * The list is required to have at least one element.
9911 __isl_give isl_set
*isl_basic_set_list_union(
9912 __isl_take isl_basic_set_list
*list
)
9916 isl_basic_set
*bset
;
9921 n
= isl_basic_set_list_n_basic_set(list
);
9923 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9924 "expecting non-empty list", goto error
);
9926 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9927 space
= isl_basic_set_get_space(bset
);
9928 isl_basic_set_free(bset
);
9930 set
= isl_set_alloc_space(space
, n
, 0);
9931 for (i
= 0; i
< n
; ++i
) {
9932 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9933 set
= isl_set_add_basic_set(set
, bset
);
9936 isl_basic_set_list_free(list
);
9939 isl_basic_set_list_free(list
);
9943 /* Return the union of the elements in the non-empty list "list".
9944 * All elements are assumed to live in the same space.
9946 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9953 n
= isl_set_list_n_set(list
);
9955 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9956 "expecting non-empty list", goto error
);
9958 set
= isl_set_list_get_set(list
, 0);
9959 for (i
= 1; i
< n
; ++i
) {
9962 set_i
= isl_set_list_get_set(list
, i
);
9963 set
= isl_set_union(set
, set_i
);
9966 isl_set_list_free(list
);
9969 isl_set_list_free(list
);
9973 __isl_give isl_basic_map
*isl_basic_map_product(
9974 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9976 isl_space
*dim_result
= NULL
;
9977 struct isl_basic_map
*bmap
;
9978 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9979 struct isl_dim_map
*dim_map1
, *dim_map2
;
9981 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
9983 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9984 isl_space_copy(bmap2
->dim
));
9986 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9987 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9988 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9989 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
9990 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9992 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9993 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9994 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9995 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9996 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9997 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9998 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9999 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
10000 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10001 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10002 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10004 bmap
= isl_basic_map_alloc_space(dim_result
,
10005 bmap1
->n_div
+ bmap2
->n_div
,
10006 bmap1
->n_eq
+ bmap2
->n_eq
,
10007 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10008 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10009 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10010 bmap
= isl_basic_map_simplify(bmap
);
10011 return isl_basic_map_finalize(bmap
);
10013 isl_basic_map_free(bmap1
);
10014 isl_basic_map_free(bmap2
);
10018 __isl_give isl_basic_map
*isl_basic_map_flat_product(
10019 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10021 isl_basic_map
*prod
;
10023 prod
= isl_basic_map_product(bmap1
, bmap2
);
10024 prod
= isl_basic_map_flatten(prod
);
10028 __isl_give isl_basic_set
*isl_basic_set_flat_product(
10029 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
10031 return isl_basic_map_flat_range_product(bset1
, bset2
);
10034 __isl_give isl_basic_map
*isl_basic_map_domain_product(
10035 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10037 isl_space
*space_result
= NULL
;
10038 isl_basic_map
*bmap
;
10039 unsigned in1
, in2
, out
, nparam
, total
, pos
;
10040 struct isl_dim_map
*dim_map1
, *dim_map2
;
10042 if (!bmap1
|| !bmap2
)
10045 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
10046 isl_space_copy(bmap2
->dim
));
10048 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10049 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
10050 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10051 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10053 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
10054 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10055 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10056 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10057 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10058 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10059 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
10060 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
10061 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
10062 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
10063 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10065 bmap
= isl_basic_map_alloc_space(space_result
,
10066 bmap1
->n_div
+ bmap2
->n_div
,
10067 bmap1
->n_eq
+ bmap2
->n_eq
,
10068 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10069 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10070 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10071 bmap
= isl_basic_map_simplify(bmap
);
10072 return isl_basic_map_finalize(bmap
);
10074 isl_basic_map_free(bmap1
);
10075 isl_basic_map_free(bmap2
);
10079 __isl_give isl_basic_map
*isl_basic_map_range_product(
10080 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10083 isl_space
*dim_result
= NULL
;
10084 isl_basic_map
*bmap
;
10085 unsigned in
, out1
, out2
, nparam
, total
, pos
;
10086 struct isl_dim_map
*dim_map1
, *dim_map2
;
10088 rational
= isl_basic_map_is_rational(bmap1
);
10089 if (rational
>= 0 && rational
)
10090 rational
= isl_basic_map_is_rational(bmap2
);
10091 if (!bmap1
|| !bmap2
|| rational
< 0)
10094 if (isl_basic_map_check_equal_params(bmap1
, bmap2
) < 0)
10097 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
10098 isl_space_copy(bmap2
->dim
));
10100 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
10101 out1
= isl_basic_map_dim(bmap1
, isl_dim_out
);
10102 out2
= isl_basic_map_dim(bmap2
, isl_dim_out
);
10103 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
10105 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
10106 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10107 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
10108 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
10109 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
10110 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
10111 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
10112 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
10113 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
10114 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
10115 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
10117 bmap
= isl_basic_map_alloc_space(dim_result
,
10118 bmap1
->n_div
+ bmap2
->n_div
,
10119 bmap1
->n_eq
+ bmap2
->n_eq
,
10120 bmap1
->n_ineq
+ bmap2
->n_ineq
);
10121 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
10122 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
10124 bmap
= isl_basic_map_set_rational(bmap
);
10125 bmap
= isl_basic_map_simplify(bmap
);
10126 return isl_basic_map_finalize(bmap
);
10128 isl_basic_map_free(bmap1
);
10129 isl_basic_map_free(bmap2
);
10133 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
10134 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
10136 isl_basic_map
*prod
;
10138 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
10139 prod
= isl_basic_map_flatten_range(prod
);
10143 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
10144 * and collect the results.
10145 * The result live in the space obtained by calling "space_product"
10146 * on the spaces of "map1" and "map2".
10147 * If "remove_duplicates" is set then the result may contain duplicates
10148 * (even if the inputs do not) and so we try and remove the obvious
10151 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
10152 __isl_take isl_map
*map2
,
10153 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
10154 __isl_take isl_space
*right
),
10155 __isl_give isl_basic_map
*(*basic_map_product
)(
10156 __isl_take isl_basic_map
*left
,
10157 __isl_take isl_basic_map
*right
),
10158 int remove_duplicates
)
10160 unsigned flags
= 0;
10161 struct isl_map
*result
;
10165 m
= isl_map_has_equal_params(map1
, map2
);
10169 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
10170 "parameters don't match", goto error
);
10172 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
10173 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
10174 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
10176 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
10177 isl_space_copy(map2
->dim
)),
10178 map1
->n
* map2
->n
, flags
);
10181 for (i
= 0; i
< map1
->n
; ++i
)
10182 for (j
= 0; j
< map2
->n
; ++j
) {
10183 struct isl_basic_map
*part
;
10184 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
10185 isl_basic_map_copy(map2
->p
[j
]));
10186 if (isl_basic_map_is_empty(part
))
10187 isl_basic_map_free(part
);
10189 result
= isl_map_add_basic_map(result
, part
);
10193 if (remove_duplicates
)
10194 result
= isl_map_remove_obvious_duplicates(result
);
10195 isl_map_free(map1
);
10196 isl_map_free(map2
);
10199 isl_map_free(map1
);
10200 isl_map_free(map2
);
10204 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
10206 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
10207 __isl_take isl_map
*map2
)
10209 return map_product(map1
, map2
, &isl_space_product
,
10210 &isl_basic_map_product
, 0);
10213 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
10214 __isl_take isl_map
*map2
)
10216 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
10219 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
10221 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
10222 __isl_take isl_map
*map2
)
10226 prod
= isl_map_product(map1
, map2
);
10227 prod
= isl_map_flatten(prod
);
10231 /* Given two set A and B, construct its Cartesian product A x B.
10233 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
10235 return isl_map_range_product(set1
, set2
);
10238 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
10239 __isl_take isl_set
*set2
)
10241 return isl_map_flat_range_product(set1
, set2
);
10244 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
10246 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
10247 __isl_take isl_map
*map2
)
10249 return map_product(map1
, map2
, &isl_space_domain_product
,
10250 &isl_basic_map_domain_product
, 1);
10253 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
10255 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
10256 __isl_take isl_map
*map2
)
10258 return map_product(map1
, map2
, &isl_space_range_product
,
10259 &isl_basic_map_range_product
, 1);
10262 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
10263 __isl_take isl_map
*map2
)
10265 return isl_map_align_params_map_map_and(map1
, map2
,
10266 &map_domain_product_aligned
);
10269 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
10270 __isl_take isl_map
*map2
)
10272 return isl_map_align_params_map_map_and(map1
, map2
,
10273 &map_range_product_aligned
);
10276 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
10278 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
10281 int total1
, keep1
, total2
, keep2
;
10285 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10286 !isl_space_range_is_wrapping(map
->dim
))
10287 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10288 "not a product", return isl_map_free(map
));
10290 space
= isl_map_get_space(map
);
10291 total1
= isl_space_dim(space
, isl_dim_in
);
10292 total2
= isl_space_dim(space
, isl_dim_out
);
10293 space
= isl_space_factor_domain(space
);
10294 keep1
= isl_space_dim(space
, isl_dim_in
);
10295 keep2
= isl_space_dim(space
, isl_dim_out
);
10296 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
10297 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
10298 map
= isl_map_reset_space(map
, space
);
10303 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
10305 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
10308 int total1
, keep1
, total2
, keep2
;
10312 if (!isl_space_domain_is_wrapping(map
->dim
) ||
10313 !isl_space_range_is_wrapping(map
->dim
))
10314 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10315 "not a product", return isl_map_free(map
));
10317 space
= isl_map_get_space(map
);
10318 total1
= isl_space_dim(space
, isl_dim_in
);
10319 total2
= isl_space_dim(space
, isl_dim_out
);
10320 space
= isl_space_factor_range(space
);
10321 keep1
= isl_space_dim(space
, isl_dim_in
);
10322 keep2
= isl_space_dim(space
, isl_dim_out
);
10323 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
10324 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
10325 map
= isl_map_reset_space(map
, space
);
10330 /* Given a map of the form [A -> B] -> C, return the map A -> C.
10332 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
10339 if (!isl_space_domain_is_wrapping(map
->dim
))
10340 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10341 "domain is not a product", return isl_map_free(map
));
10343 space
= isl_map_get_space(map
);
10344 total
= isl_space_dim(space
, isl_dim_in
);
10345 space
= isl_space_domain_factor_domain(space
);
10346 keep
= isl_space_dim(space
, isl_dim_in
);
10347 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
10348 map
= isl_map_reset_space(map
, space
);
10353 /* Given a map of the form [A -> B] -> C, return the map B -> C.
10355 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
10362 if (!isl_space_domain_is_wrapping(map
->dim
))
10363 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10364 "domain is not a product", return isl_map_free(map
));
10366 space
= isl_map_get_space(map
);
10367 total
= isl_space_dim(space
, isl_dim_in
);
10368 space
= isl_space_domain_factor_range(space
);
10369 keep
= isl_space_dim(space
, isl_dim_in
);
10370 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
10371 map
= isl_map_reset_space(map
, space
);
10376 /* Given a map A -> [B -> C], extract the map A -> B.
10378 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
10385 if (!isl_space_range_is_wrapping(map
->dim
))
10386 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10387 "range is not a product", return isl_map_free(map
));
10389 space
= isl_map_get_space(map
);
10390 total
= isl_space_dim(space
, isl_dim_out
);
10391 space
= isl_space_range_factor_domain(space
);
10392 keep
= isl_space_dim(space
, isl_dim_out
);
10393 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10394 map
= isl_map_reset_space(map
, space
);
10399 /* Given a map A -> [B -> C], extract the map A -> C.
10401 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10408 if (!isl_space_range_is_wrapping(map
->dim
))
10409 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10410 "range is not a product", return isl_map_free(map
));
10412 space
= isl_map_get_space(map
);
10413 total
= isl_space_dim(space
, isl_dim_out
);
10414 space
= isl_space_range_factor_range(space
);
10415 keep
= isl_space_dim(space
, isl_dim_out
);
10416 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10417 map
= isl_map_reset_space(map
, space
);
10422 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10424 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10425 __isl_take isl_map
*map2
)
10429 prod
= isl_map_domain_product(map1
, map2
);
10430 prod
= isl_map_flatten_domain(prod
);
10434 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10436 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10437 __isl_take isl_map
*map2
)
10441 prod
= isl_map_range_product(map1
, map2
);
10442 prod
= isl_map_flatten_range(prod
);
10446 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10449 uint32_t hash
= isl_hash_init();
10454 bmap
= isl_basic_map_copy(bmap
);
10455 bmap
= isl_basic_map_normalize(bmap
);
10458 total
= isl_basic_map_total_dim(bmap
);
10459 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10460 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10462 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10463 isl_hash_hash(hash
, c_hash
);
10465 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10466 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10468 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10469 isl_hash_hash(hash
, c_hash
);
10471 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10472 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10474 if (isl_int_is_zero(bmap
->div
[i
][0]))
10476 isl_hash_byte(hash
, i
& 0xFF);
10477 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10478 isl_hash_hash(hash
, c_hash
);
10480 isl_basic_map_free(bmap
);
10484 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10486 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10489 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10496 map
= isl_map_copy(map
);
10497 map
= isl_map_normalize(map
);
10501 hash
= isl_hash_init();
10502 for (i
= 0; i
< map
->n
; ++i
) {
10503 uint32_t bmap_hash
;
10504 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10505 isl_hash_hash(hash
, bmap_hash
);
10513 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10515 return isl_map_get_hash(set_to_map(set
));
10518 /* Return the number of basic maps in the (current) representation of "map".
10520 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10522 return map
? map
->n
: 0;
10525 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10527 return set
? set
->n
: 0;
10530 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10531 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10536 return isl_stat_error
;
10538 for (i
= 0; i
< map
->n
; ++i
)
10539 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10540 return isl_stat_error
;
10542 return isl_stat_ok
;
10545 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10546 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10551 return isl_stat_error
;
10553 for (i
= 0; i
< set
->n
; ++i
)
10554 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10555 return isl_stat_error
;
10557 return isl_stat_ok
;
10560 /* Return a list of basic sets, the union of which is equal to "set".
10562 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10563 __isl_keep isl_set
*set
)
10566 isl_basic_set_list
*list
;
10571 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10572 for (i
= 0; i
< set
->n
; ++i
) {
10573 isl_basic_set
*bset
;
10575 bset
= isl_basic_set_copy(set
->p
[i
]);
10576 list
= isl_basic_set_list_add(list
, bset
);
10582 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10589 bset
= isl_basic_set_cow(bset
);
10593 dim
= isl_basic_set_get_space(bset
);
10594 dim
= isl_space_lift(dim
, bset
->n_div
);
10597 isl_space_free(bset
->dim
);
10599 bset
->extra
-= bset
->n_div
;
10602 bset
= isl_basic_set_finalize(bset
);
10606 isl_basic_set_free(bset
);
10610 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10616 set
= set_from_map(isl_map_align_divs_internal(set_to_map(set
)));
10621 set
= isl_set_cow(set
);
10625 n_div
= set
->p
[0]->n_div
;
10626 dim
= isl_set_get_space(set
);
10627 dim
= isl_space_lift(dim
, n_div
);
10630 isl_space_free(set
->dim
);
10633 for (i
= 0; i
< set
->n
; ++i
) {
10634 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10645 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10653 dim
= isl_basic_set_total_dim(bset
);
10654 size
+= bset
->n_eq
* (1 + dim
);
10655 size
+= bset
->n_ineq
* (1 + dim
);
10656 size
+= bset
->n_div
* (2 + dim
);
10661 int isl_set_size(__isl_keep isl_set
*set
)
10669 for (i
= 0; i
< set
->n
; ++i
)
10670 size
+= isl_basic_set_size(set
->p
[i
]);
10675 /* Check if there is any lower bound (if lower == 0) and/or upper
10676 * bound (if upper == 0) on the specified dim.
10678 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10679 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10683 if (isl_basic_map_check_range(bmap
, type
, pos
, 1) < 0)
10684 return isl_bool_error
;
10686 pos
+= isl_basic_map_offset(bmap
, type
);
10688 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10689 if (isl_int_is_zero(bmap
->div
[i
][0]))
10691 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10692 return isl_bool_true
;
10695 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10696 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10697 return isl_bool_true
;
10699 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10700 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10707 return lower
&& upper
;
10710 isl_bool
isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10711 enum isl_dim_type type
, unsigned pos
)
10713 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10716 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10717 enum isl_dim_type type
, unsigned pos
)
10719 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10722 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10723 enum isl_dim_type type
, unsigned pos
)
10725 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10728 isl_bool
isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10729 enum isl_dim_type type
, unsigned pos
)
10734 return isl_bool_error
;
10736 for (i
= 0; i
< map
->n
; ++i
) {
10738 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10739 if (bounded
< 0 || !bounded
)
10743 return isl_bool_true
;
10746 /* Return true if the specified dim is involved in both an upper bound
10747 * and a lower bound.
10749 isl_bool
isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10750 enum isl_dim_type type
, unsigned pos
)
10752 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10755 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10757 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10758 enum isl_dim_type type
, unsigned pos
,
10759 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10760 enum isl_dim_type type
, unsigned pos
))
10765 return isl_bool_error
;
10767 for (i
= 0; i
< map
->n
; ++i
) {
10769 bounded
= fn(map
->p
[i
], type
, pos
);
10770 if (bounded
< 0 || bounded
)
10774 return isl_bool_false
;
10777 /* Return 1 if the specified dim is involved in any lower bound.
10779 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10780 enum isl_dim_type type
, unsigned pos
)
10782 return has_any_bound(set
, type
, pos
,
10783 &isl_basic_map_dim_has_lower_bound
);
10786 /* Return 1 if the specified dim is involved in any upper bound.
10788 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10789 enum isl_dim_type type
, unsigned pos
)
10791 return has_any_bound(set
, type
, pos
,
10792 &isl_basic_map_dim_has_upper_bound
);
10795 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10797 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10798 enum isl_dim_type type
, unsigned pos
,
10799 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10800 enum isl_dim_type type
, unsigned pos
))
10805 return isl_bool_error
;
10807 for (i
= 0; i
< map
->n
; ++i
) {
10809 bounded
= fn(map
->p
[i
], type
, pos
);
10810 if (bounded
< 0 || !bounded
)
10814 return isl_bool_true
;
10817 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10819 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10820 enum isl_dim_type type
, unsigned pos
)
10822 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10825 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10827 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10828 enum isl_dim_type type
, unsigned pos
)
10830 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10833 /* For each of the "n" variables starting at "first", determine
10834 * the sign of the variable and put the results in the first "n"
10835 * elements of the array "signs".
10837 * 1 means that the variable is non-negative
10838 * -1 means that the variable is non-positive
10839 * 0 means the variable attains both positive and negative values.
10841 isl_stat
isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10842 unsigned first
, unsigned n
, int *signs
)
10844 isl_vec
*bound
= NULL
;
10845 struct isl_tab
*tab
= NULL
;
10846 struct isl_tab_undo
*snap
;
10849 if (!bset
|| !signs
)
10850 return isl_stat_error
;
10852 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10853 tab
= isl_tab_from_basic_set(bset
, 0);
10854 if (!bound
|| !tab
)
10857 isl_seq_clr(bound
->el
, bound
->size
);
10858 isl_int_set_si(bound
->el
[0], -1);
10860 snap
= isl_tab_snap(tab
);
10861 for (i
= 0; i
< n
; ++i
) {
10864 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10865 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10867 empty
= tab
->empty
;
10868 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10869 if (isl_tab_rollback(tab
, snap
) < 0)
10877 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10878 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10880 empty
= tab
->empty
;
10881 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10882 if (isl_tab_rollback(tab
, snap
) < 0)
10885 signs
[i
] = empty
? -1 : 0;
10889 isl_vec_free(bound
);
10890 return isl_stat_ok
;
10893 isl_vec_free(bound
);
10894 return isl_stat_error
;
10897 isl_stat
isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10898 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10900 if (!bset
|| !signs
)
10901 return isl_stat_error
;
10902 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10903 return isl_stat_error
);
10905 first
+= pos(bset
->dim
, type
) - 1;
10906 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10909 /* Is it possible for the integer division "div" to depend (possibly
10910 * indirectly) on any output dimensions?
10912 * If the div is undefined, then we conservatively assume that it
10913 * may depend on them.
10914 * Otherwise, we check if it actually depends on them or on any integer
10915 * divisions that may depend on them.
10917 static isl_bool
div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10920 unsigned n_out
, o_out
;
10921 unsigned n_div
, o_div
;
10923 if (isl_int_is_zero(bmap
->div
[div
][0]))
10924 return isl_bool_true
;
10926 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10927 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10929 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10930 return isl_bool_true
;
10932 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10933 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10935 for (i
= 0; i
< n_div
; ++i
) {
10936 isl_bool may_involve
;
10938 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10940 may_involve
= div_may_involve_output(bmap
, i
);
10941 if (may_involve
< 0 || may_involve
)
10942 return may_involve
;
10945 return isl_bool_false
;
10948 /* Return the first integer division of "bmap" in the range
10949 * [first, first + n[ that may depend on any output dimensions and
10950 * that has a non-zero coefficient in "c" (where the first coefficient
10951 * in "c" corresponds to integer division "first").
10953 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10954 isl_int
*c
, int first
, int n
)
10961 for (k
= first
; k
< first
+ n
; ++k
) {
10962 isl_bool may_involve
;
10964 if (isl_int_is_zero(c
[k
]))
10966 may_involve
= div_may_involve_output(bmap
, k
);
10967 if (may_involve
< 0)
10976 /* Look for a pair of inequality constraints in "bmap" of the form
10978 * -l + i >= 0 or i >= l
10980 * n + l - i >= 0 or i <= l + n
10982 * with n < "m" and i the output dimension at position "pos".
10983 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10984 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10985 * and earlier output dimensions, as well as integer divisions that do
10986 * not involve any of the output dimensions.
10988 * Return the index of the first inequality constraint or bmap->n_ineq
10989 * if no such pair can be found.
10991 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10992 int pos
, isl_int m
)
10997 unsigned n_div
, o_div
;
10998 unsigned n_out
, o_out
;
11004 ctx
= isl_basic_map_get_ctx(bmap
);
11005 total
= isl_basic_map_total_dim(bmap
);
11006 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11007 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11008 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11009 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11010 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11011 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
11013 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
11014 n_out
- (pos
+ 1)) != -1)
11016 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
11019 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
11020 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
11023 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
11024 bmap
->ineq
[j
] + 1, total
))
11028 if (j
>= bmap
->n_ineq
)
11030 isl_int_add(bmap
->ineq
[i
][0],
11031 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
11032 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
11033 isl_int_sub(bmap
->ineq
[i
][0],
11034 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
11037 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
11043 return bmap
->n_ineq
;
11046 /* Return the index of the equality of "bmap" that defines
11047 * the output dimension "pos" in terms of earlier dimensions.
11048 * The equality may also involve integer divisions, as long
11049 * as those integer divisions are defined in terms of
11050 * parameters or input dimensions.
11051 * In this case, *div is set to the number of integer divisions and
11052 * *ineq is set to the number of inequality constraints (provided
11053 * div and ineq are not NULL).
11055 * The equality may also involve a single integer division involving
11056 * the output dimensions (typically only output dimension "pos") as
11057 * long as the coefficient of output dimension "pos" is 1 or -1 and
11058 * there is a pair of constraints i >= l and i <= l + n, with i referring
11059 * to output dimension "pos", l an expression involving only earlier
11060 * dimensions and n smaller than the coefficient of the integer division
11061 * in the equality. In this case, the output dimension can be defined
11062 * in terms of a modulo expression that does not involve the integer division.
11063 * *div is then set to this single integer division and
11064 * *ineq is set to the index of constraint i >= l.
11066 * Return bmap->n_eq if there is no such equality.
11067 * Return -1 on error.
11069 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
11070 int pos
, int *div
, int *ineq
)
11073 unsigned n_out
, o_out
;
11074 unsigned n_div
, o_div
;
11079 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11080 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
11081 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11082 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
11085 *ineq
= bmap
->n_ineq
;
11088 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
11089 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
11091 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
11092 n_out
- (pos
+ 1)) != -1)
11094 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11098 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
11099 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
11101 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
11102 k
+ 1, n_div
- (k
+1)) < n_div
)
11104 l
= find_modulo_constraint_pair(bmap
, pos
,
11105 bmap
->eq
[j
][o_div
+ k
]);
11108 if (l
>= bmap
->n_ineq
)
11120 /* Check if the given basic map is obviously single-valued.
11121 * In particular, for each output dimension, check that there is
11122 * an equality that defines the output dimension in terms of
11123 * earlier dimensions.
11125 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11131 return isl_bool_error
;
11133 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
11135 for (i
= 0; i
< n_out
; ++i
) {
11138 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
11141 return isl_bool_error
;
11142 if (eq
>= bmap
->n_eq
)
11143 return isl_bool_false
;
11146 return isl_bool_true
;
11149 /* Check if the given basic map is single-valued.
11150 * We simply compute
11154 * and check if the result is a subset of the identity mapping.
11156 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
11159 isl_basic_map
*test
;
11163 sv
= isl_basic_map_plain_is_single_valued(bmap
);
11167 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
11168 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
11170 space
= isl_basic_map_get_space(bmap
);
11171 space
= isl_space_map_from_set(isl_space_range(space
));
11172 id
= isl_basic_map_identity(space
);
11174 sv
= isl_basic_map_is_subset(test
, id
);
11176 isl_basic_map_free(test
);
11177 isl_basic_map_free(id
);
11182 /* Check if the given map is obviously single-valued.
11184 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
11187 return isl_bool_error
;
11189 return isl_bool_true
;
11191 return isl_bool_false
;
11193 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
11196 /* Check if the given map is single-valued.
11197 * We simply compute
11201 * and check if the result is a subset of the identity mapping.
11203 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
11210 sv
= isl_map_plain_is_single_valued(map
);
11214 test
= isl_map_reverse(isl_map_copy(map
));
11215 test
= isl_map_apply_range(test
, isl_map_copy(map
));
11217 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
11218 id
= isl_map_identity(dim
);
11220 sv
= isl_map_is_subset(test
, id
);
11222 isl_map_free(test
);
11228 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
11232 map
= isl_map_copy(map
);
11233 map
= isl_map_reverse(map
);
11234 in
= isl_map_is_single_valued(map
);
11240 /* Check if the given map is obviously injective.
11242 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
11246 map
= isl_map_copy(map
);
11247 map
= isl_map_reverse(map
);
11248 in
= isl_map_plain_is_single_valued(map
);
11254 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
11258 sv
= isl_map_is_single_valued(map
);
11262 return isl_map_is_injective(map
);
11265 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
11267 return isl_map_is_single_valued(set_to_map(set
));
11270 /* Does "map" only map elements to themselves?
11272 * If the domain and range spaces are different, then "map"
11273 * is considered not to be an identity relation, even if it is empty.
11274 * Otherwise, construct the maximal identity relation and
11275 * check whether "map" is a subset of this relation.
11277 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
11281 isl_bool equal
, is_identity
;
11283 space
= isl_map_get_space(map
);
11284 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
11285 isl_space_free(space
);
11286 if (equal
< 0 || !equal
)
11289 id
= isl_map_identity(isl_map_get_space(map
));
11290 is_identity
= isl_map_is_subset(map
, id
);
11293 return is_identity
;
11296 int isl_map_is_translation(__isl_keep isl_map
*map
)
11301 delta
= isl_map_deltas(isl_map_copy(map
));
11302 ok
= isl_set_is_singleton(delta
);
11303 isl_set_free(delta
);
11308 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11310 if (isl_seq_first_non_zero(p
, pos
) != -1)
11312 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11317 isl_bool
isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11324 return isl_bool_error
;
11326 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11327 return isl_bool_false
;
11329 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11330 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11331 for (j
= 0; j
< nvar
; ++j
) {
11332 int lower
= 0, upper
= 0;
11333 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11334 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11336 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11337 return isl_bool_false
;
11340 if (i
< bset
->n_eq
)
11342 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11343 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11345 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11346 return isl_bool_false
;
11347 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11352 if (!lower
|| !upper
)
11353 return isl_bool_false
;
11356 return isl_bool_true
;
11359 isl_bool
isl_set_is_box(__isl_keep isl_set
*set
)
11362 return isl_bool_error
;
11364 return isl_bool_false
;
11366 return isl_basic_set_is_box(set
->p
[0]);
11369 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11372 return isl_bool_error
;
11374 return isl_space_is_wrapping(bset
->dim
);
11377 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11380 return isl_bool_error
;
11382 return isl_space_is_wrapping(set
->dim
);
11385 /* Modify the space of "map" through a call to "change".
11386 * If "can_change" is set (not NULL), then first call it to check
11387 * if the modification is allowed, printing the error message "cannot_change"
11390 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11391 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11392 const char *cannot_change
,
11393 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11401 ok
= can_change
? can_change(map
) : isl_bool_true
;
11403 return isl_map_free(map
);
11405 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11406 return isl_map_free(map
));
11408 space
= change(isl_map_get_space(map
));
11409 map
= isl_map_reset_space(map
, space
);
11414 /* Is the domain of "map" a wrapped relation?
11416 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11419 return isl_bool_error
;
11421 return isl_space_domain_is_wrapping(map
->dim
);
11424 /* Does "map" have a wrapped relation in both domain and range?
11426 isl_bool
isl_map_is_product(__isl_keep isl_map
*map
)
11428 return isl_space_is_product(isl_map_peek_space(map
));
11431 /* Is the range of "map" a wrapped relation?
11433 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11436 return isl_bool_error
;
11438 return isl_space_range_is_wrapping(map
->dim
);
11441 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11443 bmap
= isl_basic_map_cow(bmap
);
11447 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11451 bmap
= isl_basic_map_finalize(bmap
);
11453 return bset_from_bmap(bmap
);
11455 isl_basic_map_free(bmap
);
11459 /* Given a map A -> B, return the set (A -> B).
11461 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11463 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11466 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11468 bset
= isl_basic_set_cow(bset
);
11472 bset
->dim
= isl_space_unwrap(bset
->dim
);
11476 bset
= isl_basic_set_finalize(bset
);
11478 return bset_to_bmap(bset
);
11480 isl_basic_set_free(bset
);
11484 /* Given a set (A -> B), return the map A -> B.
11485 * Error out if "set" is not of the form (A -> B).
11487 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11489 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11490 "not a wrapping set", &isl_space_unwrap
);
11493 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11494 enum isl_dim_type type
)
11499 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11502 bmap
= isl_basic_map_cow(bmap
);
11506 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11510 bmap
= isl_basic_map_finalize(bmap
);
11514 isl_basic_map_free(bmap
);
11518 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11519 enum isl_dim_type type
)
11526 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11529 map
= isl_map_cow(map
);
11533 for (i
= 0; i
< map
->n
; ++i
) {
11534 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11538 map
->dim
= isl_space_reset(map
->dim
, type
);
11548 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11553 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11556 bmap
= isl_basic_map_cow(bmap
);
11560 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11564 bmap
= isl_basic_map_finalize(bmap
);
11568 isl_basic_map_free(bmap
);
11572 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11574 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11577 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11578 __isl_take isl_basic_map
*bmap
)
11583 if (!bmap
->dim
->nested
[0])
11586 bmap
= isl_basic_map_cow(bmap
);
11590 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11594 bmap
= isl_basic_map_finalize(bmap
);
11598 isl_basic_map_free(bmap
);
11602 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11603 __isl_take isl_basic_map
*bmap
)
11608 if (!bmap
->dim
->nested
[1])
11611 bmap
= isl_basic_map_cow(bmap
);
11615 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11619 bmap
= isl_basic_map_finalize(bmap
);
11623 isl_basic_map_free(bmap
);
11627 /* Remove any internal structure from the spaces of domain and range of "map".
11629 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11634 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11637 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11640 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11642 return set_from_map(isl_map_flatten(set_to_map(set
)));
11645 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11647 isl_space
*dim
, *flat_dim
;
11650 dim
= isl_set_get_space(set
);
11651 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11652 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11653 map
= isl_map_intersect_domain(map
, set
);
11658 /* Remove any internal structure from the space of the domain of "map".
11660 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11665 if (!map
->dim
->nested
[0])
11668 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11671 /* Remove any internal structure from the space of the range of "map".
11673 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11678 if (!map
->dim
->nested
[1])
11681 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11684 /* Reorder the dimensions of "bmap" according to the given dim_map
11685 * and set the dimension specification to "space" and
11686 * perform Gaussian elimination on the result.
11688 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11689 __isl_take isl_space
*space
, __isl_take
struct isl_dim_map
*dim_map
)
11691 isl_basic_map
*res
;
11695 if (!bmap
|| !space
|| !dim_map
)
11698 flags
= bmap
->flags
;
11699 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11700 ISL_FL_CLR(flags
, ISL_BASIC_MAP_SORTED
);
11701 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11702 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
11703 res
= isl_basic_map_alloc_space(space
, n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11704 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11706 res
->flags
= flags
;
11707 res
= isl_basic_map_gauss(res
, NULL
);
11708 res
= isl_basic_map_finalize(res
);
11712 isl_basic_map_free(bmap
);
11713 isl_space_free(space
);
11717 /* Reorder the dimensions of "map" according to given reordering.
11719 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11720 __isl_take isl_reordering
*r
)
11723 struct isl_dim_map
*dim_map
;
11725 map
= isl_map_cow(map
);
11726 dim_map
= isl_dim_map_from_reordering(r
);
11727 if (!map
|| !r
|| !dim_map
)
11730 for (i
= 0; i
< map
->n
; ++i
) {
11731 struct isl_dim_map
*dim_map_i
;
11734 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11736 space
= isl_reordering_get_space(r
);
11737 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
], space
, dim_map_i
);
11743 map
= isl_map_reset_space(map
, isl_reordering_get_space(r
));
11744 map
= isl_map_unmark_normalized(map
);
11746 isl_reordering_free(r
);
11752 isl_reordering_free(r
);
11756 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11757 __isl_take isl_reordering
*r
)
11759 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11762 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11763 __isl_take isl_space
*model
)
11768 if (!map
|| !model
)
11771 ctx
= isl_space_get_ctx(model
);
11772 if (!isl_space_has_named_params(model
))
11773 isl_die(ctx
, isl_error_invalid
,
11774 "model has unnamed parameters", goto error
);
11775 if (isl_map_check_named_params(map
) < 0)
11777 aligned
= isl_map_space_has_equal_params(map
, model
);
11781 isl_reordering
*exp
;
11783 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11784 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11785 map
= isl_map_realign(map
, exp
);
11788 isl_space_free(model
);
11791 isl_space_free(model
);
11796 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11797 __isl_take isl_space
*model
)
11799 return isl_map_align_params(set
, model
);
11802 /* Align the parameters of "bmap" to those of "model", introducing
11803 * additional parameters if needed.
11805 __isl_give isl_basic_map
*isl_basic_map_align_params(
11806 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11809 isl_bool equal_params
;
11811 if (!bmap
|| !model
)
11814 ctx
= isl_space_get_ctx(model
);
11815 if (!isl_space_has_named_params(model
))
11816 isl_die(ctx
, isl_error_invalid
,
11817 "model has unnamed parameters", goto error
);
11818 if (isl_basic_map_check_named_params(bmap
) < 0)
11820 equal_params
= isl_space_has_equal_params(bmap
->dim
, model
);
11821 if (equal_params
< 0)
11823 if (!equal_params
) {
11824 isl_reordering
*exp
;
11825 struct isl_dim_map
*dim_map
;
11827 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11828 exp
= isl_reordering_extend_space(exp
,
11829 isl_basic_map_get_space(bmap
));
11830 dim_map
= isl_dim_map_from_reordering(exp
);
11831 bmap
= isl_basic_map_realign(bmap
,
11832 isl_reordering_get_space(exp
),
11833 isl_dim_map_extend(dim_map
, bmap
));
11834 isl_reordering_free(exp
);
11838 isl_space_free(model
);
11841 isl_space_free(model
);
11842 isl_basic_map_free(bmap
);
11846 /* Do "bset" and "space" have the same parameters?
11848 isl_bool
isl_basic_set_space_has_equal_params(__isl_keep isl_basic_set
*bset
,
11849 __isl_keep isl_space
*space
)
11851 isl_space
*bset_space
;
11853 bset_space
= isl_basic_set_peek_space(bset
);
11854 return isl_space_has_equal_params(bset_space
, space
);
11857 /* Do "map" and "space" have the same parameters?
11859 isl_bool
isl_map_space_has_equal_params(__isl_keep isl_map
*map
,
11860 __isl_keep isl_space
*space
)
11862 isl_space
*map_space
;
11864 map_space
= isl_map_peek_space(map
);
11865 return isl_space_has_equal_params(map_space
, space
);
11868 /* Do "set" and "space" have the same parameters?
11870 isl_bool
isl_set_space_has_equal_params(__isl_keep isl_set
*set
,
11871 __isl_keep isl_space
*space
)
11873 return isl_map_space_has_equal_params(set_to_map(set
), space
);
11876 /* Align the parameters of "bset" to those of "model", introducing
11877 * additional parameters if needed.
11879 __isl_give isl_basic_set
*isl_basic_set_align_params(
11880 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11882 return isl_basic_map_align_params(bset
, model
);
11885 /* Drop all parameters not referenced by "map".
11887 __isl_give isl_map
*isl_map_drop_unused_params(__isl_take isl_map
*map
)
11891 if (isl_map_check_named_params(map
) < 0)
11892 return isl_map_free(map
);
11894 for (i
= isl_map_dim(map
, isl_dim_param
) - 1; i
>= 0; i
--) {
11897 involves
= isl_map_involves_dims(map
, isl_dim_param
, i
, 1);
11899 return isl_map_free(map
);
11901 map
= isl_map_project_out(map
, isl_dim_param
, i
, 1);
11907 /* Drop all parameters not referenced by "set".
11909 __isl_give isl_set
*isl_set_drop_unused_params(
11910 __isl_take isl_set
*set
)
11912 return set_from_map(isl_map_drop_unused_params(set_to_map(set
)));
11915 /* Drop all parameters not referenced by "bmap".
11917 __isl_give isl_basic_map
*isl_basic_map_drop_unused_params(
11918 __isl_take isl_basic_map
*bmap
)
11922 if (isl_basic_map_check_named_params(bmap
) < 0)
11923 return isl_basic_map_free(bmap
);
11925 for (i
= isl_basic_map_dim(bmap
, isl_dim_param
) - 1; i
>= 0; i
--) {
11928 involves
= isl_basic_map_involves_dims(bmap
,
11929 isl_dim_param
, i
, 1);
11931 return isl_basic_map_free(bmap
);
11933 bmap
= isl_basic_map_drop(bmap
, isl_dim_param
, i
, 1);
11939 /* Drop all parameters not referenced by "bset".
11941 __isl_give isl_basic_set
*isl_basic_set_drop_unused_params(
11942 __isl_take isl_basic_set
*bset
)
11944 return bset_from_bmap(isl_basic_map_drop_unused_params(
11945 bset_to_bmap(bset
)));
11948 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11949 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11950 enum isl_dim_type c2
, enum isl_dim_type c3
,
11951 enum isl_dim_type c4
, enum isl_dim_type c5
)
11953 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11954 struct isl_mat
*mat
;
11960 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11961 isl_basic_map_total_dim(bmap
) + 1);
11964 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11965 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11966 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11967 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11968 isl_int_set(mat
->row
[i
][pos
],
11969 bmap
->eq
[i
][off
+ k
]);
11977 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11978 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11979 enum isl_dim_type c2
, enum isl_dim_type c3
,
11980 enum isl_dim_type c4
, enum isl_dim_type c5
)
11982 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11983 struct isl_mat
*mat
;
11989 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11990 isl_basic_map_total_dim(bmap
) + 1);
11993 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11994 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11995 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11996 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11997 isl_int_set(mat
->row
[i
][pos
],
11998 bmap
->ineq
[i
][off
+ k
]);
12006 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
12007 __isl_take isl_space
*space
,
12008 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
12009 enum isl_dim_type c2
, enum isl_dim_type c3
,
12010 enum isl_dim_type c4
, enum isl_dim_type c5
)
12012 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
12013 isl_basic_map
*bmap
= NULL
;
12019 if (!space
|| !eq
|| !ineq
)
12022 if (eq
->n_col
!= ineq
->n_col
)
12023 isl_die(space
->ctx
, isl_error_invalid
,
12024 "equalities and inequalities matrices should have "
12025 "same number of columns", goto error
);
12027 total
= 1 + isl_space_dim(space
, isl_dim_all
);
12029 if (eq
->n_col
< total
)
12030 isl_die(space
->ctx
, isl_error_invalid
,
12031 "number of columns too small", goto error
);
12033 extra
= eq
->n_col
- total
;
12035 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), extra
,
12036 eq
->n_row
, ineq
->n_row
);
12039 for (i
= 0; i
< extra
; ++i
) {
12040 k
= isl_basic_map_alloc_div(bmap
);
12043 isl_int_set_si(bmap
->div
[k
][0], 0);
12045 for (i
= 0; i
< eq
->n_row
; ++i
) {
12046 l
= isl_basic_map_alloc_equality(bmap
);
12049 for (j
= 0, pos
= 0; j
< 5; ++j
) {
12050 int off
= isl_basic_map_offset(bmap
, c
[j
]);
12051 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
12052 isl_int_set(bmap
->eq
[l
][off
+ k
],
12058 for (i
= 0; i
< ineq
->n_row
; ++i
) {
12059 l
= isl_basic_map_alloc_inequality(bmap
);
12062 for (j
= 0, pos
= 0; j
< 5; ++j
) {
12063 int off
= isl_basic_map_offset(bmap
, c
[j
]);
12064 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
12065 isl_int_set(bmap
->ineq
[l
][off
+ k
],
12066 ineq
->row
[i
][pos
]);
12072 isl_space_free(space
);
12074 isl_mat_free(ineq
);
12076 bmap
= isl_basic_map_simplify(bmap
);
12077 return isl_basic_map_finalize(bmap
);
12079 isl_space_free(space
);
12081 isl_mat_free(ineq
);
12082 isl_basic_map_free(bmap
);
12086 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
12087 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
12088 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12090 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
12091 c1
, c2
, c3
, c4
, isl_dim_in
);
12094 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
12095 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
12096 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12098 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
12099 c1
, c2
, c3
, c4
, isl_dim_in
);
12102 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
12103 __isl_take isl_space
*dim
,
12104 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
12105 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
12107 isl_basic_map
*bmap
;
12108 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
12109 c1
, c2
, c3
, c4
, isl_dim_in
);
12110 return bset_from_bmap(bmap
);
12113 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
12116 return isl_bool_error
;
12118 return isl_space_can_zip(bmap
->dim
);
12121 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
12124 return isl_bool_error
;
12126 return isl_space_can_zip(map
->dim
);
12129 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
12130 * (A -> C) -> (B -> D).
12132 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
12141 if (!isl_basic_map_can_zip(bmap
))
12142 isl_die(bmap
->ctx
, isl_error_invalid
,
12143 "basic map cannot be zipped", goto error
);
12144 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
12145 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
12146 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
12147 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
12148 bmap
= isl_basic_map_cow(bmap
);
12149 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
12152 bmap
->dim
= isl_space_zip(bmap
->dim
);
12155 bmap
= isl_basic_map_mark_final(bmap
);
12158 isl_basic_map_free(bmap
);
12162 /* Given a map (A -> B) -> (C -> D), return the corresponding map
12163 * (A -> C) -> (B -> D).
12165 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
12172 if (!isl_map_can_zip(map
))
12173 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
12176 map
= isl_map_cow(map
);
12180 for (i
= 0; i
< map
->n
; ++i
) {
12181 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
12186 map
->dim
= isl_space_zip(map
->dim
);
12196 /* Can we apply isl_basic_map_curry to "bmap"?
12197 * That is, does it have a nested relation in its domain?
12199 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
12202 return isl_bool_error
;
12204 return isl_space_can_curry(bmap
->dim
);
12207 /* Can we apply isl_map_curry to "map"?
12208 * That is, does it have a nested relation in its domain?
12210 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
12213 return isl_bool_error
;
12215 return isl_space_can_curry(map
->dim
);
12218 /* Given a basic map (A -> B) -> C, return the corresponding basic map
12221 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
12227 if (!isl_basic_map_can_curry(bmap
))
12228 isl_die(bmap
->ctx
, isl_error_invalid
,
12229 "basic map cannot be curried", goto error
);
12230 bmap
= isl_basic_map_cow(bmap
);
12233 bmap
->dim
= isl_space_curry(bmap
->dim
);
12236 bmap
= isl_basic_map_mark_final(bmap
);
12239 isl_basic_map_free(bmap
);
12243 /* Given a map (A -> B) -> C, return the corresponding map
12246 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
12248 return isl_map_change_space(map
, &isl_map_can_curry
,
12249 "map cannot be curried", &isl_space_curry
);
12252 /* Can isl_map_range_curry be applied to "map"?
12253 * That is, does it have a nested relation in its range,
12254 * the domain of which is itself a nested relation?
12256 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
12259 return isl_bool_error
;
12261 return isl_space_can_range_curry(map
->dim
);
12264 /* Given a map A -> ((B -> C) -> D), return the corresponding map
12265 * A -> (B -> (C -> D)).
12267 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
12269 return isl_map_change_space(map
, &isl_map_can_range_curry
,
12270 "map range cannot be curried",
12271 &isl_space_range_curry
);
12274 /* Can we apply isl_basic_map_uncurry to "bmap"?
12275 * That is, does it have a nested relation in its domain?
12277 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
12280 return isl_bool_error
;
12282 return isl_space_can_uncurry(bmap
->dim
);
12285 /* Can we apply isl_map_uncurry to "map"?
12286 * That is, does it have a nested relation in its domain?
12288 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
12291 return isl_bool_error
;
12293 return isl_space_can_uncurry(map
->dim
);
12296 /* Given a basic map A -> (B -> C), return the corresponding basic map
12299 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
12305 if (!isl_basic_map_can_uncurry(bmap
))
12306 isl_die(bmap
->ctx
, isl_error_invalid
,
12307 "basic map cannot be uncurried",
12308 return isl_basic_map_free(bmap
));
12309 bmap
= isl_basic_map_cow(bmap
);
12312 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
12314 return isl_basic_map_free(bmap
);
12315 bmap
= isl_basic_map_mark_final(bmap
);
12319 /* Given a map A -> (B -> C), return the corresponding map
12322 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
12324 return isl_map_change_space(map
, &isl_map_can_uncurry
,
12325 "map cannot be uncurried", &isl_space_uncurry
);
12328 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12329 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12331 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12334 /* Construct a basic map where the given dimensions are equal to each other.
12336 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12337 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12339 isl_basic_map
*bmap
= NULL
;
12345 if (pos1
>= isl_space_dim(space
, type1
))
12346 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12347 "index out of bounds", goto error
);
12348 if (pos2
>= isl_space_dim(space
, type2
))
12349 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12350 "index out of bounds", goto error
);
12352 if (type1
== type2
&& pos1
== pos2
)
12353 return isl_basic_map_universe(space
);
12355 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12356 i
= isl_basic_map_alloc_equality(bmap
);
12359 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12360 pos1
+= isl_basic_map_offset(bmap
, type1
);
12361 pos2
+= isl_basic_map_offset(bmap
, type2
);
12362 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12363 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12364 bmap
= isl_basic_map_finalize(bmap
);
12365 isl_space_free(space
);
12368 isl_space_free(space
);
12369 isl_basic_map_free(bmap
);
12373 /* Add a constraint imposing that the given two dimensions are equal.
12375 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12376 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12380 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12382 bmap
= isl_basic_map_intersect(bmap
, eq
);
12387 /* Add a constraint imposing that the given two dimensions are equal.
12389 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12390 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12392 isl_basic_map
*bmap
;
12394 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12396 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12401 /* Add a constraint imposing that the given two dimensions have opposite values.
12403 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12404 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12406 isl_basic_map
*bmap
= NULL
;
12412 if (pos1
>= isl_map_dim(map
, type1
))
12413 isl_die(map
->ctx
, isl_error_invalid
,
12414 "index out of bounds", goto error
);
12415 if (pos2
>= isl_map_dim(map
, type2
))
12416 isl_die(map
->ctx
, isl_error_invalid
,
12417 "index out of bounds", goto error
);
12419 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12420 i
= isl_basic_map_alloc_equality(bmap
);
12423 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12424 pos1
+= isl_basic_map_offset(bmap
, type1
);
12425 pos2
+= isl_basic_map_offset(bmap
, type2
);
12426 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12427 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12428 bmap
= isl_basic_map_finalize(bmap
);
12430 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12434 isl_basic_map_free(bmap
);
12439 /* Construct a constraint imposing that the value of the first dimension is
12440 * greater than or equal to that of the second.
12442 static __isl_give isl_constraint
*constraint_order_ge(
12443 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12444 enum isl_dim_type type2
, int pos2
)
12451 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12453 if (pos1
>= isl_constraint_dim(c
, type1
))
12454 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12455 "index out of bounds", return isl_constraint_free(c
));
12456 if (pos2
>= isl_constraint_dim(c
, type2
))
12457 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12458 "index out of bounds", return isl_constraint_free(c
));
12460 if (type1
== type2
&& pos1
== pos2
)
12463 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12464 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12469 /* Add a constraint imposing that the value of the first dimension is
12470 * greater than or equal to that of the second.
12472 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12473 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12478 if (type1
== type2
&& pos1
== pos2
)
12480 space
= isl_basic_map_get_space(bmap
);
12481 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12482 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12487 /* Add a constraint imposing that the value of the first dimension is
12488 * greater than or equal to that of the second.
12490 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12491 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12496 if (type1
== type2
&& pos1
== pos2
)
12498 space
= isl_map_get_space(map
);
12499 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12500 map
= isl_map_add_constraint(map
, c
);
12505 /* Add a constraint imposing that the value of the first dimension is
12506 * less than or equal to that of the second.
12508 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12509 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12511 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12514 /* Construct a basic map where the value of the first dimension is
12515 * greater than that of the second.
12517 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12518 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12520 isl_basic_map
*bmap
= NULL
;
12526 if (pos1
>= isl_space_dim(space
, type1
))
12527 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12528 "index out of bounds", goto error
);
12529 if (pos2
>= isl_space_dim(space
, type2
))
12530 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12531 "index out of bounds", goto error
);
12533 if (type1
== type2
&& pos1
== pos2
)
12534 return isl_basic_map_empty(space
);
12536 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12537 i
= isl_basic_map_alloc_inequality(bmap
);
12539 return isl_basic_map_free(bmap
);
12540 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12541 pos1
+= isl_basic_map_offset(bmap
, type1
);
12542 pos2
+= isl_basic_map_offset(bmap
, type2
);
12543 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12544 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12545 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12546 bmap
= isl_basic_map_finalize(bmap
);
12550 isl_space_free(space
);
12551 isl_basic_map_free(bmap
);
12555 /* Add a constraint imposing that the value of the first dimension is
12556 * greater than that of the second.
12558 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12559 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12563 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12565 bmap
= isl_basic_map_intersect(bmap
, gt
);
12570 /* Add a constraint imposing that the value of the first dimension is
12571 * greater than that of the second.
12573 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12574 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12576 isl_basic_map
*bmap
;
12578 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12580 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12585 /* Add a constraint imposing that the value of the first dimension is
12586 * smaller than that of the second.
12588 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12589 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12591 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12594 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12598 isl_local_space
*ls
;
12603 if (!isl_basic_map_divs_known(bmap
))
12604 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12605 "some divs are unknown", return NULL
);
12607 ls
= isl_basic_map_get_local_space(bmap
);
12608 div
= isl_local_space_get_div(ls
, pos
);
12609 isl_local_space_free(ls
);
12614 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12617 return isl_basic_map_get_div(bset
, pos
);
12620 /* Plug in "subs" for dimension "type", "pos" of "bset".
12622 * Let i be the dimension to replace and let "subs" be of the form
12626 * Any integer division with a non-zero coefficient for i,
12628 * floor((a i + g)/m)
12632 * floor((a f + d g)/(m d))
12634 * Constraints of the form
12642 * We currently require that "subs" is an integral expression.
12643 * Handling rational expressions may require us to add stride constraints
12644 * as we do in isl_basic_set_preimage_multi_aff.
12646 __isl_give isl_basic_set
*isl_basic_set_substitute(
12647 __isl_take isl_basic_set
*bset
,
12648 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12654 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12657 bset
= isl_basic_set_cow(bset
);
12658 if (!bset
|| !subs
)
12661 ctx
= isl_basic_set_get_ctx(bset
);
12662 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12663 isl_die(ctx
, isl_error_invalid
,
12664 "spaces don't match", goto error
);
12665 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12666 isl_die(ctx
, isl_error_unsupported
,
12667 "cannot handle divs yet", goto error
);
12668 if (!isl_int_is_one(subs
->v
->el
[0]))
12669 isl_die(ctx
, isl_error_invalid
,
12670 "can only substitute integer expressions", goto error
);
12672 pos
+= isl_basic_set_offset(bset
, type
);
12676 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12677 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12679 isl_int_set(v
, bset
->eq
[i
][pos
]);
12680 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12681 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12682 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12685 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12686 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12688 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12689 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12690 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12691 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12694 for (i
= 0; i
< bset
->n_div
; ++i
) {
12695 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12697 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12698 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12699 isl_seq_combine(bset
->div
[i
] + 1,
12700 subs
->v
->el
[0], bset
->div
[i
] + 1,
12701 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12702 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12707 bset
= isl_basic_set_simplify(bset
);
12708 return isl_basic_set_finalize(bset
);
12710 isl_basic_set_free(bset
);
12714 /* Plug in "subs" for dimension "type", "pos" of "set".
12716 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12717 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12721 if (set
&& isl_set_plain_is_empty(set
))
12724 set
= isl_set_cow(set
);
12728 for (i
= set
->n
- 1; i
>= 0; --i
) {
12729 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12730 set
= set_from_map(remove_if_empty(set_to_map(set
), i
));
12741 /* Check if the range of "ma" is compatible with the domain or range
12742 * (depending on "type") of "bmap".
12744 static isl_stat
check_basic_map_compatible_range_multi_aff(
12745 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12746 __isl_keep isl_multi_aff
*ma
)
12749 isl_space
*ma_space
;
12751 ma_space
= isl_multi_aff_get_space(ma
);
12753 m
= isl_space_has_equal_params(bmap
->dim
, ma_space
);
12757 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12758 "parameters don't match", goto error
);
12759 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12763 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12764 "spaces don't match", goto error
);
12766 isl_space_free(ma_space
);
12767 return isl_stat_ok
;
12769 isl_space_free(ma_space
);
12770 return isl_stat_error
;
12773 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12774 * coefficients before the transformed range of dimensions,
12775 * the "n_after" coefficients after the transformed range of dimensions
12776 * and the coefficients of the other divs in "bmap".
12778 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12779 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12784 isl_local_space
*ls
;
12789 ls
= isl_aff_get_domain_local_space(ma
->u
.p
[0]);
12793 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12794 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12795 for (i
= 0; i
< n_div
; ++i
) {
12796 int o_bmap
= 0, o_ls
= 0;
12798 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12799 o_bmap
+= 1 + 1 + n_param
;
12800 o_ls
+= 1 + 1 + n_param
;
12801 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12802 o_bmap
+= n_before
;
12803 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12804 ls
->div
->row
[i
] + o_ls
, n_set
);
12807 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12809 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12810 ls
->div
->row
[i
] + o_ls
, n_div
);
12813 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12814 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
12818 isl_local_space_free(ls
);
12821 isl_local_space_free(ls
);
12825 /* How many stride constraints does "ma" enforce?
12826 * That is, how many of the affine expressions have a denominator
12827 * different from one?
12829 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12834 for (i
= 0; i
< ma
->n
; ++i
)
12835 if (!isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12841 /* For each affine expression in ma of the form
12843 * x_i = (f_i y + h_i)/m_i
12845 * with m_i different from one, add a constraint to "bmap"
12848 * f_i y + h_i = m_i alpha_i
12850 * with alpha_i an additional existentially quantified variable.
12852 * The input variables of "ma" correspond to a subset of the variables
12853 * of "bmap". There are "n_before" variables in "bmap" before this
12854 * subset and "n_after" variables after this subset.
12855 * The integer divisions of the affine expressions in "ma" are assumed
12856 * to have been aligned. There are "n_div_ma" of them and
12857 * they appear first in "bmap", straight after the "n_after" variables.
12859 static __isl_give isl_basic_map
*add_ma_strides(
12860 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12861 int n_before
, int n_after
, int n_div_ma
)
12869 total
= isl_basic_map_total_dim(bmap
);
12870 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12871 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12872 for (i
= 0; i
< ma
->n
; ++i
) {
12873 int o_bmap
= 0, o_ma
= 1;
12875 if (isl_int_is_one(ma
->u
.p
[i
]->v
->el
[0]))
12877 div
= isl_basic_map_alloc_div(bmap
);
12878 k
= isl_basic_map_alloc_equality(bmap
);
12879 if (div
< 0 || k
< 0)
12881 isl_int_set_si(bmap
->div
[div
][0], 0);
12882 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12883 ma
->u
.p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12884 o_bmap
+= 1 + n_param
;
12885 o_ma
+= 1 + n_param
;
12886 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12887 o_bmap
+= n_before
;
12888 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12889 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_in
);
12892 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12894 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12895 ma
->u
.p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12896 o_bmap
+= n_div_ma
;
12898 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12899 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->u
.p
[i
]->v
->el
[0]);
12905 isl_basic_map_free(bmap
);
12909 /* Replace the domain or range space (depending on "type) of "space" by "set".
12911 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12912 enum isl_dim_type type
, __isl_take isl_space
*set
)
12914 if (type
== isl_dim_in
) {
12915 space
= isl_space_range(space
);
12916 space
= isl_space_map_from_domain_and_range(set
, space
);
12918 space
= isl_space_domain(space
);
12919 space
= isl_space_map_from_domain_and_range(space
, set
);
12925 /* Compute the preimage of the domain or range (depending on "type")
12926 * of "bmap" under the function represented by "ma".
12927 * In other words, plug in "ma" in the domain or range of "bmap".
12928 * The result is a basic map that lives in the same space as "bmap"
12929 * except that the domain or range has been replaced by
12930 * the domain space of "ma".
12932 * If bmap is represented by
12934 * A(p) + S u + B x + T v + C(divs) >= 0,
12936 * where u and x are input and output dimensions if type == isl_dim_out
12937 * while x and v are input and output dimensions if type == isl_dim_in,
12938 * and ma is represented by
12940 * x = D(p) + F(y) + G(divs')
12942 * then the result is
12944 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12946 * The divs in the input set are similarly adjusted.
12949 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12953 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12954 * B_i G(divs') + c_i(divs))/n_i)
12956 * If bmap is not a rational map and if F(y) involves any denominators
12958 * x_i = (f_i y + h_i)/m_i
12960 * then additional constraints are added to ensure that we only
12961 * map back integer points. That is we enforce
12963 * f_i y + h_i = m_i alpha_i
12965 * with alpha_i an additional existentially quantified variable.
12967 * We first copy over the divs from "ma".
12968 * Then we add the modified constraints and divs from "bmap".
12969 * Finally, we add the stride constraints, if needed.
12971 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12972 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12973 __isl_take isl_multi_aff
*ma
)
12977 isl_basic_map
*res
= NULL
;
12978 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12979 isl_int f
, c1
, c2
, g
;
12988 ma
= isl_multi_aff_align_divs(ma
);
12991 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12994 if (type
== isl_dim_in
) {
12996 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12998 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
13001 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
13002 n_div_ma
= ma
->n
? isl_aff_dim(ma
->u
.p
[0], isl_dim_div
) : 0;
13004 space
= isl_multi_aff_get_domain_space(ma
);
13005 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
13006 rational
= isl_basic_map_is_rational(bmap
);
13007 strides
= rational
? 0 : multi_aff_strides(ma
);
13008 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
13009 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
13011 res
= isl_basic_map_set_rational(res
);
13013 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
13014 if (isl_basic_map_alloc_div(res
) < 0)
13017 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
13020 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
13021 k
= isl_basic_map_alloc_equality(res
);
13024 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
13025 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13028 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
13029 k
= isl_basic_map_alloc_inequality(res
);
13032 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
13033 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
13036 for (i
= 0; i
< bmap
->n_div
; ++i
) {
13037 if (isl_int_is_zero(bmap
->div
[i
][0])) {
13038 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
13041 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
13042 n_before
, n_after
, n_div_ma
, n_div_bmap
,
13047 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
13053 isl_basic_map_free(bmap
);
13054 isl_multi_aff_free(ma
);
13055 res
= isl_basic_map_simplify(res
);
13056 return isl_basic_map_finalize(res
);
13062 isl_basic_map_free(bmap
);
13063 isl_multi_aff_free(ma
);
13064 isl_basic_map_free(res
);
13068 /* Compute the preimage of "bset" under the function represented by "ma".
13069 * In other words, plug in "ma" in "bset". The result is a basic set
13070 * that lives in the domain space of "ma".
13072 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
13073 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
13075 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
13078 /* Compute the preimage of the domain of "bmap" under the function
13079 * represented by "ma".
13080 * In other words, plug in "ma" in the domain of "bmap".
13081 * The result is a basic map that lives in the same space as "bmap"
13082 * except that the domain has been replaced by the domain space of "ma".
13084 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
13085 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13087 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
13090 /* Compute the preimage of the range of "bmap" under the function
13091 * represented by "ma".
13092 * In other words, plug in "ma" in the range of "bmap".
13093 * The result is a basic map that lives in the same space as "bmap"
13094 * except that the range has been replaced by the domain space of "ma".
13096 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
13097 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
13099 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
13102 /* Check if the range of "ma" is compatible with the domain or range
13103 * (depending on "type") of "map".
13104 * Return isl_stat_error if anything is wrong.
13106 static isl_stat
check_map_compatible_range_multi_aff(
13107 __isl_keep isl_map
*map
, enum isl_dim_type type
,
13108 __isl_keep isl_multi_aff
*ma
)
13111 isl_space
*ma_space
;
13113 ma_space
= isl_multi_aff_get_space(ma
);
13114 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
13115 isl_space_free(ma_space
);
13117 return isl_stat_error
;
13119 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
13120 "spaces don't match", return isl_stat_error
);
13121 return isl_stat_ok
;
13124 /* Compute the preimage of the domain or range (depending on "type")
13125 * of "map" under the function represented by "ma".
13126 * In other words, plug in "ma" in the domain or range of "map".
13127 * The result is a map that lives in the same space as "map"
13128 * except that the domain or range has been replaced by
13129 * the domain space of "ma".
13131 * The parameters are assumed to have been aligned.
13133 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
13134 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13139 map
= isl_map_cow(map
);
13140 ma
= isl_multi_aff_align_divs(ma
);
13143 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
13146 for (i
= 0; i
< map
->n
; ++i
) {
13147 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
13148 isl_multi_aff_copy(ma
));
13153 space
= isl_multi_aff_get_domain_space(ma
);
13154 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
13156 isl_space_free(map
->dim
);
13161 isl_multi_aff_free(ma
);
13163 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
13164 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
13167 isl_multi_aff_free(ma
);
13172 /* Compute the preimage of the domain or range (depending on "type")
13173 * of "map" under the function represented by "ma".
13174 * In other words, plug in "ma" in the domain or range of "map".
13175 * The result is a map that lives in the same space as "map"
13176 * except that the domain or range has been replaced by
13177 * the domain space of "ma".
13179 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
13180 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
13187 aligned
= isl_map_space_has_equal_params(map
, ma
->space
);
13191 return map_preimage_multi_aff(map
, type
, ma
);
13193 if (isl_map_check_named_params(map
) < 0)
13195 if (!isl_space_has_named_params(ma
->space
))
13196 isl_die(map
->ctx
, isl_error_invalid
,
13197 "unaligned unnamed parameters", goto error
);
13198 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
13199 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
13201 return map_preimage_multi_aff(map
, type
, ma
);
13203 isl_multi_aff_free(ma
);
13204 return isl_map_free(map
);
13207 /* Compute the preimage of "set" under the function represented by "ma".
13208 * In other words, plug in "ma" in "set". The result is a set
13209 * that lives in the domain space of "ma".
13211 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
13212 __isl_take isl_multi_aff
*ma
)
13214 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
13217 /* Compute the preimage of the domain of "map" under the function
13218 * represented by "ma".
13219 * In other words, plug in "ma" in the domain of "map".
13220 * The result is a map that lives in the same space as "map"
13221 * except that the domain has been replaced by the domain space of "ma".
13223 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
13224 __isl_take isl_multi_aff
*ma
)
13226 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
13229 /* Compute the preimage of the range of "map" under the function
13230 * represented by "ma".
13231 * In other words, plug in "ma" in the range of "map".
13232 * The result is a map that lives in the same space as "map"
13233 * except that the range has been replaced by the domain space of "ma".
13235 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13236 __isl_take isl_multi_aff
*ma
)
13238 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13241 /* Compute the preimage of "map" under the function represented by "pma".
13242 * In other words, plug in "pma" in the domain or range of "map".
13243 * The result is a map that lives in the same space as "map",
13244 * except that the space of type "type" has been replaced by
13245 * the domain space of "pma".
13247 * The parameters of "map" and "pma" are assumed to have been aligned.
13249 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13250 __isl_take isl_map
*map
, enum isl_dim_type type
,
13251 __isl_take isl_pw_multi_aff
*pma
)
13260 isl_pw_multi_aff_free(pma
);
13261 res
= isl_map_empty(isl_map_get_space(map
));
13266 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13267 isl_multi_aff_copy(pma
->p
[0].maff
));
13268 if (type
== isl_dim_in
)
13269 res
= isl_map_intersect_domain(res
,
13270 isl_map_copy(pma
->p
[0].set
));
13272 res
= isl_map_intersect_range(res
,
13273 isl_map_copy(pma
->p
[0].set
));
13275 for (i
= 1; i
< pma
->n
; ++i
) {
13278 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13279 isl_multi_aff_copy(pma
->p
[i
].maff
));
13280 if (type
== isl_dim_in
)
13281 res_i
= isl_map_intersect_domain(res_i
,
13282 isl_map_copy(pma
->p
[i
].set
));
13284 res_i
= isl_map_intersect_range(res_i
,
13285 isl_map_copy(pma
->p
[i
].set
));
13286 res
= isl_map_union(res
, res_i
);
13289 isl_pw_multi_aff_free(pma
);
13293 isl_pw_multi_aff_free(pma
);
13298 /* Compute the preimage of "map" under the function represented by "pma".
13299 * In other words, plug in "pma" in the domain or range of "map".
13300 * The result is a map that lives in the same space as "map",
13301 * except that the space of type "type" has been replaced by
13302 * the domain space of "pma".
13304 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13305 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13312 aligned
= isl_map_space_has_equal_params(map
, pma
->dim
);
13316 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13318 if (isl_map_check_named_params(map
) < 0)
13320 if (isl_pw_multi_aff_check_named_params(pma
) < 0)
13322 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13323 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13325 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13327 isl_pw_multi_aff_free(pma
);
13328 return isl_map_free(map
);
13331 /* Compute the preimage of "set" under the function represented by "pma".
13332 * In other words, plug in "pma" in "set". The result is a set
13333 * that lives in the domain space of "pma".
13335 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13336 __isl_take isl_pw_multi_aff
*pma
)
13338 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13341 /* Compute the preimage of the domain of "map" under the function
13342 * represented by "pma".
13343 * In other words, plug in "pma" in the domain of "map".
13344 * The result is a map that lives in the same space as "map",
13345 * except that domain space has been replaced by the domain space of "pma".
13347 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13348 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13350 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13353 /* Compute the preimage of the range of "map" under the function
13354 * represented by "pma".
13355 * In other words, plug in "pma" in the range of "map".
13356 * The result is a map that lives in the same space as "map",
13357 * except that range space has been replaced by the domain space of "pma".
13359 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13360 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13362 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13365 /* Compute the preimage of "map" under the function represented by "mpa".
13366 * In other words, plug in "mpa" in the domain or range of "map".
13367 * The result is a map that lives in the same space as "map",
13368 * except that the space of type "type" has been replaced by
13369 * the domain space of "mpa".
13371 * If the map does not involve any constraints that refer to the
13372 * dimensions of the substituted space, then the only possible
13373 * effect of "mpa" on the map is to map the space to a different space.
13374 * We create a separate isl_multi_aff to effectuate this change
13375 * in order to avoid spurious splitting of the map along the pieces
13377 * If "mpa" has a non-trivial explicit domain, however,
13378 * then the full substitution should be performed.
13380 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13381 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13385 isl_pw_multi_aff
*pma
;
13390 n
= isl_map_dim(map
, type
);
13391 full
= isl_map_involves_dims(map
, type
, 0, n
);
13392 if (full
>= 0 && !full
)
13393 full
= isl_multi_pw_aff_has_non_trivial_domain(mpa
);
13400 space
= isl_multi_pw_aff_get_space(mpa
);
13401 isl_multi_pw_aff_free(mpa
);
13402 ma
= isl_multi_aff_zero(space
);
13403 return isl_map_preimage_multi_aff(map
, type
, ma
);
13406 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13407 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13410 isl_multi_pw_aff_free(mpa
);
13414 /* Compute the preimage of "map" under the function represented by "mpa".
13415 * In other words, plug in "mpa" in the domain "map".
13416 * The result is a map that lives in the same space as "map",
13417 * except that domain space has been replaced by the domain space of "mpa".
13419 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13420 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13422 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13425 /* Compute the preimage of "set" by the function represented by "mpa".
13426 * In other words, plug in "mpa" in "set".
13428 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13429 __isl_take isl_multi_pw_aff
*mpa
)
13431 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13434 /* Return a copy of the equality constraints of "bset" as a matrix.
13436 __isl_give isl_mat
*isl_basic_set_extract_equalities(
13437 __isl_keep isl_basic_set
*bset
)
13445 ctx
= isl_basic_set_get_ctx(bset
);
13446 total
= 1 + isl_basic_set_dim(bset
, isl_dim_all
);
13447 return isl_mat_sub_alloc6(ctx
, bset
->eq
, 0, bset
->n_eq
, 0, total
);
13450 /* Are the "n" "coefficients" starting at "first" of the integer division
13451 * expressions at position "pos1" in "bmap1" and "pos2" in "bmap2" equal
13453 * The "coefficient" at position 0 is the denominator.
13454 * The "coefficient" at position 1 is the constant term.
13456 isl_bool
isl_basic_map_equal_div_expr_part(__isl_keep isl_basic_map
*bmap1
,
13457 int pos1
, __isl_keep isl_basic_map
*bmap2
, int pos2
,
13458 unsigned first
, unsigned n
)
13460 if (isl_basic_map_check_range(bmap1
, isl_dim_div
, pos1
, 1) < 0)
13461 return isl_bool_error
;
13462 if (isl_basic_map_check_range(bmap2
, isl_dim_div
, pos2
, 1) < 0)
13463 return isl_bool_error
;
13464 return isl_seq_eq(bmap1
->div
[pos1
] + first
,
13465 bmap2
->div
[pos2
] + first
, n
);
13468 /* Are the integer division expressions at position "pos1" in "bmap1" and
13469 * "pos2" in "bmap2" equal to each other, except that the constant terms
13472 isl_bool
isl_basic_map_equal_div_expr_except_constant(
13473 __isl_keep isl_basic_map
*bmap1
, int pos1
,
13474 __isl_keep isl_basic_map
*bmap2
, int pos2
)
13479 if (!bmap1
|| !bmap2
)
13480 return isl_bool_error
;
13481 total
= isl_basic_map_total_dim(bmap1
);
13482 if (total
!= isl_basic_map_total_dim(bmap2
))
13483 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
13484 "incomparable div expressions", return isl_bool_error
);
13485 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13487 if (equal
< 0 || !equal
)
13489 equal
= isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13491 if (equal
< 0 || equal
)
13492 return isl_bool_not(equal
);
13493 return isl_basic_map_equal_div_expr_part(bmap1
, pos1
, bmap2
, pos2
,
13497 /* Replace the numerator of the constant term of the integer division
13498 * expression at position "div" in "bmap" by "value".
13499 * The caller guarantees that this does not change the meaning
13502 __isl_give isl_basic_map
*isl_basic_map_set_div_expr_constant_num_si_inplace(
13503 __isl_take isl_basic_map
*bmap
, int div
, int value
)
13505 if (isl_basic_map_check_range(bmap
, isl_dim_div
, div
, 1) < 0)
13506 return isl_basic_map_free(bmap
);
13508 isl_int_set_si(bmap
->div
[div
][1], value
);
13513 /* Is the point "inner" internal to inequality constraint "ineq"
13515 * The point is considered to be internal to the inequality constraint,
13516 * if it strictly lies on the positive side of the inequality constraint,
13517 * or if it lies on the constraint and the constraint is lexico-positive.
13519 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13520 __isl_keep isl_basic_set
*bset
, int ineq
)
13526 if (!inner
|| !bset
)
13527 return isl_bool_error
;
13529 ctx
= isl_basic_set_get_ctx(bset
);
13530 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13531 &ctx
->normalize_gcd
);
13532 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13533 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13535 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13536 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13537 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13540 /* Tighten the inequality constraints of "bset" that are outward with respect
13541 * to the point "vec".
13542 * That is, tighten the constraints that are not satisfied by "vec".
13544 * "vec" is a point internal to some superset S of "bset" that is used
13545 * to make the subsets of S disjoint, by tightening one half of the constraints
13546 * that separate two subsets. In particular, the constraints of S
13547 * are all satisfied by "vec" and should not be tightened.
13548 * Of the internal constraints, those that have "vec" on the outside
13549 * are tightened. The shared facet is included in the adjacent subset
13550 * with the opposite constraint.
13551 * For constraints that saturate "vec", this criterion cannot be used
13552 * to determine which of the two sides should be tightened.
13553 * Instead, the sign of the first non-zero coefficient is used
13554 * to make this choice. Note that this second criterion is never used
13555 * on the constraints of S since "vec" is interior to "S".
13557 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13558 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13562 bset
= isl_basic_set_cow(bset
);
13565 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13568 internal
= is_internal(vec
, bset
, j
);
13570 return isl_basic_set_free(bset
);
13573 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);
13579 /* Replace the variables x of type "type" starting at "first" in "bmap"
13580 * by x' with x = M x' with M the matrix trans.
13581 * That is, replace the corresponding coefficients c by c M.
13583 * The transformation matrix should be a square matrix.
13585 __isl_give isl_basic_map
*isl_basic_map_transform_dims(
13586 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, unsigned first
,
13587 __isl_take isl_mat
*trans
)
13591 bmap
= isl_basic_map_cow(bmap
);
13592 if (!bmap
|| !trans
)
13595 if (trans
->n_row
!= trans
->n_col
)
13596 isl_die(trans
->ctx
, isl_error_invalid
,
13597 "expecting square transformation matrix", goto error
);
13598 if (first
+ trans
->n_row
> isl_basic_map_dim(bmap
, type
))
13599 isl_die(trans
->ctx
, isl_error_invalid
,
13600 "oversized transformation matrix", goto error
);
13602 pos
= isl_basic_map_offset(bmap
, type
) + first
;
13604 if (isl_mat_sub_transform(bmap
->eq
, bmap
->n_eq
, pos
,
13605 isl_mat_copy(trans
)) < 0)
13607 if (isl_mat_sub_transform(bmap
->ineq
, bmap
->n_ineq
, pos
,
13608 isl_mat_copy(trans
)) < 0)
13610 if (isl_mat_sub_transform(bmap
->div
, bmap
->n_div
, 1 + pos
,
13611 isl_mat_copy(trans
)) < 0)
13614 ISL_F_CLR(bmap
, ISL_BASIC_MAP_SORTED
);
13615 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
13617 isl_mat_free(trans
);
13620 isl_mat_free(trans
);
13621 isl_basic_map_free(bmap
);
13625 /* Replace the variables x of type "type" starting at "first" in "bset"
13626 * by x' with x = M x' with M the matrix trans.
13627 * That is, replace the corresponding coefficients c by c M.
13629 * The transformation matrix should be a square matrix.
13631 __isl_give isl_basic_set
*isl_basic_set_transform_dims(
13632 __isl_take isl_basic_set
*bset
, enum isl_dim_type type
, unsigned first
,
13633 __isl_take isl_mat
*trans
)
13635 return isl_basic_map_transform_dims(bset
, type
, first
, trans
);